Related papers: Random permutations with logarithmic cycle weights

In this paper we compute the precise asymptotics of the variance of linear statistic of descents on a growing interval for Plancherel Young diagrams (following Vershik and Kerov, diagrams are considered rotated by $\pi/4$). We also give an…

We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…

Consider a random permutation of $\{1, \ldots, \lfloor n^{t_2}\rfloor\}$ drawn according to the Ewens measure with parameter $t_1$ and let $K(n, t)$ denote the number of its cycles, where $t\equiv (t_1, t_2)\in\mathbb [0, 1]^2$. Next,…

We present a novel approach to study the evolution of the size (i.e. the number of vertices) of the giant component of a random graph process. It is based on the exploration algorithm called simultaneous breadth-first walk, introduced by…

This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.

We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on $n$ integers. Under certain…

We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…

The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…

Convergence of order $O(1/\sqrt{n})$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The…

We obtain a Central Limit Theorem for the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size as the degree goes to infinity. A study of the asymptotic variance of the number of roots is…

A single permutation, seen as union of disjoint cycles, represents a regular graph of degree two. Consider $d$ many independent random permutations and superimpose their graph structures. It is a common model of a random regular (multi-)…

In this paper, we examine the asymptotic behavior of the longest increasing subsequence (LIS) in a uniformly random permutation of $n$ elements. We rely on the Robinson--Schensted--Knuth correspondence, Young tableaux, and key classical…

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…

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.

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 consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…

In this paper we prove a strong law of large numbers and its L^1-convergence counterpart for the process counted with a random characteristic in the context of self-similar fragmentation processes. This result extends a somewhat analogical…

We show a central limit theorem for random walk on a Galton-Watson tree, when the edges of the tree are assigned randomly uniformly elliptic conductances. When a positive fraction of edges is assigned a small conductance $\varepsilon$, we…

The normalised partial sums of values of a nonnegative multiplicative function over divisors with appropriately restricted sizes of a random permutation from the symmetric group define trajectories of a stochastic process. We prove a…

We study the joint distribution of the input sum and the output sum of a deterministic transducer. Here, the input of this finite-state machine is a uniformly distributed random sequence. We give a simple combinatorial characterization of…