Searching efficiency of multiple walkers on the weighted networks
From MaRDI portal
Publication:2137613
DOI10.1016/j.physa.2019.123352OpenAlexW2984228155WikidataQ126818528 ScholiaQ126818528MaRDI QIDQ2137613
Junjie Shen, Yu Huang, Lingfei Dai, Huijia Chi, Meifeng Dai, Yin Li, Wei Yi Su
Publication date: 16 May 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2019.123352
heterogeneous mean-field theoryannealed network approachglobal mean first parallel passage timemean first parallel passage time
Related Items (2)
AVERAGE FERMAT DISTANCES OF TWO-COLORED SUBSTITUTION NETWORKS ⋮ Extreme events in stochastic transport on networks
Cites Work
- Bounds on the cover time of parallel rotor walks
- From first-passage times of random walks in confinement to geometry-controlled kinetics
- Scale-free effect of substitution networks
- Fractality of evolving self-similar networks
- Network coherence in the web graphs
- Diffusion and Reactions in Fractals and Disordered Systems
- Kinetics of first passage in a cone
- Persistence of activity in threshold contact processes, an “Annealed approximation” of random Boolean networks
- The stretch to stray on time: Resonant length of random walks in a transient
- FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
- DIMENSION ANALYSIS OF CONTINUOUS FUNCTIONS WITH UNBOUNDED VARIATION
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- Analysis of Relaxation Time in Random Walk with Jumps
This page was built for publication: Searching efficiency of multiple walkers on the weighted networks