Loading...
Fast Sequential Creation of Random Realizations of Degree Sequences()
We examine the problem of creating random realizations of very large degree sequences. Although fast in practice, the Markov chain Monte Carlo (MCMC) method for selecting a realization has limited usefulness for creating large graphs because of memory constraints. Instead, we focus on sequential imp...
Saved in:
| Published in: | Internet Math |
|---|---|
| Main Author: | |
| Format: | Artigo |
| Language: | Inglês |
| Published: |
2016
|
| Subjects: | |
| Online Access: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4971584/ https://ncbi.nlm.nih.gov/pubmed/27499709 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1080/15427951.2016.1164768 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|