Parking on supercritical Galton-Watson trees
From MaRDI portal
(Redirected from Publication:5026459)
Abstract: At each site of a supercritical Galton-Watson tree place a parking spot which can accommodate one car. Initially, an independent and identically distributed number of cars arrive at each vertex. Cars proceed towards the root in discrete time and park in the first available spot they come to. Let be the total number of cars that arrive to the root. Goldschmidt and Przykucki proved that undergoes a phase transition from being finite to infinite almost surely as the mean number of cars arriving to each vertex increases. We show that is finite at the critical threshold, describe its growth rate above criticality, and prove that it increases as the initial car arrival distribution becomes less concentrated. For the canonical case that either 0 or 2 cars arrive at each vertex of a -ary tree, we give improved bounds on the critical threshold and show that is discontinuous.
Recommendations
Cites work
- A family of bijections between \(G\)-parking functions and spanning trees
- A polytope related to empirical distributions, plane trees, parking functions, and the associahedron
- A survey of max-type recursive distributional equations
- An exactly solvable continuous-time Derrida-Retaux model
- An Occupancy Discipline and Applications
- Asymptotic behavior of densities for two-particle annihilating random walks
- Catalan numbers, their generalization, and their uses
- scientific article; zbMATH DE number 1182849 (Why is no real title available?)
- Introduction to algorithms
- Non-equilibrium phase transitions: activated random walks at criticality
- Non-intersection of transient branching random walks
- Parking functions and noncrossing partitions
- Parking functions for mappings
- Parking on a random rooted plane tree
- Parking on a random tree
- Parking on transitive unimodular graphs
- Probabilizing parking functions
- Recurrence and density decay for diffusion-limited annihilating systems
- Renormalization group study of the A+B diffusion-limited reaction.
- Runoff on rooted trees
- Sensitivity of the frog model to initial conditions
- Sharpness, restart, and acceleration
- Stochastic orders
- Stochastic orders and the frog model
- Stretched exponential decay for subcritical parking times on
- Strict inequalities for the time constant in first passage percolation.
- Study of the iterations of a mapping associated to a spin glass model
- The free energy in the Derrida-Retaux recursive model
Cited in
(14)- Diffusion-limited annihilating systems and the increasing convex order
- Parking on a random rooted plane tree
- Brussels sprouts, noncrossing trees, and parking functions
- Parking on a random tree
- scientific article; zbMATH DE number 7643620 (Why is no real title available?)
- Stretched exponential decay for subcritical parking times on
- Sharpness of the phase transition for parking on random trees
- Parking on the infinite binary tree
- Non-universality in clustered ballistic annihilation
- 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
- Parking on Cayley trees and frozen Erdős-Rényi
- Parking on supercritical geometric Bienaymé-Galton-Watson trees
- Multilayer parking with screening on a random tree
This page was built for publication: Parking on supercritical Galton-Watson trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5026459)
