referenzen.bib

@article{erdos_renyi_1960,
  title   = {On the evolution of random graphs},
  author  = {Erd{\H{o}}s, Paul and R{\'e}nyi, Alfr{\'e}d and others},
  journal = {Publ. Math. Inst. Hung. Acad. Sci},
  volume  = {5},
  number  = {1},
  pages   = {17--60},
  year    = {1960}
}

@article{gilbert_1959,
  title     = {Random graphs},
  author    = {Gilbert, Edgar N},
  journal   = {The Annals of Mathematical Statistics},
  volume    = {30},
  number    = {4},
  pages     = {1141--1144},
  year      = {1959},
  publisher = {JSTOR}
}

@inproceedings{networkrepository,
  title     = {The Network Data Repository with Interactive Graph Analytics and Visualization},
  author    = {Ryan A. Rossi and Nesreen K. Ahmed},
  booktitle = {AAAI},
  url       = {https://networkrepository.com},
  year      = {2015}
}

@article{batagelj2005efficient,
  title     = {Efficient generation of large random networks},
  author    = {Batagelj, Vladimir and Brandes, Ulrik},
  journal   = {Physical Review E},
  volume    = {71},
  number    = {3},
  pages     = {036113},
  year      = {2005},
  publisher = {APS}
}

@article{DBLP:journals/toms/Hubschle-Schneider22,
  author  = {Lorenz H{\"{u}}bschle{-}Schneider and
             Peter Sanders},
  title   = {Parallel Weighted Random Sampling},
  journal = {{ACM} Trans. Math. Softw.},
  volume  = {48},
  number  = {3},
  pages   = {29:1--29:40},
  year    = {2022}
}

@article{DBLP:journals/rsa/KrivelevichS13,
  author  = {Michael Krivelevich and
             Benny Sudakov},
  title   = {The phase transition in random graphs: {A} simple proof},
  journal = {Random Struct. Algorithms},
  volume  = {43},
  number  = {2},
  pages   = {131--138},
  year    = {2013}
}

@article{barabasi2014network,
  title     = {Network science book},
  author    = {Barab{\'a}si, Albert-L{\'a}szl{\'o}},
  journal   = {Network Science},
  volume    = {625},
  year      = {2014},
  publisher = {Cambridge University Press Cambridge}
}

@book{Penschuck_2020,
  address = {Frankfurt [Hessen]},
  title   = {Scalable generation of random graphs},
  author  = {Penschuck, Manuel},
  year    = {2020}
}

@article{barabasi1999emergence,
  title     = {Emergence of Scaling in Random Networks},
  author    = {Barab{\'{a}}si, A. L. and Albert, R.},
  year      = {1999},
  journal   = {Science},
  publisher = {American Assoc. for the Advancement of Science {AAAS}},
  volume    = {286},
  number    = {5439},
  pages     = {509--512}
}

@article{10.2307/1716232,
  title     = {Networks of Scientific Papers},
  author    = {Derek J. De Solla Price},
  year      = {1965},
  journal   = {Science},
  publisher = {American Assoc. for the Advancement of Science},
  volume    = {149},
  number    = {3683},
  pages     = {510--515},
  issn      = {00368075, 10959203},
  url       = {http://www.jstor.org/stable/1716232}
}

@inproceedings{DBLP:conf/alenex/MeyerP16,
  author    = {Ulrich Meyer and
               Manuel Penschuck},
  title     = {Generating Massive Scale-Free Networks under Resource Constraints},
  booktitle = {{ALENEX}},
  pages     = {39--52},
  publisher = {{SIAM}},
  year      = {2016}
}

@article{SANDERS2016489,
  title   = {Scalable generation of scale-free graphs},
  journal = {Information Processing Letters},
  volume  = {116},
  number  = {7},
  pages   = {489-491},
  year    = {2016},
  issn    = {0020-0190},
  doi     = {https://doi.org/10.1016/j.ipl.2016.02.004},
  author  = {Peter Sanders and Christian Schulz}
}

@article{doi:10.1073/pnas.200327197,
  author  = {L. A. N. Amaral  and A. Scala  and M. Barthélémy  and H. E. Stanley },
  title   = {Classes of small-world networks},
  journal = {Proceedings of the National Academy of Sciences},
  volume  = {97},
  number  = {21},
  pages   = {11149-11152},
  year    = {2000},
  doi     = {10.1073/pnas.200327197},
  url     = {https://www.pnas.org/doi/abs/10.1073/pnas.200327197},
  eprint  = {https://www.pnas.org/doi/pdf/10.1073/pnas.200327197}
}

@article{lancichinetti2008benchmark,
  title     = {Benchmark graphs for testing community detection algorithms},
  author    = {Lancichinetti, Andrea and Fortunato, Santo and Radicchi, Filippo},
  journal   = {Physical review E},
  volume    = {78},
  number    = {4},
  pages     = {046110},
  year      = {2008},
  publisher = {APS}
}

@article{DBLP:journals/snam/SchlauchHZ15,
  author  = {Wolfgang Eugen Schlauch and
             Emoke{-}{\'{A}}gnes Horv{\'{a}}t and
             Katharina Anna Zweig},
  title   = {Different flavors of randomness: comparing random graph models with
             fixed degree sequences},
  journal = {Soc. Netw. Anal. Min.},
  volume  = {5},
  number  = {1},
  pages   = {36:1--36:14},
  year    = {2015}
}

@article{DBLP:journals/tomacs/Lemire19,
  author  = {Daniel Lemire},
  title   = {Fast Random Integer Generation in an Interval},
  journal = {{ACM} Trans. Model. Comput. Simul.},
  volume  = {29},
  number  = {1},
  pages   = {3:1--3:12},
  year    = {2019}
}

@inproceedings{DBLP:conf/esa/BerenbrinkHK0PT20,
  author    = {Petra Berenbrink and
               David Hammer and
               Dominik Kaaser and
               Ulrich Meyer and
               Manuel Penschuck and
               Hung Tran},
  title     = {Simulating Population Protocols in Sub-Constant Time per Interaction},
  booktitle = {{ESA}},
  series    = {LIPIcs},
  volume    = {173},
  pages     = {16:1--16:22},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2020}
}

@article{DBLP:journals/mst/MatiasVN03,
  author  = {Yossi Matias and
             Jeffrey Scott Vitter and
             Wen{-}Chun Ni},
  title   = {Dynamic Generation of Discrete Random Variates},
  journal = {Theory Comput. Syst.},
  volume  = {36},
  number  = {4},
  pages   = {329--358},
  year    = {2003}
}

@article{DBLP:journals/jea/HamannMPTW18,
  author  = {Michael Hamann and
             Ulrich Meyer and
             Manuel Penschuck and
             Hung Tran and
             Dorothea Wagner},
  title   = {I/O-Efficient Generation of Massive Graphs Following the \emph{LFR}
             Benchmark},
  journal = {{ACM} J. Exp. Algorithmics},
  volume  = {23},
  year    = {2018}
}


@article{carstens_2017,
  title     = {TOPOLOGY OF COMPLEX NETWORKS: MODELS AND ANALYSIS},
  volume    = {95},
  doi       = {10.1017/S0004972716001003},
  number    = {2},
  journal   = {Bulletin of the Australian Mathematical Society},
  publisher = {Cambridge University Press},
  author    = {Carstens, Corrie Jacobien},
  year      = {2017},
  pages     = {347–349}
}


@article{DBLP:journals/compnet/VigerL16,
  author  = {Fabien Viger and
             Matthieu Latapy},
  title   = {Efficient and simple generation of random simple connected graphs
             with prescribed degree sequence},
  journal = {J. Complex Networks},
  volume  = {4},
  number  = {1},
  pages   = {15--37},
  year    = {2016}
}

@inproceedings{DBLP:conf/alenex/StantonP11,
  author    = {Isabelle Stanton and
               Ali Pinar},
  title     = {Sampling Graphs with a Prescribed Joint Degree Distribution Using
               Markov Chains},
  booktitle = {{ALENEX}},
  pages     = {151--163},
  publisher = {{SIAM}},
  year      = {2011}
}

@article{rao96,
  issn      = {0581572X},
  url       = {http://www.jstor.org/stable/25051102},
  abstract  = {In this paper we give an MCMC method using switches along alternating cycles for generating random (0, 1)-matrices with given marginals and examine its empirical performance in several examples.},
  author    = {A. Ramachandra Rao and Rabindranath Jana and Suraj Bandyopadhyay},
  journal   = {Sankhyā: The Indian Journal of Statistics, Series A (1961-2002)},
  number    = {2},
  pages     = {225--242},
  publisher = {Springer},
  title     = {A Markov Chain Monte Carlo Method for Generating Random (0, 1)-Matrices with Given Marginals},
  urldate   = {2023-06-19},
  volume    = {58},
  year      = {1996}
}