Parking on a Random Tree
From MaRDI portal
Publication:5219309
DOI10.1017/S0963548318000457zbMath1434.60043arXiv1610.08786OpenAlexW2963440438WikidataQ129044143 ScholiaQ129044143MaRDI QIDQ5219309
Christina Goldschmidt, Michał Przykucki
Publication date: 11 March 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.08786
Trees (05C05) Combinatorial probability (60C05) Phase transitions (general) in equilibrium statistical mechanics (82B26) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (21)
Stretched exponential decay for subcritical parking times on ⋮ Sharpness of the phase transition for parking on random trees ⋮ Parking on the infinite binary tree ⋮ Parking on the integers ⋮ The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses ⋮ Universality: random matrices, random geometry and SPDEs. Abstracts from the workshop held May 29 -- June 4, 2022 ⋮ The dual Derrida-Retaux conjecture ⋮ Unnamed Item ⋮ Parking on supercritical Galton-Watson trees ⋮ Parking on Cayley trees and frozen Erdős-Rényi ⋮ Particle density in diffusion-limited annihilating systems ⋮ Parking on a random rooted plane tree ⋮ A Max-Type Recursive Model: Some Properties and Open Questions ⋮ An exactly solvable continuous-time Derrida-Retaux model ⋮ Parking function varieties for combinatorial tree models ⋮ Runoff on rooted trees ⋮ The Derrida-Retaux conjecture on recursive models ⋮ Two-type annihilating systems on the complete and star graph ⋮ The sustainability probability for the critical Derrida-Retaux model ⋮ Diffusion-limited annihilating systems and the increasing convex order ⋮ Parking on transitive unimodular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parking functions for mappings
- A survey of max-type recursive distributional equations
- Subdiffusive behavior of random walk on a random cluster
- Parking functions and noncrossing partitions
- On the Lambert \(w\) function
- Recurrence of distributional limits of finite planar graphs
- Random walk on the incipient infinite cluster on trees
- SOME RESULTS FOR SKIP-FREE RANDOM WALK
- Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
- Building uniformly random subtrees
- Hyperplane arrangements, interval orders, and trees.
- An Occupancy Discipline and Applications
This page was built for publication: Parking on a Random Tree