相关论文: A product of invariant random permutations has the…

We analyse q-functional equations arising from tree-like combinatorial structures, which are counted by size, internal path length, and certain generalisations thereof. The corresponding counting parameters are labelled by a positive…

The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

We show that almost all permutations have some power that is a cycle of prime length. The proof includes a theorem giving a strong upper bound on the proportion of elements of the symmetric group having no cycles with length in a given set.

We consider the situation when a learner faces a set of unknown discrete distributions $(p_k)_{k\in \mathcal K}$ defined over a common alphabet $\mathcal X$, and can build for each distribution $p_k$ an individual high-probability…

This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…

Feller (1945) provided a coupling between the counts of cycles of various sizes in a uniform random permutation of $[n]$ and the spacings between successes in a sequence of $n$ independent Bernoulli trials with success probability $1/n$ at…

Conformation-dependent design of polymer sequences can be considered as a tool to control macromolecular self-assembly. We consider the monomer unit sequences created via the modification of polymers in a homogeneous melt in accordance with…

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 investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…

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 self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…

Let the random variable $Z_{n,k}$ denote the number of increasing subsequences of length $k$ in a random permutation from $S_n$, the symmetric group of permutations of $\{1,...,n\}$. We show that $Var(Z_{n,k_n})=o((EZ_{n,k_n})^2)$ as $…

A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…

In this paper, we consider cyclic permutations that avoid the monotone decreasing permutation $k(k-1)\ldots 21$, whose cycle also demonstrates some pattern avoidance. If the cycle is written in standard form with 1 appearing at the…

The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…

Let $\mathcal{S}_n$ be the permutation group on $n$ elements, and consider a random walk on $\mathcal{S}_n$ whose step distribution is uniform on $k$-cycles. We prove a well-known conjecture that the mixing time of this process is…

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 prove the universality of the large deviations for conjugacy invariant permutations with few cycles. As an application, we establish the universality of large deviation at speeds $n$ and $\sqrt{n}$ for the length of monotone subsequences…

We study a model of spatial random permutations over a discrete set of points. Formally, a permutation $\sigma$ is sampled proportionally to the weight $\exp\{-\alpha \sum_x V(\sigma(x)-x)\},$ where $\alpha>0$ is the temperature and $V$ is…