Related papers: Sampling independent sets in the discrete torus

We study the differential operator $A=\frac{d^4}{dx^4}$ acting on a connected network $\mathcal{G}$ along with $\mathcal L^2$, the square of the discrete Laplacian acting on a connected discrete graph $\mathsf{G}$. For both operators we…

We prove gradient bounds for the Markov semigroup of the dynamic $\varphi^4_2$-model on a torus of fixed size $L>0$. For sufficiently large mass $m>0$ these estimates imply exponential contraction of the Markov semigroup. Our method is…

Iterative load balancing algorithms for indivisible tokens have been studied intensively in the past. Complementing previous worst-case analyses, we study an average-case scenario where the load inputs are drawn from a fixed probability…

We study measure-theoretical aspects of torus piecewise isometries. Not much is known about this type of dynamical systems, except for the special case of one-dimensional interval exchange mappings. The last case is fundamentally different…

The famous results of Koml\'os, Major and Tusn\'ady (see [15] and [17]) state that it is possible to approximate almost surely the partial sums of size n of i.i.d. centered random variables in L p (p > 2) by a Wiener process with an error…

We are interested in various aspects of spectral rigidity of Cayley and Schreier graphs of finitely generated groups. For each pair of integers $d\geq 2$ and $m \ge 1$, we consider an uncountable family of groups of automorphisms of the…

We propose an analytic approach for the steady-state dynamics of Markov processes on locally tree-like graphs. It is based on time-translation invariant probability distributions for edge trajectories, which we encode in terms of infinite…

Let G be a connected graph. The toughness of G is defined as t(G)=min{\frac{|S|}{c(G-S)}}, in which the minimum is taken over all proper subsets S\subset V(G) such that c(G-S)\geq 2 where c(G-S) denotes the number of components of G-S.…

This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…

A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…

We study high-dimensional random geometric graphs (RGGs) of edge-density $p$ with vertices uniformly distributed on the $d$-dimensional torus and edges inserted between sufficiently close vertices with respect to an $L_q$-norm. We focus on…

Sampling from discrete distributions is a ubiquitous task in machine learning, recently revisited by the emergence of discrete diffusion models. While Langevin algorithms constitute the state of the art for continuous spaces, discrete…

The class of two-spin systems contains several important models, including random independent sets and the Ising model of statistical physics. We show that for both the hard-core (independent set) model and the anti-ferromagnetic Ising…

We study the number of nodal components (connected components of the set of zeroes) of functions in the ensemble of arithmetic random waves, that is, random eigenfunctions of the Laplacian on the flat $d$-dimensional torus $\mathbb{T}^{d}$…

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 consider the symmetric simple exclusion process on Z^d, for d>= 5, and study the regularity of the quasi-stationary measures of the dynamics conditionned on not occupying the origin. For each \rho\in ]0,1[, we establish uniqueness of the…

Consider a critical Erd\"os-R\'enyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{-1}+\lambda n^{-4/3}$, $\lambda$ being a…

We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d>6 for sufficient spread-out percolation. We use a relatively simple…

We consider stochastic processes on complete, locally compact tree-like metric spaces $(T,r)$ on their "natural scale" with boundedly finite speed measure $\nu$. Given a triple $(T,r,\nu)$ such a speed-$\nu$ motion on $(T,r)$ can be…

This work deals with the divisible sandpile model when an initial configuration sampled from a heavy-tailed distribution. Extending results of Levine et al. (2015) and Cipriani et al. (2016) we determine sufficient conditions for…