Related papers: Improved bounds on the sandpile diffusions on Grid…
Light diffusion is usually associated with thick, opaque media. Indeed, multiple scattering is necessary for the onset of the diffusive regime and such condition is generally not met in almost transparent media. Nonetheless, at long enough…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
Gallai asked in 1984 if any $k$-critical graph on $n$ vertices contains at least $n$ distinct $(k-1)$-critical subgraphs. The answer is trivial for $k\leq 3$. Improving a result of Stiebitz, Abbott and Zhou proved in 1995 that for all…
Given a distribution of pebbles on the vertices of a graph, say that we can pebble a vertex if a pebble is left on it after some sequence of moves, each of which takes two pebbles from some vertex and places one on an adjacent vertex. A…
Edge expansion is a parameter indicating how well-connected a graph is. It is useful for designing robust networks, analysing random walks or information flow through a network and is an important notion in theoretical computer science.…
We present an analysis of an epidemic spreading process on the Apollonian network that can describe an epidemic spreading in a non-sedentary population. The modified diffusive epidemic process was employed in this analysis in a…
Avalanche dynamics is an indispensable feature of complex systems. Here we study the self-organized critical dynamics of avalanches on scale-free networks with degree exponent $\gamma$ through the Bak-Tang-Wiesenfeld (BTW) sandpile model.…
After the introduction of sandpile model a number of different variants have been studied. In most of these models sand particles are indistinguishable. Here we have painted the sand particles using a few distinct colors, and restrict them…
When sand flows out of a funnel onto a surface, a three dimensional pile that is stabilized by friction grows taller as it spreads. Here we investigate an idealized two dimensional analogue: spreading of a pile of monodisperse oil droplets…
In this paper, the sharp interface limit for the compressible non-isentropic Navier-Stokes/Allen-Cahn system is derived by the method of matched asymptotic expansion. We show that the leading order problem satisfies the compressible…
An old conjecture of Erd{\H{o}}s and Gallai states that every $n$ vertex graph can be decomposed, that is $E(G)$ can be partitioned, into $O(n)$ cycles and edges. The covering version of this conjecture was proven by Pyber in 1985, where it…
The emergence of diffusion is one of the deepest physical phenomena observed in many-body interacting, chaotic systems. But establishing rigorously that correlation functions, say of the spin, expand diffusively, remains one of the most…
The reachability problem asks to decide if there exists a path from one vertex to another in a digraph. In a grid digraph, the vertices are the points of a two-dimensional square grid, and an edge can occur between a vertex and its…
We study the communication complexity of a number of graph properties where the edges of the graph $G$ are distributed between Alice and Bob (i.e., each receives some of the edges as input). Our main results are: * An Omega(n) lower bound…
This paper deals with the problem of global parameter estimation of affine diffusions in $\mathbb{R}_+ \times \mathbb{R}^n$ denoted by $AD(1, n)$ where $n$ is a positive integer which is a subclass of affine diffusions introduced by Duffie…
Out-of-distribution (OOD) generalization has emerged as a critical challenge in graph learning, as real-world graph data often exhibit diverse and shifting environments that traditional models fail to generalize across. A promising solution…
The sandpile group of a connected graph is the group of recurrent configurations in the abelian sandpile model on this graph. We study the structure of this group for the case of regular trees. A description of this group is the following:…
This paper proposes and analyzes a novel clustering algorithm that combines graph-based diffusion geometry with techniques based on density and mode estimation. The proposed method is suitable for data generated from mixtures of…
Ahanjideh, Akbari, Fakharan and Trevisan proposed a conjecture in [Linear Algebra Appl. 632 (2022) 1--14] on the distribution of the Laplacian eigenvalues of graphs: for any connected graph of order $n$ with diameter $d\ge 2$ that is not a…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…