23 citations · 99 across the 26 of their papers we have counts for
4 papers · 1 filter
A partition-based similarity for classification distributions
Hayden S. Helm, Ronak D. Mehta, Brandon Duderstadt +5
Herein we define a measure of similarity between classification distributions that is both principled from the perspective of statistical pattern recognition and useful from the pe…
On Two Distinct Sources of Nonidentifiability in Latent Position Random Graph Models
Joshua Agterberg, Minh Tang, Carey E. Priebe
Two separate and distinct sources of nonidentifiability arise naturally in the context of latent position random graph models, though neither are unique to this setting. In this pa…
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…
Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question
Jesús Arroyo, Carey E. Priebe, Vince Lyzinski
Graph matching consists of aligning the vertices of two unlabeled graphs in order to maximize the shared structure across networks; when the graphs are unipartite, this is commonly…