Related papers: Sustainable growth in complex networks
We propose a growing network model that consists of two tunable mechanisms: growth by merging modules which are represented as complete graphs and a fitness-driven preferential attachment. Our model exhibits the three prominent statistical…
Growing network models with preferential attachment dependent on both age and degree are proposed to simulate certain features of citation network noted in \cite{red2}. In this directed network, a new node gets attached to an older node…
The study of community networks has attracted considerable attention recently. In this paper, we propose an evolving community network model based on local processes, the addition of new nodes intra-community and new links intra- or…
Complex networks across various fields are often considered to be scale free -- a statistical property usually solely characterized by a power-law distribution of the nodes' degree $k$. However, this characterization is incomplete. In…
Analytical results are presented for the structure of networks that evolve via a preferential-attachment-random-deletion (PARD) model in the regime of overall network growth and in the regime of overall contraction. The phase transition…
What makes economic and ecological networks so unlike other highly skewed networks in their tendency toward turbulence and collapse? Here, we explore the consequences of a defining feature of these networks: their nodes are tied together by…
We investigate the evolution rules and degree distribution properties of the Software Heritage dataset, a large-scale growing network linking software source-code versions from open-source communities. The network spans more than 40 years…
A preferential attachment model for a growing network incorporating deletion of edges is studied and the expected asymptotic degree distribution is analyzed. At each time step $t=1,2,\ldots$, with probability $\pi_1>0$ a new vertex with one…
We investigate the growth of connectivity in a network. In our model, starting with a set of disjoint nodes, links are added sequentially. Each link connects two nodes, and the connection rate governing this random process is proportional…
Models of growing networks are a central topic in network science. In these models, vertices are usually labeled by their arrival time, distinguishing even those node pairs whose structural roles are identical. In contrast, unlabeled…
A central claim in modern network science is that real-world networks are typically "scale free," meaning that the fraction of nodes with degree $k$ follows a power law, decaying like $k^{-\alpha}$, often with $2 < \alpha < 3$. However,…
In this paper we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in $\mathbb{R}^2$, forming new connections to old nodes subject to the constraint that edges do not…
Co-evolution exhibited by a network system, involving the intricate interplay between the dynamics of the network itself and the subsystems connected by it, is a key concept for understanding the self-organized, flexible nature of…
Many weighted scale-free networks are known to have a power-law correlation between strength and degree of nodes, which, however, has not been well explicated. We investigate the dynamic behaviors of resource/traffic flow on scale-free…
We present a model for growing information networks where the ageing of a node depends on the time at which it entered the network and on the last time it was cited. The model is shown to undergo a transition from a small-world to…
We study a modified version of a model previously proposed by Jackson and Wolinsky to account for communicating information and allocating goods in socioeconomic networks. In the model, the utility function of each node is given by a…
We introduce and simulate a growth model of the world-wide Web based on the dynamics of outgoing links that is motivated by the conduct of the agents in the real Web to update outgoing links (re)directing them towards constantly changing…
This study proposes a novel network growth model named ComAwareNetGrowth which aims to mimic evolution of real-world social networks. The model works in discrete time. At each timestep, a new link (I) within-community or (II) anywhere in…
A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its $i$-th predecessor of degree $k_i$ with a directed link of length $\ell$ using a probability…
We study structural properties of trees grown by preferential attachment. In this mechanism, nodes are added sequentially and attached to existing nodes at a rate that is strictly proportional to the degree. We classify nodes by their depth…