Towards a Systematic Evaluation of Generative Network Models
From MaRDI portal
Recommendations
Cites work
- A simple model of global cascades on random networks
- Collective dynamics of `small-world' networks
- Connected components in random graphs with given expected degree sequences
- Do we need hundreds of classifiers to solve real world classification problems?
- Efficient embedding of scale-free graphs in the hyperbolic plane
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3936510 (Why is no real title available?)
- Networks, crowds and markets. Reasoning about a highly connected world.
- On the diameter of hyperbolic random graphs
- Random hyperbolic graphs: degree sequence and clustering (extended abstract)
- The average distances in random graphs with given expected degrees
- The clustering coefficient of a scale-free random graph
- The degree sequence of a scale-free random graph process
- The diameter of a scale-free random graph
Cited in
(9)- Generating realistic labelled, weighted random graphs
- Generating graphs by creating associative and random links between existing nodes
- Inferring pattern generators on networks
- Limitations of Chung Lu random graph generation
- A generative graph model for electrical infrastructure networks
- scientific article; zbMATH DE number 1256721 (Why is no real title available?)
- Assessment of model fit via network comparison methods based on subgraph counts
- Distribution-Free Models of Social Networks
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
This page was built for publication: Towards a Systematic Evaluation of Generative Network Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881231)