Related papers: Cutoff for the bidirectional East Process
We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for…
We consider a natural analogue of Brownian motion on free orthogonal quantum groups and prove that it exhibits a cutoff at time $N\ln(N)$. Then, we study the induced classical process on the real line and compute its atoms and density. This…
In this paper, we study the cut-off phenomenon under the total variation distance of $d$-dimensional Ornstein-Uhlenbeck processes which are driven by L\'evy processes. That is to say, under the total variation distance, there is an abrupt…
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 consider the East model in $\mathbb Z^d$, an example of a kinetically constrained interacting particle system with oriented constraints, together with one of its natural variant. Under any ergodic boundary condition it is known that the…
Long-time limit of one-dimensional L\'{e}vy processes weighted and normalized with respect to the exponential functional of two-point local times are studied. The limit processes may vary according to the choice of random clocks.
We study the convergence to equilibrium in high dimensions, focusing on explicit bounds on mixing times and the emergence of the cutoff phenomenon for Dyson-Laguerre processes. These are interacting particle systems with non-constant…
We describe an algorithm for solving an important geometric problem arising in computer-aided manufacturing. When cutting away a region from a solid piece of material -- such as steel, wood, ceramics, or plastic -- using a rough tool in a…
The main goal of this paper is applying the cut-off projection for solving one-dimensional backward heat conduction problem in a two-slab system with a perfect contact. In a constructive manner, we commence by demonstrating the…
We propose a new method for identifying cutting locations for quantum circuit cutting, with a primary focus on partitioning circuits into three or more parts. Under the assumption that the classical postprocessing function is decomposable,…
The linear-time ham-sandwich cut algorithm of Lo, Matou\v{s}ek, and Steiger for bi-chromatic finite point sets in the plane works by appropriately selecting crossings of the lines in the dual line arrangement with a set of well-chosen…
Several long-time limit theorems of one-dimensional L\'{e}vy processes weighted and normalized by functions of the local time are studied. The long-time limits are taken via certain families of random times, called clocks: exponential…
The location and width of the time window in which a sequence of processes converges to equilibrum are given under conditions of exponential convergence. The location depends on the side: the left-window and right window cutoffs may have…
The Fredrickson-Andersen one spin facilitated model belongs to the class of Kinetically Constrained Spin Models. It is a non attractive process with positive spectral gap. In this paper we give a precise result on the relaxation for this…
We study the convergence to equilibrium of the Dyson-Jacobi process, a system of n interacting particles on the segment [0, 1] arising from Random Matrix Theory. We establish the occurence of a cutoff phenomenon for the intrinsic…
Given a family of rotationally symmetric compact manifolds indexed by the dimension and a weight function, the goal of this paper is to investigate the cut-off phenomenon for the Brownian motions on this family. We provide a class of…
This article establishes cutoff thermalization (also known as the cutoff phenomenon) for a class of generalized Ornstein-Uhlenbeck systems $(X^\varepsilon_t(x))_{t\geqslant 0}$ with $\varepsilon$-small additive L\'evy noise and initial…
We consider random walk on the group of uni-upper triangular matrices with entries in $\mathbb{F}_2$ which forms an important example of a nilpotent group. Peres and Sly (2013) proved tight bounds on the mixing time of this walk up to…
Scheduling jobs with precedence constraints on a set of identical machines to minimize the total processing time (makespan) is a fundamental problem in combinatorial optimization. In practical settings such as cloud computing, jobs are…
We study the effect of a small cutoff $\epsilon$ on the velocity of a pulled front in one dimension by means of a variational principle. We obtain a lower bound on the speed dependent on the cutoff, and for which the two leading order terms…