- AutorIn
- Konstantin Klemm
- Peter F. Stadler
- Titel
- Statistics of cycles in large networks
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:15-qucosa2-330860
- Quellenangabe
- Physical review. E, Statistical, nonlinear, and soft matter physics Erscheinungsort: Melville
Verlag: American Physical Society
Erscheinungsjahr: 2006
Jahrgang: 73
Heft: 2 Pt 2
ISSN: 1539-3755
E-ISSN: 1550-2376 - Erstveröffentlichung
- 2006
- Abstract (EN)
- The occurrence of self-avoiding closed paths (cycles) in networks is studied under varying rules of wiring. As a main result, we find that the dependence between network size and typical cycle length is algebraic, (h) proportional to Nalpha, with distinct values of for different wiring rules. The Barabasi-Albert model has alpha=1. Different preferential and nonpreferential attachment rules and the growing Internet graph yield alpha<1. Computation of the statistics of cycles at arbitrary length is made possible by the introduction of an efficient sampling algorithm.
- Freie Schlagwörter (EN)
- Informatics, Statistics, Physics
- Klassifikation (DDC)
- 530
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:15-qucosa2-330860
- Veröffentlichungsdatum Qucosa
- 06.02.2019
- Dokumenttyp
- Artikel
- Sprache des Dokumentes
- Englisch