Latent space models play an important role in the modeling and analysis ...
The last several years have seen a renewed and concerted effort to
incor...
In this work we consider the setting where many networks are observed on...
Recent advances in Bayesian models for random partitions have led to the...
Vertex nomination is a lightly-supervised network information retrieval ...
Many statistical settings call for estimating a population parameter, mo...
Graph embeddings, a class of dimensionality reduction techniques designe...
A core problem in statistical network analysis is to develop network
ana...
In increasingly many settings, particularly in neuroimaging, data sets
c...
Many popular dimensionality reduction procedures have out-of-sample
exte...
Suppose that one particular block in a stochastic block model is deemed
...
Given a vertex of interest in a network G_1, the vertex nomination probl...
The random dot product graph (RDPG) is an independent-edge random graph ...
Query-by-example search often uses dynamic time warping (DTW) for compar...
Given a graph in which a few vertices are deemed interesting a priori, t...
Manifold learning and dimensionality reduction techniques are ubiquitous...