Peer Revenue Fully funded

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics Probability

math.PR Watch Probability (sign in to use)

Thursday 17 September

Probability

Boolean Small-Ball Inequalities for Discrepancy Theory

We prove new small-ball inequalities for boolean matrix-series. The leading example is $\mathbb E_s[{\text{det}(I-S^2)^\beta\,\mathbf 1_{\{\|S\|<1\}}}]\ge e^{-O(\beta\tau)}$, which holds for boolean matrix-series $S=\sum_i s_iA_i$ formed using symmetric matrices $A_1,\dots,A_n$ and uniformly random signs $s\in\{\pm1\}^n$. Specifically, this inequality holds for all $\beta\ge1$ with $\tau=\sum_i\text{Tr} A_i^2$, as soon as the maximum of $(\text{Tr} A_i^2)_{i=1}^n$ and a certain variance term are bounded above by universal constants. The proof combines the Gaussian reciprocal estimate of (Akbas and Sra 2026), the directional-variation signing theorem of (Guo, Fang, and Lu 2026), and a replica argument that turns existence into a Gibbs law on good signings. Most notably, boolean small-ball delivers a new, interlacing-free proof of Kadison-Singer (most general case); it also recovers Matrix Spencer and Komlós as quick corollaries, while yielding more than six almost immediate proofs of an assortment of discrepancy theoretic problems.
Read the full abstract

Probability

Markovian renormalisation for percolation in high-dimension: Semi-decidability of mean field behavior

We develop a new approach to study Bernoulli percolation in dimensions $d>6$. The key idea is to approximate open paths at probability $p'>p$ by a Markov chain of pointed $p$-open clusters. This allows us to transfer sharp information on the two point function from $p$ to $p'$. This inductively gives good asymptotic estimates on the two point function as $p\uparrow p_c$. As a main application, we show that having critical meanfield behavior is a semi-decidable problem. Along the way, we also prove sharp asymptotics for the susceptibility and the average radius of gyration, and prove a local central limit theorem for the slightly subcritical two-point function.
Read the full abstract

Probability

Point process convergence of large inradii of Poisson-Laguerre tessellations

In this paper we study a weighted generalization of the Poisson-Voronoi tessellation called the Poisson-Laguerre tessellation, where the nuclei of the generating Poisson process additionally carry independent non-negative random weights. For each cell we can define its inradius as the radius of the largest ball centered at the nucleus and contained in the cell. We consider point processes of nuclei, weights and inradii, where the nuclei are taken from growing observation windows and the processes are suitably rescaled and shifted to see the behavior of large inradii. We prove convergence in distribution to suitable Poisson processes, obtaining as corollaries the asymptotic behavior of the maximal inradii. Our results cover dimension $d \geq 3$ and bounded random weights, dimension $d = 2$ and random weights with suitable finite exponential moments as well as dimension $d \geq 2$ and random weights following a power-law distribution. Particularly, we observe a different behavior of the Poisson-Laguerre tessellation in the planar and higher dimensional cases when the weights are bounded. The proofs of our results are based on suitable Poisson process approximation techniques and a careful investigation of the geometry of large cells.
Read the full abstract

Probability · Cross-listed from math.AP

Existence of strong initial traces for stochastic conservation laws

We prove existence and uniqueness of a strong initial trace for every bounded kinetic solution of a stochastic scalar conservation law, although no initial value is prescribed and no nondegeneracy condition is imposed on the flux. The core of the proof is pathwise. After fixing a realization, the rescaled stochastic terms and kinetic measure vanish in the blow-up limit, so Panov's compactness argument applies; degenerate flux intervals are handled by recursive dimension reduction. The stochastic setting creates several additional difficulties. The martingale identities must remain valid on one common full-probability set throughout the reductions, which requires a parameterized stochastic-Fubini construction. Moreover, the pathwise trace is not automatically measurable because its exceptional sets may depend on the realization. Deterministic time averages and right-continuity of the filtration yield a jointly measurable initial trace, with local strong convergence along essential times, both almost surely and in mean.
Read the full abstract

All authors Marko Erceg, Kenneth Karlsen, Nikola Konatar, Darko Mitrovic

Probability · Cross-listed from cs.DS

Fast FPRAS for the Permanent

