相关论文: Phase Transitions in an Aging Network
We present a general class of geometric network growth mechanisms by homogeneous attachment in which the links created at a given time $t$ are distributed homogeneously between a new node and the exising nodes selected uniformly. This is…
We offer an example of an network model with a power law degree distribution, P(k) ~ k^{-alpha}, for nodes but which nevertheless has a well-defined geography and a nonzero threshold percolation probability for alpha>2, the range of…
The in-degree and out-degree distributions of a growing network model are determined. The in-degree is the number of incoming links to a given node (and vice versa for out-degree. The network is built by (i) creation of new nodes which each…
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
In this note we make some specific observations on the distribution of the degree of a given vertex in certain model of randomly growing networks. The rule for network growth is the following. Starting with an initial graph of minimum…
There is a pressing need for a description of complex systems that includes considerations of the underlying network of interactions, for a diverse range of biological, technological and other networks. In this work relationships between…
Evolving network models under a dynamic growth rule which comprises the addition and deletion of nodes are investigated. By adding a node with a probability $P_a$ or deleting a node with the probability $P_d=1-P_a$ at each time step, where…
We consider nonequilibrium phase transitions in weighted scale-free networks, in which highly connected nodes, which are created earlier in time are partially immunized. For epidemic spreading we solve the dynamical mean-field equations and…
We investigate a network growth model in which the genealogy controls the evolution. In this model, a new node selects a random target node and links either to this target node, or to its parent, or to its grandparent, etc; all nodes from…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
The analysis of the dynamics of a large class of excitable systems on locally tree-like networks leads to the conclusion that at $\lambda=1$ a continuous phase transition takes place, where $\lambda$ is the largest eigenvalue of the…
Preferential attachment drives the evolution of many complex networks. Its analytical studies mostly consider the simplest case of a network that grows uniformly in time despite the accelerating growth of many real networks. Motivated by…
We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows either algebraically or logarithmically with the net size),…
We introduce a simple one-parameter network growth algorithm which is able to reproduce a wide variety of realistic network structures but without having to invoke any global information about node degrees such as preferential-attachment…
A network as a substrate for dynamic processes may have its own dynamics. We propose a model for networks which evolve together with diffusing particles through a coupled dynamics, and investigate emerging structural property. The model…
We study the growth of a directed network, in which the growth is constrained by the cost of adding links to the existing nodes. We propose a new preferential-attachment scheme, in which a new node attaches to an existing node i with…
Extensive studies have been done to understand the principles behind architectures of real networks. Recently, evidences for hierarchical organization in many real networks have also been reported. Here, we present a new hierarchical model…
We study structural properties of growing networks where both addition and deletion of nodes are possible. Our model network evolves via two independent processes. With rate r, a node is added to the system and this node links to a randomly…
The Barab\'{a}si-Albert (BA) model is extended to include the concept of local world and the microscopic event of adding edges. With probability $p$, we add a new node with $m$ edges which preferentially link to the nodes presented in the…
Complex networks in different areas exhibit degree distributions with heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential…