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 language | English |
|---|---|
| Article number | 026127 |
| Pages (from-to) | 026127/1-026127/8 |
| Journal | Physical Review E |
| Volume | 68 |
| Issue number | 2 2 |
| State | Published - Aug 2003 |
| Externally published | Yes |