23 citations · 23 across the 12 of their papers we have counts for
6 papers · 1 filter
Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks
Jesús Arroyo, Daniel L. Sussman, Carey E. Priebe +1
Given a pair of graphs with the same number of vertices, the inexact graph matching problem consists in finding a correspondence between the vertices of these graphs that minimizes…
Alignment Strength and Correlation for Graphs
Donniell E. Fishkind, Lingyao Meng, Ao Sun +2
When two graphs have a correlated Bernoulli distribution, we prove that the alignment strength of their natural bijection strongly converges to a novel measure of graph correlation…
On a 'Two Truths' Phenomenon in Spectral Graph Clustering
Carey E. Priebe, Youngser Park, Joshua T. Vogelstein +6
Clustering is concerned with coherently grouping observations without any explicit concept of true groupings. Spectral graph clustering - clustering the vertices of a graph based o…
Tractable Graph Matching via Soft Seeding
Fei Fang, Daniel L. Sussman, Vince Lyzinski
The graph matching problem aims to discover a latent correspondence between the vertex sets of two observed graphs. This problem has proven to be quite challenging, with few satisf…
Matched Filters for Noisy Induced Subgraph Detection
Daniel L. Sussman, Youngser Park, Carey E. Priebe +1
The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social n…
Vertex nomination: The canonical sampling and the extended spectral nomination schemes
Jordan Yoder, Li Chen, Henry Pao +5
Suppose that one particular block in a stochastic block model is of interest, but block labels are only observed for a few of the vertices in the network. Utilizing a graph realize…