Related papers: Addition-Deletion Networks
We investigate a class of network growth rules that are based on a redirection algorithm wherein new nodes are added to a network by linking to a randomly chosen target node with some probability 1-r or linking to the parent node of the…
Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its…
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-alpha} and alpha=alpha(n) is bounded away from 0. We show…
Real world complex networks are scale free and possess meso-scale properties like core-periphery and community structure. We study evolution of the core over time in real world networks. This paper proposes evolving models for both…
Generative mechanisms which lead to empirically observed structure of networked systems from diverse fields like biology, technology and social sciences form a very important part of study of complex networks. The structure of many…
Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…
We consider a growing network in which an incoming node gets attached to the $i^{th}$ existing node with the probability $\Pi_i \propto {k_i}^{\beta}\tau_i^{\alpha}$, where $k_{i}$ is the degree of the $i^{th}$ node and $\tau_i$ its present…
We introduce a new topological descriptor of a network called the density decomposition which is a partition of the nodes of a network into regions of uniform density. The decomposition we define is unique in the sense that a given network…
A bredge (bridge-edge) is an edge whose deletion would split the network component on which it resides into two components. Bredges are vulnerable links that play an important role in network collapse processes, which may result from node…
We evolve network topology of an asymmetrically connected threshold network by a simple local rewiring rule: quiet nodes grow links, active nodes lose links. This leads to convergence of the average connectivity of the network towards the…
We present exact results for the degree distribution in a directed network model that grows by node duplication (ND). Such models are useful in the study of the structure and growth dynamics of gene regulatory networks and scientific…
Identifying power-law scaling in real networks - indicative of preferential attachment - has proved controversial. Critics argue that measuring the temporal evolution of a network directly is better than measuring the degree distribution…
Production networks, dynamic systems of firms linked through input-output relationships, transmit microeconomic shocks into macroeconomic fluctuations. While prior studies often assume static networks, real-world economies feature…
We investigate a simple generative model for network formation. The model is designed to describe the growth of networks of kinship, trading, corporate alliances, or autocatalytic chemical reactions, where feedback is an essential element…
We constructs a new network by superposition of hexahedron , which are scale-free, highly sparse,disassortative ,and maximal planar graphs. The network degree distribution, agglomeration coefficient and degree of correlation are computed…
We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or "attracted" to its neighbor of maximal degree, as long as the degree is increasing.…
One of the most important features of spatial networks such as transportation networks, power grids, Internet, neural networks, is the existence of a cost associated with the length of links. Such a cost has a profound influence on the…
In social networks of human individuals, social relationships do not necessarily last forever as they can either fade gradually with time, resulting in link aging, or terminate abruptly, causing link deletion, as even old friendships may…
We propose a model for evolving networks by merging building blocks represented as complete graphs, reminiscent of modules in biological system or communities in sociology. The model shows power-law degree distributions, power-law…
We generalize the Barab\'{a}si--Albert's model of growing networks accounting for initial properties of sites and find exactly the distribution of connectivities of the network $P(q)$ and the averaged connectivity $\bar{q}(s,t)$ of a site…