Poisson-Dirichlet branching random walks

@article{AddarioBerry2013PoissonDirichletBR,
  title={Poisson-Dirichlet branching random walks},
  author={L. Addario-Berry and K. Ford},
  journal={Annals of Applied Probability},
  year={2013},
  volume={23},
  pages={283-307}
}
  • L. Addario-Berry, K. Ford
  • Published 2013
  • Mathematics
  • Annals of Applied Probability
  • We determine, to within O(1), the expected minimal position at level n in certain branching random walks. The walks under consideration have displacement vector (v_1,v_2,...), where each v_j is the sum of j independent Exponential(1) random variables and the different v_i need not be independent. In particular, our analysis applies to the Poisson-Dirichlet branching random walk and to the Poisson-weighted infinite tree. As a corollary, we also determine the expected height of a random recursive… CONTINUE READING
    12 Citations

    Figures from this paper

    Convergence of directed random graphs to the Poisson-weighted infinite tree
    • 4
    • PDF
    Correction terms for the height of weighted recursive trees
    • PDF
    Asymptotic Analysis of Hoppe Trees
    • 3
    • Highly Influenced
    • PDF
    Invasion Percolation on Galton-Watson Trees
    • 1
    • PDF
    Quenched Survival of Bernoulli Percolation on Galton-Watson Trees
    • 3
    • PDF
    Continuum Cascade Model: Branching Random Walk for Traveling Wave
    • 1
    • PDF
    On Directed Random Graphs and Greedy Walks on Point Processes
    • 1
    • Highly Influenced
    • PDF
    Percolation On Galton-Watson Trees
    • PDF

    References

    SHOWING 1-10 OF 31 REFERENCES
    Minima in branching random walks
    • 119
    • PDF
    Weak convergence for the minimal position in a branching random walk: A simple proof
    • 39
    • PDF
    Branching processes in the analysis of the heights of trees
    • L. Devroye
    • Mathematics, Computer Science
    • Acta Informatica
    • 2004
    • 101
    • PDF
    Note on the Heights of Random Recursive Trees and Random m-ary Search Trees
    • B. Pittel
    • Mathematics, Computer Science
    • Random Struct. Algorithms
    • 1994
    • 163
    • Highly Influential
    TIGHTNESS FOR A FAMILY OF RECURSION EQUATIONS
    • 60
    • PDF
    Combinatorial Stochastic Processes
    • 1,171
    • PDF