arXiv subjects

Daniel C. Jerison

Publications and source records attributed to Daniel C. Jerison.

5 recordsLinked to original sources

arXiv2026

Connectivity of Districting Metagraphs

In this article, we prove irreducibility results for a family of Markov chains arising in the study of redistricting and detecting gerrymandering. These chains use ReCom moves as their transition mechanism and are commonly employed in Markov chain Monte Carlo methods to generate ensembles of districting plans. Such ensembles are frequently used for outlier analysis, in which a proposed districting map is compared against the ensemble to determine whether it behaves atypically; this methodology often appears in expert testimony in redistricting litigation. We show that when the underlying dual graph is a triangular subset of the triangular lattice with side length 5 or larger, and each district consists of two merged geographic regions, the associated ReCom chain is irreducible. This provides another entry in the very small list of known classes of ReCom chains for which irreducibility has been established. We also demonstrate the fragility of this phenomenon by constructing an infinite family of maps for which the corresponding ReCom chain is not irreducible. Indeed, we produce a districting map that, after implementing a single ReCom move, always yields the same original map. These examples remain structurally close to the triangular lattice: they arise as subdivisions of the triangular lattice, and the resulting graphs have maximum degree at most 8. Finally, we prove irreducibility for a further special case: the ReCom chain on a 3 x n grid graph partitioned into three districts of size n.

math.CO↗

arXiv2019

Quantitative convergence rates for reversible Markov chains via strong random times

Let $(X_t)$ be a discrete time Markov chain on a general state space. It is well-known that if $(X_t)$ is aperiodic and satisfies a drift and minorization condition, then it converges to its stationary distribution $\pi$ at an exponential rate. We consider the problem of computing upper bounds for the distance from stationarity in terms of the drift and minorization data. Baxendale showed that these bounds improve significantly if one assumes that $(X_t)$ is reversible with nonnegative eigenvalues (i.e. its transition kernel is a self-adjoint operator on $L^2(\pi)$ with spectrum contained in $[0,1]$). We identify this phenomenon as a special case of a general principle: for a reversible chain with nonnegative eigenvalues, any strong random time gives direct control over the convergence rate. We formulate this principle precisely and deduce from it a stronger version of Baxendale's result. Our approach is fully quantitative and allows us to convert drift and minorization data into explicit convergence bounds. We show that these bounds are tighter than those of Rosenthal and Baxendale when applied to a well-studied example.

math.PR↗

arXiv2019

A combinatorial criterion for macroscopic circles in planar triangulations

Given a finite simple triangulation, we estimate the sizes of circles in its circle packing in terms of Cannon's vertex extremal length. Our estimates provide control over the size of the largest circle in the packing. We use them, combined with results from [12], to prove that in a proper circle packing of the discrete mating-of-trees random map model of Duplantier, Gwynne, Miller and Sheffield, the size of the largest circle goes to zero with high probability.

math.PR↗

arXiv2019

The Dirichlet problem for orthodiagonal maps

We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals, converges to its continuous counterpart as the mesh size goes to 0. This provides a convergence statement for discrete holomorphic functions, similar to the one obtained by Chelkak and Smirnov for isoradial graphs. We observe that by the double circle packing theorem, any finite, simple, 3-connected planar map admits an orthodiagonal representation. Our result improves the work of Skopenkov and Werness by dropping all regularity assumptions required in their work and providing effective bounds. In particular, no bound on the vertex degrees is required. Thus, the result can be applied to models of random planar maps that with high probability admit orthodiagonal representation with mesh size tending to 0. In a companion paper, we show that this can be done for the discrete mating-of-trees random map model of Duplantier, Gwynne, Miller and Sheffield.

math.PR↗

arXiv2015

Mixing time and eigenvalues of the abelian sandpile Markov chain

The abelian sandpile model defines a Markov chain whose states are integer-valued functions on the vertices of a simple connected graph $G$. By viewing this chain as a (nonreversible) random walk on an abelian group, we give a formula for its eigenvalues and eigenvectors in terms of `multiplicative harmonic functions' on the vertices of $G$. We show that the spectral gap of the sandpile chain is within a constant factor of the length of the shortest non-integer vector in the dual Laplacian lattice, while the mixing time is at most a constant times the smoothing parameter of the Laplacian lattice. We find a surprising inverse relationship between the spectral gap of the sandpile chain and that of simple random walk on $G$: If the latter has a sufficiently large spectral gap, then the former has a small gap! In the case where $G$ is the complete graph on $n$ vertices, we show that the sandpile chain exhibits cutoff at time $\frac{1}{4\pi^{2}}n^{3}\log n$.

math.PR↗