Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence
Charo I. Del Genio, Hyunju Kim, Zoltán Toroczkai et al. · 2010
Read Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence by Charo I. Del Genio, Hyunju Kim, Zoltán Toroczkai et al. (2010) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/plos-pone-0010012.txt.
Description
Charo I Del Genio and co-authors offer a 2010 PLOS ONE math paper on making random networks fairly. A network's degree sequence lists how many links each point has. Fair sampling from all networks with a fixed list matters for studies of disease spread, social ties, and the internet.
Older methods swap links step by step or match stubs, loose link ends, but both can bias results or reject many tries. The new method runs in bounded time, always yields a network, and attaches a weight to each sample. Tests used link patterns drawn from two common spread shapes. The weights should let researchers measure network traits without hidden skew.
Catalog record
| CREATOR | Charo I. Del Genio, Hyunju Kim, Zoltán Toroczkai et al. |
|---|---|
| YEAR | 2010 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 36 KB |
| LICENSE | Creative Commons Attribution License |
| RIGHTS | CC BY |
| SOURCE | PLOS ONE |
Source: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0010012