We give an FPRAS for the permanent of an $n\times n$ $0/1$ matrix with running time $\widetilde{O}(n^{3.5}\varepsilon^{-2})$. Our algorithm extends to a strongly polynomial FPRAS for arbitrary nonnegative matrices, as in previous works. Jerrum, Sinclair, and Vigoda (2004) gave the first FPRAS for the permanent of a nonnegative matrix. The running time was subsequently improved to $\widetilde{O}(n^7)$ by Bezáková, Štefankovič, Vazirani, and Vigoda (2008), and recently to $\widetilde{O}(n^6)$ by Chen, Vigoda, and Yang (2026). We introduce a multicommodity-flow bound inspired by electrical flows, replacing the usual path-length factor by routing energy. For a boosted version of the classical JSV chain, we prove a relaxation-time bound of $O(n^3\log n)$ and show that stationary trajectories of this length estimate all stationary hole-pattern probabilities, yielding an $\widetilde O(n^5)$-time FPRAS algorithm. Our new hole-weighted slide (HWS) chain improves both bounds to $O(n^2\log n)$, yielding an $\widetilde O(n^4)$-time algorithm. Finally, we obtain the claimed $\widetilde O(n^{3.5})$ running time by using a subset of $\widetilde{O}(\sqrt{n})$ checkpoint temperatures in an iterated sequence of warm-starts to obtain initializations at every temperature.
Read the full abstract

All authors Xiaoyu Chen, Heng Guo, Eric Vigoda, Xiongxin Yang

Probability

Interpolation of Gaussian Free Fields via Random Matrices

In this paper we construct a two parameter family of generalized Gaussian fields which interpolates between the Gaussian Free Field, conditioned Gaussian Free Fields, and Gaussian Free Fields with independent noise. Depending on the values of the parameters, we characterize these generalized Gaussian fields as partial conditionings of a Gaussian Free Field with perturbations of its first two Fourier modes. We show that this family arises as the fluctuations of the height function associated with the corner process of a two parameter variant of Wigner random matrices.
Read the full abstract

Probability · Cross-listed from math-ph

Phase transitions in non-Hermitian spherical integrals

We study the large-$N$ asymptotics of a constrained spherical integral for non-Hermitian random matrices, in which the norms and mutual scalar product of two vectors are fixed. In the delocalized regime, the asymptotics are governed by the non-Hermitian transforms $\mathcal R_1$ and $\mathcal R_2$. At saddle-point level, the constrained integral exhibits a transition to a localized regime controlled by the largest singular value of a shifted matrix and by the overlap of its associated left and right singular vectors. Motivated by the Hermitian spherical-integral mechanism and by the Coulomb-gas picture, we formulate conjectures for one-eigenvalue large deviations and boundary fluctuations. Throughout, our analysis is carried out in the spirit of mathematical physics.
Read the full abstract

Probability

Almost-Uniform Bayesian Convergence to the Truth Is Not Characterized by Countable Additivity on Conditional Hitting Times

We revisit the analysis of Bayesian convergence to the truth under finite additivity in a recent paper by Nielsen (J. Philos. Logic, 2021, doi:10.1007/s10992-020-09569-2) Its principal theorem proves that the posteriors of a probability function converge to the truth almost uniformly if and only if the function has two properties: an approximation property, and so-called countable additivity on conditional hitting times. We show that the two properties are necessary but not sufficient, so that the theorem is false, and we locate the error in its published proof. We construct a merely finitely additive probability function that has both properties and whose posteriors converge to the truth almost surely but not almost uniformly. Three of the paper's four remaining theorems, and its corollary, lose their published proofs as well, two with the failed implication and two to a separate defect that we also identify. Two of the four results we reprove and one we leave undecided; the last is the corollary, which our counterexample does not refute, and which we establish for a family including the counterexample and leave open in general. We also show that almost-sure convergence of posteriors to the truth for every event does not characterize countable additivity. We close with what a repaired characterization of almost-uniform convergence would have to add.
Read the full abstract

Probability · Cross-listed from math.AP

Stochastic Two-Dimensional Anisotropic Magnetohydrodynamics System with Multiplicative Noise

In this paper, we investigate the stochastic two-dimensional anisotropic magnetohydrodynamics system on $\mathbb T^2$ with velocity dissipation acting only in the horizontal direction. Under multiplicative noise, we prove the existence of global martingale solutions and global probabilistically weak solutions, together with pathwise uniqueness.
Read the full abstract

Probability

