Related papers: Limit distributions for cycles of random parking f…
We apply the random-matrix theory to the car-parking problem. For this purpose, we adopt a Coulomb gas model that associates the coordinates of the gas particles with the eigenvalues of a random matrix. The nature of interaction between the…
We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…
This paper proposes a totally asymmetric simple exclusion process on a traveling lane, which is equipped with a queueing system and functions of site assignments along the parking lane. In the proposed system, new particles arrive at the…
The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…
We investigate asymptotic behaviour of averaging operators for actions of simple rank-one Lie groups. It was previously known that these averaging operators converge almost everywhere, and we establish a more precise asymptotic formula that…
In this paper, we view parking functions viewed as labeled Dyck paths in order to study a notion of pattern avoidance first introduced by Remmel and Qiu. In particular we enumerate the parking functions avoiding any set of two or more…
Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…
We address the problem of giving robust performance bounds based on the study of the asymptotic behavior of the insensitive load balancing schemes when the number of servers and the load scales jointly. These schemes have the desirable…
In a parking function, a car is considered lucky if it is able to park in its preferred spot. Extending work of Harris and Martinez, we enumerate outcomes of parking functions with a fixed set of lucky cars. We then consider a…
Given a countably infinite group $G$ acting on some space $X$, an increasing family of finite subsets $G_n$ and $x\in X$, a natural question to ask is what asymptotical distribution the sets $G_nx$ form. More formally, we define for a…
Classical parking functions are a generalization of permutations that appear in many combinatorial structures. Prime parking functions are indecomposable components such that any classical parking function can be uniquely described as a…
This paper investigates the asymptotic behavior of Green functions associated to partially homogeneous random walks in the quadrant $Z_+^2$. There are four possible distributions for the jumps of these processes, depending on the location…
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking…
We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and number of comparisons used by the randomized quick sort…
We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…
In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…
We consider sequences of needlet random fields defined as weighted averaged forms of spherical Gaussian eigenfunctions. Our main result is a Central Limit Theorem in the high energy setting, for the boundary lengths of their excursion sets.…
We count cycles of an unbounded length in generalized Johnson graphs. Asymptotics of the number of such cycles is obtained for certain growth rates of the cycle length.
In a recent study of large non-null sample covariance matrices, a new sequence of functions generalizing the GUE Tracy-Widom distribution of random matrix theory was obtained. This paper derives Painlev\'e formulas of these functions and…
We extend the Matom\"{a}ki-Radziwi\l\l{} theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a…