Related papers: On graph parameters guaranteeing fast Sandpile dif…
We connect several notions relating the structural and dynamical properties of a graph. Among them are the topological entropy coming from the vertex shift, which is related to the spectral radius of the graph's adjacency matrix, the…
The social graphs synthesized by the generative models are increasingly in demand due to data scarcity and concerns over user privacy. One of the key performance criteria for generating social networks is the fidelity to specified…
In the single-source sandpile model, a number $N$ grains of sand are positioned at a central vertex on the 2-dimensional grid $\mathbb{Z}^2$. We study the stabilisation of this configuration for a stochastic sandpile model based on a…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
Geological parameterization entails the representation of a geomodel using a small set of latent variables and a mapping from these variables to grid-block properties such as porosity and permeability. Parameterization is useful for data…
In this paper, we explore the higher- and lower-order connectivity aspects of the visibility graph representation of sandpile models, focusing on the Bak-Tang-Wiesenfeld (BTW) model. By converting the time series of avalanche events into…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
Let $(G_n)_{n \geq 1} = ((V_n,E_n))_{n \geq 1}$ be a sequence of finite, connected, vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)_{n \geq 1}$ in $[0,1]$ is supercritical with respect…
We present a detailed analysis of large scale simulations of avalanches in the 2D Abelian sandpile model. We compare statistical properties of two different decompositions of avalanches into clusters of topplings and waves of topplings.…
The Kob-Andersen model is a fundamental example of a kinetically constrained lattice gas, that is, an interacting particle system with Kawasaki type dynamics and kinetic constraints. In this model, a particle is allowed to jump when…
We prove that in wide generality the critical curve of the activated random walk model is a continuous function of the deactivation rate, and we provide a bound on its slope which is uniform with respect to the choice of the graph.…
Recent experiments have successfully realized multi-band non-Abelian topological insulators with parity-time symmetry. Their topological classification transcends the conventional ten-fold classification, necessitating the use of…
Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…
Many tools from the field of graph signal processing exploit knowledge of the underlying graph's structure (e.g., as encoded in the Laplacian matrix) to process signals on the graph. Therefore, in the case when no graph is available, graph…
We prove that the Abelian sandpile model on a random binary and binomial tree, as introduced in \cite{rrs}, is not critical for all branching probabilities $p<1$; by estimating the tail of the annealed survival time of a random walk on the…
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…
In this work, we relate girth and path-degeneracy in classes with sub-exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor-closed classes that are tight up to a constant factor (and tight up to…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
Diffusion models have become the go-to method for many generative tasks, particularly for image-to-image generation tasks such as super-resolution and inpainting. Current diffusion-based methods do not provide statistical guarantees…
The hard-core model can be used to understand the numbers of independent sets in graphs in extremal graph theory. The occupancy fraction, defined as the logarithmic derivative of the independence polynomial of a graph, is a key quantity in…