The skeleton-blocks decomposition of Bienaymé trees, and applications to their local convergence

We study multi-type critical Bienaymé trees through the lens of the skeleton-blocks structure, seeing them as a monotype skeleton on which we have added multi-type blocks. This decomposition enjoys a remarkably elegant compatibility with the concept of local convergence, allowing us to find simple proofs of traditional local limit theorems.
Read the full abstract

Probability

The Airy line ensemble at the edge of uniform alternating sign matrices

We prove that the height-level path ensemble of a uniform alternating sign matrix converges to the Airy line ensemble near every interior point of the north-west arctic arc. Under the standard bijection, this is equivalently a limit theorem for the osculating paths of the domain-wall six-vertex model at the ice point. The proof has two main inputs. The integrable input is a new Pfaffian formula for rectangular frozen-corner probabilities, from which we obtain one-point convergence of the top path to the GUE Tracy–Widom distribution. The probabilistic input is an exact resampling law and accompanying bridge estimates for a strictly ordered midpoint encoding of the paths; these yield tightness and the Brownian Gibbs property for every subsequential limit. Aggarwal and Huang's strong characterization then identifies each such limit as the Airy line ensemble.
Read the full abstract

Probability

Space-time fractional stochastic Burgers-type equation

We establish the existence and uniqueness of solutions to a $(1+1)$-dimensional fractional stochastic Burgers-type equation featuring a Caputo fractional time derivative, a fractional Laplacian, and space-time white noise forcing modified by a Riemann-Liouville fractional integral. From a physical perspective, equations of this type describe non-Markovian dynamics with long-range temporal and spatial dependencies. The main difficulty is that the solution to the linearized equation has low spatial Hölder regularity, rendering the singular nonlinearity $G(u)\partial_x u$ classically ill-defined. The proof relies on two main ingredients: first, combining the Da Prato-Debussche decomposition with rough path theory to rigorously interpret the nonlinear product; and second, deriving Schauder-type estimates for fractional heat kernels given in terms of slowly decaying Mittag-Leffler functions. The nonlocality of the fractional time derivative requires a strong assumption on the initial condition.
Read the full abstract

Probability

Limit shape for domain-wall six-vertex model

In this note we announce limit shape theorems for the height function of the six-vertex model in the antiferroelectric (for arbitrary $\Delta <-1$) and disordered (in a restricted range $-1 < \Delta \le 1/2$) regimes under domain-wall boundary conditions.

Probability · Cross-listed from math.CO

Fractional expectation thresholds and the "second" Kahn-Kalai conjecture

We show that the uniform probability measure on copies of a nonempty graph $H$ in $K_n$ is $Cq_H\log(2e(H))$-spread, where $q_H$ is its graphic expectation threshold. Consequently, the fractional expectation threshold of $H$ is at most $Cq_H\log(2e(H))$. We remove the logarithmic factor for trees and for graphs whose average degree is at least the logarithm of their maximum degree. This proves the “second” Kahn-Kalai conjecture for these two classes, which encompass most of the standard families studied in random graph containment problems.
Read the full abstract

Probability

Sharp spectral norm concentration of sparse random tensors

We prove a sharp concentration inequality for the spectral norm of sparse random tensors with independent Bernoulli entries. Let $T$ be an order-$k$ tensor of dimension $n\times\cdots\times n$ with independent Bernoulli$(p)$ entries, where $k$ is fixed. For any $c,r>0$, we show that $\|T-\mathbb E T\|\le C_{k,r,c}\sqrt{np}$ with probability at least $1-n^{-r}$ whenever $np\ge c\log n$. We extend this bound to inhomogeneous Bernoulli sampling with deterministic entrywise weights. This removes the logarithmic factor in the work of Zhou and Zhu (2021). The proof follows the Kahn–Szemerédi light–heavy decomposition with a refined estimate on the heavy tuple part. We also obtain a log-free second eigenvalue bound for the random hypergraph model of Friedman and Wigderson (1995).
Read the full abstract

Probability

Copula Operad and Copula Entropy

