Related papers: Improved bounds on the sandpile diffusions on Grid…
An artificial neural network is used to evaluate the effectiveness of six metrics and their combinations to assess whether slip transfers across grain boundaries in coarse-grained oligocrystalline Al foils…
Oliveira conjectured that the order of the mixing time of the exclusion process with $k$-particles on an arbitrary $n$-vertex graph is at most that of the mixing-time of $k$ independent particles. We verify this up to a constant factor for…
We propose a linear programming (LP) framework for steady-state diffusion and flux optimization on geometric networks. The state variable satisfies a discrete diffusion law on a weighted, oriented graph, where conductances are scaled by…
In this paper, we will introduce the `grid method' to prove that the extreme case of oscillation occurs for the averages obtained by sampling a flow along the sequence of times of the form $\{n^\alpha: n\in \mathbb{N}\}$, where $\alpha$ is…
Start with a graph with a subset of vertices called {\it the border}. A particle released from the origin performs a random walk on the graph until it comes to the immediate neighbourhood of the border, at which point it joins this subset…
The concept of percolation is combined with a self-consistent treatment of the interaction between the dynamics on a lattice and the external drive. Such a treatment can provide a mechanism by which the system evolves to criticality without…
A pebbling move on a graph consists of removing $2$ pebbles from a vertex and adding $1$ pebble to one of the neighbouring vertices. A vertex is called reachable if we can put $1$ pebble on it after a sequence of moves. The optimal pebbling…
The leaky abelian sandpile model (Leaky-ASM) is a growth model in which $n$ grains of sand start at the origin in $\mathbb{Z}^2$ and diffuse along the vertices according to a toppling rule. A site can topple if its amount of sand is above a…
Continuous graph neural models based on differential equations have expanded the architecture of graph neural networks (GNNs). Due to the connection between graph diffusion and message passing, diffusion-based models have been widely…
Place an $A$-particle at each site of a graph independently with probability $p$ and otherwise place a $B$-particle. $A$- and $B$-particles perform independent continuous time random walks at rates $\lambda_A$ and $\lambda_B$, respectively,…
We propose a new model of self-organized criticality. A particle is dropped at random on a lattice and moves along directions specified by arrows at each site. As it moves, it changes the direction of the arrows according to fixed rules. On…
An abelian network is a collection of communicating automata whose state transitions and message passing each satisfy a local commutativity condition. This paper is a continuation of the abelian networks series of Bond and Levine (2016),…
The divisible sandpile starts with i.i.d. random variables ("masses") at the vertices of an infinite, vertex-transitive graph, and redistributes mass by a local toppling rule in an attempt to make all masses at most 1. The process…
Diffusion-based classifiers such as those relying on the Personalized PageRank and the Heat kernel, enjoy remarkable classification accuracy at modest computational requirements. Their performance however is affected by the extent to which…
The majority of graphs whose sandpile groups are known are either regular or simple. We give an explicit formula for a family of non-regular multi-graphs called thick cycles. A thick cycle graph is a cycle where multi-edges are permitted.…
Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex…
We study a directed stochastic sandpile model of Self-Organized Criticality, which exhibits recurrent, multiple topplings, putting it in a separate universality class from the exactly solved model of Dhar and Ramaswamy. We show that in the…
A $ B_h $ set (or Sidon set of order $ h $) in an Abelian group $ G $ is any subset $ \{b_0, b_1, \ldots,b_{n}\} $ of $ G $ with the property that all the sums $ b_{i_1} + \cdots + b_{i_h} $ are different up to the order of the summands.…
In this paper we study a triple generalization of the Leaky Abelian Sandpile Model (LASM) of Alevy and Mkrtchyan, originally analyzed in the case of the square lattice in dimension two. First, we work in any dimension. Second, each site can…
A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…