Related papers: Long cycle of random permutations with polynomiall…
We study point process convergence for sequences of iid random walks. The objective is to derive asymptotic theory for the extremes of these random walks. We show convergence of the maximum random walk to the Gumbel distribution under the…
We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…
We establish some asymptotic expansions for infinite weighted convolutions of distributions having light subexponential tails. Examples are presented, some showing that in order to obtain an expansion with two significant terms, one needs…
The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…
In this paper we study the asymptotic behaviour of empirical processes when parameters are estimated, assuming that the underlying sequence of random variables is long-range dependent. We show completely different phenomena compared to…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
We studied the long-term dynamics of evolutionary Swarm Chemistry by extending the simulation length ten-fold compared to earlier work and by developing and using a new automated object harvesting method. Both macroscopic dynamics and…
In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate…
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…
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen at random with probability proportional to its weight. In the case where the total…
We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
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$…
A universal cycle for permutations of length $n$ is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length $n$, and containing all permutations of length $n$ as factors. It is well known…
We apply a common measure of randomness, the entropy, in the context of iterated functions on a finite set with n elements. For a permutation, it turns out that this entropy is asymptotically (for a growing number of iterations) close to…
We study the long-time behavior of decoupled continuous-time random walks characterized by superheavy-tailed distributions of waiting times and symmetric heavy-tailed distributions of jump lengths. Our main quantity of interest is the…
The longest stretch $L(n)$ of consecutive heads in $n$ i.i.d. coin tosses is seen from the prism of large deviations. We first establish precise asymptotics for the moment generating function of $L(n)$ and then show that there are precisely…
We consider the probability that a weighted sum of $n$ i.i.d. random variables $X_j$, $j = 1, . . ., n$, with stretched exponential tails is larger than its expectation and determine the rate of its decay, under suitable conditions on the…
For a stochastic difference equation $D_n=A_nD_{n-1}+B_n$ which stabilises upon time we study tail distribution asymptotics of $D_n$ under the assumption that the distribution of $\log(1+|A_1|+|B_1|)$ is heavy-tailed, that is, all its…
In this paper, we enumerate the pairs of permutations that are long cycles and whose product has a given cycle-type. Our main result is a simple relation concerning the desired numbers for a few related cycle-types. The relation refines a…