Testing for Equivalence of Network Distribution Using Subgraph Counts
From MaRDI portal
Publication:5065993
DOI10.1080/10618600.2020.1736085OpenAlexW3105730750MaRDI QIDQ5065993
Pierre-André G. Maugis, Patrick J. Wolfe, Sofia C. Olhede, Carey E. Priebe
Publication date: 28 March 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10618600.2020.1736085
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- A nonparametric two-sample hypothesis testing problem for random graphs
- Two-sample Hypothesis Testing for Inhomogeneous Random Graphs
- Universally consistent vertex classification for latent positions graphs
- Oracle inequalities for network models and sparse graphon estimation
- The method of moments and degree distributions for network models
- Finding and counting given length cycles
- Subsampling bootstrap of count features of networks
- When are small subgraphs of a random graph normally distributed?
- A distributed approach for graph mining in massive networks
- Bayesian inference and testing of group differences in brain networks
- Detecting local network motifs
- Hypothesis testing for network data in functional neuroimaging
- Common and individual structure of brain networks
- Estimating and understanding exponential random graph models
- Poisson approximation of subgraph counts in stochastic block models and a graphon model
- Graph limits and exchangeable random graphs
- Metrics for sparse graphs
- Latent Space Approaches to Social Network Analysis
- Statistical inference on random dot product graphs: a survey
- A Multiscale Community Blockmodel for Network Exploration
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- Testing and Modeling Dependencies Between a Network and Nodal Attributes
This page was built for publication: Testing for Equivalence of Network Distribution Using Subgraph Counts
