This paper deals with the problem of graph matching or network alignment for Erdős–Rényi
graphs, which can be viewed as a noisy average-case version of the graph isomorphism …

Matching recovery threshold for correlated random graphs Page 1 The Annals of Statistics
2023, Vol. 51, No. 4, 1718–1743 https://doi.org/10.1214/23-AOS2305 © Institute of …

The problem of detecting edge correlation between two Erdős-Rényi random graphs on
unlabeled nodes can be formulated as a hypothesis testing problem: under the null …

Graph matching, also known as network alignment, refers to finding a bijection between the
vertex sets of two given graphs so as to maximally align their edges. This fundamental …

We study the graph alignment problem over two independent Erd\H {o} sR\'enyi graphs on $
n $ vertices, with edge density $ p $ falling into two regimes separated by the critical window …

For two independent Erdős–Rényi graphs G (n, p) G\left (n, p\right), we study the maximal
overlap (ie, the number of common edges) of these two graphs over all possible vertex …

Given two Erd\H {o} sR\'enyi graphs with $ n $ vertices whose edges are correlated through
a latent vertex correspondence, we study complexity lower bounds for the associated …

In this paper, we study the problem of recovering the latent vertex correspondence between
two correlated random graphs with vastly inhomogeneous and unknown edge probabilities …

We propose an efficient algorithm for matching two correlated Erd\H {o} s--R\'enyi graphs
with $ n $ vertices whose edges are correlated through a latent vertex correspondence …

Motivated by the problem of matching vertices in two correlated Erd\H {o} sR\'enyi graphs,
we study the problem of matching two correlated Gaussian Wigner matrices. We propose an …