Related papers: Internal DLA on cylinder graphs: fluctuations and …
We show bounds on total variation and $L^{\infty}$ mixing times, spectral gap and magnitudes of the complex valued eigenvalues of a general (non-reversible non-lazy) Markov chain with a minor expansion property. This leads to the first…
We propose a mechanism to produce fluctuations in the viscosity parameter ($\alpha$) in differetially rotating discs. We carried out a nonlinear analysis of a general accretion flow, where any perturbation on the background $\alpha$ was…
We prove that the mixing time of driven-dissipative activated random walk on an interval of length $n$ with uniform or central driving exhibits cutoff at $n$ times the critical density for activated random walk on the integers. The proof…
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…
We study the effects of uniform time delays on the extreme fluctuations in stochastic synchronization and coordination problems with linear couplings in complex networks. We obtain the average size of the fluctuations at the nodes from the…
We give a new method for analysing the mixing time of a Markov chain using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes…
We prove a cutoff for the random walk on random $n$-lifts of finite weighted graphs, even when the random walk on the base graph $\mathcal{G}$ of the lift is not reversible. The mixing time is w.h.p. $t_{mix}=h^{-1}\log n$, where $h$ is a…
Exponential random graphs are used extensively in the sociology literature. This model seeks to incorporate in random graphs the notion of reciprocity, that is, the larger than expected number of triangles and other small subgraphs.…
We prove that the continuous-time, single-flip Glauber dynamics for lozenge tilings of the size-$N$ hexagon mix in time $N^{2+o(1)}$. This was predicted to hold on fairly general domains of diameter $N$ (on the basis of the ``Lifshitz law''…
In this paper, we study fluctuations of conditionally centered statistics of the form $$N^{-1/2}\sum_{i=1}^N c_i(g(\sigma_i)-\mathbb{E}_N[g(\sigma_i)|\sigma_j,j\neq i])$$ where $(\sigma_1,\ldots ,\sigma_N)$ are sampled from a dependent…
An interesting opportunity to determine thermodynamic and transport properties in more detail is to identify generic statistical properties of initial density perturbations. Here we study event-by-event fluctuations in terms of correlation…
In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle" which characterizes the odometer function of the growth process.…
The \textit{node reliability} of a graph $G$ is the probability that at least one node is operational and that the operational nodes can all communicate in the subgraph that they induce, given that the edges are perfectly reliable but each…
Determining the total variation mixing time of Kac's random walk on the special orthogonal group $\mathrm{SO}(n)$ has been a long-standing open problem. In this paper, we construct a novel non-Markovian coupling for bounding this mixing…
We construct a family of growing finite bounded degree rooted graphs, $G_n$, in which the mixing time for simple random walk, starting at the root, is order $\log |G_n|$. Yet after a quasi - isometry, the ratio of $|G_n|$ over the mixing…
A phenomenological theory of the fluctuations of velocity occurring in a fully developed homogeneous and isotropic turbulent flow is presented. The focus is made on the fluctuations of the spatial (Eulerian) and temporal (Lagrangian)…
We prove that if a rescaled mean curvature flow is a global graph over the round cylinder with small gradient and converges super-exponentially fast, then it must coincide with the cylinder itself. We also show that the result is sharp with…
We show that the dissipative Abelian sandpile on a graph L can be related to a random walk on a graph which consists of L extended with a trapping site. From this relation it can be shown, using exact results and a scaling assumption, that…
New aspects of turbulence are uncovered if one considers flow motion from the perspective of a fluid particle (known as the Lagrangian approach) rather than in terms of a velocity field (the Eulerian viewpoint). Using a new experimental…