Wird geladen...
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...
Gespeichert in:
| Veröffentlicht in: | Internet Math |
|---|---|
| 1. Verfasser: | |
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
2016
|
| Schlagworte: | |
| Online Zugang: | 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: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|