23 citations · 23 across the 2 of their papers we have counts for
4 papers
Vertex Nomination, Consistent Estimation, and Adversarial Modification
Joshua Agterberg, Youngser Park, Jonathan Larson +3
Given a pair of graphs and and a vertex set of interest in , the vertex nomination (VN) problem seeks to find the corresponding vertices of interest in (if t…
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…
Semiparametric spectral modeling of the Drosophila connectome
Carey E. Priebe, Youngser Park, Minh Tang +8
We present semiparametric spectral modeling of the complete larval Drosophila mushroom body connectome. Motivated by a thorough exploratory data analysis of the network via Gaussia…
Logarithmic Representability of Integers as k-Sums
Anant P. Godbole, Samuel Gutekunst, Vince Lyzinski +1
A set A=A_{k,n} in [n]\cup{0} is said to be an additive k-basis if each element in {0,1,...,kn} can be written as a k-sum of elements of A in at least one way. Seeking multiple rep…