Testing for Equivalence of Network Distribution Using Subgraph Counts
From MaRDI portal
(Redirected from Publication:5065993)
Cites work
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- A distributed approach for graph mining in massive networks
- A multiscale community blockmodel for network exploration
- A nonparametric two-sample hypothesis testing problem for random graphs
- Bayesian inference and testing of group differences in brain networks
- Common and individual structure of brain networks
- Detecting local network motifs
- Estimating and understanding exponential random graph models
- Finding and counting given length cycles
- Graph limits and exchangeable random graphs
- Hypothesis testing for network data in functional neuroimaging
- Large networks and graph limits
- Latent Space Approaches to Social Network Analysis
- Metrics for sparse graphs
- Oracle inequalities for network models and sparse graphon estimation
- Poisson approximation of subgraph counts in stochastic block models and a graphon model
- Statistical inference on random dot product graphs: a survey
- Subsampling bootstrap of count features of networks
- Testing and modeling dependencies between a network and nodal attributes
- The method of moments and degree distributions for network models
- Two-sample hypothesis testing for inhomogeneous random graphs
- Universally consistent vertex classification for latent positions graphs
- When are small subgraphs of a random graph normally distributed?
Cited in
(16)- Subgraph network random effects error components models: specification and testing
- Edgeworth expansions for network moments
- Exact tests for singular network data
- Subgraphs in preferential attachment models
- Valid two-sample graph testing via optimal transport procrustes and multiscale graph correlation with applications in connectomics
- Multiplex Depth for Network-Valued Data and Applications
- Hypothesis testing for two sample comparison of non Euclidean network data
- Bayesian modelling and computation utilising directed cycles in multiple network data
- A Latent Space Model for Weighted Keyword Co-Occurrence Networks with Applications in Knowledge Discovery in Statistics
- Hoeffding-type decomposition for U-statistics on bipartite networks
- Goodness-of-fit testing based on graph functionals for homogeneous Erdős-Rényi graphs
- A longitudinal ordinal collaboration network model for multiclass link prediction and its application
- Higher-Order Accurate Two-Sample Network Inference and Network Hashing
- Characterization of the asymptotic behaviour of U-statistics on row-column exchangeable matrices
- An overview of asymptotic normality in stochastic blockmodels: cluster analysis and inference
- Subsampling bootstrap of count features of networks
This page was built for publication: Testing for Equivalence of Network Distribution Using Subgraph Counts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5065993)
