相关论文: Abelian Sandpile Model on Randomly Rooted Graphs a…

We present a two-dimensional system which exhibits features of self-organized criticality. The avalanches which occur on the surface of a pile of rice are found to exhibit finite size scaling in their probability distribution. The critical…

We study the scaling properties of avalanche activity in the two-dimensional Abelian sandpile model. Instead of the conventional avalanche size distribution, we analyze the site activity distribution, which measures how often a site…

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

We study the local geometry of the three-dimensional uniform spanning tree and its connection with the Abelian sandpile model. We obtain sharp tail exponents, up to subpolynomial errors, for the past of the origin in the three-dimensional…

We introduce a new lattice growth model, which we call boundary sandpile. The model amounts to potential-theoretic redistribution of a given initial mass on $\mathbb{Z}^d$ ($d\geq 2$) onto the boundary of an (a priori) unknown domain. The…

Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…

We give a non-trivial upper bound for the critical density when stabilizing i.i.d. distributed sandpiles on the lattice $\mathbb{Z}^2$. We also determine the asymptotic spectral gap, asymptotic mixing time and prove a cutoff phenomenon for…

With any self-similar action of a finitely generated group $G$ of automorphisms of a regular rooted tree $T$ can be naturally associated an infinite sequence of finite graphs $\{\Gamma_n\}_{n\geq 1}$, where $\Gamma_n$ is the Schreier graph…

We introduce two sandpile models which show the same behavior of real sandpiles, that is, an almost self-organized critical behavior for small systems and the dominance of large avalanches as the system size increases. The systems become…

We introduce a new model of a stochastic sandpile on a graph $G$ containing a sink. When unstable, a site sends one grain to each of its neighbours independently with probability $p \in (0,1]$. For $p=1$, this coincides with the standard…

In this paper we study a simple model of a purely excitatory neural network that, by construction, operates at a critical point. This model allows us to consider various markers of criticality and illustrate how they should perform in a…

Multiple studies of neural avalanches across different data modalities led to the prominent hypothesis that the brain operates near a critical point. The observed exponents often indicate the mean-field directed-percolation universality…

We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…

We consider the Bak-Tang-Wiesenfeld sandpile model on square lattices in different dimensions (D>=6). A finite size scaling analysis of the avalanche probability distributions yields the values of the distribution exponents, the dynamical…

We consider random perturbations of non-uniformly expanding maps, possibly having a non-degenerate critical set. We prove that, if the Lebesgue measure of the set of points failing the non-uniform expansion or the slow recurrence to the…

We classify all recurrent configurations of the Abelian sandpile model (ASM) on Ferrers graphs. The classification is in terms of decorations of EW-tableaux, which undecorated are in bijection with the minimal recurrent configurations. We…

Consider the convex hull of a collection of disjoint open discs with radii $1/2$. The boundary of the convex hull consists of a finite number of line segments and arcs. Randomly choose a point in one of the arcs in the boundary so that the…

For a finite connected graph $G$ and a non-empty subset $S$ of its vertices thought of sinks, the so-called critical group (or sandpile group) $C(G, S)$ has been studied for a long time. We present a class of graphs where such an extension…

We prove that the wired uniform spanning forest exhibits mean-field behaviour on a very large class of graphs, including every transitive graph of at least quintic volume growth and every bounded degree nonamenable graph. Several of our…