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 …

We consider the task of learning latent community structure from multiple correlated
networks. First, we study the problem of learning the latent vertex correspondence between …

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 …

In this paper, we consider the graph alignment problem, which is the problem of recovering,
given two graphs, a one-to-one mapping between nodes that maximizes edge overlap. This …

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 …

Testing correlation of unlabeled random graphs Page 1 The Annals of Applied Probability
2023, Vol. 33, No. 4, 2519–2558 https://doi.org/10.1214/22-AAP1786 © Institute of …

In this paper we address the problem of testing whether two observed trees (t, t′) are
sampled either independently or from a joint distribution under which they are correlated …

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 …