Searching efficiency of multiple walkers on the weighted networks

Abstract The weighted networks are realistic forms of networks, where a weight is attached to each link. In order to better study searching efficiency of multiple walkers we extend the study on the binary networks to the weighted networks. In this paper, the main aim is to measure the searching efficiency of multiple walkers on the weighted networks. Firstly, we review the theoretical foundations related to our study. Secondly, we introduce the heterogeneous mean-field (HMF) theory and the annealed network approach on the weighted networks. Then, we deduce the analysis formula of mean first parallel passage time (MFPPT). Finally, we study the global mean first parallel passage time (GMFPPT) and compare it to the searching efficiency of a single walker previously studied. The obtained result shows that the GMFPPT follows a uniform power law with the number of walkers. The key of this paper is to apply the heterogeneous mean-field (HMF) theory and the annealed weighted network approach to replace the weighted uncorrelated networks with the weighted fully connected networks and then construct a general probability transfer matrix on the weighted fully connected networks.

[1]  J. Sherman,et al.  Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix , 1950 .

[2]  Wang Ying-Hai,et al.  Walks on Weighted Networks , 2007 .

[3]  Martin Falcke,et al.  The stretch to stray on time: Resonant length of random walks in a transient. , 2018, Chaos.

[4]  Weigang Sun,et al.  ON THE CONDITIONAL MATCHING OF FRACTAL NETWORKS , 2016 .

[5]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[6]  E Ben-Naim,et al.  Knots and random walks in vibrated granular chains. , 2001, Physical review letters.

[7]  E. Berlow,et al.  Strong effects of weak interactions in ecological communities , 1999, Nature.

[8]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[9]  Zhongzhi Zhang,et al.  Random walks in weighted networks with a perfect trap: an application of Laplacian spectra. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Meifeng Dai,et al.  The trapping problem and the average shortest weighted path of the weighted pseudofractal scale-free networks , 2019, International Journal of Modern Physics C.

[11]  O. Bénichou,et al.  From first-passage times of random walks in confinement to geometry-controlled kinetics , 2014 .

[12]  Qiang Jia,et al.  Consensus of Multi-Agents With Event-Based Nonlinear Coupling Over Time-Varying Digraphs , 2018, IEEE Transactions on Circuits and Systems II: Express Briefs.

[13]  J. Klafter,et al.  First-passage times in complex scale-invariant media , 2007, Nature.

[14]  Alan M. Frieze,et al.  The cover time of a biased random walk on a random cubic graph , 2018, AofA.

[15]  M. Dai,et al.  FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS , 2017 .

[16]  Changsong Zhou,et al.  Universality in the synchronization of weighted random networks. , 2006, Physical review letters.

[17]  Lifeng Xi,et al.  Scale-free effect of substitution networks , 2018 .

[18]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.

[19]  Zu-Guo Yu,et al.  Fractal and multifractal analyses of bipartite networks , 2017, Scientific Reports.

[20]  R. May,et al.  How Viruses Spread Among Computers and People , 2001, Science.

[21]  Michael Small,et al.  Multiple random walks on complex networks: A harmonic law predicts search time. , 2017, Physical review. E.

[22]  Konstantin Avrachenkov,et al.  Analysis of Relaxation Time in Random Walk with Jumps , 2018, WAW.

[23]  Sergio Gómez,et al.  Nonperturbative heterogeneous mean-field approach to epidemic spreading in complex networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  H. Stanley,et al.  The Physics of Foraging: An Introduction to Random Searches and Biological Encounters , 2011 .

[25]  B Kahng,et al.  First passage time for random walks in heterogeneous networks. , 2012, Physical review letters.

[26]  Shlomo Havlin,et al.  Diffusion and Reactions in Fractals and Disordered Systems: Exact enumeration , 2000 .

[27]  R. Pastor-Satorras,et al.  Mean-field diffusive dynamics on weighted networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Zhongzhi Zhang,et al.  Mean first-passage time for maximal-entropy random walks in complex networks , 2014, Scientific Reports.

[29]  M. Dai,et al.  Coherence analysis of a class of weighted tree-like polymer networks , 2018 .

[30]  J. Orenstein,et al.  Ultrafast spectroscopy of quantum materials , 2012 .

[31]  Adrian Kosowski,et al.  Bounds on the cover time of parallel rotor walks , 2016, J. Comput. Syst. Sci..

[32]  Guanrong Chen,et al.  Understanding and preventing cascading breakdown in complex clustered networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  B Waclaw,et al.  Condensation in zero-range processes on inhomogeneous networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  Alessandro Vespignani,et al.  Random walks and search in time-varying networks. , 2012, Physical review letters.

[35]  Lifeng Xi,et al.  Fractality of evolving self-similar networks , 2019, Physica A: Statistical Mechanics and its Applications.

[36]  Rick Durrett,et al.  Persistence of activity in threshold contact processes, an “Annealed approximation” of random Boolean networks , 2009, Random Struct. Algorithms.

[37]  E. Ben-Naim,et al.  First-passage exponents of multiple random walks , 2010, 1009.0239.

[38]  Qiang Jia,et al.  Event-Triggered Protocol for the Consensus of Multi-Agent Systems With State-Dependent Nonlinear Coupling , 2018, IEEE Transactions on Circuits and Systems I: Regular Papers.

[39]  Tao Zhou,et al.  Traffic dynamics based on local routing protocol on a scale-free network. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  Fangyue Chen,et al.  Network coherence in the web graphs , 2015, Commun. Nonlinear Sci. Numer. Simul..

[41]  R. Pastor-Satorras,et al.  Langevin approach for the dynamics of the contact process on annealed scale-free networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[42]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

[43]  Kui Yao,et al.  DIMENSION ANALYSIS OF CONTINUOUS FUNCTIONS WITH UNBOUNDED VARIATION , 2017 .