notesum.ai

Published at December 3

cs.CR

cs.SI

Released Date: December 3, 2024

Authors: Sofiane Azogagh¹, Zelma Aubin Birba¹, Josée Desharnais², Sébastien Gambs Marc-Olivier Killijian, Nadia Tawbi²

Aff.: ¹Université du Québec à Montréal; ²Université Laval

$\mathcal{V}$	set of vertices (i.e., vertices)
$\mathcal{E}$	set of edges (i.e., links)
$G=(\mathcal{V},\mathcal{E})$	graph of vertices $\mathcal{V}$ and edges $\mathcal{E}$
$\Gamma(x)\subseteq\mathcal{V}$	neighbors of $x$ in $G$ (i.e., $\{v\in\mathcal{V}\mid(v,x)\in\mathcal{E}$ )
$\Gamma^{\star}(x)\subseteq\mathcal{V}$	neighbors of $x$ in $G^{\star}$
$G^{2}$	common neighbors matrix of $G$ ( i.e., $G^{2}(u,v)=\|\Gamma(u)\cap\Gamma(v)\|$ ))
$\Gamma^{2}(x)$	neighbors of $x$ in $G^{2}$ , that is, vertices that have at least one common neighbor with $u$
$M\|_{E}$	matrix $M$ restricted to $E$
$\rho$	Proportion of existing and non-existing edges known by attacker