Growing Small-World Networks Generated by Attaching to Edges
Zhongzhi Zhang, Lili Rong
Abstract
We introduce a minimal model of small-world growing network generated by attaching to edges. The produced network is a plane graph which exists in real-life world. We obtain the analytic results of degree distribution decaying exponentially with degree and average clustering coefficient C=3/2ln3-1≈ 0.6479, which are in good agreement with the numerical simulations. We also prove that the increasing tendency of average path length of the considered network is a little slower than the logarithm of the network order N.
Create a lesson
Related papers
Dynamically Reentrant Skyrmion Phase in Oscillating Magnetic Fields
Z. Demir Vatansever, E. Vatansever, A. Vasilopoulos et al.
Mutual linearity in semi-Markov networks
Julian B. Voits, Ulrich S. Schwarz
Steady states in asymmetric exclusion processes with reactions: Fluctuations and non-mean field behaviour
Rohn Chatterjee, Atri Goswami, Sudip Mukherjee
Marginal Operator Deformations and Pseudocriticality in Baxter--Wu Models
Hyun-Yong Lee, Naoki Kawashima, Nikolaos G. Fytas et al.
Kardar--Parisi--Zhang density hydrodynamics in a coherent XXZ--ASEP Lindbladian
Yansheng Liu, Daoguang Li, Kaixiang Lu et al.
Brownian gyrator model with stochastic resetting
Satya N. Majumdar, Gregory Schehr, Pascal Viot et al.