Hipster random walks
From MaRDI portal
Abstract: We introduce and study a family of random processes on trees we call hipster random walks, special instances of which we heuristically connect to the min-plus binary trees introduced by Robin Pemantle and studied by Auffinger and Cable (2017; arXiv:1709.07849), and to the critical random hierarchical lattice studied by Hambly and Jordan (2004). We prove distributional convergence for the processes by showing that their evolutions can be understood as a discrete analogues of certain convection-diffusion equations, then using a combination of coupling arguments and results from the numerical analysis literature on convergence of numerical approximations of PDEs.
Recommendations
Cites work
- A random hierarchical lattice: the series-parallel graph and its properties
- Generalized solutions of degenerate second-order quasilinear parabolic and elliptic equations
- scientific article; zbMATH DE number 3422898 (Why is no real title available?)
- scientific article; zbMATH DE number 5058450 (Why is no real title available?)
- scientific article; zbMATH DE number 3320665 (Why is no real title available?)
- Monotone Difference Approximations Of BV Solutions To Degenerate Convection-Diffusion Equations
- Numerical approximation of hyperbolic systems of conservation laws
- On finite-difference approximations and entropy conditions for shocks
- THE SPACES BV AND QUASILINEAR EQUATIONS
Cited in
(5)- The hipster effect: when anti-conformists all look the same
- Asymmetric cooperative motion in one dimension
- Symmetric cooperative motion in one dimension
- The distance on the slightly supercritical random series-parallel graph
- Finite-depth scaling and an exact Bernoulli-leaf identity for the min-plus process on the binary tree
This page was built for publication: Hipster random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200502)