ID: cond-mat/0405076

Growing Networks with Enhanced Resilience to Perturbation

May 5, 2004

View on ArXiv

Similar papers 4

Degree-distribution Stability of Growing Networks

August 27, 2008

89% Match
Zhenting Hou, Xiangxing Kong, Dinghua Shi, ... , Zhao Qinggui
Mathematical Physics
Probability
Physics and Society

In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady degree distribution exists and get its exact formulas. Then we apply it to various ...

Find SimilarView on arXiv

Power-law statistics and universal scaling in the absence of criticality

March 27, 2015

89% Match
Jonathan Touboul, Alain Destexhe
Neurons and Cognition

Critical states are sometimes identified experimentally through power-law statistics or universal scaling functions. We show here that such features naturally emerge from networks in self-sustained irregular regimes away from criticality. In these regimes, statistical physics theory of large interacting systems predict a regime where the nodes have independent and identically distributed dynamics. We thus investigated the statistics of a system in which units are replaced by ...

Find SimilarView on arXiv

Scale-free networks without growth

December 20, 2005

89% Match
Yan-Bo Xie, Tao Zhou, Bing-Hong Wang
Statistical Mechanics

In this letter, we proposed an ungrowing scale-free network model, wherein the total number of nodes is fixed and the evolution of network structure is driven by a rewiring process only. In spite of the idiographic form of $G$, by using a two-order master equation, we obtain the analytic solution of degree distribution in stable state of the network evolution under the condition that the selection probability $G$ in rewiring process only depends on nodes' degrees. A particula...

Find SimilarView on arXiv

Self-Organization Induced Scale-Free Networks

August 28, 2004

89% Match
Gang Yan, Tao Zhou, ... , Fu Zhong-Qian
Statistical Mechanics
Disordered Systems and Neura...

What is the underlying mechanism leading to power-law degree distributions of many natural and artificial networks is still at issue. We consider that scale-free networks emerges from self-organizing process, and such a evolving model is introduced in this letter. At each time step, a new node is added to the network and connect to some existing nodes randomly, instead of "preferential attachment" introduced by Barab\'{a}si and Albert, and then the new node will connect with ...

Find SimilarView on arXiv

Stability as a natural selection mechanism on interacting networks

July 17, 2010

89% Match
Juan I. Perotti, Orlando V. Billoni, ... , Cannas Sergio A.
Disordered Systems and Neura...
Adaptation and Self-Organizi...
Biological Physics
Molecular Networks

Biological networks of interacting agents exhibit similar topological properties for a wide range of scales, from cellular to ecological levels, suggesting the existence of a common evolutionary origin. A general evolutionary mechanism based on global stability has been proposed recently [J I Perotti, O V Billoni, F A Tamarit, D R Chialvo, S A Cannas, Phys. Rev. Lett. 103, 108701 (2009)]. This mechanism is incorporated into a model of a growing network of interacting agents i...

Find SimilarView on arXiv

Statistical physics of social networking

June 2, 2020

89% Match
Vaibhav Wasnik
Physics and Society
Statistical Mechanics
Social and Information Netwo...

In this work we make an attempt to understand social networks from a mathematical viewpoint. In the first instance we consider a network where each node representing an individual can connect with a neighbouring node with a certain probability along with connecting with individuals who are friends of friends. We find that above a particular value of a chosen combination of parameters, the probability of connection between two widely separated nodes is a scale free. We next co...

Find SimilarView on arXiv

Emergence and resilience of social networks: a general theoretical framework

April 18, 2005

89% Match
George C. M. A. Ehrhardt, Matteo Marsili, Fernando Vega-Redondo
Physics and Society
Statistical Mechanics

We introduce and study a general model of social network formation and evolution based on the concept of preferential link formation between similar nodes and increased similarity between connected nodes. The model is studied numerically and analytically for three definitions of similarity. In common with real-world social networks, we find coexistence of high and low connectivity phases and history dependence. We suggest that the positive feedback between linking and similar...

Find SimilarView on arXiv

Tunable and Growing Network Generation Model with Community Structures

October 31, 2013

89% Match
Mohammad Qasim Pasta, Zohaib Jan, ... , Zaidi Faraz
Social and Information Netwo...
Physics and Society

Recent years have seen a growing interest in the modeling and simulation of social networks to understand several social phenomena. Two important classes of networks, small world and scale free networks have gained a lot of research interest. Another important characteristic of social networks is the presence of community structures. Many social processes such as information diffusion and disease epidemics depend on the presence of community structures making it an important ...

Find SimilarView on arXiv

Self Organized Scale-Free Networks from Merging and Regeneration

March 5, 2004

89% Match
Beom Jun Kim, Ala Trusina, ... , Sneppen Kim
Adaptation and Self-Organizi...
Disordered Systems and Neura...

We consider the self organizing process of merging and regeneration of vertices in complex networks and demonstrate that a scale-free degree distribution emerges in a steady state of such a dynamics. The merging of neighbor vertices in a network may be viewed as an optimization of efficiency by minimizing redundancy. It is also a mechanism to shorten the distance and thus decrease signaling times between vertices in a complex network. Thus the merging process will in particul...

Find SimilarView on arXiv

A Statistical Physics Perspective on Web Growth

June 7, 2002

89% Match
P. L. Krapivsky, S. Redner
Networking and Internet Arch...
Statistical Mechanics

Approaches from statistical physics are applied to investigate the structure of network models whose growth rules mimic aspects of the evolution of the world-wide web. We first determine the degree distribution of a growing network in which nodes are introduced one at a time and attach to an earlier node of degree k with rate A_ksim k^gamma. Very different behaviors arise for gamma<1, gamma=1, and gamma>1. We also analyze the degree distribution of a heterogeneous network, th...

Find SimilarView on arXiv