SearcharxivSearch

arXiv · 2608.09419

Left-tail expansions for Schr\"oder branching processes with explicit convergence rates

Abstract

In previous work, the density of the martingale limit in Schr\"oder branching processes was expressed as a convergent double power-law series with oscillatory terms. The proof relied on two assumptions, one of which imposed a geometric restriction on the critical angle of the Julia set of the offspring generating function near $1$. In this paper, we show that both assumptions can be removed. We derive explicit bounds on the expansion coefficients, which imply locally uniform convergence of the double series. The coefficients decay exponentially in one summation index, with the rate explicitly determined by the critical angle, and super-exponentially in the other. Finally, we investigate the behavior of the critical angle and describe regimes in which it approaches its minimum. This analysis shows how the geometry of the Julia set influences the magnitude of the oscillatory corrections in the left-tail expansion.

Explore related subjects

Keep this discovery

BibTeXRIS

Anton A. Kutsenko. 2026-08-10. Left-tail expansions for Schr\"oder branching processes with explicit convergence rates. https://arxiv.org/abs/2608.09419

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

KEEP EXPLORING

Related papers

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

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

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