Percolation on bipartite scale-free networks

Details Percolation on bipartite scale-free networks Percolation on bipartite scale-free networks

2010-01-08

arxiv.org/abs/1001.1225v2

Physica A 389, 2920 (2010)

Physics

Condensed Matter

Statistical Mechanics

12 pages, 1 figure. To appear in Physica A: Special Issue in honour of Prof. A. N. Berker (2009)

Scientific paper

10.1016/j.physa.2009.12.068

Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of unlike type. Such bipartite graphs appear in many social networks, for instance in affiliation networks and in sexual contact networks in which both types of nodes show the scale-free characteristic for the degree distribution. During the depreciation process, an edge between nodes with degrees k and q is retained with probability proportional to (kq)^(-alpha), where alpha is positive so that links between hubs are more prone to failure. The removal process is studied analytically by introducing a generating functions theory. We deduce exact self-consistent equations describing the system at a macroscopic level and discuss the percolation transition. Critical exponents are obtained by exploiting the Fortuin-Kasteleyn construction which provides a link between our model and a limit of the Potts model.

Affiliated with

Also associated with

No associations

Rating

Percolation on bipartite scale-free 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 Percolation on bipartite scale-free networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Percolation on bipartite scale-free networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-579820