arXiv Analytics

Sign in

arXiv:1702.05992 [math.PR]AbstractReferencesReviewsResources

Approximate and exact solutions of intertwining equations through random spanning forests

Luca Avena, Fabienne Castell, Alexandre Gaudillière, Clothilde Melot

Published 2017-02-20Version 1

For different reversible Markov kernels on finite state spaces, we look for families of probability measures for which the time evolution almost remains in their convex hull. Motivated by signal processing problems and metastability studies we are interested in the case when the size of such families is smaller than the size of the state space, and we want such distributions to be with small overlap among them. To this aim we introduce a squeezing function to measure the common overlap of such families, and we use random forests to build random approximate solutions of the associated intertwining equations for which we can bound from above the expected values of both squeezing and total variation errors. We also explain how to modify some of these approximate solutions into exact solutions by using those eigenvalues of the associated Laplacian with the largest absolute values.

Related articles: Most relevant | Search more
arXiv:1410.3551 [math.PR] (Published 2014-10-14)
Exponential stability of the exact solutions and $θ$-EM approximations to neutral SDDEs with Markov switching
arXiv:1912.04854 [math.PR] (Published 2019-12-10)
Random spanning forests and hyperbolic symmetry
arXiv:1506.01370 [math.PR] (Published 2015-06-03)
Indistinguishability of components of random spanning forests