Probability & Statistics · Mathematics & Statistics
Probability
The newest papers in Probability that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
298 papers, from 31 August 2026 to 5 November 2026: 270 arXiv preprints and 28 OpenAlex records.
Get the few papers worth your time in Probability every morning.
Follow Probability and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers
Low-Temperature Sampling via Equilibrium Disagreements
We develop a new framework for sampling at low temperatures using Glauber dynamics.Tusnády's problem and online two-sample thinning
We determine the sharp order of discrepancy in Tusnády's problem in every fixed dimension $d\ge 2$.Near linear mixing of random-cluster Glauber dynamics on random regular graphs
We study the random-cluster model on locally treelike graphs at low temperatures.Functional inequalities from the fundamental limits of Bayesian estimation
We develop a Bayesian information-theoretic framework for proving functional inequalities for log-concave measures.Can a self-sustaining chemical network emerge due to just a few catalysts?
Understanding how self-sustaining chemical reaction networks can emerge from simple molecules is an important question in chemical approaches to the origin of life.CARM: Conformal Adaptive Risk Masking for Reliable Scientific Super-Resolution
Deep learning-based super-resolution (SR) can reconstruct fine-scale Earth-observation fields from coarse observations, but reconstruction accuracy alone does not provide a calibrated rule for…A general technique for explicit quantile representations
This work proves existence of contours independent of probability level for exact quantile integrals of strictly positive real-analytic densities.Necessary and sufficient conditions for the martingale property of stochastic exponentials driven by multi-dimensional diffusions
We give necessary and sufficient coefficient conditions for stochastic exponentials driven by multidimensional diffusions to be true martingales.A Survey of Nonlinear Filtering Methods for Data Assimilation and Recent Advances in Generative AI-Enabled Score Filters
Many real-world applications, such as numerical weather prediction or wildfire tracking, involve modeling highly nonlinear dynamical systems that are chaotic and influenced by various sources of…State Evolution and Universality of Iterated Linear Programs for the Binary Perceptron
The binary perceptron is a random constraint satisfaction problem that asks for a sign vector satisfying a system of random linear inequalities.A Bayesian-Geometric Reading of Classical Model-Based Optimal Design
The classical model-based optimal design criteria (D-, T-, L-, C-, and A-optimality) are usually motivated via the Cramér--Rao bound as optimizing scalar functions of the Fisher information matrix…Glauber Dynamics for Sampling Colorings: Rapid Mixing above $(1+1/\mathrm{e})Δ$ via Hidden Hard-Core Models
We show that for every $γ>0$ and every sufficiently large $Δ$, the Glauber dynamics for proper $q$-colorings of any $n$-vertex graph of maximum degree $Δ$ has spectral gap $Ω_γ(1/n)$, and hence…Deep Neural Operator Learning for stochastic heat equations and applications
In this paper, we establish a universal approximation theorem for solution operators of semilinear stochastic heat equations in spatial dimension \(d\ge2\), extending deep neural operator…A Random Matrix Analysis of Symmetric Tensor Unfolding
We study a fundamental problem in machine learning: partial recovery of a planted signal $\boldsymbol{v} \in \mathbb{S}^{n-1}$ from a spiked tensor $\boldsymbol{\mathsf{X}} = λ\…Beyond the Bochner Method: Optimal Spectral Gaps for Block Dynamics of Spin Systems like the $O(N)$ Model
Let $μ$ be a probability distribution on a spin system with $n$ sites and possibly infinite spin spaces.A Fully Polynomial Approximation Algorithm for the Sherrington-Kirkpatrick Model
Montanari's incremental approximate message passing (IAMP) algorithm [FOCS 2019; SIAM J. Comput., 2025] and the zero-temperature formulation of El Alaoui, Montanari and Sellke (AMS) [Ann.Fine-Grained Complexity Across the Computational Phase Transition
How does a computational problem transition from easy to hard?On a Class of Non-Local Elliptic-Transport Systems in Score-Guided Probability Flow on $SE(3)$: Score-Singularity Resolution, Space-Time ADN Shift, and Markov Mean-Field Games
We establish mathematical foundations for optimal spatiotemporal vector fields governing continuous score-guided probability flows over bounded submanifolds $M \subset SE(3)$ on the Special…Online Algorithms Cannot Find Isolated Perceptron Solutions
The binary perceptron problem asks for a length-$n$ sign vector in the intersection of $\lfloor αn\rfloor$-many independent random Gaussian half-spaces.Lee-Yang theorems for $q$-deformed oscillators and doubly-scaled SYK
We show that the vacuum partition function of the $q$-deformed oscillator \[ L_q(z):= \langle0|e^{zT_q}|0\rangle, \qquad T_q := \mathsf{a}_q + \mathsf{a}_q^* \] satisfies the Lee-Yang property…