arXiv Analytics

Sign in

arXiv:1009.6009 [cond-mat.dis-nn]AbstractReferencesReviewsResources

Profile and scaling of the fractal exponent of percolations in complex networks

Takehisa Hasegawa, Tomoaki Nogawa, Koji Nemoto

Published 2010-09-29, updated 2013-11-07Version 2

We propose a novel finite size scaling analysis for percolation transition observed in complex networks. While it is known that cooperative systems in growing networks often undergo an infinite order transition with inverted Berezinskii-Kosterlitz-Thouless singularity, it is very hard for numerical simulations to determine the transition point precisely. Since the neighbor of the ordered phase is not a simple disordered phase but a critical phase, conventional finite size scaling technique does not work. In our finite size scaling, the forms of the scaling functions for the order parameter and the fractal exponent determine the transition point and critical exponents numerically for an infinite order transition as well as a standard second order transition. We confirm the validity of our scaling hypothesis through Monte-Carlo simulations for bond percolations in some network models: the decorated (2,2)-flower and the random attachment growing network, where an infinite order transition occurs, and the configuration model, where a second order transition occurs.

Related articles: Most relevant | Search more
arXiv:cond-mat/0608695 (Published 2006-08-30, updated 2006-09-06)
Local symmetries in complex networks
arXiv:0907.1514 [cond-mat.dis-nn] (Published 2009-07-09, updated 2009-10-16)
Entropy measures for complex networks: Toward an information theory of complex topologies
arXiv:0806.1655 [cond-mat.dis-nn] (Published 2008-06-10)
Self-Organization and Complex Networks