Related papers: Long Range Percolation Mixing Time
Let $\mathcal{C}_1$ be the largest component of the Erd\H{o}s--R\'{e}nyi random graph $\mathcal{G}(n,p)$. The mixing time of random walk on $\mathcal {C}_1$ in the strictly supercritical regime, $p=c/n$ with fixed $c>1$, was shown to have…
We prove tight mixing time bounds for natural random walks on bases of matroids, determinantal distributions, and more generally distributions associated with log-concave polynomials. For a matroid of rank $k$ on a ground set of $n$…
We consider a flip dynamics for directed (1+d)-dimensional lattice paths with length L. The model can be interpreted as a higher dimensional version of the simple exclusion process, the latter corresponding to the case d=1. We prove that…
In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…
The subject of graph convexity is well explored in the literature, the so-called interval convexities above all. In this work, we explore the cycle convexity, an interval convexity whose interval function is $I(S) = S \cup \{u \mid G[S \cup…
In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoperimetric dimension larger than one. For these graphs we are able to prove that p_c < 1, or in other words, that there exists a percolation…
We present dynamic algorithms with polylogarithmic update time for estimating the size of the maximum matching of a graph undergoing edge insertions and deletions with approximation ratio strictly better than $2$. Specifically, we obtain a…
Every lattice for which the bond percolation critical probability can be found exactly possesses a critical polynomial, with the root in [0,1] providing the threshold. Recent work has demonstrated that this polynomial may be generalized…
We present a numerical study for the threshold percolation probability, $p_c$, in the bond percolation model with multiple ranges, in the square lattice. A recent Theorem demonstrated by de Lima {\it et al.} [B. N. B. de Lima, R. P.…
We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application…
A comparative simulation study of polymer brushes formed by grafting at a planar surface either flexible linear polymers (chain length $N_L$) or (non-catenated) ring polymers (chain length $N_R=2 N_L$) is presented. Two distinct off-lattice…
We show that the total variation mixing time is not quasi-isometry invariant, even for Cayley graphs. Namely, we construct a sequence of pairs of Cayley graphs with maps between them that twist the metric in a bounded way, while the ratio…
The implications of a large value of the effective Majorana neutrino mass for a class of two texture zero neutrino mass matrices have been studied in the flavor basis. It is found that these textures predict near maximal atmospheric…
We consider a Markov chain on invertible $n\times n$ matrices with entries in $\mathbb{Z}_2$ which moves by picking an ordered pair of distinct rows and add the first one to the other, modulo $2$. We establish a logarithmic Sobolev…
A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…
We study the cluster-size distribution of supercritical long-range percolation on $\mathbb{Z}^d$, where two vertices $x,y\in\mathbb{Z}^d$ are connected by an edge with probability $\mathrm{p}(\|x-y\|):=p\min(1,\beta\|x-y\|)^{-d\alpha}$ for…
Mixing-via-shearing is a powerful and versatile method for establishing mixing properties of smooth parabolic flows. In its quantitative form, it provides upper bounds on the decay of correlations for sufficiently smooth observables.…
We derive the critical nearest-neighbor connectivity $g_n$ as $3/4$, $3(7-9p_c^{tri})/[4(5-4p_c^{tri})]$, and $3(2+7p_c^{tri})/[4(5-p_c^{tri})]$ for bond percolation on the square, honeycomb and triangular lattice respectively, where…
Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results were proved on rapidly mixing Markov chains on unconstrained,…
The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - \epsilon$, assuming the Unique…