Related papers: Dynamic Scaling, Data-collapse and Self-Similarity…
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…
Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered.…
A dynamical model of small-world network, with directed links which describe various correlations in social and natural phenomena, is presented. Random responses of every site to the imput message are introduced to simulate real systems.…
We develop and test a rewiring method (originally proposed by Newman) which allows to build random networks having pre-assigned degree distribution and two-point correlations. For the case of scale-free degree distributions, we discretize…
Barab\'asi-Albert's `Scale Free' model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however,…
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 dynamical network model which unifies a number of network families which are individually known to exhibit $q$-exponential degree distributions. The present model dynamics incorporates static (non-growing) self-organizing…
In many social complex systems, in which agents are linked by non-linear interactions, the history of events strongly influences the whole network dynamics. However, a class of "commonly accepted beliefs" seems rarely studied. In this…
Many networks generated by nature have two generic properties: they are formed in the process of {preferential attachment} and they are scale-free. Considering these features, by interfering with mechanism of the {preferential attachment},…
We consider a generalised d-dimensional model for asymptotically-scale-free geographical networks. Central to many networks of this kind, when considering their growth in time, is the attachment rule, i.e. the probability that a new node is…
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…
Multilayer networks are widespread in natural and manmade systems. Key properties of these networks are their spectral and eigenfunction characteristics, as they determine the critical properties of many dynamics occurring on top of them.…
Barab\'asi-Albert model describes many different natural networks, often yielding sensible explanations to the subjacent dynamics. However, finite size effects may prevent from discerning among different underlying physical mechanisms and…
All crucial features of the recently observed real-world weighted networks are obtained in a model where the weight of a link is defined with a single non-linear parameter $\alpha$ as $w_{ij}=(s_is_j)^\alpha$, $s_i$ and $s_j$ are the…
Correlation between nodes is found to be a common and important property in many complex networks. Here we investigate degree correlations of the Barabasi-Albert (BA) Scale-Free model with both analytical results and simulations, and find…
The scaling relation derived by Dorogovtsev, Goltsev, Mendes and Samukhin [Phys. Rev. E, 68 (2003) 046109] states that the exponents of the power-law connectivity distribution, gamma, and the power-law eigenvalue distribution of the…
We show that the load at each node in a preferential attachment network scales as a power of the degree of the node. For a network whose degree distribution is p(k) ~ k^(-gamma), we show that the load is l(k) ~ k^eta with eta = gamma - 1,…
We discuss how various models of scale-free complex networks approach their limiting properties when the size N of the network grows. We focus mainly on equilibrated networks and their finite-size degree distributions. Our results show that…
In this paper, critical global connectivity of mobile ad hoc communication networks (MAHCN) is investigated. We model the two-dimensional plane on which nodes move randomly with a triangular lattice. Demanding the best communication of the…
We investigate various aspects of the statistics of leaders in growing network models defined by stochastic attachment rules. The leader is the node with highest degree at a given time (or the node which reached that degree first if there…