Related papers: Cut-off for sandpiles on tiling graphs
We study the stochastic Ising model on finite graphs with n vertices and bounded degree and analyze the effect of boundary conditions on the mixing time. We show that for all low enough temperatures, the spectral gap of the dynamics with…
A lattice dynamics model is proposed for the history dependence observed in sandpile experiments. The dependence of the stress distribution on the preparation of the sandpile is explained as a dependence of certain attractors on the…
We investigate the fluctuation of the top location of a sandpile numerically using the two-dimensional discrete elements method. We feed particles to a sandpile at a fixed time interval and calculate power spectra from the time series of…
With a toppling rule which generates metastable sites, we explore the properties of a gradient-driven sandpile that is minimally perturbed at one boundary. In two dimensions we find that the transport of grains takes place along deep…
We discuss the use of a ferromagnetic spin model on a random graph to model granular compaction. A multi-spin interaction is used to capture the competition between local and global satisfaction of constraints characteristic for geometric…
We study the mixing time of random graphs in the $d$-dimensional toric unit cube $[0,1]^d$ generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a…
We compare and contrast two types of deformations inspired by mixing applications -- one from the mixing of fluids (stretching and folding), the other from the mixing of granular matter (cutting and shuffling). The connection between…
We study the splitting of regular square lattices subject to stochastic intermittent flows. Various flow patterns are produced by different groupings of the nodes, based on their random alternation between two possible states. The resulting…
A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Discovered in the context of card…
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We further study…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
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…
The non-ergodic behavior of the deterministic Fixed Energy Sandpile (DFES), with Bak-Tang-Wiesenfeld (BTW) rule, is explained by the complete characterization of a class of dynamical invariants (or toppling invariants). The link between…
The yielding behavior of a sheared Laponite suspension is investigated within a 1 mm gap under two different boundary conditions. No-slip conditions, ensured by using rough walls, lead to shear localization as already reported in various…
In this paper we show that the cutoff in separation profile for Brownian motion on flat torus T n\,; on spheres S n\,; on real, complex and quaternionic projective space resp. P n pRq, P n pCq and P n pHq, is the tail distribution of some…
The electric resistance between two arbitrary nodes on any infinite lattice structure of resistors that is a periodic tiling of space is obtained. Our general approach is based on the lattice Green's function of the Laplacian matrix…
We investigate the geometric properties displayed by the magnetic patterns developing on a two-dimensional Ising system, when a diffusive thermal dynamics is adopted. Such a dynamics is generated by a random walker which diffuses throughout…
We give a systematic development of the application of matrix norms to rapid mixing in spin systems. We show that rapid mixing of both random update Glauber dynamics and systematic scan Glauber dynamics occurs if any matrix norm of the…
A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…
A tiling is a cover of R^d by tiles such as polygons that overlap only on their borders. A patch is a configuration consisting of finitely many tiles that appears in tilings. From a tiling, we can construct a dynamical system which encodes…