Related papers: Sampling independent sets in the discrete torus

We consider a random geometric graph obtained by placing a Poisson point process of intensity 1 in the d-dimensional torus of side length n^(1/d) and connecting two points by an edge if their distance is at most r. We consider the case of…

In recent years, statistical characterization of the discrete conservative dynamical systems (more precisely, paradigmatic examples of area-preserving maps such as the standard and the web maps) has been analyzed extensively and shown that,…

Let $X$ be a proper algebraic scheme over an algebraically closed field. We assume that a torus $T$ acts on $X$ such that the action has isolated fixed points. The $T$-graph of $X$ can be defined using the fixed points and the one…

Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…

It is shown that pure exponential discs in spiral galaxies are capable of supporting slowly varying discrete global lopsided modes, which can explain the observed features of lopsidedness in the stellar discs. Using linearized fluid…

We study the limiting behavior of interacting particle systems indexed by large sparse graphs, which evolve either according to a discrete time Markov chain or a diffusion, in which particles interact directly only with their nearest…

We show that the existence of a "good"' coupling w.r.t. Hamming distance for any local Markov chain on a discrete product space implies rapid mixing of the Glauber dynamics in a blackbox fashion. More specifically, we only require the…

Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and pairs of degree-1 vertices with the same neighbourhood. We…

We consider the problem of `discrete-time persistence', which deals with the zero-crossings of a continuous stochastic process, X(T), measured at discrete times, T = n(\Delta T). For a Gaussian Stationary Process the persistence (no…

We study the behaviour, in the simultaneous limits \hbar going to 0, t going to \infty, of the Husimi and Wigner distributions of initial coherent states and position eigenstates, evolved under the quantized hyperbolic toral automorphisms…

We use a recently developed technique, which allows to perform few Lanczos steps on a given wavefunction even for large system sizes, to investigate the $t{-}J$ model in the physical parameter region and to check the stability of the BCS…

We study hard dimers on dynamical lattices in arbitrary dimensions using a random tensor model. The set of lattices corresponds to triangulations of the d-sphere and is selected by the large N limit. For small enough dimer activities, the…

The dimer model on a graph embedded in the torus can be interpreted as a collection of random self-avoiding loops. In this paper, we consider the uniform toroidal honeycomb dimer model. We prove that when the mesh of the graph tends to zero…

A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…

Let $\nu$ be a probability measure that is ergodic under the endomorphism $(\times p, \times p)$ of the torus $\mathbb{T}^2$, such that $\dim \pi \mu < \dim \mu$ for some non-principal projection $\pi$. We show that, if both $m\neq n$ are…

We study choosability with separation which is a constrained version of list coloring of graphs. A (k,d)-list assignment L on a graph G is a function that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair…

The mixing time of a Markov chain determines how fast the iterates of the Markov chain converge to the stationary distribution; however, it does not control the dependencies between samples along the Markov chain. In this paper, we study…

We use the lace expansion to study the long-distance decay of the two-point function of weakly self-avoiding walk on the integer lattice $\mathbb{Z}^d$ in dimensions $d>4$, in the vicinity of the critical point, and prove an upper bound…

Topological order, the hallmark of fractional quantum Hall states, is primarily defined in terms of ground-state degeneracy on higher-genus manifolds, e.g. the torus. We investigate analytically and numerically the smooth crossover between…

We present a simple combinatorial framework for establishing approximate tensorization of variance and entropy in the setting of spin systems (a.k.a. undirected graphical models) based on balanced separators of the underlying graph. Such…