相关论文: Long Range Percolation Mixing Time
Classical spectral graph theory characterizes graphs with logarithmic mixing time. In this work, we present a combinatorial characterization of graphs with constant mixing time. The combinatorial characterization is based on the small-set…
Consider independent long range percolation on $\mathbf{Z}^2$, where horizontal and vertical edges of length $n$ are open with probability $p_n$. We show that if $\limsup_{n\to\infty}p_n>0,$ then there exists an integer $N$ such that…
For two independent Erd\H{o}s-R\'enyi graphs $\mathbf G(n,p)$, we study the maximal overlap (i.e., the number of common edges) of these two graphs over all possible vertex correspondence. We present a polynomial-time algorithm which finds a…
The spectral gap $\gamma$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to…
A simple way to sample a uniform triangulation of the sphere with a fixed number $n$ of vertices is a Monte-Carlo method: we start from an arbitrary triangulation and flip repeatedly a uniformly chosen edge. We give a lower bound in…
Given $\omega\ge 1$, let $Z^2_{(\omega)}$ be the graph with vertex set $Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most $\omega$ in the other. (Thus $Z^2_{(1)}$ is precisely $Z^2$.) Let…
We consider a long-range percolation graph on $\mathbb Z^d$ where, in addition to the nearest-neighbor edges of $\mathbb Z^d$, distinct $x,y\in\mathbb Z^d$ are connected by an edge independently with probability asymptotic to…
Through a Metropolis-like algorithm with single step computational cost of order one, we build a Markov chain that relaxes to the canonical Fermi statistics for k non-interacting particles among m energy levels. Uniformly over the…
It is known that many different types of finite random subgraph models undergo quantitatively similar phase transitions around their percolation thresholds, and the proofs of these results rely on isoperimetric properties of the underlying…
We consider tilings of a closed region of the Kagome lattice (partition of the plane into regular hexagons and equilateral triangles such that each edge is shared by one triangle and one hexagon). We are interested in the rate of…
We study reversible polymerization of rings. In this stochastic process, two monomers bond and as a consequence, two disjoint rings may merge into a compound ring, or, a single ring may split into two fragment rings. This…
We consider oriented long-range percolation on a graph with vertex set $\mathbb{Z}^d \times \mathbb{Z}_+$ and directed edges of the form $\langle (x,t), (x+y,t+1)\rangle$, for $x,y$ in $\mathbb{Z}^d$ and $t \in \mathbb{Z}_+$. Any edge of…
The splitting processes of bremsstrahlung and pair production in a medium are coherent over large distances in the very high energy limit, which leads to a suppression known as the Landau-Pomeranchuk-Migdal (LPM) effect. We continue study…
We describe infinite clusters which arise in nearest-neighbour percolation for so-called cocycle measures on the square lattice. These measures arise naturally in the study of random transformations. We show that infinite clusters have a…
The splitting processes of bremsstrahlung and pair production in a medium are coherent over large distances in the very high energy limit, which leads to a suppression known as the Landau-Pomeranchuk-Migdal (LPM) effect. We analyze the case…
Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of techniques to estimate their mixing time. In this paper, we study the mixing time of random walks in dynamic random environments. To that end,…
We prove the one-dimensional almost sure invariance principle with essentially optimal rates for slowly (polynomially) mixing deterministic dynamical systems, such as Pomeau-Manneville intermittent maps, with H\"older continuous…
We present a 1.8334-approximation algorithm for Vertex Cover on string graphs given with a representation, which takes polynomial time in the size of the representation; the exact approximation factor is $11/6$. Recently, the barrier of 2…
An anisotropic random barrier model is presented, in which the transition probabilities in different directions have different probability density functions. At low temperatures, the anisotropic long--time diffusion coefficients, obtained…
The similarities between string percolation and Glasma results are emphasized, special attention being paid to rapidity long range correlations, ridge structure and elliptic flow. As the string density of high multiplicity pp collisions at…