We construct a symmetric operad $\mathfrak{C}$ on the class of all multivariate copulas, where operadic composition is given by Sklar substitution. We prove that the absolutely continuous subclass $\mathfrak{C}^{ac}$—which coincides with the $L^1$ class of copula densities—forms a suboperad; under composition, the density of the composite copula is given by the explicit Sklar substitution density formula $g(v)=\phi\big(\Psi_1(v^{(1)}),\dots,\Psi_n(v^{(n)})\big)\prod_{k=1}^{n}\psi_{k}(v^{(k)})$. Furthermore, we show that copulas with finite copula entropy—identified with the $L\log L$ class of copula densities—are closed under substitution and hence constitute a suboperad $\mathfrak{C}^{L\log L}$. On this suboperad, copula entropy is strictly additive: $H(\gamma(\Phi;\Psi_{1},\ldots,\Psi_{n}))=H(\Phi)+\sum_{k=1}^{n}H(\Psi_{k})$.
Read the full abstract

Probability

Perturbed Brownian motion reflected at a time-dependent boundary

Let $B$ be a standard Brownian motion, $x\ge 0,\, \nu<1$, and $b:[0,\infty)\to\mathbb R$ is a continuous function locally of finite variation starting from 0. We define the perturbed Brownian motion reflected at the boundary $b$ by establishing strong existence and pathwise uniqueness of a solution to the equation \[ W_t=(1-\nu)x+B_t+\nu M_t(W)+\frac12 L_t^0(W-b), \qquad W_t\ge b(t), \] where $M_t(W):=\sup_{0\le s\le t} W_s$ and the process $L^0(W-b)$ is the semimartingale local time at 0 of the process $W-b$. We give a positive result under condition (PB) on the boundary $b$ : for every $T>0$, the upward increment $\sup_{0\le s<t\le T,\,t-s\le h}(b(t)-b(s))^+ = o(\sqrt{h})$ as $h\downarrow 0$. The proof splits into two regimes: the case $\nu<1/2$ is a consequence of the Skorokhod problem in an orthant proved by [Williams 1995], while the case $\nu\ge 1/2$ combines a deterministic comparison estimate and a logarithmic upper bound on the number of completed round-trips, following the strategy of [Chaumont and Doney 1999]. For $\alpha\in(0,1/2)$, we also construct an increasing $\alpha$-Hölder boundary for which no continuous adapted solution starting from zero exists for any $\nu<1$.
Read the full abstract

Probability · Cross-listed from math.NT

Low moments of automorphic random multiplicative function sums

We determine the order of the low moments of partial sums of random multiplicative functions associated with Euler products of bounded degree whose unitary local parameters satisfy a prime-square cancellation condition, thereby generalizing Harper's seminal work. The result applies to irreducible compact-group representations of unitary or symplectic type, including the higher-rank Sato–Tate model $SU(d)$ and the odd symmetric-power Sato–Tate model $\operatorname{Sym}^{m}SU(2)$.
Read the full abstract

Probability

Parisi Formula for the ground state energy of quantum p-Spin Hamiltonians

Quantum $p$-local spin glass Hamiltonians are natural quantum analogues of the classical spin glass models. We provide an asymptotic characterization of the maximal energy achievable by the product states. We prove that for every $p \ge 2$, the limit of ground state energy exists and is given by a Parisi-type variational formula. This settles a question left open by Anschuetz et. al. (2025). The variational formula also recovers the known large-$p$ asymptotics as a consequence. Finally, we prove that the limiting product state energy is universal for a broad class of non-Gaussian interactions.
Read the full abstract

Probability

Inhomogeneous Long-Range First-Passage Percolation in a Random Vertex Environment

We study inhomogeneous long-range first-passage percolation on $\mathbb{Z}^d$ with edge passage times $\lVert x-y\rVert^\alpha\omega_{xy}/(V_xV_y)$, where vertex weights have polynomial upper-tail exponent $\gamma$ and edge noises have polynomial lower-tail exponent $\theta$ at zero. The model interpolates between long-range first-passage percolation and scale-free percolation and exhibits competition between reusable heavy-vertex hubs and pair-specific small-noise bridges. We conjecture an eight-regime phase diagram, organized into five growth phases governed by $q_{\rm hub}=d/\gamma$ and $q_{\rm edge}=d/\theta$. For $T_n=T(0,\lceil nx\rceil)$, we prove upper bounds of the conjectured order in every regime and matching lower bounds in phases I and II. Specifically, $T_n=0$ a.s. when $\alpha<q_{\rm hub}\vee q_{\rm edge}$, while $T_n=\Theta_{\mathbb{P}}(1)$ when $q_{\rm hub}\vee q_{\rm edge}<\alpha<2q_{\rm hub}$. In the edge-dominated intermediate regime, $T_n=O_{\mathbb{P}}((\log n)^{\Delta_{\rm III}+\varepsilon})$, where $\Delta_{\rm III}=\log 2/\log(2q_{\rm edge}/\alpha)$. The two power-law regimes satisfy $T_n=O_{\mathbb{P}}(n^{\alpha-2q_{\rm hub}+\varepsilon})$ and $T_n=O_{\mathbb{P}}(n^{\alpha-2q_{\rm edge}+\varepsilon})$, and the linear regime satisfies $T_n=O_{\mathbb{P}}(n)$. All upper bounds are constructive, based on hub-chain and binary edge-bridge multiscale constructions.
Read the full abstract

