Percolation on correlated random networks

Details Percolation on correlated random networks Percolation on correlated random networks

2011-09-05

arxiv.org/abs/1109.0839v1

Physics

Condensed Matter

Statistical Mechanics

11 pages, 9 figure; to appear in Phys. Rev. E

Scientific paper

We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks themselves. Given the weighted nature of the graphs, different kinds of bond percolation can be studied: stochastic (deleting links randomly) and deterministic (deleting links based on rank weights), each mimicking a different physical process. The evolution of the network is accordingly different, as evidenced by the behavior of the largest component size and of the distribution of cluster sizes. In particular, we can derive that weak ties are crucial in order to maintain the graph connected and that, when they are the most prone to failure, the giant component typically shrinks without abruptly breaking apart; these results have been recently evidenced in several kinds of social networks.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-449640