Small value probabilities via the branching tree heuristic

Peter Morters; Marcel Ortgiese

Home/Archive/arXiv

arXiv · 0710.3493

Small value probabilities via the branching tree heuristic

Peter Morters·Marcel Ortgiese

View original source ↗Read source document ↗Export metadata ↓

Abstract

In the first part of this paper we give easy and intuitive proofs for the small value probabilities of the martingale limit of a supercritical Galton-Watson process in both the Schröder and the Böttcher case. These results are well-known, but the most cited proofs rely on generating function arguments which are hard to transfer to other settings. In the second part we show that the strategy underlying our proofs can be used in the quite different context of self-intersections of stochastic processes. Solving a problem posed by Wenbo Li, we find the small value probabilities for intersection local times of several Brownian motions, as well as for self-intersection local times of a single Brownian motion.

Explore related subjects

math.PR

Keep this discovery

BibTeX RIS

Peter Morters, Marcel Ortgiese. 2007-10-18. Small value probabilities via the branching tree heuristic. https://arxiv.org/abs/0710.3493

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR↗

arXiv2026

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR↗

arXiv2026

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR↗