17
Views
6
CrossRef citations to date
0
Altmetric
EDITOR'S CORNER

The Editor's Corner: The White Screen Problem

Pages 704-707 | Published online: 02 Feb 2018

REFERENCES

  • David J. Aldous, Lower bounds for covering time for reversible Markov chains and random walks on graphs, J. Theoretical Probability, 2 (1989) 91–100.
  • David J. Aldous, Bibliography: Random Walks on Graphs, 1988.
  • R. Aleliunas et al, Random walks, universal traversal sequences, and the complexity of maze traversal, Proc. 20th IEEE Symposium on the Foundations of Computer Science, (1979) 218–233.
  • P. Gerl, Random walks on graphs, in Probability Measures on Groups, v (H. Heyer, ed.), Springer Lecture Notes in Mathematics 1210, 1986.
  • Peter Claver Matthews, Some sample path properties of a random walk on the cube, J Theoretical Probability, 2 (1989) 129–146.
  • David Zuckerman, Covering the 2-torus, preprint, 1989.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.