Random walks on the folded hypercube

Random walks are basic mechanism for many dynamic processes on the network. In this paper, we study the global mean first-passage time (GMFPT) of random walks on the n -dimensional folded hypercube FQn. FQn is a variation of the hypercube Qn by adding complementary edges, and characterized with the superiorities of smaller diameter and higher connectivity than the hypercube. We initiate a more concise formula to the Kirchhoff index by using the spectra of the Laplace matrix of FQn. We also obtain the explicit formula to GMFPT, and the exponent of scaling efficiency characterizing the random walks is further determined, finding that it takes less time when random walks on FQn than on Qn. Moreover, we explore random walks on the FQn considering a given trap. Finally, we make some comparison with Qn in Kirchhoff index, noticing a more effective traffic on FQn.

[1]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[2]  Kenneth Ward Church,et al.  Query suggestion using hitting time , 2008, CIKM '08.

[3]  F. Verstraete,et al.  Quantum computation and quantum-state engineering driven by dissipation , 2009 .

[4]  Edward A. Codling,et al.  Random walk models in biology , 2008, Journal of The Royal Society Interface.

[5]  Yousef Seifi Kavian,et al.  Energy-efficient network design via modelling: optimal designing point for energy, reliability, coverage and end-to-end delay , 2013, IET Networks.

[6]  Thomas Sauerwald,et al.  Tight bounds for the cover time of multiple random walks , 2009, Theor. Comput. Sci..

[7]  R. K. Agrawal,et al.  A combination of artificial neural network and random walk models for financial time series forecasting , 2013, Neural Computing and Applications.

[8]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[9]  O. Bénichou,et al.  Global mean first-passage times of random walks on complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Jinde Cao,et al.  The Kirchhoff Index of Folded Hypercubes and Some Variant Networks , 2014 .

[11]  Chuanqi Xiao,et al.  Dimer Coverings on Random Polyomino Chains , 2015 .

[12]  Sun-Yuan Hsieh,et al.  Fault-tolerant path embedding in folded hypercubes with both node and edge faults , 2013, Theor. Comput. Sci..

[13]  Prabhakar Raghavan,et al.  The electrical resistance of a graph captures its commute and cover times , 2005, computational complexity.

[14]  J. Byers.  CORRELATED RANDOM WALK EQUATIONS OF ANIMAL DISPERSAL RESOLVED BY SIMULATION , 2001 .

[15]  Wen-Xu Wang,et al.  Control of epidemic spreading on complex networks by local traffic dynamics. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Angelika Mueller,et al.  Principles Of Random Walk , 2016 .

[17]  G. Viswanathan,et al.  Lévy flights and superdiffusion in the context of biological encounters and random searches , 2008 .

[18]  M. Randic,et al.  Resistance distance , 1993 .

[19]  István Lukovits,et al.  Extensions of the Wiener Number , 1996, J. Chem. Inf. Comput. Sci..

[20]  Steven Skiena,et al.  DeepWalk: online learning of social representations , 2014, KDD.

[21]  Francesc Comellas,et al.  Mean first-passage time for random walks on generalized deterministic recursive trees. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Sun-Yuan Hsieh,et al.  Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes , 2013, IEEE Transactions on Computers.

[23]  J. Guan,et al.  Mean first-passage time for random walks on the T-graph , 2009, 0907.3251.

[24]  Xin-She Yang,et al.  Multiobjective cuckoo search for design optimization , 2013, Comput. Oper. Res..

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

[26]  Wei-gang Sun,et al.  A discrete random walk on the hypercube , 2018 .

[27]  Shuigeng Zhou,et al.  Exact solution for mean first-passage time on a pseudofractal scale-free web. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  David Thomas,et al.  The Art in Computer Programming , 2001 .