Tightness for a family of recursion equations

From MaRDI portal
Publication:1019091

DOI10.1214/08-AOP414zbMath1169.60020arXivmath/0612382MaRDI QIDQ1019091

Ofer Zeitouni, Maury Bramson

Publication date: 27 May 2009

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0612382




Related Items (29)

The extremal process of critical points of the pure \(p\)-spin spherical spin Glass modelTightness for Maxima of Generalized Branching Random WalksLongest Path Distance in Random CircuitsStationary random metrics on hierarchical graphs via \((\min,+)\)-type recursive distributional equationsExtreme local extrema of two-dimensional discrete Gaussian free fieldConvergence of directed random graphs to the Poisson-weighted infinite treeOn explosions in heavy-tailed branching random walksConvergence in law of the minimum of a branching random walkQuenched invariance principles for the maximal particle in branching random walk in random environment and the parabolic Anderson modelA sharp estimate for cover times on binary treesPoisson-Dirichlet branching random walksAsymptotics of cover times via Gaussian free fields: bounded-degree graphs and general treesExact asymptotics of the freezing transition of a logarithmically correlated random energy modelA scaling limit for the cover time of the binary treeThe almost sure limits of the minimal position and the additive martingale in a branching random walkMaximum of the characteristic polynomial of random unitary matricesExtremes of local times for simple random walks on symmetric treesConvergence in law for the branching random walk seen from its tipOn the maximal displacement of subcritical branching random walksSlowdown for time inhomogeneous branching Brownian motionCyclic behavior of maxima in a hierarchical summation schemeMinima in branching random walksOn the maximal displacement of near-critical branching random walksLimit law for the cover time of a random walk on a binary treeMinimal position and critical martingale convergence in branching random walks, and directed polymers on disordered treesCutoff for the East processRight-most position of a last progeny modified time inhomogeneous branching random walkUnnamed ItemOn the maximal displacement of critical branching random walk



Cites Work


This page was built for publication: Tightness for a family of recursion equations