Searcharxiv⌕ Search

arXiv subjects

Jonathan C. Mattingly

Publications and source records attributed to Jonathan C. Mattingly.

At least 37 records · Page 2Linked to original sources
arXiv2021

The Gaussian Structure of the Singular Stochastic Burgers Equation

We consider the stochastically forced Burgers equation with an emphasis on spatially rough driving noise. We show that the law of the process at a fixed time $t$, conditioned on no explosions, is absolutely continuous with respect to the stochastic heat equation obtained by removing the nonlinearity from the equation. This establishes a form of ellipticity in this infinite dimensional setting. The results follow from a recasting of the Girsanov Theorem to handle less spatially regular solutions while only proving absolute continuity at a fixed time and not on path-space. The results are proven by decomposing the solution into the sum of auxiliary processes which are then shown to be absolutely continuous in law to a stochastic heat equation. The number of levels in this decomposition diverges to infinite as we move to the stochastically forced Burgers equation associated to the KPZ equation, which we conjecture is just beyond the validity of our results (and certainly the current proof). The analysis provides insights into the structure of the solution as we approach the regularity of KPZ. A number of techniques from singular SPDEs are employed as we are beyond the regime of classical solutions for much of the paper.

math.PR↗
arXiv2020

Singularities of invariant densities for random switching between two linear ODEs in 2D

We consider a planar dynamical system generated by two stable linear vector fields with distinct fixed points and random switching between them. We characterize singularities of the invariant density in terms of the switching rates and contraction rates. We prove boundedness away from those singularities. We also discuss some motivating biological examples.

math.DS↗
arXiv2020

Non-reversible Markov chain Monte Carlo for sampling of districting maps

Evaluating the degree of partisan districting (Gerrymandering) in a statistical framework typically requires an ensemble of districting plans which are drawn from a prescribed probability distribution that adheres to a realistic and non-partisan criteria. In this article we introduce novel non-reversible Markov chain Monte-Carlo (MCMC) methods for the sampling of such districting plans which have improved mixing properties in comparison to previously used (reversible) MCMC algorithms. In doing so we extend the current framework for construction of non-reversible Markov chains on discrete sampling spaces by considering a generalization of skew detailed balance. We provide a detailed description of the proposed algorithms and evaluate their performance in numerical experiments.

stat.CO↗
arXiv2020

Multi-Scale Merge-Split Markov Chain Monte Carlo for Redistricting

We develop a Multi-Scale Merge-Split Markov chain on redistricting plans. The chain is designed to be usable as the proposal in a Markov Chain Monte Carlo (MCMC) algorithm. Sampling the space of plans amounts to dividing a graph into a partition with a specified number of elements which each correspond to a different district. The districts satisfy a collection of hard constraints and the measure may be weighted with regard to a number of other criteria. The multi-scale algorithm is similar to our previously developed Merge-Split proposal, however, this algorithm provides improved scaling properties and may also be used to preserve nested communities of interest such as counties and precincts. Both works use a proposal which extends the ReCom algorithm which leveraged spanning trees merge and split districts. In this work we extend the state space so that each district is defined by a hierarchy of trees. In this sense, the proposal step in both algorithms can be seen as a "Forest ReCom." We also expand the state space to include edges that link specified districts, which further improves the computational efficiency of our algorithm. The collection of plans sampled by the MCMC algorithm can serve as a baseline against which a particular plan of interest is compared. If a given plan has different racial or partisan qualities than what is typical of the collection of plans, the given plan may have been gerrymandered and is labeled as an outlier.

math.PR↗
arXiv2019

Geometric ergodicity of Langevin dynamics with Coulomb interactions

This paper is concerned with the long time behavior of Langevin dynamics of {\em Coulomb gases} in $\mathbf{R}^d$ with $d\geq 2$, that is a second order system of Brownian particles driven by an external force and a pairwise repulsive Coulomb force. We prove that the system converges exponentially to the unique Boltzmann-Gibbs invariant measure under a weighted total variation distance. The proof relies on a novel construction of Lyapunov function for the Coulomb system.

math.PR↗
arXiv2018

Seemingly stable chemical kinetics can be stable, marginally stable, or unstable

