Degree Distribution, Rank-size Distribution, and Leadership Persistence in Mediation-Driven Attachment Networks

  title={Degree Distribution, Rank-size Distribution, and Leadership Persistence in Mediation-Driven Attachment Networks},
  author={Md. Kamrul Hassan and Liana Islam and Syed Arefinul Haque},
We investigate the growth of a class of networks in which a new node first picks a mediator at random and connects with m randomly chosen neighbors of the mediator at each time step. We show that the degree distribution in such a mediation-driven attachment (MDA) network exhibits power-law P(k)∼k−γ(m) with a spectrum of exponents depending on m. To appreciate the contrast between MDA and Barabasi–Albert (BA) networks, we then discuss their rank-size distribution. To quantify how long a leader… Expand
Dynamic scaling, data-collapse and self-similarity in mediation-driven attachment networks
Recently, we have shown that if the $i$th node of the Barab\'{a}si-Albert (BA) network is characterized by the generalized degree $q_i(t)=k_i(t)t_i^\beta/m$, where $k_i(t)\sim t^\beta$ and $m$ areExpand
Universality class of explosive percolation in Barabási-Albert networks
This work study explosive percolation in Barabási-Albert network, in which nodes are born with degree k = m, for both product rule (PR) and sum rule (SR) of the Achlioptas process finds that the critical exponents ν, α, β and γ for m > 1 are found to be independent not only of the value of m but also of PR and SR. Expand
Modelling and Analysis the Network Model Controlled by Mediation-Driven Attachment Rule
The problem of modeling scale-free networks is considered and the dependence of the scaling factor of nodes degree distribution on the control parameter – the number of links associated with incoming nodes – is analyzed both analytically and by numerical simulation. Expand
Correlated copying in a hidden network model
We introduce the concept of a hidden network model – a generative two-layer network in which an observed network evolves according to the structure of an underlying hidden layer. We apply the conceptExpand
The longest path in the Price model
A reverse greedy path is defined and it is shown both analytically and numerically that this scales with the logarithm of the size of the network with a coefficient given by the number of edges added using random attachment. Expand
Heterogeneous node copying from hidden network structure
Node copying is an important mechanism for network formation, yet most models assume uniform copying rules. Motivated by observations of heterogeneous triadic closure in real networks, we introduceExpand
Elastic Scale-Free Networks Model Based on the Mediaton-Driven Attachment Rule
Applying the copy-factor as the control parameter instead of traditionally used number of incoming links makes it possible to generate networks model, which combines the key benefits of mediation- driven attachment, such as indirect using the nodes degree, and elasticity,such as different relative growth rates for links and nodes. Expand
COVID-19 Should be Suppressed by Mixed Constraints -- from Simulations on Constrained Scale-Free Networks
For quickly suppressing the number of infections, restrict W to less than 4 if the constraint to make m0 at most 1 is too strict, and set m0 to 4 or less works for quick reduction of infections according to the result. Expand
Infections May Not be Suppressed by Moderate Restriction of Contacts -- Simulated Expansions of Virus in Constrained Scale-Free Networks
Infection of virus is here simulated over human networks where the widths, defined as two constants representing the size of the contacting community, are constrained. In this model, the real-spaceExpand
Scale-free Network-based Differential Evolution
The novelties of this paper include a scale-free network-based population structure and a new mutation operator designed to fully utilize the neighborhood information provided by a scalefree structure to alleviate the drawbacks of premature convergence. Expand


Dynamic scaling, data-collapse and self-similarity in Barabási and Albert networks
In this paper, we show that if each node of the Barabasi–Albert (BA) network is characterized by the generalized degree q, i.e. the product of their degree k and the square root of their respectiveExpand
Organization of growing random networks.
  • P. Krapivsky, S. Redner
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
The organizational development of growing random networks is investigated, and the combined age and degree distribution of nodes shows that old nodes typically have a large degree. Expand
Highly dispersed networks generated by enhanced redirection
We analyze growing networks that are built by enhanced redirection. Nodes are sequentially added and each incoming node attaches to a randomly chosen 'target' node with probability 1 − r, or to theExpand
Scale-free network growth by ranking.
A criterion of network growth that explicitly relies on the ranking of the nodes according to any prestige measure, be it topological or not is proposed, which may explain the frequency and robustness of scale-free degree distributions in real networks, as illustrated by the special case of the Web graph. Expand
Evolution of networks with aging of sites
  • Dorogovtsev, Mendes
  • Physics, Medicine
  • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 2000
It is found both from simulation and analytically that the network shows scaling behavior only in the region alpha<1, when alpha increases from -infinity to 0, and the exponent gamma of the distribution of connectivities grows from 2 to the value for the network without aging. Expand
Highly dispersed networks by enhanced redirection.
A class of networks that grow by enhanced redirection is introduced, and each either attaches to a randomly chosen target node or to the parent of the target with probability r, where r is an increasing function of the degree of the parent. Expand
Scale-free networks via attaching to random neighbors
Preferential attachment is considered one of the key factors in the formation of scale-free networks. However, complete random attachment without a preferential mechanism can also generate scale-freeExpand
Scale-free network topology and multifractality in a weighted planar stochastic lattice
We propose a weighted planar stochastic lattice (WPSL) formed by the random sequential partition of a plane into contiguous and non-overlapping blocks and we find that it evolves following severalExpand
Duplication Models for Biological Networks
Combinatorial probabilistic methods are used to examine the evolution of graphs by node duplication processes and derive exact analytical relationships between the exponent of the power law and the parameters of the model. Expand
Topology of evolving networks: local events and universality
A continuum theory is proposed that predicts the connectivity distribution of the network describing the professional links between movie actors as well as the scaling function and the exponents, in good agreement with numerical results. Expand