SearcharxivSearch

arXiv · 1505.06428

Random Dirichlet series arising from records

Abstract

We study the distributions of the random Dirichlet series with parameters $(s, \beta)$ defined by $$ S=\sum_{n=1}^{\infty}\frac{I_n}{n^s}, $$ where $(I_n)$ is a sequence of independent Bernoulli random variables, $I_n$ taking value $1$ with probability $1/n^\beta$ and value $0$ otherwise. Random series of this type are motivated by the record indicator sequences which have been studied in extreme value theory in statistics. We show that when $s>0$ and $0< \beta \le 1$ with $s+\beta>1$ the distribution of $S$ has a density; otherwise it is purely atomic or not defined because of divergence. In particular, in the case when $s>0$ and $\beta=1$, we prove that for every $0 1$ it is unbounded. In the case when $s>0$ and $0<\beta<1$ with $s+\beta>1$, the density is smooth. To show the absolute continuity, we obtain estimates of the Fourier transforms, employing van der Corput's method to deal with number-theoretic problems. We also give further regularity results of the densities, and present an example of non atomic singular distribution which is induced by the series restricted to the primes.

Explore related subjects

Keep this discovery

BibTeXRIS

Ron Peled, Yuval Peres, Jim Pitman, Ryokichi Tanaka. 2015-05-24. Random Dirichlet series arising from records. https://arxiv.org/abs/1505.06428

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