The Mean Capture Time on Horizontal Divided Nested Networks
DOI:
https://doi.org/10.54097/gk0wxf53Keywords:
Nested network; horizontal division line; division coefficient; mean capture time.Abstract
In this paper, we consider the division of nested networks with a horizontal division line , where is the division coefficient. The problem of capture on the surplus network obtained after the division is studied. In addition, by studying the structure of the surplus network, we obtain the relationship between the transmission efficiency on the surplus network and the division coefficient . When is larger, the capture time is shorter and the network transmission efficiency is higher. At the same time, we also solved the mean capture time of each node on the bottom edge of the surplus network.
Downloads
References
[1] Pinter-Wollman N, Hobson E A, Smith J E, et al. The dynamics of animal social networks: analytical, conceptual, and theoretical advances[J]. Behavioral Ecology, 2014, 25(2): 242-255.
[2] Shanker O. Complex network dimension and path counts[J]. Theoretical computer science, 2010, 411(26-28): 2454-2458.
[3] Haag J E, Wouwer A V, Bogaerts P. Dynamic modeling of complex biological systems: a link between metabolic and macroscopic description[J]. Mathematical biosciences, 2005, 193(1): 25-49.
[4] Zhuo Y, Peng Y, Liu C, et al. Traffic dynamics on layered complex networks[J]. Physica A: Statistical Mechanics and its Applications, 2011, 390(12): 2401-2407.
[5] Bose D, Chanda C K, Chakrabarti A. Vulnerability assessment of a power transmission network employing complex network theory in a resilience framework[J]. Microsystem Technologies, 2020, 26(8): 2443-2451.
[6] Saleh M, Esa Y, Mohamed A. Applications of complex network analysis in electric power systems[J]. Energies, 2018, 11(6): 1381.
[7] Chen G, Dong Z Y, Hill D J, et al. An improved model for structural vulnerability analysis of power networks[J]. Physica A: Statistical Mechanics and its Applications, 2009, 388(19): 4259-4266.
[8] Arianos S, Bompard E, Carbone A, et al. Power grid vulnerability: A complex network approach[J]. Chaos: An Interdisciplinary Journal of Nonlinear Science, 2009, 19(1).
[9] Ma F, Xue H, Yuen K F, et al. Assessing the vulnerability of logistics service supply chain based on complex network[J]. Sustainability, 2020, 12(5): 1991.
[10] Su Y, Qin J, Yang P, et al. A Supply Chain‐Logistics Super‐Network Equilibrium Model for Urban Logistics Facility Network Optimization[J]. Mathematical Problems in Engineering, 2019, 2019(1): 5375282.
[11] Feng S, Weng T, Wang Y, et al. Random search processes on complex networks: From a static target to a moving object[J]. Physica A: Statistical Mechanics and its Applications, 2024, 636: 129544.
[12] Masuda N, Porter M A, Lambiotte R. Random walks and diffusion on networks[J]. Physics reports, 2017, 716: 1-58.
[13] Liu Y, Zeng X, He Z, et al. Inferring microRNA-disease associations by random walk on a heterogeneous network with multiple data sources[J]. IEEE/ACM transactions on computational biology and bioinformatics, 2016, 14(4): 905-915.
[14] Guo Q, He F, Fan B, et al. WalkFormer: 3D mesh analysis via transformer on random walk[J]. Neural Computing and Applications, 2024, 36(7): 3499-3511.
[15] Xi L, Ye Q, Yao J, et al. Eigentime identities of flower networks with multiple branches[J]. Physica A: Statistical Mechanics and its Applications, 2019, 526: 120857.
[16] Ye Q, Gu J, Xi L. Eigentime identities of fractal flower networks[J]. Fractals, 2019, 27(02): 1950008.
[17] Dai M, Chen D, Dong Y, et al. Scaling of average receiving time and average weighted shortest path on weighted Koch networks[J]. Physica A: Statistical Mechanics and its Applications, 2012, 391(23): 6165-6173.
[18] Zhang J, Sun W. The structural properties of the generalized Koch network[J]. Journal of Statistical Mechanics: Theory and Experiment, 2010, 2010(07): P07011.
[19] Zhang Z, Wu B, Zhang H, et al. Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices[J]. Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, 2010, 81(3): 031118.
[20] Kozak J J, Balakrishnan V. Analytic expression for the mean time to absorption for a random walker on the Sierpinski gasket[J]. Physical Review E, 2002, 65(2): 021105.
[21] Wu, B.; Zhang, Z.; Su, W. AVERAGE TRAPPING TIME ON THE LEVEL-3 SIERPINSKI GASKET. ROMANIAN JOURNAL OF PHYSICS 2020, 65.
[22] Wu B, Zhang Z. The average trapping time on a half Sierpinski Gasket[J]. Chaos, Solitons & Fractals, 2020, 140: 110261.
[23] Zhang Z, Wu B. Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures[J]. Journal of Statistical Mechanics: Theory and Experiment, 2022, 2022(3): 033205.
[24] Zhang Z, Wu B. Average trapping time on the 3-dimensional 3-level sierpinski gasket network with a set of trap nodes[J]. Fractals, 2022, 30(07): 2250162.
[25] Hu Z, Chen Y. The trapping problem on horizontal partitioned level-3 sierpinski gasket networks[J]. Physica Scripta, 2023, 98(4): 045207.
[26] Sun Y, Liu X, Li X. Hitting time for random walks on the Sierpinski network and the half Sierpinski network[J]. Frontiers in Physics, 2022, 10: 1076276.
[27] Han Y, Wu B. The average trapping time of non-nearest-neighbor jumps on nested networks[J]. Physica Scripta, 2023, 98(12): 125227.
[28] Chandra, A.K.; Raghavan, P.; Ruzzo, W.L.; Smolensky, R.; Tiwari, P. The electrical resistance of a graph captures its commute and cover times. Computational Complexity 1996, 6, 312–340.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Academic Journal of Science and Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
