118 citations · 252 across the 14 of their papers we have counts for
17 papers
On seeded subgraph-to-subgraph matching: The ssSGM Algorithm and matchability information theory
Lingyao Meng, Mengqi Lou, Jianyu Lin +2
The subgraph-subgraph matching problem is, given a pair of graphs and a positive integer , to find vertices in the first graph, vertices in the second graph, and a bijec…
The Phantom Alignment Strength Conjecture: Practical use of graph matching alignment strength to indicate a meaningful graph match
Donniell E. Fishkind, Felix Parker, Hamilton Sawczuk +5
The alignment strength of a graph matching is a quantity that gives the practitioner a measure of the correlation of the two graphs, and it can also give the practitioner a sense f…
On a complete and sufficient statistic for the correlated Bernoulli random graph model
Donniell E. Fishkind, Avanti Athreya, Lingyao Meng +2
Inference on vertex-aligned graphs is of wide theoretical and practical importance.There are, however, few flexible and tractable statistical models for correlated graphs, and even…
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…
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…
Statistical inference on random dot product graphs: a survey
Avanti Athreya, Donniell E. Fishkind, Keith Levin +7
The random dot product graph (RDPG) is an independent-edge random graph that is analytically tractable and, simultaneously, either encompasses or can successfully approximate a wid…