Related papers: The permuton limit of random recursive separable p…

A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are `Brownian local minima' and `unordered infinite sample'. They are identically distributed. A framework for such concepts,…

We study a diffusion approximation for a model of stochastic motion of a particle in one spatial dimension. The velocity of the particle is constant but the direction of the motion undergoes random changes with a Poisson clock. Moreover,…

We prove a general version of the classical Perron-Frobenius convergence property for reducible matrices. We then apply this result to reducible substitutions and use it to produce limit frequencies for factors and hence invariant measures…

Fix an arbitrary compact orientable surface with a boundary and consider a uniform bipartite random quadrangulation of this surface with $n$ faces and boundary component lengths of order $\sqrt n$ or of lower order. Endow this…

We consider random walks perturbed at zero which behave like (possibly different) random walks with i.i.d. increments on each half lines and restarts at $0$ whenever they cross that point. We show that the perturbed random walk, after being…

Motivated by recent studies of large Mallows$(q)$ permutations, we propose a class of random permutations of $\mathbb{N}_{+}$ and of $\mathbb{Z}$, called regenerative permutations. Many previous results of the limiting Mallows$(q)$…

We study the number of occurrences of any fixed vincular permutation pattern. We show that this statistics on uniform random permutations is asymptotically normal and describe the speed of convergence. To prove this central limit theorem,…

We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…

In a uniform random permutation \Pi of [n] := {1,2,...,n}, the set of elements k in [n-1] such that \Pi(k+1) = \Pi(k) + 1 has the same distribution as the set of fixed points of \Pi that lie in [n-1]. We give three different proofs of this…

In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.

We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We…

We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…

Permutations of correlated sequences of random variables appear naturally in a variety of applications such as graph matching and asynchronous communications. In this paper, the asymptotic statistical behavior of such permuted sequences is…

We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…

We consider a (one-dimensional) branching Brownian motion process with a general offspring distribution having at least two moments, and in which all particles have a drift towards the origin where they are immediately absorbed. It is…

We consider a branching Brownian motion in $\mathbb{R}^d$. We prove that there exists a random subset $\Theta$ of $\mathbb{S}^{d-1}$ such that the limit of the derivative martingale exists simultaneously for all directions $\theta \in…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…

Non-Markovian processes can often be turned Markovian by enlarging the set of variables. Here we show, by an explicit construction, how this can be done for the dynamics of a Brownian particle obeying the generalized Langevin equation.…