Counting graphs and null models of complex networks: configuration model and extensions

DOI10.1007/978-3-319-68705-6_1MaRDI QIDQ1687897zbMATH OpenOpenAlexFDO

Authors Remco van der Hofstad

Publication date 4 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-68705-6_1

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• On the use of random graphs as null model of large connected networks
• Constructions and applications for null models of complex networks based on randomized algorithms
• Network models in class \(C\) on arbitrary graphs
• scientific article; zbMATH DE number 7626706
• Graph-theoretic analysis of complex stochastic networks
• Counting and enumerating galled networks
• scientific article; zbMATH DE number 1959499
• Asymptotic enumeration and distributional properties of galled networks
• Configuration models of random hypergraphs

Cited in

(11)

• Triadic closure in configuration models with unbounded degree fluctuations
• Threshold functions for small subgraphs in simple graphs and multigraphs
• On the use of random graphs as null model of large connected networks
• Limit laws for self-loops and multiple edges in the configuration model
• Upper bounds for number of removed edges in the erased configuration model
• Configuring random graph models with fixed degree sequences
• Configuration models of random hypergraphs
• Limit theorems for assortativity and clustering in null models for scale-free networks
• scientific article; zbMATH DE number 5176323 (Why is no real title available?)
• Self-similarity of communities of the ABCD model
• The configuration model for partially directed graphs

This page was built for publication: Counting graphs and null models of complex networks: configuration model and extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687897)