The role of detachment of in-links in scale-free networks

@article{Lnsk2013TheRO,
  title={The role of detachment of in-links in scale-free networks},
  author={Petr L{\'a}nsk{\'y} and Federico Polito and Laura Sacerdote},
  journal={Journal of Physics A: Mathematical and Theoretical},
  year={2013},
  volume={47}
}
Real-world networks may exhibit a detachment phenomenon determined by the canceling of previously existing connections. We discuss a tractable extension of the Yule model to account for this feature. Analytical results are derived and discussed both asymptotically and for a finite number of links. Comparison with the original model is performed in the supercritical case. The first-order asymptotic tail behavior of the two models is similar but differences arise in the second-order term. We… 
View on IOP Publishing
arxiv.org
11 Citations
Background Citations
5
Methods Citations
1

11 Citations

Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
Generalized Nonlinear Yule Models
With the aim of considering models related to random graphs growth exhibiting persistent memory, we propose a fractional nonlinear modification of the classical Yule model often studied in the…
Uniform Preferential Selection Model for Generating Scale-free Networks
TLDR
This paper proposes a model that describes the degree distribution for the whole range of k > 0, i.e., before and after k m i n and demonstrates that the degree distributions of the graphs generated by this model match well with those of the real-world graphs.
Analysis of a Model for Generating Weakly Scale-free Networks
TLDR
This paper proposes a model that describes this particular degree distribution for the whole range of $k>0$ and performs comprehensive mathematical analysis of the model in the discrete domain and compares the degree distribution generated by these models with that of real-world networks.
Generating Graphs by Creating Associative and Random Links Between Existing Nodes
TLDR
This paper proposes a new generative model for generating realistic networks that is a blend of three key ideas namely preferential attachment, associativity of social links and randomness in real networks and gives both qualitative and quantitative results for clarity.
Random Graphs Associated to Some Discrete and Continuous Time Preferential Attachment Models
We give a common description of Simon, Barabási–Albert, II-PA and Price growth models, by introducing suitable random graph processes with preferential attachment mechanisms. Through the II-PA model,…
On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
Studies on generalized Yule models
  • F. Polito
  • Mathematics
    Modern Stochastics: Theory and Applications
  • 2018
We present a generalization of the Yule model for macroevolution in which, for the appearance of genera, we consider point processes with the $OS$ property, while for the growth of species we use…
On the continuous-time limit of the Barabási-Albert random graph
On a Two-Parameter Yule-Simon Distribution
  • E. Baur, J. Bertoin
  • Mathematics
    A Lifetime of Excursions Through Random Walks and Lévy Processes
  • 2021
We extend the classical one-parameter Yule-Simon law to a version depending on two parameters, which in part appeared in Bertoin [2019] in the context of a preferential attachment algorithm with…
...
...

References

SHOWING 1-10 OF 56 REFERENCES
Multifractal properties of growing networks
We introduce a new family of models for growing networks. In these networks new edges are preferentially attached to vertices with a higher number of connections, and new vertices are created by…
Degree distributions of evolving networks
In this paper, we propose a simple evolving network model with link and node removals as well as additions and show that this evolving network is scale free with a degree exponent varying in (1,4]…
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Evolution of networks
TLDR
The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated.
World Wide Web scaling exponent from Simon's 1955 model.
  • S. Bornholdt, Holger Ebel
  • Physics, Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
TLDR
A simple and elegant model for scaling phenomena in general copy- and growth-processes as proposed by Simon in 1955 is recalled and when combined with an experimental measurement of network growth in the World Wide Web, this classical model is able to model the in-link dynamics and predicts the scaling exponent gamma=2.1 in accordance with observation.
Scale-Free Networks: A Decade and Beyond
TLDR
An avalanche of research has shown that many real networks, independent of their age, function, and scope, converge to similar architectures, a universality that allowed researchers from different disciplines to embrace network theory as a common paradigm.
A stochastic evolutionary model exhibiting power-law behaviour with an exponential cutoff
Scale-free characteristics of random networks: the topology of the world-wide web
Growing network model for community with group structure.
TLDR
A growing network model for a community with a group structure, which consists of individual members and groups, gatherings of members, which investigates the emerging community structure analytically and numerically.
Theory of Zipf's Law and Beyond
Zipf's law is one of the few quantitative reproducible regularities found in economics. It states that, for most countries, the size distributions of city sizes and of firms are power laws with a…
...
...