We propose an efficient algorithm for graph matching based on similarity scores constructed
from counting a certain family of weighted trees rooted at each vertex. For two Erdős–Rényi …

This paper studies the problem of matching two complete graphs with edge weights
correlated through latent geometries, extending a recent line of research on random graph …

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 …

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 …

We consider the problem of learning latent community structure from multiple correlated
networks. We study edge-correlated stochastic block models with two balanced …

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 …

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 …

The problem of aligning Erdős–Rényi random graphs is a noisy, average-case version of the
graph isomorphism problem, in which a pair of correlated random graphs is observed …

We study one-way matching of a pair of datasets with low rank signals. Under a stylized
model, we first derive information-theoretic limits of matching under a mismatch proportion …

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 …