Jonathan C. Mattingly
Finance · 2001–2013
A researcher in the Science corpus: 12 papers; trusts 31 researchers and is trusted by 82 researchers here, as inferred from the citation graph.
Subfields
- Finance — 37 citations into it; #313 of 10,547 by trust here, #860 by citations
- Statistics and Probability — 35 citations into it; #1,195 of 13,188 by trust here, #1,524 by citations
- Mathematical Physics — 34 citations into it; #870 of 8,596 by trust here, #1,115 by citations
- Applied Mathematics — 24 citations into it; #515 of 7,714 by trust here, #796 by citations
- Control and Systems Engineering — 18 citations into it; #252 of 8,519 by trust here, #815 by citations
- Probabilistic & Bayesian Methods — 15 citations into it
- Computational Theory and Mathematics — 13 citations into it; #7,219 of 12,489 by trust here, #7,025 by citations
- Statistical and Nonlinear Physics — 9 citations into it; #418 of 10,175 by trust here, #1,866 by citations
Whom Jonathan C. Mattingly trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Sergei B. Kuksin
- Gareth O. Roberts
- Sean P. Meyn
- Martin Hairer
- Armen Shirikyan
- Tim Hesterberg
- Mylene B'edard
- Richard L. Tweedie
- Jeffrey S. Rosenthal
- Andrew M. Stuart
Who trusts Jonathan C. Mattingly overall
- Martin Hairer
- Arnaud Debussche
- Andreas Eberle
- Tomasz Komorowski
- C. Odasso
- Michael Röckner
- Oleg Butkovsky
- Charles-Edouard Br'ehier
- Andrew M. Stuart
- Arnaud Guillin
Papers from Jonathan C. Mattingly's perspective
Ordered by how strongly the researchers Jonathan C. Mattingly trusts endorse each paper. Same corpus, a different order for every researcher.
- Markov Chains and Stochastic Stability
- Markov Processes: Characterization and Convergence
- QUANTITATIVE CONVERGENCE RATES OF MARKOV CHAINS: A SIMPLE ACCOUNT
- Optimal scaling of discrete approximations to Langevin diffusions
- Lectures on the Coupling Method
- Weak convergence of Metropolis algorithms for non-i.i.d. target distributions
- Monte Carlo Sampling Methods Using Markov Chains and Their Applications
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Quantitative bounds on convergence of time-inhomogeneous Markov chains
- Renewal theory and computable convergence rates for geometrically ergodic Markov chains
Their papers
- Diffusion limits of the random walk metropolis algorithm in high dimensions (2010) — 118 citations
- Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise (2002) — 680 citations
- Yet Another Look at Harris’ Ergodic Theorem for Markov Chains (2008) — 418 citations
- Ergodicity for the Navier‐Stokes equation with degenerate random forcing: Finite‐dimensional approximation (2001) — 141 citations
- Asymptotic coupling and a general form of Harris’ theorem with applications to stochastic delay equations (2009) — 323 citations
- A Theory of Hypoellipticity and Unique Ergodicity for Semilinear Stochastic PDEs (2008) — 167 citations
- Sensitivity to switching rates in stochastically switched odes (2013) — 47 citations
- Sticky central limit theorems on open books (2012) — 109 citations
- Propagating Lyapunov functions to prove noise-induced stabilization (2011) — 54 citations
- Spectral gaps in Wasserstein distances and the 2D stochastic Navier–Stokes equations (2006) — 218 citations
- Ergodicity of the 2D Navier-Stokes equations with degenerate stochastic forcing (2004) — 640 citations
- Exponential Convergence for the Stochastically Forced Navier-Stokes Equations and Other Partially Dissipative Dynamics (2002) — 183 citations