1
|
Yuan Z, Peng J, Gao L, Shao R. First-passage properties of bundled networks. CHAOS (WOODBURY, N.Y.) 2024; 34:073150. [PMID: 39042508 DOI: 10.1063/5.0221894] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 06/04/2024] [Accepted: 07/11/2024] [Indexed: 07/25/2024]
Abstract
Bundled networks, obtained by attaching a copy of a fiber structure to each node on the base structure, serve as important realistic models for the geometry and dynamics of nontranslationally invariant systems in condensed matter physics. Here, we analyze the first-passage properties, including the mean first-passage time, the mean-trapping time, the global-mean first-passage time (GFPT), and the stationary distribution, of a biased random walk within such networks, in which a random walker moves to a neighbor on base with probability γ and to a neighbor on fiber with probability 1-γ when the walker at a node on base. We reveal the primary properties of both the base and fiber structure, which govern the first-passage characteristics of the bundled network. Explicit expressions between these quantities in the bundled networks and the related quantities in the component structures are presented. GFPT serves as a crucial indicator for evaluating network transport efficiency. Unexpectedly, bases and fibers with similar scaling of GFPT can construct bundled networks exhibiting different scaling behaviors of GFPT. Therefore, bundled networks can be tailored to accommodate specific dynamic property requirements by choosing a suitable base and fiber structure. These findings contribute to advancing the design and optimization of network structures.
Collapse
Affiliation(s)
- Zhenhua Yuan
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
- Guangdong Provincial Key Laboratory, co-sponsored by the Province and City of Information Security Technology, Guangzhou University, Guangzhou 510006, China
- Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| | - Junhao Peng
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
- Guangdong Provincial Key Laboratory, co-sponsored by the Province and City of Information Security Technology, Guangzhou University, Guangzhou 510006, China
- Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| | - Long Gao
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
- Guangdong Provincial Key Laboratory, co-sponsored by the Province and City of Information Security Technology, Guangzhou University, Guangzhou 510006, China
- Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| | - Renxiang Shao
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
- Guangdong Provincial Key Laboratory, co-sponsored by the Province and City of Information Security Technology, Guangzhou University, Guangzhou 510006, China
- Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| |
Collapse
|
2
|
Yuan Z, Peng J, Gao L, Shao R. Fractal and first-passage properties of a class of self-similar networks. CHAOS (WOODBURY, N.Y.) 2024; 34:033134. [PMID: 38526982 DOI: 10.1063/5.0196934] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 01/10/2024] [Accepted: 03/01/2024] [Indexed: 03/27/2024]
Abstract
A class of self-similar networks, obtained by recursively replacing each edge of the current network with a well-designed structure (generator) and known as edge-iteration networks, has garnered considerable attention owing to its role in presenting rich network models to mimic real objects with self-similar structures. The generator dominates the structural and dynamic properties of edge-iteration networks. However, the general relationships between these networks' structural and dynamic properties and their generators remain unclear. We study the fractal and first-passage properties, such as the fractal dimension, walk dimension, resistance exponent, spectral dimension, and global mean first-passage time, which is the mean time for a walker, starting from a randomly selected node and reaching the fixed target node for the first time. We disclose the properties of the generators that dominate the fractal and first-passage properties of general edge-iteration networks. A clear relationship between the fractal and first-passage properties of the edge-iteration networks and the related properties of the generators are presented. The upper and lower bounds of these quantities are also discussed. Thus, networks can be customized to meet the requirements of fractal and dynamic properties by selecting an appropriate generator and tuning their structural parameters. The results obtained here shed light on the design and optimization of network structures.
Collapse
Affiliation(s)
- Zhenhua Yuan
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
- Guangdong Provincial Key Laboratory, Co-sponsored by the Province and City of Information Security Technology, Guangzhou University, Guangzhou 510006, China
- Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| | - Junhao Peng
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
- Guangdong Provincial Key Laboratory, Co-sponsored by the Province and City of Information Security Technology, Guangzhou University, Guangzhou 510006, China
- Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| | - Long Gao
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
- Guangdong Provincial Key Laboratory, Co-sponsored by the Province and City of Information Security Technology, Guangzhou University, Guangzhou 510006, China
- Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| | - Renxiang Shao
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
- Guangdong Provincial Key Laboratory, Co-sponsored by the Province and City of Information Security Technology, Guangzhou University, Guangzhou 510006, China
- Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| |
Collapse
|
3
|
Chen Y, Yuan Z, Gao L, Peng J. Optimizing search processes with stochastic resetting on the pseudofractal scale-free web. Phys Rev E 2023; 108:064109. [PMID: 38243504 DOI: 10.1103/physreve.108.064109] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/04/2023] [Accepted: 11/15/2023] [Indexed: 01/21/2024]
Abstract
The pseudofractal scale-free web (PSFW) is a well-known model for a scale-free network with small-world characteristics. Understanding the dynamic properties of this network can provide valuable insights into dynamic processes occurring in general scale-free and small-world networks. In this study we investigate search processes using discrete-time random walks on the PSFW to reveal the impact of the resetting position on optimizing search efficiency, as measured by the mean first-passage time (MFPT). At each step the walker has two options: with a probability of 1-γ, it moves to one of the neighboring sites, and with a probability of γ, it resets to the predefined resetting position. We explore various choices for the resetting position, present rigorous results for the MFPT to a given node of the network, determine the optimal resetting probability γ^{*} where the MFPT reaches its minimum, and evaluate the ratio of the minimum for MFPT to the MFPT without resetting for each case. Results show that, in large PSFWs, both the degree of the resetting position and the distance between the target and the resetting position significantly affect the search efficiency. A higher degree of the resetting position leads to a slower convergence of the walker to the target, while a greater distance between the target and the resetting position also results in a slower convergence. Additionally, we observe that resetting to a vertex randomly selected from the stationary distribution can significantly expedite the process of the walker reaching the target. The findings presented in this study shed light on optimizing stochastic search processes on large networks, offering valuable insights into improving search efficiency in real-world applications, where the target node's location is unknown.
Collapse
Affiliation(s)
- Yongjin Chen
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China; Guangdong Provincial Key Laboratory of Information Security Technology, Guangzhou University, Guangzhou 510006, China; and Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| | - Zhenhua Yuan
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China; Guangdong Provincial Key Laboratory of Information Security Technology, Guangzhou University, Guangzhou 510006, China; and Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| | - Long Gao
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China; Guangdong Provincial Key Laboratory of Information Security Technology, Guangzhou University, Guangzhou 510006, China; and Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| | - Junhao Peng
- School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China; Guangdong Provincial Key Laboratory of Information Security Technology, Guangzhou University, Guangzhou 510006, China; and Guangzhou Center for Applied Mathematics, Guangzhou University, Guangzhou 510006, China
| |
Collapse
|