Related papers: The $k$-cycle shuffling with repeated cards

We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction…

Ballistic transport through a collection of quantum billiards in undoped graphene is studied analytically within the conformal mapping technique. The billiards show pseudodiffusive behavior, with the conductance equal to that of a classical…

Given a vertex in a $(k, \varphi, \epsilon)$-clusterable graph, i.e. a graph whose vertex set can be partitioned into a disjoint union of $\varphi$-expanders of size $\approx n/k$ with outer conductance bounded by $\epsilon$, can one…

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

We extend the peeling exploration introduced in arxiv:1506.01590 to the setting of Boltzmann planar maps coupled to a rigid $O(n)$ loop model. Its law is related to a class of discrete Markov processes obtained by confining random walks to…

We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application…

We present an affine-invariant random walk for drawing uniform random samples from a convex body $\mathcal{K} \subset \mathbb{R}^n$ that uses maximum volume inscribed ellipsoids, known as John's ellipsoids, for the proposal distribution.…

We investigate a quadratic dynamical system known as nonlinear recombinations. This system models the evolution of a probability measure over the Boolean cube, converging to the stationary state obtained as the product of the initial…

For which values of $k$ does a uniformly chosen $3$-regular graph $G$ on $n$ vertices typically contain $ n/k$ vertex-disjoint $k$-cycles (a $k$-cycle factor)? To date, this has been answered for $k=n$ and for $k \ll \log n$; the former,…

Answering a question by Angel, Holroyd, Martin, Wilson and Winkler, we show that the maximal number of non-colliding coupled simple random walks on the complete graph $K_N$, which take turns, moving one at a time, is monotone in $N$. We use…

We survey recent results concerning the total-variation mixing time of the simple exclusion process on the segment (symmetric and asymmetric) and a continuum analog, the simple random walk on the simplex with an emphasis on cutoff results.…

For piecewise-smooth differential systems, in this paper we focus on crossing limit cycles and sliding loops bifurcating from a grazing loop connecting one high multiplicity tangent point. For the low multiplicity cases considered in…

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…

We consider the random walk on the hypercube which moves by picking an ordered pair $(i,j)$ of distinct coordinates uniformly at random and adding the bit at location $i$ to the bit at location $j$, modulo $2$. We show that this Markov…

We study $p$-colored top-$m$-to-random on the wreath product $G_{n,p}=C_p\wr S_n$, with $m$ fixed. Using the Nakano-Sadahiro-Sakurai basis elements $B_m$, we obtain exact nested-set occupancy mixtures and reduce the likelihood ratio to the…

We find Gaussian cutoff profiles for the total variation distance to stationarity of a random walk on a multiplex network: a finite number of directed configuration models sharing a vertex set, each with its own bounded degree distribution…

As a strategy to complete games quickly, we investigate one-dimensional random walks where the step length increases deterministically upon each return to the origin. When the step length after the kth return equals k, the displacement of…

Let $S(k)$ be the scattering matrix for a Schr\"odinger operator (Laplacian plus potential) on $\RR^n$ with compactly supported smooth potential. It is well known that $S(k)$ is unitary and that the spectrum of $S(k)$ accumulates on the…

Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…

In this paper we generalize permutations to plane permutations. We employ this framework to derive a combinatorial proof of a result of Zagier and Stanley, that enumerates the number of $n$-cycles $\omega$, for which $\omega(12\cdots n)$…