Related papers: Evolution of reference networks with aging
Network science provides an indispensable theoretical framework for studying the structure and function of real complex systems. Different network models are often used for finding the rules that govern their evolution, whereby the correct…
We study two models of an age-biased graph process: the $\delta$-version of the preferential attachment graph model (PAM) and the uniform attachment graph model (UAM), with $m$ attachments for each of incoming vertices. We show that almost…
Growth dynamic of real networks because of emerging complexities is an open and interesting question. Indeed it is not realistic to ignore history impact on the current events. The mystery behind that complexity could be in the role of…
We introduce a new class of networks that grow by enhanced redirection. Nodes are introduced sequentially, and each either attaches to a randomly chosen target node with probability 1-r or to the ancestor of the target with probability r,…
We propose a model of the evolution of the networks of scientific citations. The model takes an out-degree distribution (distribution of number of citations) and two parameters as input. The parameters capture the two main ingredients of…
We analyze the betweenness centrality (BC) of nodes in large complex networks. In general, the BC is increasing with connectivity as a power law with an exponent $\eta$. We find that for trees or networks with a small loop density $\eta=2$…
Discriminating between competing explanatory models as to which is more likely responsible for the growth of a network is a problem of fundamental importance for network science. The rules governing this growth are attributed to mechanisms…
In this letter we present data analysis and modeling of two particular cases of study in the field of growing networks. We analyze WWW data set and authorship collaboration networks in order to check the presence of correlation in the data.…
In this paper, we introduce a modified epidemic model on regular and scale-free networks respectively. We consider the birth rate $\delta$, cure rate $\gamma$, infection rate $\lambda$, $\alpha$ from the infectious disease, and death rate…
The study of citation networks is of interest to the scientific community. However, the underlying mechanism driving individual citation behavior remains imperfectly understood, despite the recent proliferation of quantitative research…
In this paper we present a new version of a network growth model, generalized in order to describe the behavior of social networks. The case of study considered is the preprint archive at cul.arxiv.org. Each node corresponds to a scientist,…
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 study spatial networks constructed by randomly placing nodes on a manifold and joining two nodes with an edge whenever their distance is less than a certain cutoff. We derive the general expression for the connectivity distribution of…
We perform experimental verification of the preferential attachment model that is commonly accepted as a generating mechanism of the scale-free complex networks. To this end we chose citation network of Physics papers and traced citation…
Research on the vulnerability of electric networks with a complex network approach has produced significant results in the last decade, especially for transmission networks. These studies have shown that there are causal relations between…
We consider a gossip network consisting of a source generating updates and $n$ nodes connected according to a given graph structure. The source keeps updates of a process, that might be generated or observed, and shares them with the…
Many important real-world networks manifest "small-world" properties such as scale-free degree distributions, small diameters, and clustering. The most common model of growth for these networks is "preferential attachment", where nodes…
We study growing networks in which each link carries a certain weight (randomly assigned at birth and fixed thereafter). The weight of a node is defined as the sum of the weights of the links attached to the node, and the network grows via…
We consider a stochastic model for directed scale-free networks following power-laws in the degree distributions in both incoming and outgoing directions. In our model, the number of vertices grow geometrically with time with growth rate p.…
Many real systems possess accelerating statistics where the total number of edges grows faster than the network size. In this paper, we propose a simple weighted network model with accelerating growth. We derive analytical expressions for…