Probability · Cross-listed from cs.IT

Maximum Entropy Probability Distributions on Spheres with Fixed Mean Busemann Function and Holomorphic-Information-Geometric Model of Cognition

In the first half of the paper we revisit the question regarding MaxEnt probability distributions on spheres. We derive families of MaxEnt distributions on spheres in real and complex vector spaces with fixed expected Busemann function (energy). As a particular case, we deduce sub-families on canonical energy levels where inverse temperature equals the dimension of the sphere. In the second part we focus on the information manifold of canonical MaxEnt distributions on the sphere in the complex vector space. This manifold is isomorphic to the Bergman ball. We introduce the reproducing kernel on this manifold and use the RKHS theory to elaborate the model of cognition. In particular, we state the principle of minimal cognitive effort in RKHS and demonstrate its dual relationship with the MaxEnt principle for probability distributions on the boundary sphere.
Read the full abstract

Probability

Monte Carlo Approximations of Time-Nonlocal Diffusions in Bounded Domains

We develop and analyze a Monte Carlo method for sampling killed anomalous diffusions obtained by time-changing Brownian motion with drift by the inverse of a subordinator. The method targets probabilistic representations of time-nonlocal, including time-fractional, Cauchy–Dirichlet problems on bounded domains. Since inverse subordinators can be sampled exactly in broad classes, while Brownian exit times are generally unavailable in arbitrary domains, we approximate the killed Brownian component by an Euler scheme with discrete boundary detection. We prove a square-root weak error bound with explicit dependence on the Laplace exponent of the subordinator, and derive mean-square and central limit results for the resulting Monte Carlo estimator. A numerical example in the disk and one in a high-dimensional anisotropic shell illustrate the theoretical rates, computation time, and the mesh-free character of the method.
Read the full abstract

All authors Ivan Biočić, Daniel E. Cedeño-Girón, Aleksandar Mijatović, Bruno Toaldo

Probability · Cross-listed from math.AP

Multidimensional fractional material derivative

We analyze a nonlocal operator in space and time, called the multidimensional fractional material derivative. We derive its pointwise representation, which allows us to study its other properties. We define an inverse operator, called fractional material integral, and derive its pointwise representation. Furthermore, we analyze a class of linear partial differential equations, which corresponds to deterministic descriptions of the scaling limits of multidimensional Lévy walks, in which transport is driven by a multidimensional fractional material derivative with a speed vector integrated with respect to a suitable probability measure and a distributional source term. Using Fourier-Laplace transform techniques and a direct convolution-kernel construction, we prove the existence and uniqueness of exponentially bounded measure solutions for measure data. Moreover, we identify a necessary and sufficient condition on the source term for conservation of unit mass and provide separate sufficient conditions for non-negativity and weak convergence to $\delta_0$.
Read the full abstract

Probability · Cross-listed from stat.ME

Parameter Estimation for the Mixed Fractional Merton Jump Diffusion Model with EM Algorithm

This paper proposes an Expectation–Maximization algorithm with Metropolis–Hastings sampling for parameter estimation in a Mixed Fractional Merton Jump Diffusion model. The model combines fractional Brownian motion to capture long-range dependence with a compound Poisson jump process to describe abrupt movements in financial returns. The latent jump process is inferred during the E-step using Markov Chain Monte Carlo sampling, while the M-step updates the model parameters by maximizing the expected complete-data likelihood. The consistency and asymptotic normality of the proposed estimator are established under suitable regularity conditions. The methodology is applied to the Helsinki Stock Index (OMXH25). The proposed estimation framework provides a reliable and computationally efficient approach for modeling financial time series exhibiting both long-memory dependence and jump behavior.
Read the full abstract

