相关论文: The cutoff phenomenon for randomized riffle shuffl…
The sequence of the simple random walks on Hamming schemes $\{H(n, q)\}_{n=1}^{\infty}$ has a cutoff phenomenon for each integer $q$ greater than or equal to $3$. In this paper, for the sequence of simple random walks on Hamming schemes…
Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…
We study convergence to equilibrium for a large class of Markov chains in random environment. The chains are sparse in the sense that in every row of the transition matrix $P$ the mass is essentially concentrated on few entries. Moreover,…
In the top to random shuffle, the first a cards are removed from a deck of n cards 12 \cdots n and then inserted back into the deck. This action can be studied by treating the top to random shuffle as an element B_a, which we define…
We study the kinetics of random sequential adsorption of a mixture of particles with continuous distribution of sizes for different deposition rules. It appears in the long time limit the resulting system can be described using the fractal…
Given a set of coins arranged in a line, we remove heads-up coins one at a time and flip any adjacent coins after each removal. The coin-removal problem is to determine for which arrangements of coins it is possible to remove all of the…
Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…
We consider the billiard dynamics in a strip-like set that is tessellated by countably many translated copies of the same polygon. A random configuration of semidispersing scatterers is placed in each copy. The ensemble of dynamical systems…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $\alpha \in (0,1)$, the union of any $n$-vertex graph with minimum degree $\alpha n$ and the binomial random…
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…
In this article pattern statistics of typical cubical cut and project sets are studied. We give estimates for the rate of convergence of appearances of patches to their asymptotic frequencies. We also give bounds for repetitivity and…
We study the distribution of the individual components of a random multicurve under the action of the mapping class group.
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…
Crackling noise is a common feature in many systems that are pushed slowly, the most familiar instance of which is the sound made by a sheet of paper when crumpled. In percolation and regular aggregation clusters of any size merge until a…
We study analytically and numerically the classical diffusive process which takes place in a chaotic billiard. This allows to estimate the conditions under which the statistical properties of eigenvalues and eigenfunctions can be described…
On the plane, every random compact set with almost surely uncountable first projection intersects with a high probability the graph of some continuous function. Implication: every black noise over the plane fails to factorize when the plane…
A scramble on a connected multigraph is a collection of connected subgraphs that generalizes the notion of a bramble. The maximum order of a scramble, called the scramble number of a graph, was recently developed as a tool for lower…
In this article, we prove the cutoff phenomenon for a general class of the discrete-time nonlinear recombination models. This system models the evolution of a probability measure on a finite product space $S^n$ representing the state of…
The modal cut-off is investigated experimentally in a series of high quality non-linear photonic crystal fibers. We demonstrate a suitable measurement technique to determine the cut-off wavelength and verify it by inspecting the near field…