%0 Generic %1 chen2014approximating %A Chen, Yu-Ting %D 2014 %K Green_function Laplace_transforms coalescent_time coalescing_random_walk evolutionary_games identity_by_descent meeting_time resistance_approximation resistance_distance %T Approximating Laplace transforms of meeting times for some symmetric Markov chains %U http://arxiv.org/abs/1410.4716 %X We study distributions of meeting times for finite symmetric Markov chains. For Markov kernels defined on large state spaces which satisfy certain weak inhomogeneity in return probabilities of points up to large numbers of steps, we obtain approximation, with explicit error bounds, of the Laplace transforms of some meeting times (without scaling) by ratios of Green functions closely related to hitting times of points. In studying this approximation, we identify some key matrix power series in Markov kernels weighted with solutions to a discrete transport-like equation with explicit coefficients, which stems from the viewpoint that meeting time distributions are equivalent to correlations of some linear particle system. Our result applies in particular to random walks on large random regular graphs. It gives a justification of the corresponding practice, among other things, in Allen, Traulsen, Tarnita and Nowak (2012) on approximating certain critical values for the emergence of cooperation when mutation is present.

@misc{chen2014approximating, abstract = {We study distributions of meeting times for finite symmetric Markov chains. For Markov kernels defined on large state spaces which satisfy certain weak inhomogeneity in return probabilities of points up to large numbers of steps, we obtain approximation, with explicit error bounds, of the Laplace transforms of some meeting times (without scaling) by ratios of Green functions closely related to hitting times of points. In studying this approximation, we identify some key matrix power series in Markov kernels weighted with solutions to a discrete transport-like equation with explicit coefficients, which stems from the viewpoint that meeting time distributions are equivalent to correlations of some linear particle system. Our result applies in particular to random walks on large random regular graphs. It gives a justification of the corresponding practice, among other things, in Allen, Traulsen, Tarnita and Nowak (2012) on approximating certain critical values for the emergence of cooperation when mutation is present.}, added-at = {2016-03-15T23:01:33.000+0100}, author = {Chen, Yu-Ting}, biburl = {https://www.bibsonomy.org/bibtex/2ccb0e2b78d1032bb6822a09bbadac50f/peter.ralph}, description = {Studes the distribution of meeting time for random starting points, i.e. when both are chosen independently according to the stationary distribution; or else when one is a single time step away from the other. }, interhash = {5d19d5b8f7edae4581dca1ae34126c13}, intrahash = {ccb0e2b78d1032bb6822a09bbadac50f}, keywords = {Green_function Laplace_transforms coalescent_time coalescing_random_walk evolutionary_games identity_by_descent meeting_time resistance_approximation resistance_distance}, note = {cite arxiv:1410.4716v1}, timestamp = {2016-03-15T23:06:50.000+0100}, title = {Approximating {Laplace} transforms of meeting times for some symmetric {Markov} chains}, url = {http://arxiv.org/abs/1410.4716}, year = 2014 }