Towards a Systematic Evaluation of Generative Network Models

DOI10.1007/978-3-319-92871-5_8OpenAlexW2806472198MaRDI QIDQ5881231

Unnamed Author, Thomas Bläsius, Maximilian Katzmann, Anton Krohmer, Tobias Friedrich

Publication date: 9 March 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-92871-5_8

zbMATH Keywords

distinguishability of network classesgenerative graph modelsreal-world comparison

Mathematics Subject Classification ID

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

Related Items (1)

From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clustering coefficient of a scale-free random graph
• Connected components in random graphs with given expected degree sequences
• The diameter of a scale-free random graph
• The degree sequence of a scale-free random graph process
• Emergence of Scaling in Random Networks
• Random Hyperbolic Graphs: Degree Sequence and Clustering
• On the Diameter of Hyperbolic Random Graphs
• A simple model of global cascades on random networks
• Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
• Collective dynamics of ‘small-world’ networks
• The average distances in random graphs with given expected degrees

This page was built for publication: Towards a Systematic Evaluation of Generative Network Models