Generating random networks from a given distribution

DOI10.1016/J.CSDA.2008.01.024zbMATH Open1452.62039OpenAlexW2090831468MaRDI QIDQ1023741FDOQ1023741

Authors: Nathan C. Carter, Charles R. Hadlock, Dominique M. A. Haughton 

Publication date: 16 June 2009

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2008.01.024

Recommendations

• scientific article; zbMATH DE number 2014740
• Generating simple random graphs with prescribed degree distribution
• A sequential importance sampling algorithm for generating random graphs with prescribed degrees
• Random graph generation using multiple switches of edges
• Generating random networks without short cycles

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Random graphs (graph-theoretic aspects) (05C80) Social networks; opinion dynamics (91D30)

Cites Work

• Goodness of Fit of Social Network Models
• Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
• Markov Graphs
• Introduction to evolutionary computing

Cited In (7)

• Generating Massive Scale-Free Networks under Resource Constraints
• Gaussian networks generated by random walks
• Mathematical programming approaches for classes of random network problems
• Generating structure specific networks
• Generating Random Networks and Graphs
• On the likelihood of forests
• Generating graphs by creating associative and random links between existing nodes

This page was built for publication: Generating random networks from a given distribution

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