Skip to main content
SpringerLink
Log in

A syntactic approach to random walks on graphs

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1335))

Included in the following conference series:

  • 122 Accesses

Abstract

We use formal language theory to study syntactic behaviour of random walks on graphs. The set of walks, viewed as sets of words, is a recognizable language. As a consequence, a set of random walks can be formally described by a rational fraction or equivalently by an automaton. Applying these techniques, we compute in a unified way various statistical parameters related to random walks, such as mean cover time, and the mean hitting time.

Laboratoire associé au CNRS

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.J. Aldous. The random walk construction of uniform spanning trees and uniform labelled trees. SIAM Journal on Discrete Mathematics, 3(4):450–465, 1990.

    Google Scholar 

  2. D.J. Aldous and J.A. Fill. Reversible Markov Chains and Random Walks on Graphs. 1996. Book in preparation.

    Google Scholar 

  3. D. Arquès and J. Françon. Arbres bien étiquetés et fractions multicontinues. In B. Courcelle, editor, Proceedings of 9th Colloquium on Trees in Algebra and Programming, pages 50–61, Bordeaux, France, March 1984. Cambridge University Press.

    Google Scholar 

  4. S. Bhatt and J.Y. Cai. Take a walk, grow a tree. In 29th Annunal IEEE Symposium on Foundations of Computer Science, pages 469–478, 1988.

    Google Scholar 

  5. G. Brightwell and P. Winkler. Extremal cover times for random walks on trees. Journal of Graph Theory, 14(5):547–554, 1990.

    Google Scholar 

  6. A.Z. Broder. Generating random spanning trees. In Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, pages 442–453, October 1989.

    Google Scholar 

  7. A.Z. Broder, A.R. Karlin, P. Raghavan, and E. Upfal. Trading space for time in undirected s-t connectivity. In ACM Symposium on Theory of Computing (STOC), pages 543–549, 1989.

    Google Scholar 

  8. D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir. Random walks on weighted graphs and applications to on-line algorithms. Journal of the ACM, 40(3):421–453, July 1993.

    Google Scholar 

  9. M. Dyer, A. Frieze, and R. Kannan. A random polynomial time algorithm for approximating the volume of covex bodies. In ACM Symposium on Theory of Computing (STOC), pages 375–381, 1989.

    Google Scholar 

  10. S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, Newyork, 1974.

    Google Scholar 

  11. W. Feller. An introduction to probability theory and its applications, volume Vol. 1. 2nd ed. Wiley, New York, 1957.

    Google Scholar 

  12. P. Flajolet. Combinatorial aspects of continued fractions. Discrete Mathematics, 32:125–161, 1980.

    Google Scholar 

  13. A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In Proc. of the Ninth Annual Symposium on Principles of Distributed Computing, pages 119–131, 1990.

    Google Scholar 

  14. M. Jerrum and A. Sinclair. Conductance and the rapid mixing property of markov chains: the approximation of the permanent resolved. In ACM Symposium on Theory of Computing (STOC), pages 235–244, 1988.

    Google Scholar 

  15. M. Mosbah and N. Saheb. Formal rational fractions and random walks on cycle graphs. Technical Report 1147-96, University of Bordeaux 1, 1996. accepté à FPSAC 97-Vienne 14–18 juillet 97.

    Google Scholar 

  16. M. Mosbah and N. Saheb.Non uniform random spanning trees on weighted graphs. Technical Report 1143-96, University of Bordeaux 1, 1996.

    Google Scholar 

  17. P. Tetali and P. Winkler. On a random walk arising in self-stabilizing token management. In Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pages 273–280, 1991.

    Google Scholar 

  18. D.B. Wilson and J.G. Propp. How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 448–457, Atlanta, Georgia, 28–30 January 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université Bordeaux-I, 351, cours de la Libération, 33405, Talence, France

    M. Mosbah & N. Saheb

Authors
  1. M. Mosbah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Saheb
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf H. Möhring

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mosbah, M., Saheb, N. (1997). A syntactic approach to random walks on graphs. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes in Computer Science, vol 1335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024503

Download citation

  • DOI: https://doi.org/10.1007/BFb0024503

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63757-8

  • Online ISBN: 978-3-540-69643-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation