Arcsine laws for random walks generated from random permutations with applications to genomics

A classical result for the simple symmetric random walk with 2n steps is that the number of steps above the origin, the time of the last visit to the origin, and the time of the maximum height all have exactly the same distribution and converge when scaled to the arcsine law. Motivated by applications in genomics, we study the distributions of these statistics for the non-Markovian random walk generated from the ascents and descents of a uniform random permutation and a Mallows(q) permutation and show that they have the same asymptotic distributions as for the simple random walk. We also give an unexpected conjecture, along with numerical evidence and a partial proof in special cases, for the result that the number of steps above the origin by step 2n for the uniform permutation generated walk has exactly the same discrete arcsine distribution as for the simple random walk, even though the other statistics for these walks have very different laws. We also give explicit error bounds to the limit theorems using Stein’s method for the arcsine distribution, as well as functional central limit theorems and a strong embedding of the Mallows(q) permutation which is of independent interest.

Sensitivity of mean-field fluctuations in Erlang loss models with randomized routing

In this paper we study a large system of N servers, each with capacity to process at most C simultaneous jobs; an incoming job is routed to a server if it has the lowest occupancy amongst d (out of N) randomly selected servers. A job that is routed to a server with no vacancy is assumed to be blocked and lost. Such randomized policies are referred to JSQ(d) (Join the Shortest Queue out of d) policies. Under the assumption that jobs arrive according to a Poisson process with rate $N\lambda^{(N)}$ where $\lambda^{(N)}=\sigma-\frac{\beta}{\sqrt{N}\,}$ , $\sigma\in\mathbb{R}_+$ and $\beta\in\mathbb{R}$ , we establish functional central limit theorems for the fluctuation process in both the transient and stationary regimes when service time distributions are exponential. In particular, we show that the limit is an Ornstein–Uhlenbeck process whose mean and variance depend on the mean field of the considered model. Using this, we obtain approximations to the blocking probabilities for large N, where we can precisely estimate the accuracy of first-order approximations.

Functional Central Limit Theorems for Occupancies and Missing Mass Process in Infinite Urn Models

We study the infinite urn scheme when the balls are sequentially distributed over an infinite number of urns labeled 1,2,... so that the urn j at every draw gets a ball with probability $$p_j$$ p j , where $$\sum _j p_j=1$$ ∑ j p j = 1 . We prove functional central limit theorems for discrete time and the Poissonized version for the urn occupancies process, for the odd occupancy and for the missing mass processes extending the known non-functional central limit theorems.

Multivariate General Compound Point Processes in Limit Order Books

In this paper, we focus on a new generalization of multivariate general compound Hawkes process (MGCHP), which we referred to as the multivariate general compound point process (MGCPP). Namely, we applied a multivariate point process to model the order flow instead of the Hawkes process. The law of large numbers (LLN) and two functional central limit theorems (FCLTs) for the MGCPP were proved in this work. Applications of the MGCPP in the limit order market were also considered. We provided numerical simulations and comparisons for the MGCPP and MGCHP by applying Google, Apple, Microsoft, Amazon, and Intel trading data.

Functional central limit theorems and moderate deviations for Poisson cluster processes

In this paper, we consider functional limit theorems for Poisson cluster processes. We first present a maximal inequality for Poisson cluster processes. Then we establish a functional central limit theorem under the second moment and a functional moderate deviation principle under the Cramér condition for Poisson cluster processes. We apply these results to obtain a functional moderate deviation principle for linear Hawkes processes.

On the Zeros of Non-Analytic Random Periodic Signals

In this paper, we investigate the local universality of the number of zeros of a random periodic signal of the form $S_n(t)=\sum _{k=1}^n a_k f(k t)$, where $f$ is a $2\pi -$periodic function satisfying weak regularity conditions and where the coefficients $a_k$ are i.i.d. random variables, which are centered with unit variance. In particular, our results hold for continuous piecewise linear functions. We prove that the number of zeros of $S_n(t)$ in a shrinking interval of size $1/n$ converges in law as $n$ goes to infinity to the number of zeros of a Gaussian process whose explicit covariance only depends on the function $f$ and not on the common law of the random coefficients $(a_k)$. As a byproduct, this entails that the point measure of the zeros of $S_n(t)$ converges in law to an explicit limit on the space of locally finite point measures on $\mathbb R$ endowed with the vague topology. The standard tools involving the regularity or even the analyticity of $f$ to establish such kind of universality results are here replaced by some high-dimensional Berry–Esseen bounds recently obtained in [ 7]. The latter allow us to prove functional Central Limit Theorems in $C^1$ or Lipschitz topology in situations where usual criteria cannot be applied due to the lack of regularity.