Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Probability

2,743 missions · 1,549 completed

Missions

Open1194Completed1549All2743
Functional AnalysisStochastic Systems·Captain: mikedeng1

Affine Processes on Positive Semidefinite Matrices III: For d ≥ 2, a Markov Family Is Infinitely Decomposable Iff It Is Affine with Zero Diffusion Iff It Is Affine and Infinitely DivisibleResearch Paper

Affine processes are Markov processes whose Laplace transform depends exponential-affinely on the initial state. On the cone Sd+S_d^+Sd+​ of positive semidefinite matrices they model stochastic covariance matrices in multivariate stochastic volatility, interest-rate and credit models. Examples include the Wishart process of Bru (Bru 1991) and Ornstein–Uhlenbeck…

13 thms1 active userReviewed
Partial Differential Equations·Captain: mikedeng1

An Optimal Variance Estimate in Stochastic Homogenization of Discrete Elliptic Equations: Scale-L Averages of the Approximate-Corrector Energy Density Have Variance ≲ L^−d, Times (ln T)^q if d = 2Research Paper

A random conductance model puts a random conductivity on every edge of the lattice Zd\mathbb Z^dZd. It is the simplest discrete model of diffusion in a heterogeneous medium, and its generator is the generator of a random walk in a random environment. Classical stochastic homogenization shows that on large scales the random operator behaves like a…

17 thms1 active userReviewed
Linear algebraRandom Matrix Theory·Captain: mikedeng1

Random Matrices: Universality of ESDs and the Circular Law 2: The ESD of A_n/√n Converges to μ iff the Normalized Log-Determinants of A_n/√n − zI Converge to μ's Log-Potential for a.e. zResearch Paper

The eigenvalues of a large non-Hermitian random matrix are hard to study directly. For Hermitian matrices, the empirical spectral distribution (ESD) is controlled by the resolvent and the Stieltjes transform, both stable under small perturbations. For non-Hermitian matrices no such tool exists: eigenvalues can move a long way under tiny perturbations, and…

10 thms1 active userReviewed
Linear algebraRandom Matrix Theory·Captain: mikedeng1

Random Matrices: Universality of ESDs and the Circular Law 1: For i.i.d. Zero-Mean Unit-Variance Entries, the ESD of (M_n + X_n)/√n Does Not Depend on the Entry Distribution in the LimitResearch Paper

