Related papers: On the Cycle Structure of Mallows Permutations

We study the rate of convergence of the Markov chain on $S_n$ which starts with a random $(n-k)$-cycle for a fixed $k \geq 1$, followed by random transpositions. The convergence to the stationary distribution turns out to be of order $n$.…

We study the size and the external path length of random tries and show that they are asymptotically independent in the asymmetric case but strongly dependent with small periodic fluctuations in the symmetric case. Such an unexpected…

Power-law distributions are typical macroscopic features occurring in almost all complex systems observable in nature. As a result, researchers in quantitative analyses must often generate random synthetic variates obeying power-law…

A sequence $\pi_1,\pi_2,\dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $\sigma$ in $\pi_n$ converges to $1/|\sigma|!$ as $n\to\infty$. We prove that $\pi_1,\pi_2,\dots$ is quasirandom if and…

The two-parameter Poisson--Dirichlet distribution is a probability distribution on the totality of positive decreasing sequences with sum 1 and hence considered to govern masses of a random discrete distribution. A characterization of the…

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…

We explore the asymptotic distributions of sequences of integer-valued additive functions defined on the symmetric group endowed with the Ewens probability measure as the order of the group increases. Applying the method of factorial…

We consider random permutation matrices following a one-parameter family of deformations of the uniform distribution, called Ewens' measures, and modifications of these matrices where the entries equal to one are replaced by i.i.d uniform…

We show the convergence of the characteristic polynomial for random permutation matrices sampled from the generalized Ewens distribution. Under this distribution, the measure of a given permutation depends only on its cycle structure,…

We prove an interesting fact describing the location of the roots of the generating polynomials of the numbers of derangements of length $n$, counted by their number of cycles. We then use this result to prove that if $k$ is the number of…

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…

Consider the family of power divergence statistics based on $n$ trials, each leading to one of $r$ possible outcomes. This includes the log-likelihood ratio and Pearson's statistic as important special cases. It is known that in certain…

Let $\mathcal{T}_n$ be the set of all mappings $T:\{1,2,\ldots,n\}\to\{1,2,\ldots,n\}$. The corresponding graph of $T$ is a union of disjoint connected unicyclic components. We assume that each $T\in\mathcal{T}_n$ is chosen uniformly at…

The problem of a diffusing particle moving among diffusing traps is analyzed in general space dimension d. We consider the case where the traps are initially randomly distributed in space, with uniform density rho, and derive upper and…

We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…

We study the model of random permutations of $n$ objects with polynomially growing cycle weights, which was recently considered by Ercolani and Ueltschi, among others. Using saddle-point analysis, we prove that the total variation distance…

We describe an approach that allows us to deduce the limiting return times distribution for arbitrary sets to be compound Poisson distributed. We establish a relation between the limiting return times distribution and the probability of the…

We consider the inclusion process on the complete graph with vanishing diffusivity, which leads to condensation of particles in the thermodynamic limit. Describing particle configurations in terms of size-biased and appropriately scaled…

We initiate the study of the cycle structure of uniformly random parking functions. Using the combinatorics of parking completions, we compute the asymptotic expected value of the number of cycles of any fixed length. We obtain an upper…

We study decomposable combinatorial labeled structures in the exp-log class, specifically, two examples of type a=1 and two examples of type a=1/2. Our approach is to establish how well existing theory matches experimental data. For…