Motif-based tests for bipartite networks

DOI10.1214/21-EJS1944zbMath1498.62116arXiv2101.11381OpenAlexW4206518699MaRDI QIDQ2136609

Pierre Latouche, Sarah Ouadah, Stephane Robin

Publication date: 11 May 2022

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.11381

zbMATH Keywords

goodness-of-fitbipartite networksnetwork motifsnetwork comparisonexpected degree distribution

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Applications of statistics to environmental and related topics (62P12) Hypothesis testing in multivariate analysis (62H15) Random graphs (graph-theoretic aspects) (05C80) Exchangeability for stochastic processes (60G09) Probabilistic graphical models (62H22)

Cites Work

• Limits of dense graph sequences
• Block clustering with Bernoulli mixture models: comparison of different approaches
• Subgraph counts in random graphs using incomplete U-statistics methods
• Connected components in random graphs with given expected degree sequences
• Graph limits and exchangeable random graphs
• The Structure and Function of Complex Networks
• Asymptotic Statistics
• Compound Poisson approximations of subgraph counts in random graphs

This page was built for publication: Motif-based tests for bipartite networks