Related papers: Short cycles of random permutations with cycle wei…

We investigate continuum percolation for Cox point processes, that is, Poisson point processes driven by random intensity measures. First, we derive sufficient conditions for the existence of non-trivial sub- and super-critical percolation…

We study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichm\"uller theory approach. We establish that, as the genus tends to infinity, the length spectrum converges to a…

We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…

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 use point processes theory to describe the asymptotic distribution of all upper order statistics for observations collected at renewal times. As a corollary, we obtain limiting theorems for corresponding extremal processes.

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

Using the recently developed notion of permutation limits this paper derives the limiting distribution of the number of fixed points and cycle structure for any convergent sequence of random permutations, under mild regularity conditions.…

Particles labelled $1,...,n$ are initially arranged in increasing order. Subsequently, each pair of neighboring particles that is currently in increasing order swaps according to a Poisson process of rate 1. We analyze the asymptotic…

We consider the random evolution described by the motion of a particle moving on a circle alternating the angular velocities $ \pm c $ and changing rotation at Poisson random times, resulting in a telegraph process over the circle. We study…

It is well known that random walks in one dimensional random environment can exhibit subdiffusive behavior due to presence of traps. In this paper we show that the passage times of different traps are asymptotically independent exponential…

We investigate the asymptotic behavior, in the long time limit, of the random homology associated to realizations of stochastic diffusion processes on a compact Riemannian manifold. In particular a rigidity result is established: if the…

Classical two-sample permutation tests for equality of distributions have exact size in finite samples, but they fail to control size for testing equality of parameters that summarize each distribution. This paper proposes permutation tests…

A statistical model of discrete finite length random processes with negative power law spectral densities is presented. The definition of terms is followed by a description of the spectral density trend. An algorithmic construction of…

Point processes model the distribution of random point sets in mathematical spaces, such as spatial and temporal domains, with applications in fields like seismology, neuroscience, and economics. Existing statistical and machine learning…

We introduce the mathematical theory of the particle systems that interact via permutations, where the transition rates are assigned not to the jumps from a site to a site, but to the permutations themselves. This permutation processes can…

In this paper, we consider semi-Markov processes whose transition times and transition probabilities depend on a small parameter $\varepsilon$. Understanding the asymptotic behavior of such processes is needed in order to study the…

Consider the following partial "sorting algorithm" on permutations: take the first entry of the permutation in one-line notation and insert it into the position of its own value. Continue until the first entry is 1. This process imposes a…

We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph's spectral properties. We broaden the asymptotic regime in which the cycle counts are known to be approximately Poisson, and we…