Percolation of arbitrary uncorrelated nested subgraphs
- 46 Downloads
The study of percolation in so-called nested subgraphs implies a generalization of the concept of percolation since the results are not linked to specific graph process. Here the behavior of such graphs at criticallity is studied for the case where the nesting operation is performed in an uncorrelated way. Specifically, I provide an analyitic derivation for the percolation inequality showing that the cluster size distribution under a generalized process of uncorrelated nesting at criticality follows a power law with universal exponent γ = 3/2. The relevance of the result comes from the wide variety of processes responsible for the emergence of the giant component that fall within the category of nesting operations, whose outcome is a family of nested subgraphs.
Unable to display preview. Download preview PDF.
- 3.S.N. Dorogovtsev, J.F.F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford University Press, Oxford, 2003) Google Scholar
- 15.B. Bollobás, Random Graphs, 2nd edn. (Cambridge University Press, Cambridge, 2001) Google Scholar
- 18.H.E. Stanley, Introduction to Phase Transitions and Critical Phenomena (Oxford Univ. Press, Oxford, 1971) Google Scholar
- 20.D. Fernholz, V. Ramachandran, Technical Report TR04-13, University of Texas at Austin. G/A 2004 Google Scholar
- 23.H.S. Wilf, Generatingfunctionology, 2nd edn. (Academic Press, Boston, London, 1994) Google Scholar
- 24.S. Janson, D.E. Knuth, T. Łuczak, B. Pittel, Rand. Struct. Alg. 4 , 231 (1993) Google Scholar
- 26.A.V. Goltsev, S.N. Dorogovtsev, J.F.F. Mendes, Phys. Rev. E 73, 056101 1 (2006) Google Scholar
- 28.B. Bollobás, Modern graph theory Graduate Texts in Mathematics (Springer, New York, 1998), Vol. 184 Google Scholar
- 29.Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, edited by M. Abramowitz, I.A. Stegun (New York, Dover, 1972) Google Scholar