Related papers: Improved bounds on the sandpile diffusions on Grid…

We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…

We show that deterministic systems with strong nonlinearities seem to be more appropriate to model sandpiles than stochastic systems or deterministic systems in which discontinuities are the only nonlinearity. In particular, we are able to…

We determine the distribution of the sandpile group (a.k.a. Jacobian) of the Erd\H{o}s-R\'enyi random graph G(n,q) as n goes to infinity. Since any particular group appears with asymptotic probability 0 (as we show), it is natural ask for…

To study the effect of boundaries on diffusion of new products, we introduce two novel analytic tools: The indifference principle, which enables us to explicitly compute the aggregate diffusion on various networks, and the dominance…

We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…

The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…

We consider the standard Abelian sandpile process on the Bethe lattice. We show the existence of the thermodynamic limit for the finite volume stationary measures and the existence of a unique infinite volume Markov process exhibiting…

In this paper, we derive nonasymptotic theoretical bounds for the influence in random graphs that depend on the spectral radius of a particular matrix, called the Hazard matrix. We also show that these results are generic and valid for a…

Let $G$ be a graph on $n$ vertices and $(H,+)$ be an abelian group. What is the minimum size ${\sf S}_H(G)$ of the set of all sums $A(u)+A(v)$ over all injections $A:V(G)\to H$? In 2012, the first author, Angel, the second author, and…

For three constrained Brownian motions, the excursion, the meander, and the reflected bridge, the densities of the maximum and of the time to reach it were expressed as double series by Majumdar, Randon-Furling, Kearney, and Yor (2008).…

In this paper we study the abelian sandpile model on the two-dimensional grid with uniform neighborhood, and prove that any family of neighborhoods defined as scalings of a continuous non-flat shape can ultimately perform crossing.

We show that diffusion models can achieve image sample quality superior to the current state-of-the-art generative models. We achieve this on unconditional image synthesis by finding a better architecture through a series of ablations. For…

We investigate locally $n \times n$ grid graphs, that is, graphs in which the neighbourhood of any vertex is the Cartesian product of two complete graphs on $n$ vertices. We consider the subclass of these graphs for which each pair of…

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 introduce and study numerically a directed two-dimensional sandpile automaton with probabilistic toppling (probability parameter p) which provides a good laboratory to study both self-organized criticality and the far-from-equilibrium…

Score-based generative models exhibit state of the art performance on density estimation and generative modeling tasks. These models typically assume that the data geometry is flat, yet recent extensions have been developed to synthesize…

We establish a Sanov type large deviation principle for an ensemble of interacting Brownian rough paths. As application a large deviations for the ($k$-layer, enhanced) empirical measure of weakly interacting diffusions is obtained. This in…

We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredients: (i) from the barely subcritical regime to the critical…

Erd\H{o}s conjectured that every $n$-vertex triangle-free graph contains a subset of $\lfloor n/2\rfloor$ vertices that spans at most $n^2/50$ edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs…

Diffusion models have become the go-to method for large-scale generative models in real-world applications. These applications often involve data distributions confined within bounded domains, typically requiring ad-hoc thresholding…