Related papers: Sampling independent sets in the discrete torus

This paper studies distributed adaptive estimation over sensor networks with partially unknown source dynamics. We present parallel continuous-time and discrete-time designs in which each node runs a local adaptive observer and exchanges…

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…

The statistical literature discusses different types of Markov properties for chain graphs that lead to four possible classes of chain graph Markov models. The different models are rather well understood when the observations are continuous…

Let $(M,d,\mu)$ be a uniformly discrete metric measure space satisfying space homogeneous volume doubling condition. We consider discrete time Markov chains on $M$ symmetric with respect to $\mu$ and whose one-step transition density is…

We investigate the question of tightness of linear programming (LP) relaxation for finding a maximum weight independent set (MWIS) in sparse random weighted graphs. We show that an edge-based LP relaxation is asymptotically tight for…

We consider a finite region of a d-dimensional lattice of nonlinear Hamiltonian rotators, where neighbouring rotators have opposite spins and are coupled by a small potential of order $\varepsilon^a,\, a\geq1/2$. We weakly stochastically…

The cutoff phenomenon describes a sharp transition in the convergence of a Markov chain to equilibrium. In recent work, the authors established cutoff and its location for the stochastic Ising model on the $d$-dimensional torus $(Z/nZ)^d$…

We consider the Ising, and more generally, $q$-state Potts Glauber dynamics on random $d$-regular graphs on $n$ vertices at low temperatures $\beta \gtrsim \frac{\log d}{d}$. The mixing time is exponential in $n$ due to a bottleneck between…

Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…

For an integer $b \ge 1$, a $b$-matching (resp. $b$-edge cover) of a graph $G=(V,E)$ is a subset $S\subseteq E$ of edges such that every vertex is incident with at most (resp. at least) $b$ edges from $S$. We prove that for any $b \ge 1$…

Let $G$ be a countably infinite group, and let $\mu$ be a generating probability measure on $G$. We study the space of $\mu$-stationary Borel probability measures on a topological $G$ space, and in particular on $Z^G$, where $Z$ is any…

We establish a bijection between marginal independence models on $n$ random variables and split closed order ideals in the poset of partial set partitions. We also establish that every discrete marginal independence model is toric in cdf…

First, we present some results about the H\"older continuity of the sample paths of so called dilatively stable processes which are certain infinitely divisible processes having a more general scaling property than self-similarity. As a…

We describe the closures of locally divergent orbitsunder the action of tori on Hilbert modular spaces of rank r = 2. In particular, we prove that if D is a maximal R-split torus acting on a real Hilbert modular space then every locally…

We study the near-critical behavior of the sparse Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$ on $n\gg1$ vertices, where the connection probability $p$ satisfies $np = 1+\theta(b_n^2/n)^{1/3}$, with $n^{3/10}\ll {b_n}\ll n^{1/2}$, and…

We prove that the scaling limit of the weakly self-avoiding walk on a $d$-dimensional discrete torus is Brownian motion on the continuum torus if the length of the rescaled walk is $o(V^{1/2})$ where $V$ is the volume (number of points) of…

The study of the dynamics of an holomorphic map near a fixed point is a central topic in complex dynamical systems. In this paper we will consider the corresponding random setting: given a probability measure $\nu$ with compact support on…

The purpose of this paper is to introduce and study the following graph theoretic paradigm. Let $$T_Kf(x)=\int K(x,y) f(y) d\mu(y),$$ where $f: X \to {\Bbb R}$, $X$ a set, finite or infinite, and $K$ and $\mu$ denote a suitable kernel and a…

In this paper, we investigate the stochastic differential equation on $\mathbb{R}^d,d\geq2$: \begin{align*} \dif X_t&=v(t,X_t)\dif t+\sqrt{2} \dif W_t. \end{align*} For any finite collection of initial probability measures…

Many important theorems in combinatorics, such as Szemer\'edi's theorem on arithmetic progressions and the Erd\H{o}s-Stone Theorem in extremal graph theory, can be phrased as statements about independent sets in uniform hypergraphs. In…