IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v31y2018i4d10.1007_s10959-017-0771-3.html
   My bibliography  Save this article

Two Applications of Random Spanning Forests

Author

Listed:
  • L. Avena

    (University of Leiden)

  • A. Gaudillière

    (Aix Marseille University)

Abstract

We use random spanning forests to find, for any Markov process on a finite set of size n and any positive integer $$m \le n$$ m ≤ n , a probability law on the subsets of size m such that the mean hitting time of a random target that is drawn from this law does not depend on the starting point of the process. We use the same random forests to give probabilistic insights into the proof of an algebraic result due to Micchelli and Willoughby and used by Fill and by Miclo to study absorption times and convergence to equilibrium of reversible Markov chains. We also introduce a related coalescence and fragmentation process that leads to a number of open questions.

Suggested Citation

  • L. Avena & A. Gaudillière, 2018. "Two Applications of Random Spanning Forests," Journal of Theoretical Probability, Springer, vol. 31(4), pages 1975-2004, December.
    • Handle: RePEc:spr:jotpro:v:31:y:2018:i:4:d:10.1007_s10959-017-0771-3
    DOI: 10.1007/s10959-017-0771-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-017-0771-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10959-017-0771-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Anantharam, V. & Tsoucas, P., 1989. "A proof of the Markov chain tree theorem," Statistics & Probability Letters, Elsevier, vol. 8(2), pages 189-192, June.
    2. James Allen Fill, 2009. "On Hitting Times and Fastest Strong Stationary Times for Skip-Free and More General Chains," Journal of Theoretical Probability, Springer, vol. 22(3), pages 587-600, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yu Gong & Yong-Hua Mao & Chi Zhang, 2012. "Hitting Time Distributions for Denumerable Birth and Death Processes," Journal of Theoretical Probability, Springer, vol. 25(4), pages 950-980, December.
    2. James Allen Fill & Vince Lyzinski, 2014. "Hitting Times and Interlacing Eigenvalues: A Stochastic Approach Using Intertwinings," Journal of Theoretical Probability, Springer, vol. 27(3), pages 954-981, September.
    3. Laurent Miclo & Pierre Patie, 2021. "On interweaving relations," Post-Print hal-03159496, HAL.
    4. Dubey, Pradeep & Sahi, Siddhartha & Shubik, Martin, 2018. "Money as minimal complexity," Games and Economic Behavior, Elsevier, vol. 108(C), pages 432-451.
    5. Michael C. H. Choi & Lu-Jing Huang, 2020. "On Hitting Time, Mixing Time and Geometric Interpretations of Metropolis–Hastings Reversiblizations," Journal of Theoretical Probability, Springer, vol. 33(2), pages 1144-1163, June.
    6. Yong-Hua Mao & Feng Wang & Xian-Yuan Wu, 2015. "Large Deviation Behavior for the Longest Head Run in an IID Bernoulli Sequence," Journal of Theoretical Probability, Springer, vol. 28(1), pages 259-268, March.
    7. Miclo, Laurent & Arnaudon, Marc & Coulibaly-Pasquier, Koléhè, 2024. "On Markov intertwining relations and primal conditioning," TSE Working Papers 24-1509, Toulouse School of Economics (TSE).
    8. Candogan, Ozan & Ozdaglar, Asuman & Parrilo, Pablo A., 2013. "Dynamics in near-potential games," Games and Economic Behavior, Elsevier, vol. 82(C), pages 66-90.
    9. Choi, Michael C.H. & Huang, Zhipeng, 2023. "Generalized Markov chain tree theorem and Kemeny’s constant for a class of non-Markovian matrices," Statistics & Probability Letters, Elsevier, vol. 193(C).
    10. Persi Diaconis & Laurent Miclo, 2009. "On Times to Quasi-stationarity for Birth and Death Processes," Journal of Theoretical Probability, Springer, vol. 22(3), pages 558-586, September.
    11. Chen Jia, 2019. "Sharp Moderate Maximal Inequalities for Upward Skip-Free Markov Chains," Journal of Theoretical Probability, Springer, vol. 32(3), pages 1382-1398, September.
    12. James Allen Fill, 2009. "The Passage Time Distribution for a Birth-and-Death Chain: Strong Stationary Duality Gives a First Stochastic Proof," Journal of Theoretical Probability, Springer, vol. 22(3), pages 543-557, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jotpro:v:31:y:2018:i:4:d:10.1007_s10959-017-0771-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.