A stationary planar random graph with singular stationary dual: dyadic lattice graphs
From MaRDI portal
Publication:2174666
Abstract: Dyadic lattice graphs and their duals are commonly used as discrete approximations to the hyperbolic plane. We use them to give examples of random rooted graphs that are stationary for simple random walk, but whose duals have only a singular stationary measure. This answers a question of Curien and shows behaviour different from the unimodular case. The consequence is that planar duality does not combine well with stationary random graphs. We also study harmonic measure on dyadic lattice graphs and show its singularity.
Recommendations
Cites work
- scientific article; zbMATH DE number 420915 (Why is no real title available?)
- scientific article; zbMATH DE number 3515486 (Why is no real title available?)
- scientific article; zbMATH DE number 1149837 (Why is no real title available?)
- scientific article; zbMATH DE number 1834589 (Why is no real title available?)
- scientific article; zbMATH DE number 3227613 (Why is no real title available?)
- An analogue of the Descartes-Euler formula for infinite graphs and Higuchi’s conjecture
- Ergodic theory on stationary random graphs
- Group-invariant percolation on graphs
- Hyperbolic and parabolic unimodular random maps
- Nonuniqueness in \(g\)-functions
- On an estimate of Cranston and McConnell for elliptic diffusions in uniform domains
- Principe variationnel et syst�mes dynamiques symboliques
- Probability on trees and networks
- Second errata to: ``Processes on unimodular random networks
- Strongly mixing g-measures
- Uniqueness ing-measures
This page was built for publication: A stationary planar random graph with singular stationary dual: dyadic lattice graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174666)