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, page 6
$q_x$-Bass Martingales: Optimality, Existence and Convergence
We introduce the class of $q_x$-Bass martingales, extending the notion of $q$-Bass martingales.Sampling from the Sherrington-Kirkpatrick Model up to Criticality
We prove that the simulated annealing algorithm efficiently samples from the Sherrington-Kirkpatrick model at inverse temperature $β< 1$ to an arbitrary inverse polynomial accuracy in total variation.The Singularity Has a Distribution: Exact Timing Laws and Detection Limits for a Stochastic Intelligence Explosion
Automating AI research creates a positive feedback loop between software capability and research effort.Subgaussian Vector Balancing by an Ising Model
We show that the guaranties of the Gram-Schmidt Walk Algorithm of Bansal, Dadush, Garg, and Lovett can be achieved by an Ising model.A Randomized Approximation Algorithm for Doubly Free-Boundary Macdonald Processes
We construct an approximate sampler for finite doubly free-boundary Macdonald rail-yard processes with Macdonald, boundary, and edge parameters in $(0,1)$.A Rate Transfer Method: Convergence Rates in Stochastic Gradient Descent via Stochastic Calculus
We develop a rate-transfer method that converts finite-time Lyapunov estimates for an associated stochastic differential equation (SDE) into finite-time convergence bounds for stochastic gradient…Wong--Zakai Convergence and FNO Learning for Stochastic Volterra Equations
This paper studies Wong--Zakai convergence and Fourier neural operator learning for stochastic Volterra integral equations (SVIEs) describing random systems with memory.With Leverage, the Gambler is Not the One Who Gets Ruined
In this note we explore the following simple question: How does the classic \emph{gambler's ruin} phenomenon change if we allow the gambler \emph{financial leverage}?Classical and Quantum Information Measures Characterizing Convertibility: An Axiomatic Approach
In this PhD thesis, we take an axiomatic approach to studying multivariate divergences, which are measures of the information content of a tuple of classical or quantum states.Graph Matching in Random Geometric Graphs I: Efficient Algorithms
We study the recovery of the hidden vertex correspondence between two correlated dense random geometric graphs.Averaged Annealed Markov Chains Achieve the Algorithmic Threshold for Tensor PCA, Part I: Glauber Dynamics
In the tensor principal components analysis (tensor PCA) problem, we are asked to recover an unknown vector in $\{\pm1\}^N$ from a noisy observation of its $k$-th tensor power, for a fixed $k\ge3$.GROMM: Generative Risk-neutral Option Market Models
We present a statically and dynamically arbitrage-free European option market model with smooth interpolation between option prices, based on the SANOS framework, and prove that its dynamics admit a…Reach-Avoid Certificates for Contact-based Stochastic Hybrid Systems
This work studies certified reach-avoid control of stochastic hybrid systems in which a stochastic differential equation governs continuous flow and a controlled stochastic kernel governs…FirstFit coloring process of random bipartite graphs and an online coloring lower bound in the random order model
FirstFit colors each arriving vertex with the smallest positive integer absent from its previously colored neighborhood.Notes on Uniform Policy Score Bounds and Lipschitz Continuity for Truncated Gaussian, Product Cauchy, Boltzmann, and Softmax Policies
We establish uniform score bounds and Lipschitz continuity for truncated Gaussian, Cauchy, Boltzmann, and softmax policies under explicitly stated parameterizations.Harmonic Reduction of Spin-Coupled Grover Walks on Hypercubes via Quantum Bernoulli Noises
We consider spin-coupled Grover walks on hypercubes within the framework of quantum Bernoulli noises (QBN).DisCo Algebra: Why Disintegration and Combination Are Not Inverses
We present DisCo algebra---a compositional framework for joint probability built from a symmetric cooperad (disintegration) and a symmetric operad (combination) on the bare family…Quantum-assisted rendezvous on hypercubes: a quantum Bernoulli noise approach
We study quantum-assisted balanced rendezvous on the $d$-dimensional hypercube in a one-step two-agent quantum-walk framework, where the two agents move the same Hamming distance and meet at a…Markov Chain Convergence in Kernel-Induced Geometry
We study the convergence of Markov chains in the geometry induced by Hilbertian embeddings associated with positive definite kernels, also called Maximum Mean Discrepancy (MMD).A Stochastic Analysis Perspective on Diffusion Models
Generative modelling involves two complementary tasks: learning a probabilistic approximation of an unknown data distribution from observations, and designing a tractable mechanism for sampling from…