A polynomial upper bound for the mixing time of edge rotations on planar maps

Strongly mixing smooth planar vector field without asymptotic directions

We use a Voronoi-type tessellation based on a compound Poisson point process to construct a polynomially mixing stationary random smooth planar vector field with bounded nonnegative components such that, with probability one, none of the associated integral curves possess an asymptotic direction.

Weakly mixing smooth planar vector field without asymptotic directions

We construct a planar smooth weakly mixing stationary random vector field with nonnegative components such that, with probability 1, the flow generated by this vector field does not have an asymptotic direction. Moreover, for all individual trajectories, the set of partial limiting directions coincides with those spanning the positive quadrant. A modified example shows that a particle in space-time weakly mixing positive velocity field does not necessarily have an asymptotic average velocity.

平面图度约束定向上马尔可夫链的混合时间

Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs

研究平面图$\alpha$-定向上的上下马尔可夫链的混合时间，证明了在特定四边形图和三角形剖分上存在慢混合，而在最大度至多4的四边形图上快速混合。

A note on mixing times of planar random walks

We present an infinite family of finite planar graphs $\{X_n\}$ with degree at most five and such that for some constant $c > 0$, $$ λ_1(X_n) \geq c(\frac{\log \diam(X_n)}{\diam(X_n)})^2\,, $$ where $λ_1$ denotes the smallest non-zero eigenvalue of the graph Laplacian. This significantly simplifies a construction of Louder and Souto. We also remark that such a lower bound cannot hold when the diameter is replaced by the average squared distance: There exists a constant $c > 0$ such that for any family $\{X_n\}$ of planar graphs we have $$ λ_1(X_n) \leq c (\frac{1}{|X_n|^2} \sum_{x,y \in X_n} d…

On the Variance of the Area of Planar Cylinder Processes Driven by Brillinger-Mixing Point Processes

We study some asymptotic properties of cylinder processes in the plane defined as union sets of dilated straight lines (appearing as mutually overlapping infinitely long strips) derived from a stationary independently marked point process on the real line, where the marks describe thickness and orientation of individual cylinders. Such cylinder processes form an important class of (in general non-stationary) planar random sets. We observe the cylinder process in an unboundedly growing domain $ρK$ when $ρ\to \infty\,$, where the set $K$ is compact and star-shaped w.r.t. the origin ${\bf o}$ bei…

Randomly coloring planar graphs with fewer colors than the maximum degree

We study Markov chains for randomly sampling $k$-colorings of a graph with maximum degree $Δ$. Our main result is a polynomial upper bound on the mixing time of the single-site update chain known as the Glauber dynamics for planar graphs when $k=Ω(Δ/\logΔ)$. Our results can be partially extended to the more general case where the maximum eigenvalue of the adjacency matrix of the graph is at most $Δ^{1-\eps}$, for fixed $\eps > 0$. The main challenge when $k \le Δ+ 1$ is the possibility of "frozen" vertices, that is, vertices for which only one color is possible, conditioned on the colors of it…