Related papers: Cut-off for sandpiles on tiling graphs
We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…
General hierarchical lattices of coupled maps are considered as dynamical systems. These models may describe many processes occurring in heterogeneous media with tree-like structures. The transition to turbulence via spatiotemporal…
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…
It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…
A model describing the three-dimensional folding of the triangular lattice on the face-centered cubic lattice is generalized allowing the presence of defects corresponding to cuts in the two-dimensional network. The model can be expressed…
Cut and project sets are obtained by projecting an irrational slice through a lattice to a lower dimensional subspace. Under standard conditions, the resulting pattern has no translational periods even though it retains some regularity of…
It is broadly known that any parallelepiped tiles space by translating copies of itself along its edges. In earlier work relating to higher-dimensional sandpile groups, the second author discovered a novel construction which fragments the…
Starting with a substitution tiling, we demonstrate a method for constructing infinitely many new substitution tilings. Each of these new tilings is derived from a graph iterated function system and the tiles have fractal boundary. We show…
We have investigated experimentally the influence of a magnetic interaction between the grains on the compaction dynamics of a granular pile submitted to a series of taps. The granular material used to perform this study is a mixture of…
We introduce a square tiling/tetragonal strip representation to the P, D, and G triply periodic minimal surfaces. This approach is useful in identifying mixtures and grain boundaries of these surfaces that might be useful for material…
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…
We solve a one-dimensional sandpile problem analytically in a thick flow regime when the pile evolution may be described by a set of linear equations. We demonstrate that, if an income flow is constant, a space periodicity takes place while…
The broad motivation of this work is a rigorous understanding of reversible, local Markov dynamics of interfaces, and in particular their speed of convergence to equilibrium, measured via the mixing time $T_{mix}$. In the…
Kinetic self-avoiding trails are introduced and used to generate a substrate of randomly quenched flow vectors. Sandpile model is studied on such a substrate with asymmetric toppling matrices where the precise balance between the net…
We study the local time distribution of a Brownian particle diffusing along the links on a graph. In particular, we derive an analytic expression of its Laplace transform in terms of the Green's function on the graph. We show that the…
We consider a random geometric graph obtained by placing a Poisson point process of intensity 1 in the d-dimensional torus of side length n^(1/d) and connecting two points by an edge if their distance is at most r. We consider the case of…
Consider symmetric simple exclusion processes, with or without Glauber dynamics on the boundary set, on a sequence of connected unweighted graphs $G_N=(V_N,E_N)$ which converge geometrically and spectrally to a compact connected metric…
We investigate the computational hardness of spin-glass instances on a square lattice, generated via a recently introduced tunable and scalable approach for planting solutions. The method relies on partitioning the problem graph into…
We study the Glauber dynamics for the Ising model on the complete graph, also known as the Curie-Weiss Model. For beta < 1, we prove that the dynamics exhibits a cut-off: the distance to stationarity drops from near 1 to near 0 in a window…
The dynamic scaling of curved interfaces presents features that are strikingly different from those of the planar ones. Spherical surfaces above one dimension are flat because the noise is irrelevant in such cases. Kinetic roughening is…