Related papers: On graph parameters guaranteeing fast Sandpile dif…
Using the matrix product formalism we formulate a natural p-species generalization of the asymmetric simple exclusion process. In this model particles hop with their own specific rate and fast particles can overtake slow ones with a rate…
We prove several results concerning a polynomial that arises from the sandpile model on directed graphs; these results are previously only known for undirected graphs. Implicit in the sandpile model is the choice of a sink vertex, and it is…
On a smooth bounded Euclidean domain, Sobolev-subcritical fast diffusion with vanishing boundary trace is known to lead to finite-time extinction, with a vanishing profile selected by the initial datum. In rescaled variables, we quantify…
We investigate the bulldozing motion of a granular sandpile driven forwards by a vertical plate. The problem is set up in the laboratory by emplacing the pile on a table rotating underneath a stationary plate; the continual circulation of…
We present classes of models in which particles are dropped on an arbitrary fixed finite connected graph, obeying adhesion rules with screening. We prove that there is an invariant distribution for the resulting height profile, and Gaussian…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
Graph generative models have broad applications in biology, chemistry and social science. However, modelling and understanding the generative process of graphs is challenging due to the discrete and high-dimensional nature of graphs, as…
The existing estimation of the upper critical dimension of the Abelian Sandpile Model is based on a qualitative consideration of avalanches as self-avoiding branching processes. We find an exact representation of an avalanche as a sequence…
We prove a necessary and sufficient condition for an Abelian Sandpile Model (ASM) to be avalanche-finite, namely: all unstable states of the system can be brought back to stability in finite number of topplings. The method is also…
The characteristics of topologically protected wave propagation is typically predicted via the band structure of the primitive unit cell, using Berry curvature to predict localized interface or boundary states (as well as their degree of…
We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…
We consider the systems of diffusion-orthogonal polynomials, defined in the work [1] of D. Bakry, S. Orevkov and M. Zani and (particularly) explain why these systems with boundary of maximal possible degree should always come from the…
Consider a graph where the sites are distributed in space according to a Poisson point process on $\mathbb R^n$. We study a population evolving on this network, with individuals jumping between sites with a rate which decreases…
Diffusion probabilistic models (DPMs), widely recognized for their potential to generate high-quality samples, tend to go unnoticed in representation learning. While recent progress has highlighted their potential for capturing visual…
In order to complete (and generalize) results of Gardiner and Praeger on 4-valent symmetric graphs (European J. Combin, 15 (1994)) we apply the method of lifting automorphisms in the context of elementary-abelian covering projections. In…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We study sandpile models as closed systems, with conserved energy density $\zeta$ playing the role of an external parameter. The critical energy density, $\zeta_c$, marks a nonequilibrium phase transition between active and absorbing…
The paper addresses the single-file diffusion in the presence of an absorbing boundary. The emphasis is on an interplay between the hard-core interparticle interaction and the absorption process. The resulting dynamics exhibits several…
Generation of graphs is a major challenge for real-world tasks that require understanding the complex nature of their non-Euclidean structures. Although diffusion models have achieved notable success in graph generation recently, they are…
This paper focuses on spectral graph convolutional neural networks (ConvNets), where filters are defined as elementwise multiplication in the frequency domain of a graph. In machine learning settings where the dataset consists of signals…