We present three examples of chemical reaction networks whose ordinary differential equation scaling limit are almost identical and in all cases stable. Nevertheless, the Markov jump processes associated to these reaction networks display the full range of behaviors: one is stable (positive recurrent), one is unstable (transient) and one is marginally stable (null recurrent). We study these differences and characterize the invariant measures by Lyapunov function techniques. In particular, we design a natural set of such functions which scale homogeneously to infinity, taking advantage of the same scaling behavior of the reaction rates.

math.PR↗
arXiv2018

Scaling and Saturation in Infinite-Dimensional Control Problems with Applications to Stochastic Partial Differential Equations

We establish the dual notions of scaling and saturation from geometric control theory in an infinite-dimensional setting. This generalization is applied to the low-mode control problem in a number of concrete nonlinear partial differential equations. We also develop applications concerning associated classes of stochastic partial differential equations (SPDEs). In particular, we study the support properties of probability laws corresponding to these SPDEs as well as provide applications concerning the ergodic and mixing properties of invariant measures for these stochastic systems.

math.PR↗
arXiv2018

Smooth invariant densities for random switching on the torus

We consider a random dynamical system obtained by switching between the flows generated by two smooth vector fields on the 2d-torus, with the random switchings happening according to a Poisson process. Assuming that the driving vector fields are transversal to each other at all points of the torus and that each of them allows for a smooth invariant density and no periodic orbits, we prove that the switched system also has a smooth invariant density, for every switching rate. Our approach is based on an integration by parts formula inspired by techniques from Malliavin calculus.

math.DS↗
arXiv2018

Quantifying Gerrymandering in North Carolina

Using an ensemble of redistricting plans, we evaluate whether a given political districting faithfully represents the geo-political landscape. Redistricting plans are sampled by a Monte Carlo algorithm from a probability distribution that adheres to realistic and non-partisan criteria. Using the sampled redistricting plans and historical voting data, we produce an ensemble of elections that reveal geo-political structure within the state. We showcase our methods on the two most recent districtings of NC for the U.S. House of Representatives, as well as a plan drawn by a bipartisan redistricting panel. We find the two state enacted plans are highly atypical outliers whereas the bipartisan plan accurately represents the ensemble both in partisan outcome and in the fine scale structure of district-level results.

physics.soc-ph↗
arXiv2017

Coupling and Decoupling to bound an approximating Markov Chain

This simple note lays out a few observations which are well known in many ways but may not have been said in quite this way before. The basic idea is that when comparing two different Markov chains it is useful to couple them is such a way that they agree as often as possible. We construct such a coupling and analyze it by a simple dominating chain which registers if the two processes agree or disagree. We find that this imagery is useful when thinking about such problems. We are particularly interested in comparing the invariant measures and long time averages of the processes. However, since the paths agree for long runs, it also provides estimates on various stopping times such as hitting or exit times. We also show that certain bounds are tight. Finally, we provide a simple application to a Markov Chain Monte Carlo algorithm and show numerically that the results of the paper show a good level of approximation at considerable speed up by using an approximating chain rather than the original sampling chain.

math.PR↗
arXiv2017

Trajectory stratification of stochastic dynamics

We present a general mathematical framework for trajectory stratification for simulating rare events. Trajectory stratification involves decomposing trajectories of the underlying process into fragments limited to restricted regions of state space (strata), computing averages over the distributions of the trajectory fragments within the strata with minimal communication between them, and combining those averages with appropriate weights to yield averages with respect to the original underlying process. Our framework reveals the full generality and flexibility of trajectory stratification, and it illuminates a common mathematical structure shared by existing algorithms for sampling rare events. We demonstrate the power of the framework by defining strata in terms of both points in time and path-dependent variables for efficiently estimating averages that were not previously tractable.

cond-mat.stat-mech↗
arXiv2017

Ergodicity and Lyapunov functions for Langevin dynamics with singular potentials

We study Langevin dynamics of $N$ particles on $R^d$ interacting through a singular repulsive potential, e.g.~the well-known Lennard-Jones type, and show that the system converges to the unique invariant Gibbs measure exponentially fast in a weighted total variation distance. The proof of the main result relies on an explicit construction of a Lyapunov function. In contrast to previous results for such systems, our result implies geometric convergence to equilibrium starting from an essentially optimal family of initial distributions.

