Combinatiorial Markov chains
From MaRDI portal
Publication:2442664
Recommendations
Cites work
- BOUNDARY THEORY OF MARKOV PROCESSES (THE DISCRETE CASE)
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Denumerable Markov chains. Generating functions, boundary theory, random walks on trees.
- Die unzerlegbaren, positiv-definiten Klassenfunktionen der abzählbar unendlichen, symmetrischen Gruppe
- scientific article; zbMATH DE number 3164979 (Why is no real title available?)
- scientific article; zbMATH DE number 3875656 (Why is no real title available?)
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 1064788 (Why is no real title available?)
- scientific article; zbMATH DE number 1957500 (Why is no real title available?)
- Markov chains: theoretical foundations, examples and simulations with MAPLE
- Random binary trees: from the average case analysis to the asymptotics of distributions
- Random Walks on Infinite Graphs and Groups
- Search trees: metric aspects and strong limit theorems
- The Martin boundary for Polya's urn scheme, and an application to stochastic population growth
- The Representation of Partition Structures
- Trickle-down processes and their boundaries
Cited in
(5)
This page was built for publication: Combinatiorial Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442664)