A. Azar, A. Z. Broder, A. R. Karlin, N. Linial, S. Phillips et al., Biased random walks Random walks, universal traversal sequences, and the complexity of maze problems Cooper and A. Frieze. The cover time of random regular graphs, AKL + 79] Proc. of the 20th Symp. on Foundations of Comp. Sc. (FOCS), pp.1-18, 1979.

C. S. Greenhill, F. B. Holt, and N. C. Wormald, Expansion properties of a random regular graph after random vertex deletions, European Journal of Combinatorics, vol.29, issue.5, pp.1139-1150, 2008.
DOI : 10.1016/j.ejc.2007.06.021

N. Hanusse, D. Ilcinkas, A. Kosowski, and N. Nisse, How to beat the random walk when you have a clock ?, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00458808

N. Hanusse, E. Kranakis, and D. Krizanc, Searching with mobile agents in networks with liars, Discrete Applied Mathematics, vol.137, issue.1, pp.69-85, 2004.
DOI : 10.1016/S0166-218X(03)00189-6
URL : https://hal.archives-ouvertes.fr/hal-00307259

N. Hanusse, D. J. Kavvadias, E. Kranakis, and D. Krizanc, Memoryless search algorithms in a network with faulty advice, Theoretical Computer Science, vol.402, issue.2-3, pp.190-198, 2008.
DOI : 10.1016/j.tcs.2008.04.034
URL : https://hal.archives-ouvertes.fr/hal-00341468

S. Hoory, N. Linial, A. Wigderson, S. Janson, A. Ruci´nskiruci´nski et al., Expander graphs and their applications, Kranakis and D. Krizanc. Searching with uncertainty Proc. SIROCCO'99, pp.439-561, 1999.
DOI : 10.1090/S0273-0979-06-01126-8

L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. Stamatiou, Locating information with uncertainty in fully interconnected networks. Networks [Lov93] L. Lovász. Random walks on graphs : A survey, Rei08] O. Reingold. Undirected connectivity in log-space. J. ACM, pp.169-180, 1993.