math.PR↗
arXiv2017

Evaluating Partisan Gerrymandering in Wisconsin

We examine the extent of gerrymandering for the 2010 General Assembly district map of Wisconsin. We find that there is substantial variability in the election outcome depending on what maps are used. We also found robust evidence that the district maps are highly gerrymandered and that this gerrymandering likely altered the partisan make up of the Wisconsin General Assembly in some elections. Compared to the distribution of possible redistricting plans for the General Assembly, Wisconsin's chosen plan is an outlier in that it yields results that are highly skewed to the Republicans when the statewide proportion of Democratic votes comprises more than 50-52% of the overall vote (with the precise threshold depending on the election considered). Wisconsin's plan acts to preserve the Republican majority by providing extra Republican seats even when the Democratic vote increases into the range when the balance of power would shift for the vast majority of redistricting plans.

stat.AP↗
arXiv2017

Optimal approximating Markov chains for Bayesian inference

The Markov Chain Monte Carlo method is the dominant paradigm for posterior computation in Bayesian analysis. It is common to control computation time by making approximations to the Markov transition kernel. Comparatively little attention has been paid to computational optimality in these approximating Markov Chains, or when such approximations are justified relative to obtaining shorter paths from the exact kernel. We give simple, sharp bounds for uniform approximations of uniformly mixing Markov chains. We then suggest a notion of optimality that incorporates computation time and approximation error, and use our bounds to make generalizations about properties of good approximations in the uniformly mixing setting. The relevance of these properties is demonstrated in applications to a minibatching-based approximate MCMC algorithm for large $n$ logistic regression and low-rank approximations for Gaussian processes.

stat.CO↗
arXiv2017

Geometric Ergodicity of Two--dimensional Hamiltonian systems with a Lennard--Jones--like Repulsive Potential

In this paper we establish the ergodicity of Langevin dynamics for simple two-particle system involving a Lennard-Jones type potential. To the best of our knowledge, this is the first such result for a system operating under this type of potential. Moreover we show that the dynamics are {\it geometrically} ergodic (have a spectral gap) and converge at a geometric rate. Methods from stochastic averaging are used to establish the existence of a Lyapunov function. The existence of a Lyapunov function in this setting seems resistant to more traditional approaches. This is a corrected version of the article.

math.PR↗
arXiv2017

Redistricting: Drawing the Line

We develop methods to evaluate whether a political districting accurately represents the will of the people. To explore and showcase our ideas, we concentrate on the congressional districts for the U.S. House of representatives and use the state of North Carolina and its redistrictings since the 2010 census. Using a Monte Carlo algorithm, we randomly generate over 24,000 redistrictings that are non-partisan and adhere to criteria from proposed legislation. Applying historical voting data to these random redistrictings, we find that the number of democratic and republican representatives elected varies drastically depending on how districts are drawn. Some results are more common, and we gain a clear range of expected election outcomes. Using the statistics of our generated redistrictings, we critique the particular congressional districtings used in the 2012 and 2016 NC elections as well as a districting proposed by a bipartisan redistricting commission. We find that the 2012 and 2016 districtings are highly atypical and not representative of the will of the people. On the other hand, our results indicate that a plan produced by a bipartisan panel of retired judges is highly typical and representative. Since our analyses are based on an ensemble of reasonable redistrictings of North Carolina, they provide a baseline for a given election which incorporates the geometry of the state's population distribution.

stat.AP↗
arXiv2016

Stochastic switching in infinite dimensions with applications to random parabolic PDEs

We consider parabolic PDEs with randomly switching boundary conditions. In order to analyze these random PDEs, we consider more general stochastic hybrid systems and prove convergence to, and properties of, a stationary distribution. Applying these general results to the heat equation with randomly switching boundary conditions, we find explicit formulae for various statistics of the solution and obtain almost sure results about its regularity and structure. These results are of particular interest for biological applications as well as for their significant departure from behavior seen in PDEs forced by disparate Gaussian noise. Our general results also have applications to other types of stochastic hybrid systems, such as ODEs with randomly switching right-hand sides.

math.PR↗