%0 Journal Article %1 aldous1991meeting %A Aldous, David J. %D 1991 %J Stochastic Processes and their Applications %K Markov_chains bounds coalescent_time meeting_time %N 2 %P 185 - 193 %R http://dx.doi.org/10.1016/0304-4149(91)90090-Y %T Meeting times for independent Markov chains %U http://www.sciencedirect.com/science/article/pii/030441499190090Y %V 38 %X Start two independent copies of a reversible Markov chain from arbitrary initial states. Then the expected time until they meet is bounded by a constant times the maximum first hitting time for the single chain. This and a sharper result are proved, and several related conjectures are discussed.

@article{aldous1991meeting, abstract = {Start two independent copies of a reversible Markov chain from arbitrary initial states. Then the expected time until they meet is bounded by a constant times the maximum first hitting time for the single chain. This and a sharper result are proved, and several related conjectures are discussed. }, added-at = {2016-03-15T22:11:59.000+0100}, author = {Aldous, David J.}, biburl = {https://www.bibsonomy.org/bibtex/2576cb9c58e4ee87f9efbb79bf50bd51c/peter.ralph}, doi = {http://dx.doi.org/10.1016/0304-4149(91)90090-Y}, interhash = {4fe9f3a509b50f49fb604a95238383d2}, intrahash = {576cb9c58e4ee87f9efbb79bf50bd51c}, issn = {0304-4149}, journal = {Stochastic Processes and their Applications }, keywords = {Markov_chains bounds coalescent_time meeting_time}, number = 2, pages = {185 - 193}, timestamp = {2016-03-15T22:11:59.000+0100}, title = {Meeting times for independent Markov chains }, url = {http://www.sciencedirect.com/science/article/pii/030441499190090Y}, volume = 38, year = 1991 }