The eigenvalues of a large random matrix with independent entries follow deterministic limiting laws. For non-Hermitian matrices with i.i.d. entries of mean zero and variance one, the circular law asserts that the eigenvalues of 1nXn\frac1{\sqrt n}X_nn​1​Xn​ become uniformly distributed on the unit disk. These laws are used across statistics (covariance and…

17 thms1 active userReviewed
Markov ChainReinforcement LearningStochastic Systems·Captain: mikedeng1

On Actor-Critic Algorithms: Convergence of Actor-Critic Algorithms with TD(1) and TD(λ) Critics on Finite MDPsResearch Paper

Reinforcement-learning methods for Markov decision processes split into critic-only methods, which learn an approximate value function and act greedily with respect to it, and actor-only methods, which adjust a parameterized policy along a simulated estimate of the gradient of its performance. Critic-only methods with function approximation can fail to…

14 thms1 active userReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Is Network Traffic Approximated by Stable Lévy Motion or Fractional Brownian Motion? 2: Superposed ON/OFF Input Under Slow Growth Converges (fidi) to α-Stable Lévy MotionResearch Paper

Measurements of Ethernet and Web traffic in the 1990s showed burstiness at every time scale, long-range dependence, and file sizes and transmission times with tails like x−αx^{-\alpha}x−α, 1<α<21<\alpha<21<α<2 (Leland, Taqqu, Willinger and Wilson, 1994; Crovella and Bestavros, 1997). The standard explanation models each user as an ON/OFF source that alternates between…

13 thms1 active userReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Is Network Traffic Approximated by Stable Lévy Motion or Fractional Brownian Motion? 3: Infinite Source Poisson Input Under Fast Growth Converges in (D[0,∞), J₁) to Fractional Brownian MotionResearch Paper

Measurements of Ethernet and Internet traffic in the 1990s showed that cumulative traffic is self-similar and long-range dependent: correlations of the input rate decay so slowly that they are not summable, and fluctuations at large time scales do not average out the way Poisson-type models predict. A widely accepted explanation is that the lengths of…

13 thms1 active userReviewed
StatisticsStochastic Systems·Captain: mikedeng1

Do Price and Volatility Jump Together?: The Observable Jump–Volatility Statistics U(F, kₙ) Converge in Probability to U(F) in the Skorokhod TopologyResearch Paper

Asset prices observed at high frequency show two kinds of discontinuity: jumps in the price itself and abrupt changes in its volatility. Whether the two occur at the same times matters for modelling. Many stochastic volatility models used in option pricing let the price and the volatility jump together (for example the affine jump-diffusion models of…

14 thms1 active userReviewed
Graph TheoryMathematical Physics·Captain: mikedeng1

Ising Models on Locally Tree-Like Graphs 1: On Uniformly Sparse Locally Tree-Like Graphs the Ising Free Entropy Density Converges to the Bethe PredictionResearch Paper

The ferromagnetic Ising model is the basic model of statistical mechanics for interacting binary variables. On a finite graph it is a probability distribution over spin configurations, and its normalizing constant, the partition function, encodes the thermodynamics: the free entropy per vertex determines the magnetization, the correlations, and the location…

27 thms1 active userReviewed
Markov ChainStochastic Systems·Captain: mikedeng1

Random Walks in a Random Environment 2: lim X_n/n = (1 − Eσ)/(1 + Eσ) if Eσ < 1, −(1 − E(σ⁻¹))/(1 + E(σ⁻¹)) if E(σ⁻¹) < 1, and 0 OtherwiseResearch Paper

A random walk in a random environment is a walk whose step probabilities are sampled once at each site and then reused whenever the walk returns there. Repeated visits therefore reveal the same local bias instead of drawing a fresh probability. This makes the walk different from an ordinary random walk with a single averaged step probability. Solomon's 1975…

8 thms1 active userReviewed
Markov ChainStochastic Systems·Captain: mikedeng1

The Two-Parameter Poisson–Dirichlet Distribution Derived from a Stable Subordinator 6: n·Y_n → (1 − α)/α Almost Surely under PD(α, θ)Research Paper

In a population divided into many species, a ranked frequency VnV_nVn​ is the fraction belonging to the nnnth most common species. The Poisson–Dirichlet distribution is a model for such random ranked frequencies. It also arises from ranked jumps of a stable subordinator, which gives the model its connection to random interval partitions. Pitman and Yor's 1997…

8 thms1 active userReviewed
Control TheoryConvex Optimization·Captain: mikedeng1

Convex Duality in Constrained Portfolio Optimization II: The Dual Problem Attains Its Infimum, So an Optimal Constrained Portfolio–Consumption Pair Exists for Every Initial CapitalResearch Paper

Portfolio decisions in continuous time must respect both market uncertainty and investment restrictions. A ban on short sales, for example, restricts the vector of wealth fractions a trader may hold at every instant. The corresponding optimal consumption and investment problem is harder than its unrestricted counterpart because a candidate portfolio…

15 thms1 active userReviewed
Stochastic Systems·Captain: mikedeng1

Weak Limit Theorems for Stochastic Integrals and Stochastic Differential Equations: Under C2.2(i), (Xₙ, Yₙ) ⇒ (X, Y) in the Skorohod Topology Implies (Xₙ, Yₙ, ∫Xₙ dYₙ) ⇒ (X, Y, ∫X dY)Research Paper

Many approximation results in probability and operations research take the form of a sequence of discrete or jump-driven systems converging to a diffusion or another limit process. When the approximating systems are written as stochastic integral equations, Xn(t)=Xn(0)+∫0tσ(Xn(s−)) dYn(s)X_n(t) = X_n(0) + \int_0^t \sigma(X_n(s-))\,dY_n(s)Xn​(t)=Xn​(0)+∫0t​σ(Xn​(s−))dYn​(s), the key step is to show that the stochastic…

15 thms1 active userReviewed
Control TheoryConvex Optimization·Captain: mikedeng1

Convex Duality in Constrained Portfolio Optimization I: Financibility, Minimality, Dual Optimality and Parsimony of an Auxiliary Market Are Equivalent and Yield the Optimal Constrained PolicyResearch Paper

An investor in a continuous-time market chooses, at every instant, how to split wealth between a bond and ddd stocks and how fast to consume, so as to maximize expected utility of consumption and terminal wealth. Without constraints on the portfolio, this problem was solved by the martingale method: Pliska (1986), Karatzas, Lehoczky and Shreve (1987) and Cox…

21 thms1 active userReviewed
Machine LearningStatistics·Captain: mikedeng1

Optimal Rates for the Regularized Least-Squares Algorithm III: Against Every Algorithm, a Single Distribution in P(b, c) Keeps the Expected Excess Risk above ℓ^(−cB/(cB+1)) for B > b (Theorem 3)Research Paper

Regularized least squares (RLS) in a reproducing kernel Hilbert space is a basic estimator of nonparametric regression and of kernel-based learning. Its learning rate is the speed at which the expected excess risk goes to zero as the sample size ℓ\ellℓ grows. A rate is useful only if it is known to be optimal, and optimality is a lower-bound statement about…

8 thms1 active userReviewed
Machine LearningStatistics·Captain: mikedeng1

Optimal Rates for the Regularized Least-Squares Algorithm II: No Learning Algorithm Converges Faster than ℓ^(−bc/(bc+1)) Uniformly over P(b, c) — the Minimax Lower Rate (Theorem 2)Research Paper

Regularized least squares (RLS), also called kernel ridge regression, is one of the standard estimators of statistical learning: given a sample of input–output pairs, it fits a function from a reproducing kernel Hilbert space by minimizing the empirical squared error plus a multiple of the squared norm. Caponnetto and De Vito (FoCM 2007) proved that, over a…

7 thms1 active userReviewed
Functional AnalysisMachine LearningStatistics·Captain: mikedeng1

Optimal Rates for the Regularized Least-Squares Algorithm I: With λ Tuned to the Effective Dimension, Regularized Least Squares Attains the Rate ℓ^(−bc/(bc+1)) Uniformly over P(b, c) (Theorem 1)Research Paper

Regularized least squares (RLS, also called kernel ridge regression or Tikhonov regularization) is the simplest learning algorithm built on a reproducing kernel Hilbert space. Given ℓ\ellℓ examples (xi,yi)(x_i,y_i)(xi​,yi​) drawn independently from an unknown distribution ρ\rhoρ, it returns the function in a hypothesis space H\mathcal HH that minimizes the empirical squared…

9 thms1 active userReviewed
Control TheoryDynamic Programming·Captain: mikedeng1

Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey 5: Canonical Triplets Are Exactly the Solutions of the Coupled Optimality EquationsResearch Paper

A controlled Markov process run under the long-run average cost criterion asks for a policy minimizing the asymptotic cost per stage. When every stationary policy induces a single recurrent class, the optimal average cost is a constant and is characterized by one equation, the average cost optimality equation (ACOE). In general it is not: under some…

6 thms1 active userReviewed
Control TheoryMathematical PhysicsOptimization+2·Captain: mikedeng1

Optimization of Mean-field Spin Glasses III: The Lagrangian Value of the Stochastic Control Problem Equals the Parisi FunctionalResearch Paper

The ground-state energy of a mixed ppp-spin spin glass, OPTN=max⁡σ∈{±1}NHN(σ)/N\mathsf{OPT}_N=\max_{\sigma\in\{\pm1\}^N}H_N(\sigma)/NOPTN​=maxσ∈{±1}N​HN​(σ)/N, converges almost surely to the infimum of the Parisi functional over non-decreasing order parameters (Auffinger–Chen 2017). El Alaoui, Montanari and Sellke (arXiv:2001.00904v1) study algorithms that find near-optimal configurations. They introduce…

14 thms1 active userReviewed
Mathematical PhysicsOptimizationPartial Differential Equations·Captain: mikedeng1

Optimization of Mean-field Spin Glasses II: Under No Overlap Gap, the Monotone Parisi Minimizer Also Minimizes the Extended FunctionalResearch Paper

The mixed ppp-spin model is a random polynomial on the hypercube {−1,+1}N\{-1,+1\}^N{−1,+1}N: a centered Gaussian process HN(σ)H_N(\boldsymbol\sigma)HN​(σ) with covariance E{HN(σ)HN(σ′)}=Nξ(⟨σ,σ′⟩/N)\mathbb E\{H_N(\boldsymbol\sigma)H_N(\boldsymbol\sigma')\} = N\xi(\langle\boldsymbol\sigma,\boldsymbol\sigma'\rangle/N)E{HN​(σ)HN​(σ′)}=Nξ(⟨σ,σ′⟩/N). Its maximum OPTN=max⁡σHN(σ)/N\mathrm{OPT}_N = \max_{\boldsymbol\sigma} H_N(\boldsymbol\sigma)/NOPTN​=maxσ​HN​(σ)/N is a canonical…

11 thms1 active userReviewed
Stochastic Systems·Captain: mikedeng1

Convergence in law of the minimum of a branching random walk: The Minimum Centred at (3/2) ln n Converges to a Gumbel Law Shifted by the Derivative MartingaleResearch Paper

A branching random walk is the simplest model of a population that both reproduces and moves: every particle dies and leaves a random cloud of children displaced relative to it. Its extreme particles control the speed of travelling waves in reaction–diffusion equations (the KPP/Fisher equation), the free energy of directed polymers on trees, the cover and…

13 thms1 active userReviewed
Dynamic ProgrammingLinear OptimizationOperations Research+1·Captain: mikedeng1

On the Choice-Based Linear Programming Model for Network Revenue Management I: The CDLP Is Asymptotically Optimal under Proportional ScalingResearch Paper

Airlines, hotels and railways sell a fixed stock of perishable capacity (seats on flight legs, room-nights) to customers who arrive over a finite selling horizon. Network revenue management decides, at each moment, which products to keep open for sale. In the classical independent-demand model each product has its own demand stream. In practice customers…

7 thms1 active userReviewed
Dynamic ProgrammingMarkov ChainOperations Research·Captain: mikedeng1

Stochastic Dynamic Programming and the Control of Queueing Systems V: The Average Cost Optimality Equation and Value Iteration for Finite State SpacesTextbook

Average cost Markov decision chains model systems that run indefinitely and are judged by their long-run cost per step: admission and routing control in queues, inventory replenishment, machine maintenance. For a finite state space the classical tool is the average cost optimality equation (ACOE)

13 thms1 active userReviewed
Operations ResearchOptimization·Captain: mikedeng1

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies: Expected Discounted Cost Is Convex in the Base-Stock LevelResearch Paper

In many inventory systems, demand that cannot be met from stock is lost rather than backordered: a customer who finds the shelf empty buys elsewhere. For such lost-sales systems with positive lead times the optimal replenishment policy is known to be complex and to depend on the whole pipeline of outstanding orders (Karlin and Scarf, 1958; Morton, 1969). In…

10 thms1 active userReviewed
Numerical AnalysisStochastic Systems·Captain: mikedeng1

Euler Approximations with Varying Coefficients II: Strong Order 1/2 in Lp for Superlinearly Growing Diffusion CoefficientsResearch Paper

Stochastic differential equations with superlinearly growing coefficients appear throughout applied probability: population models with cubic damping, Langevin dynamics with polynomial potentials, and stochastic volatility models such as the 3/2-model used for pricing VIX options, whose diffusion coefficient grows like ∣x∣3/2|x|^{3/2}∣x∣3/2. For such equations the…

13 thms1 active userReviewed
PreviousPage 47 of 48Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me