Dembo, Amir, Rosen, Jay, and Zeitouni, Ofer. Limit law for the cover time of a random walk on a binary tree. Retrieved from https://par.nsf.gov/biblio/10285942. Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 57.2 Web. doi:10.1214/20-AIHP1098.
Dembo, Amir, Rosen, Jay, & Zeitouni, Ofer. Limit law for the cover time of a random walk on a binary tree. Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 57 (2). Retrieved from https://par.nsf.gov/biblio/10285942. https://doi.org/10.1214/20-AIHP1098
Dembo, Amir, Rosen, Jay, and Zeitouni, Ofer.
"Limit law for the cover time of a random walk on a binary tree". Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 57 (2). Country unknown/Code not available. https://doi.org/10.1214/20-AIHP1098.https://par.nsf.gov/biblio/10285942.
@article{osti_10285942,
place = {Country unknown/Code not available},
title = {Limit law for the cover time of a random walk on a binary tree},
url = {https://par.nsf.gov/biblio/10285942},
DOI = {10.1214/20-AIHP1098},
abstractNote = {},
journal = {Annales de l'Institut Henri Poincaré, Probabilités et Statistiques},
volume = {57},
number = {2},
author = {Dembo, Amir and Rosen, Jay and Zeitouni, Ofer},
editor = {null}
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.