相关论文: Random Walks, Electric Networks and The Transience…
The Abelian Sandpile Model is a discrete diffusion process defined on graphs (Dhar [10], Dhar et al. [11]) which serves as the standard model of self-organized criticality. The transience class of a sandpile is defined as the maximum number…
The Abelian Sandpile Model is a discrete diffusion process defined on graphs (Dhar \cite{DD90}, Dhar et al. \cite{DD95}) which serves as the standard model of self-organized criticality. The transience class of a sandpile is defined as the…
We use techniques from the theory of electrical networks to give nearly tight bounds for the transience class of the Abelian sandpile model on the two-dimensional grid up to polylogarithmic factors. The Abelian sandpile model is a discrete…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
Motivated by the dissipative abelian sandpile model, we analyze the trajectories of a one-dimensional random walk in a landscape of soft traps. These traps, placed at increasing distances from each other, correspond to dissipative sites in…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
The Abelian sandpile growth model is a diffusion process for configurations of chips placed on vertices of the integer lattice $\mathbb{Z}^d$, in which sites with at least 2d chips {\em topple}, distributing 1 chip to each of their…
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…
The Abelian sandpile model was the first example of a self-organized critical system studied by Bak, Tang and Wiesenfeld. The dynamics of the sandpiles occur when the grains topple over a graph. In this study, we allow the graph to evolve…
A new sandpile model is studied in which bonds of the system are inhibited for activity after a certain number of transmission of grains. This condition impels an unstable sand column to distribute grains only to those neighbours which have…
We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of A's takes precedence over that of B's. The model was originally proposed and analyzed in Maragakis et…
The $\textit{Abelian Sandpile}$ model is a well-known model used in exploring $\textit{self-organized criticality}$. Despite a large amount of work on other aspects of sandpiles, there have been limited results in efficiently computing the…
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…
The abelian sandpile model defines a Markov chain whose states are integer-valued functions on the vertices of a simple connected graph $G$. By viewing this chain as a (nonreversible) random walk on an abelian group, we give a formula for…
We considered diffusion-driven processes on small-world networks with distance-dependent random links. The study of diffusion on such networks is motivated by transport on randomly folded polymer chains, synchronization problems in…
The diffusion of a particle in a crowded environment typically proceeds through three regimes: for very short times the particle diffuses freely until it collides with an obstacle for the first time, while for very long times diffusion the…
We study the Abelian sandpile model (ASM), a process where grains of sand are placed on a graph's vertices. When the number of grains on a vertex is at least its degree, one grain is distributed to each neighboring vertex. This model has…
We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…
We survey recent results of normal and anomalous diffusion of two types of random motions with long memory in ${\Bbb R}^d$ or ${\Bbb Z}^d$. The first class consists of random walks on ${\Bbb Z}^d$ in divergence-free random drift field,…
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…