All authors Chidiogo Joy Agboeke, Hamidreza Maleki Almani, Dario Gasbarra, Foad Shokrollahi, Tommi Sottinen

Probability

An invariant variational proof for canonical processes with independent symmetric log-concave tails

We prove a prescribed-index-law comparison for canonical processes with independent symmetric coordinates having log-concave tails, with no doubling assumption

Probability

Limit theorems for the one-dimensional parabolic Anderson model with white noise potential

We consider the parabolic Anderson model $\partial_t u=\partial_x^2 u+\xi u$ on $\mathbb{R}_+\times\mathbb{R}$ with $u(0,\cdot)\equiv 1$, where $\xi$ is a spatial white noise. We study the long-time behavior of the spatial integral $U(t):=\int_{-L(t)/2}^{L(t)/2}u(t,x)\,dx$, where $L(t)=\exp(\alpha^3 t^3/24)$ with $\alpha>0$. We establish a weak law of large numbers for $\alpha>1$ and a central limit theorem for $\alpha>2$. Moreover, for every $\alpha\in(0,2)$, we show that $U(t)$ converges in distribution, after explicit centering and scaling, to a totally asymmetric $\alpha$-stable law. To the best of our knowledge, these are the first stable limit laws for the continuous parabolic Anderson model. In addition, we establish two spectral results of independent interest for the one-dimensional Anderson Hamiltonian on a growing interval. They are the main ingredients of the proofs. The first gives the lower-tail asymptotics of the lowest eigenvalue, including the exact prefactor. The second shows that, on this lower-tail event, the $L^1$ norm of the corresponding eigenfunction concentrates around an explicit deterministic value.
Read the full abstract

Probability

Sudakov minoration for weighted Orlicz balls

We give a proof of a universal Sudakov minoration principle for measures based on wighted Orlicz balls.

Probability · Cross-listed from math.OC

Percolation Markov Decision Processes

We study Percolation Markov Decision Processes (PMDPs), in which the decision maker repeatedly moves a token through the d-dimensional integer lattice with deterministic transitions and random payoffs assigned to the edges. Payoffs are revealed before the beginning of the decision process and the decision maker aims to maximize the average accumulated payoff over a fixed horizon. We establish the existence of the uniform value (as the horizon tends to infinity) and 0-optimal strategies. In the particular case of Bernoulli payoffs, we establish continuity results for the uniform value. We also present several one-dimensional examples to illustrate that optimal strategies may be very complex. Then, we introduce a dimensional lifting property that allows PMDPs to be approximated by PMDPs of lower dimension and could be used to approximate critical probability thresholds in percolation theory.
Read the full abstract

Probability · Cross-listed from cs.PF

Whittle index approach to multi-server scheduling with convex delay costs and impatient customers

We consider the dynamic scheduling problem in a multi-class M/G/N + M queue with convex delay costs and impatient customers that have exponential abandonment times. We apply the Whittle index approach to find a reasonable heuristic solution for this tricky problem. By assuming exponential abandonment times, we are able to make a very straightforward use of the results of the corresponding problem with patient customers presented in Queueing Systems, Vol. 110, Article no. 2, 2026. Our main theoretical achievements are proving that the closed version of the corresponding discrete-time problem is indexable and deriving an explicit expression for the Whittle index. The discrete-time results are utilized to develop the Whittle index policy for the original continuous-time scheduling problem.
Read the full abstract

Probability

Convergence of Densities for the Euler–Maruyama Approximation of Brownian-Driven McKean–Vlasov Equations

Convergence of the transition density of the Euler-Maruyama scheme for a Brownian-driven McKean-Vlasov stochastic differential equation is established, the coefficients being uniformly elliptic, spatially smooth, and Lipschitz with respect to the law in the 2-Wasserstein distance. The density p_n of the n-step scheme is shown to converge to the density p of the McKean-Vlasov equation in a Gaussian-weighted supremum norm at rate O(n^{-1/2}), that is, of order one half in the step size, and hence also uniformly in space. The proof develops a discrete parametrix (Levi-Hadamard) expansion for the Euler chain and compares it with the continuous parametrix of the limiting equation along a hierarchy of measure-flow, time-discretisation and lattice corrections; the discrepancy between the discrete and the continuous measure flows is of order O(n^{-1/2}) in the 2-Wasserstein distance and does not degrade the final rate.
Read the full abstract