Context-free pairs of groups. II: Cuts, tree sets, and random walks
From MaRDI portal
Publication:658032
DOI10.1016/j.disc.2011.07.026zbMath1248.37044arXiv0911.0134OpenAlexW1968015827WikidataQ40386735 ScholiaQ40386735MaRDI QIDQ658032
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.0134
Discrete-time Markov processes on general state spaces (60J05) Formal languages and automata (68Q45) General theory of random and stochastic dynamical systems (37H05) Random walks on graphs (05C81)
Related Items
The language of self-avoiding walks ⋮ Formulae and Asymptotics for Coefficients of Algebraic Functions ⋮ Groups, graphs, languages, automata, games and second-order monadic logic ⋮ Context-free pairs of groups. I: Context-free pairs and graphs
Cites Work
- Context-free pairs of groups. I: Context-free pairs and graphs
- Groups, the theory of ends, and context-free languages
- The theory of ends, pushdown automata, and second-order logic
- Context-free languages and random walks on groups
- Singularities of the Green function of a random walk on a discrete group
- Finite range random walk on free groups and homogeneous trees
- Finitely generated groups with the M. Hall property
- Vertex-transitive graphs and accessibility
- Growth-sensitivity of context-free languages.
- Cutting up graphs
- Return probabilities for random walk on a half-line
- Non-negative matrices and Markov chains.
- Growth and ergodicity of context-free languages
- Random walks and periodic continued fractions
- Full Banach Mean Values on Countable groups.
- Random Trees
- Accessibility and Groups of Cohomological Dimension One
- Subgroups of Surface Groups are Almost Geometric
- Random Walks on Infinite Graphs and Groups - a Survey on Selected topics
- Random Walks on Infinite Graphs and Groups
- On the entropy of context-free languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Context-free pairs of groups. II: Cuts, tree sets, and random walks