Stochastic growth tree networks with an identical fractal dimension: Construction and mean hitting time for random walks
- 1 June 2022
- journal article
- research article
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 32 (6), 063123
- https://doi.org/10.1063/5.0093795
Abstract
There is little attention paid to stochastic tree networks in comparison with the corresponding deterministic analogs in the current study of fractal trees. In this paper, we propose a principled framework for producing a family of stochastic growth tree networks T-m;t possessing fractal characteristic, where t represents the time step and parameter m is the number of vertices newly created for each existing vertex at generation. To this end, we introduce two types of generative ways, i.e., Edge-Operation and Edge-Vertex-Operation. More interestingly, the resulting stochastic trees turn out to have an identical fractal dimension d(m;f) = ln 2 (m + 1) / ln 2 regardless of the introduction of randomness in the growth process. At the same time, we also study many other structural parameters including diameter and degree distribution. In both extreme cases, our tree networks are deterministic and follow multiple-point degree distribution and power-law degree distribution, respectively. Additionally, we consider random walks on stochastic growth tree networks T-m;t and derive an expectation estimation for mean hitting time < H-m;t > in an effective combinatorial manner instead of commonly used spectral methods. The result shows that on average, the scaling of mean hitting time < H-m;t > obeys < H-m;t > = |T-m;t|(lambda), where |T-m;t| represents vertex number and exponent lambda is equivalent to 1 + ln 2 / ln 2 (m+1). In the meantime, we conduct extensive experimental simulations and observe that empirical analysis is in strong agreement with theoretical results. Published under an exclusive license by AIP Publishing.Keywords
Funding Information
- National Key Research and Development Program of China (2020YFB1805400)
- National Natural Science Foundation of China (62072010)
This publication has 42 references indexed in Scilit:
- Exponential-family random graph models for valued networksElectronic Journal of Statistics, 2012
- The weighted random graph modelNew Journal of Physics, 2009
- An introduction to exponential random graph (p*) models for social networksSocial Networks, 2007
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- Apollonian Networks: Simultaneously Scale-Free, Small World, Euclidean, Space Filling, and with Matching GraphsPhysical Review Letters, 2005
- Self-similarity of complex networksNature, 2005
- Random Walks on Complex NetworksPhysical Review Letters, 2004
- Brownian Motion and Harmonic Analysis on Sierpinski CarpetsCanadian Journal of Mathematics, 1999
- The Quasi-Wiener and the Kirchhoff Indices CoincideJournal of Chemical Information and Computer Sciences, 1996
- Fractal models for diffusion controlled aggregationJournal of Physics A: General Physics, 1983