Giant strongly connected component of directed networks

Details Giant strongly connected component of directed networks Giant strongly connected component of directed networks

2001-03-30

arxiv.org/abs/cond-mat/0103629v1

Phys. Rev. E 64, 025101 (2001)

Physics

Condensed Matter

Statistical Mechanics

4 pages revtex, 4 figures

Scientific paper

10.1103/PhysRevE.64.025101

We describe how to calculate the sizes of all giant connected components of a directed graph, including the {\em strongly} connected one. Just to the class of directed networks, in particular, belongs the World Wide Web. The results are obtained for graphs with statistically uncorrelated vertices and an arbitrary joint in,out-degree distribution $P(k_i,k_o)$. We show that if $P(k_i,k_o)$ does not factorize, the relative size of the giant strongly connected component deviates from the product of the relative sizes of the giant in- and out-components. The calculations of the relative sizes of all the giant components are demonstrated using the simplest examples. We explain that the giant strongly connected component may be less resilient to random damage than the giant weakly connected one.

Affiliated with

Also associated with

No associations

Rating

Giant strongly connected component of directed networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Giant strongly connected component of directed networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Giant strongly connected component of directed networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-684065