Related papers: Cycle structure of the interchange process and rep…
Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random…
Understanding the periodic and structural properties of permutation maps over residue rings such as $\mathbb{Z}_{p^k}$ is a foundational challenge in algebraic dynamics and pseudorandom sequence analysis. Despite notable progress in…
We derive a formula for the entries in the change-of-basis matrix between Young's seminormal and natural representations of the symmetric group. These entries are determined as sums over weighted paths in the weak Bruhat graph on standard…
We study the "rank 1 case" of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result is new, it completes the…
A permutation P on {1,..,N} is a_fast_forward_permutation_ if for each m the computational complexity of evaluating P^m(x)$ is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions.…
In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…
We prove the occurrence of a phase transition accompanied by the emergence of cycles of diverging lengths in the random interchange process on the hypercube.
A universal cycle for a set S of combinatorial objects is a cyclic sequence of length |S|that contains a representation of each element in S exactly once as a substring. If S is the set of k-subsets of [n] = {1, 2, . . . , n}, it is…
Universal cycle for $k$-permutations is a cyclic arrangement in which each $k$-permutation appears exactly once as $k$ consecutive elements. Enumeration problem of universal cycles for $k$-permutations is discussed and one new enumerating…
We show how to generate random derangements efficiently by two different techniques: random restricted transpositions and sequential importance sampling. The algorithm employing restricted transpositions can also be used to generate random…
Breakpoint graphs are ubiquitous structures in the field of genome rearrangements. Their cycle decomposition has proved useful in computing and bounding many measures of (dis)similarity between genomes, and studying the distribution of…
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 present general links between statistics of non-Hermitian random matrices and the distribution of the number of cycles of some specific random permutations. In particular, we derive explicit formulas for the generating functions of the…
Robust travel time predictions are of prime importance in managing any transportation infrastructure, and particularly in rail networks where they have major impacts both on traffic regulation and passenger satisfaction. We aim at…
We consider the geometric random (GR) graph on the $d-$dimensional torus with the $L_\sigma$ distance measure ($1 \leq \sigma \leq \infty$). Our main result is an exact characterization of the probability that a particular labeled cycle…
For uniform random permutations conditioned to have no long cycles, we prove that the total number of cycles satisfies a central limit theorem. Under additional assumptions on the asymptotic behavior of the set of allowed cycle lengths, we…
The graph transformation approach is a recently proposed method for computing mean first passage times, rates, and committor probabilities for kinetic transition networks. Here we compare the performance to existing linear algebra methods,…
We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…
We consider random walks on several classes of graphs and explore the likely structure of the vacant set, i.e. the set of unvisited vertices. Let \Gamma(t) be the subgraph induced by the vacant set of the walk at step t. We show that for…
We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of length 2, the limiting joint distribution of the number of…