English
Related papers

Related papers: On martingale tail sums for the path length in ran…

200 papers

In his, by now, classical work from 1981, Nerman made extensive use of a crucial martingale $(W_t)_{t \geq 0}$ to prove convergence in probability, in mean and almost surely, of supercritical general branching processes (a.k.a.…

Probability · Mathematics 2021-07-02 Alexander Iksanov , Konrad Kolesko , Matthias Meiners

We establish the large deviation probabilities for the height of random recursive trees, revealing polynomial upper-tail decay and stretched-exponential lower-tail decay. Remarkably, the lower tail features an atypical prefactor that grows…

Probability · Mathematics 2026-04-23 Xinxin Chen , Heng Ma

Programs with randomization constructs is an active research topic, especially after the recent introduction of martingale-based analysis methods for their termination and runtimes. Unlike most of the existing works that focus on proving…

Logic in Computer Science · Computer Science 2019-02-18 Satoshi Kura , Natsuki Urabe , Ichiro Hasuo

We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999) 409-432]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion…

Probability · Mathematics 2012-11-05 Nicolas Broutin , Cecilia Holmgren

We generalize a famous tail Doob's inequality, relative two non-negative random variables, arising in the martingale theory, in two directions: on the more general source data and on the random variables belonging to the so-called Grand…

Probability · Mathematics 2022-06-03 M. R. Formica , E. Ostrovsky , L. Sirota

Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…

Databases · Computer Science 2010-08-31 Everardo Barcenas , Pierre Geneves , Nabil Layaida , Alan Schmitt

In this paper, we give rates of convergence, for minimal distances and for the uniform distance, between the law of partial sums of martingale differences and thelimiting Gaussian distribution. More precisely, denoting by $P_{X}$ the law of…

Probability · Mathematics 2021-01-19 Jérôme Dedecker , Florence Merlevède , Emmanuel Rio

In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…

Probability · Mathematics 2011-09-02 Gabriel Faraud

There has been recent interest in the conditional central limit question for (strictly) stationary, ergodic processes $...,X_{-1},X_0,X_1,...$ whose partial sums $S_n=X_1+...+X_n$ are of the form $S_n=M_n+R_n$, where $M_n$ is a square…

Probability · Mathematics 2008-01-03 Ou Zhao , Michael Woodroofe

A law of the iterated logarithm is established for the last passage times of directed percolation on rectangles in the plane over exponential or geometric independent random variables, rescaled to converge to the Tracy-Widom distribution.…

Probability · Mathematics 2016-10-07 Michel Ledoux

We prove a central limit theorem for stationary multiple (random) fields of martingale differences $f\circ T_{\underline{i}}$, $\underline{i}\in \Bbb Z^d$, where $T_{\underline{i}}$ is a $\Bbb Z^d$ action. In most cases the multiple…

Probability · Mathematics 2018-03-28 Dalibor Volny

The tail of the distribution of a sum of a random number of independent and identically distributed nonnegative random variables depends on the tails of the number of terms and of the terms themselves. This situation is of interest in the…

Probability · Mathematics 2008-12-10 Christian Y. Robert , Johan Segers

We consider a sequence of Markov chains $(\mathcal X^n)_{n=1,2,...}$ with $\mathcal X^n = (X^n_\sigma)_{\sigma\in\mathcal T}$, indexed by the full binary tree $\mathcal T = \mathcal T_0 \cup \mathcal T_1 \cup ...$, where $\mathcal T_k$ is…

Probability · Mathematics 2014-06-17 Peter Czuppon , Peter Pfaffelhuber

Infinite sums of i.i.d. random variables discounted by a multiplicative random walk are called perpetuities and have been studied by many authors. The present paper provides a log-type moment result for such random variables under minimal…

Probability · Mathematics 2008-04-08 Gerold Alsmeyer , Alexander Iksanov

For a sequence of random variables $(X_1, X_2, \ldots, X_n)$, $n \geq 1$, that are independent and identically distributed with a regularly varying tail with index $-\alpha$, $\alpha \geq 0$, we show that the contribution of the maximum…

Probability · Mathematics 2018-01-31 Van Minh Nguyen

This work is devoted to P\'olya-Young urns, a class of periodic P\'olya urns of importance in the analysis of Young tableaux. We provide several extension of the previous results of Banderier, Marchal and Wallner [Ann. Prob. (2020)] on…

Probability · Mathematics 2024-06-28 Markus Kuba

Biggins [Uniform convergence of martingales in the branching random walk. {\em Ann. Probab.}, 20(1):137--151, 1992] proved local uniform convergence of additive martingales in $d$-dimensional supercritical branching random walks at complex…

Probability · Mathematics 2016-11-17 Konrad Kolesko , Matthias Meiners

The sums and maxima of non-stationary random length sequences of regularly varying random variables may have the same tail and extremal indices, Markovich and Rodionov (2020). The main constraint is that there exists a unique series in a…

Probability · Mathematics 2021-10-11 Natalia Markovich

We consider a directed random walk on the backbone of the infinite cluster generated by supercritical oriented percolation, or equivalently the space-time embedding of the ``ancestral lineage'' of an individual in the stationary…

Probability · Mathematics 2013-06-18 Matthias Birkner , Jiri Cerny , Andrej Depperschmidt , Nina Gantert

An infinite convergent sum of independent and identically distributed random variables discounted by a multiplicative random walk is called perpetuity, because of a possible actuarial application. We give three disjoint groups of sufficient…

Probability · Mathematics 2021-07-01 Dariusz Buraczewski , Piotr Dyszewski , Alexander Iksanov , Alexander Marynych