Statistics of cycles in large networks

Konstantin Klemm, Peter F. Stadler

Research output: Contribution to journal › Article

11 Citations (Scopus)

Abstract

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 N and typical cycle length is algebraic, h t Nα, with distinct values of α for different wiring rules. The Barabasi-Albert model has α=1. Different preferential and nonpreferential attachment rules and the growing Internet graph yield α

Original languageEnglish
Article number025101
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume73
Issue number2
DOIs
Publication statusPublished - 2006
Externally publishedYes

Fingerprint

wiring
statistics
Statistics
Cycle
cycles
Cycle Length
attachment
occurrences
Distinct
Closed
Path
Graph in graph theory
Model

ASJC Scopus subject areas

  • Physics and Astronomy(all)
  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Mathematical Physics

Cite this

Statistics of cycles in large networks. / Klemm, Konstantin; Stadler, Peter F.

In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, Vol. 73, No. 2, 025101, 2006.

Research output: Contribution to journal › Article

Klemm, K & Stadler, PF 2006, 'Statistics of cycles in large networks', Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, vol. 73, no. 2, 025101. https://doi.org/10.1103/PhysRevE.73.025101
Klemm K, Stadler PF. Statistics of cycles in large networks. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics. 2006;73(2). 025101. https://doi.org/10.1103/PhysRevE.73.025101
Klemm, Konstantin ; Stadler, Peter F. / Statistics of cycles in large networks. In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics. 2006 ; Vol. 73, No. 2.
@article{336e3041ec2646198b2dfb759bcdaff1,
title = "Statistics of cycles in large networks",
abstract = "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 N and typical cycle length is algebraic, h t Nα, with distinct values of α for different wiring rules. The Barabasi-Albert model has α=1. Different preferential and nonpreferential attachment rules and the growing Internet graph yield α",
author = "Konstantin Klemm and Stadler, {Peter F.}",
year = "2006",
doi = "10.1103/PhysRevE.73.025101",
language = "English",
volume = "73",
journal = "Physical review. E",
issn = "2470-0045",
publisher = "American Physical Society",
number = "2",

}

TY - JOUR

T1 - Statistics of cycles in large networks

AU - Klemm, Konstantin

AU - Stadler, Peter F.

PY - 2006

Y1 - 2006

N2 - 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 N and typical cycle length is algebraic, h t Nα, with distinct values of α for different wiring rules. The Barabasi-Albert model has α=1. Different preferential and nonpreferential attachment rules and the growing Internet graph yield α

AB - 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 N and typical cycle length is algebraic, h t Nα, with distinct values of α for different wiring rules. The Barabasi-Albert model has α=1. Different preferential and nonpreferential attachment rules and the growing Internet graph yield α

UR - http://www.scopus.com/inward/record.url?scp=33344472437&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33344472437&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.73.025101

DO - 10.1103/PhysRevE.73.025101

M3 - Article

AN - SCOPUS:33344472437

VL - 73

JO - Physical review. E

JF - Physical review. E

SN - 2470-0045

IS - 2

M1 - 025101

ER -

Access to Document