# Modelling Populations of Interaction Networks via Distance Metrics

@inproceedings{Bolt2022ModellingPO, title={Modelling Populations of Interaction Networks via Distance Metrics}, author={George Bolt and Sim'on Lunag'omez and Christopher Nemeth}, year={2022} }

Network data arises through observation of relational information between a collection of entities. Recent work in the literature has independently considered when (i) one observes a sample of networks, connectome data in neuroscience being a ubiquitous example, and (ii) the units of observation within a network are edges or paths, such as emails between people or a series of page visits to a website by a user, often referred to as interaction network data. The intersection of these two cases…

## One Citation

### Compressing network populations with modal networks reveals structural diversity

- Computer Science
- 2022

It is shown that these nonparametric methods derived from the minimum description length principle recover planted heterogeneity in synthetic network populations and eﬀectively identify important structural heterogeneities in example network populations representing global trade and the fossil record.

## References

SHOWING 1-10 OF 29 REFERENCES

### Bayesian exponential random graph models for populations of networks

- Computer Science
- 2021

A multilevel framework for populations of networks based on exponential random graph models is proposed, enabling the inference of age-related differences in the topological structure of the brain’s functional connectivity.

### Nonparametric Bayes Modeling of Populations of Networks

- Computer Science
- 2014

A flexible Bayesian nonparametric approach for modeling the population distribution of network-valued data through a mixture model that reduces dimensionality and efficiently incorporates network information within each mixture component by leveraging latent space representations is proposed.

### Latent Space Approaches to Social Network Analysis

- Computer Science
- 2002

This work develops a class of models where the probability of a relation between actors depends on the positions of individuals in an unobserved “social space,” and proposes Markov chain Monte Carlo procedures for making inference on latent positions and the effects of observed covariates.

### Modeling Network Populations via Graph Distances

- Mathematics, Computer ScienceJournal of the American Statistical Association
- 2020

A new class of models for multiple networks to parameterize a distribution on labeled graphs in terms of a Fréchet mean graph and a parameter that controls the concentration of this distribution about its mean is introduced.

### Edge Exchangeable Models for Interaction Networks

- Computer ScienceJournal of the American Statistical Association
- 2018

The Hollywood model is identified here as the canonical family of edge exchangeable distributions, which is computationally tractable, admits a clear interpretation, exhibits good theoretical properties, and performs reasonably well in estimation and prediction as it demonstrates on real network datasets.

### Joint Modeling of Multiple Network Views

- Computer Science
- 2016

A variational inference approach to estimate the intractable posterior of the latent space joint model (LSJM) that merges the information given by multiple network views assuming that the probability of a node being connected with other nodes in each network view is explained by a unique latent variable.

### Tracking network dynamics: A survey using graph distances

- Computer ScienceThe Annals of Applied Statistics
- 2018

An overview of commonly-used graph distances and an explicit characterization of the structural changes that they are best able to capture, and some guidance on choosing one distance over another in different contexts are provided.

### Inference for Multiple Heterogeneous Networks with a Common Invariant Subspace

- Computer ScienceJ. Mach. Learn. Res.
- 2021

A new model is introduced, the common subspace independent-edge multiple random graph model, which describes a heterogeneous collection of networks with a shared latent structure on the vertices but potentially different connectivity patterns for each graph, and is both flexible enough to meaningfully account for important graph differences and tractable enough to allow for accurate inference in multiple networks.

### Hypothesis Testing For Network Data in Functional Neuroimaging

- Computer Science
- 2014

This work draws on concepts and techniques from geometry, and high-dimensional statistical inference, for testing in the context of networks derived from functional neuroimaging data on human subjects from the 1000 Functional Connectomes Project, and shows that this global test is more statistical powerful, than a mass-univariate approach.

### Hypothesis testing for populations of networks

- Computer Science, MathematicsCommunications in Statistics - Theory and Methods
- 2021

This work proposes a general procedure for hypothesis testing of networks and in particular, for differentiating distributions of two samples of networks, and proposes a test statistics based on the singular value of a generalized Wigner matrix.