90 research outputs found
Sieving random iterative function systems
It is known that backward iterations of independent copies of a contractive
random Lipschitz function converge almost surely under mild assumptions. By a
sieving (or thinning) procedure based on adding to the functions time and space
components, it is possible to construct a scale invariant stochastic process.
We study its distribution and paths properties. In particular, we show that it
is c\`adl\`ag and has finite total variation. We also provide examples and
analyse various properties of particular sieved iterative function systems
including perpetuities and infinite Bernoulli convolutions, iterations of
maximum, and random continued fractions.Comment: 36 pages, 2 figures; accepted for publication in Bernoull
Local universality for real roots of random trigonometric polynomials
Consider a random trigonometric polynomial of
the form where are independent
identically distributed bivariate real random vectors with zero mean and unit
covariance matrix. Let be any sequence of real numbers.
We prove that as , the number of real zeros of in the
interval converges in distribution to the number of zeros
in the interval of a stationary, zero-mean Gaussian process with
correlation function . We also establish similar local universality
results for the centered random vectors having an arbitrary
covariance matrix or belonging to the domain of attraction of a two-dimensional
-stable law.Comment: 20 pages, extended version. New results (including the stable case)
were adde
- …