In recent years, significant advances have been made in the design and evaluation of
balanced (hyper) graph partitioning algorithms. We survey trends of the past decade in …

Brains contain networks of interconnected neurons and so knowing the network architecture
is essential for understanding brain function. We therefore mapped the synaptic-resolution …

The quadratic assignment problem (QAP) has considered one of the most significant
combinatorial optimization problems due to its variant and significant applications in real life …

Graph matching-aligning a pair of graphs to minimize their edge disagreements-has
received wide-spread attention from both theoretical and applied communities over the past …

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 …

Graph matching, also known as network alignment, aims at recovering the latent vertex
correspondence between two unlabeled, edge-correlated weighted graphs. To tackle this …

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 describe general heuristics to approximately solve a wide variety of problems with
convex objective and decision variables from a non-convex set. The heuristics, which …

The graph matching optimization problem is an essential component for many tasks in
computer vision, such as bringing two deformable objects in correspondence. Naturally, a …

Statistical analysis for populations of networks is widely applicable, but challenging, as
networks have strongly non-Euclidean behaviour. Graph space is an exhaustive framework …