Percolation on correlated random networks

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.

[1]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[2]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[3]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Jian Li,et al.  Modeling brain functional networks using logic relationships , 2009, BMC Neuroscience.

[5]  G. Bianconi.  Entropy of network ensembles. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[7]  Irwin J. Kopin,et al.  Reviews of Neuroscience , 1974 .

[8]  Elena Agliari,et al.  A statistical mechanics approach to autopoietic immune networks , 2010, 1001.3857.

[9]  I. M. Sokolov,et al.  Epidemics, disorder, and percolation , 2003, cond-mat/0301394.

[10]  Hernán D. Rozenfeld.  Structure and Properties of Complex Networks: Models, Dynamics, Applications , 2008 .

[11]  Huba J. M. Kiss,et al.  Ageing as a price of cooperation and complexity , 2008, BioEssays : news and reviews in molecular, cellular and developmental biology.

[12]  Ran Chen.  Intelligent Computing and Information Science , 2011 .

[13]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

[14]  J. W. Essam,et al.  Percolation theory , 1980 .

[15]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[16]  Illés Farkas,et al.  Statistical mechanics of topological phase transitions in networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Junshan Zhang,et al.  Percolation and blind spots in complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Reuven Cohen,et al.  Percolation theory and fragmentation measures in social networks , 2007 .

[19]  Jordi Soriano,et al.  Percolation in living neural networks. , 2006, Physical review letters.

[20]  Béla Bollobás,et al.  Random Graphs , 1985 .

[21]  Elena Agliari,et al.  A statistical mechanics approach to Granovetter theory , 2010, ArXiv.

[22]  P. Bork,et al.  Evolution of biomolecular networks — lessons from metabolic and protein interactions , 2009, Nature Reviews Molecular Cell Biology.

[23]  Haibo Hu,et al.  Disassortative mixing in online social networks , 2009, 0909.0450.

[24]  Markus Brede,et al.  Patterns in randomly evolving networks: idiotypic networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  A. Barra,et al.  A Hebbian approach to complex-network generation , 2010, 1009.1343.

[26]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[27]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[28]  Chenggui Zhao.  Circulant Graph Modeling Deterministic Small-World Networks , 2011, ICIC 2011.

[29]  E. Todeva.  Networks , 2007 .

[30]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[31]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[32]  Elena Agliari,et al.  Microscopic energy flows in disordered Ising spin systems , 2010, 1006.5905.

[33]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[34]  R. Rosenfeld.  Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[35]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[36]  A. Barra,et al.  Equilibrium statistical mechanics on correlated random graphs , 2010, 1009.1345.

[37]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .