Configuration models of random hypergraphs

DOI10.1093/comnet/cnaa018zbMath1467.05239arXiv1902.09302OpenAlexW3047309339MaRDI QIDQ4992030

Philip Chodrow

Publication date: 4 June 2021

Published in: Journal of Complex Networks (Search for Journal in Brave)

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

zbMATH Keywords

dyadic configuration modelnull random hypergraphsstatistical inference in polyadic networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items (8)

Moments of Uniform Random Multigraphs with Fixed Degree Sequences ⋮ Random recursive hypergraphs ⋮ Sombor index and degree-related properties of simplicial networks ⋮ Mixture models and networks: The stochastic blockmodel ⋮ Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs ⋮ What Are Higher-Order Networks? ⋮ A Density Description of a Bounded-Confidence Model of Opinion Dynamics on Hypergraphs ⋮ Sampling hypergraphs with given degrees

This page was built for publication: Configuration models of random hypergraphs