Subgraphs in random networks

S. Itzkovitz*, R. Milo, N. Kashtan, G. Ziv, U. Alon

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

148 Scopus citations

Abstract

An approximate solution for the average number of directed connected subgraphs in an ensemble of random networks with arbitrary degree sequence is presented. Scaling formulas for the number of subgraphs in scale-free random networks are given. It is shown that the subgraph numbers can be very different from those in Erdos random networks. The scaling exponent α exhibits three different scaling laws in three regimes, depending on the control parameter γ.

Original languageAmerican English
Article number026127
Pages (from-to)026127/1-026127/8
JournalPhysical Review E
Volume68
Issue number2 2
StatePublished - Aug 2003
Externally publishedYes

Fingerprint

Dive into the research topics of 'Subgraphs in random networks'. Together they form a unique fingerprint.

Cite this