Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Stochastic Systems

635 missions · 329 completed

The mathematics of systems that evolve under randomness, modeled as families of random variables indexed by time — from Markov chains and martingales to Brownian motion and stochastic differential equations. The field spans stochastic analysis, filtering and optimal control under uncertainty, ergodic behavior of random dynamics, and concentration of measure, with models reaching across physics, engineering, finance, and biology.

Missions

Open306Completed329All635
Machine LearningProbabilityReinforcement Learning·Captain: mikedeng1

Reusing Historical Trajectories in Natural Policy Gradient via Importance Sampling: Asymptotic Normality of the RNPG Error, with Reuse Shrinking the Joint-Noise Covariance by 1/KResearch Paper

In reinforcement learning, each policy update may require new interaction with an environment. When interaction is costly, an optimizer can retain past trajectories and use them again, provided it corrects for the different policy that generated them. Lin, Wang, and Zhou study this idea for natural policy gradient, using importance weights to reuse earlier…

10 thms1 active userReviewed
CombinatoricsProbability·Captain: mikedeng1

Conditional Uniformity and Hawkes Processes: Given Its Size, a Hawkes Cluster's Compensator Points Are ρ Times the Order Statistics of a Uniform Random Parking Function Minus i.i.d. UniformsResearch Paper

Hawkes processes are point processes in which every event raises the rate of future events. They are used to model contagion in financial markets, earthquake aftershocks, the spread of posts on social networks and arrivals to service systems (Hawkes 1971; Hawkes and Oakes 1974). Hawkes and Oakes showed that a stationary Hawkes process is a Poisson stream of…

10 thms1 active userReviewed
Machine LearningProbability·Captain: mikedeng1

Mean Field Analysis of Deep Neural Networks: The SGD-Trained Two-Hidden-Layer Network Converges, as Its Layer Widths Grow in Turn, to the Unique Solution of a Limiting Integro-Differential SystemResearch Paper

A neural network can change its behavior substantially when both its width and its training duration grow. For a network with two hidden layers, the parameters of the layers interact during training, so a large-width description must account for the output of the actual optimization algorithm. Sirignano and Spiliopoulos study this question for online…

9 thms1 active userReviewed
Algorithmic Game TheoryControl TheoryProbability·Captain: mikedeng1

Dynamic Set Values for Nonzero-Sum Games with Multiple Equilibriums: The Set Value of a Continuous-Time Nonzero-Sum Stochastic Differential Game Satisfies the Dynamic Programming PrincipleResearch Paper

A nonzero-sum game can have several Nash equilibria with different cost vectors. Selecting one equilibrium before asking how the game behaves over time loses information and may make a proposed dynamic rule depend on that selection. Feinstein, Rudloff and Zhang study the entire set of equilibrium cost vectors and ask whether it can be evaluated consistently…

14 thms1 active userReviewed
Control TheoryDynamic ProgrammingProbability·Captain: mikedeng1

McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations: The N-Player Common-Noise Control Value Converges to the McKean–Vlasov ValueResearch Paper

A controller of a large population may choose a separate action for each participant while all participants experience the same random environment. The resulting optimization problem has a growing state space: with NNN participants, the state records NNN paths and NNN controls. A McKean–Vlasov control problem replaces the empirical distribution of those…

10 thms1 active userReviewed
Control TheoryOperations ResearchProbability·Captain: mikedeng1

Comparison Between Mean-Variance and Monotone Mean-Variance Preferences Under Jump Diffusion and Stochastic Factor Model: Optimal MMV and MV Utilities Coincide If and Only If Assumption 1 HoldsResearch Paper

Mean-variance (MV) preferences, Uθ(X)=E[X]−θ2Var(X)U_\theta(X)=\mathbb E[X]-\frac\theta2\mathrm{Var}(X)Uθ​(X)=E[X]−2θ​Var(X), are the standard objective of portfolio selection since Markowitz. They are not monotone: an investor can prefer a terminal wealth XXX to a wealth X′≥XX'\ge XX′≥X that is larger in every state, because the extra upside raises the variance. Monotone mean-variance (MMV) preferences (Ma…

15 thms1 active userReviewed
Control TheoryPartial Differential Equations·Captain: mikedeng1

Stochastic Control Problems with State Reflections Arising from Relaxed Benchmark Tracking: Verification Theorem for the Optimal Feedback Investment-Consumption StrategyResearch Paper

A fund manager who tracks a benchmark (a stock index, a price index, the cost of higher education) wants the managed wealth to stay above the benchmark at all times. Under a strict floor constraint Vt≥MtV_t\ge M_tVt​≥Mt​ the set of admissible strategies can be empty when the benchmark is random. Bo, Huang and Yu (arXiv:2302.08302, Math. Oper. Res.) relax the…

22 thms1 active userReviewed
🏆Completed
Markov ChainProbabilityReinforcement Learning+1·Captain: Wenqian Xing

Estimation of Treatment Effects Under Nonstationarity via the Truncated Policy Gradient EstimatorResearch Paper

Randomized experiments (A/B tests) on ride-sharing marketplaces, recommendation systems and digital-health services assign each arriving user to treatment or control. The assignment changes the system state seen by later users, so observations are not independent: this is temporal interference, or carryover. The difference-in-means estimator ignores it, and…

17 thms1 active userReviewed
Mathematical PhysicsPartial Differential EquationsProbability·Captain: mikedeng1

Global-in-Time Mean-Field Convergence for Singular Riesz-Type Diffusive Flows 2: A Uniform-in-Time Modulated-Energy Bound for Globally Superharmonic Riesz-Type PotentialsResearch Paper

Systems of many particles that interact through a singular pair potential and are subject to independent noise appear in plasma physics (Coulomb interactions), in vortex models of fluids, in models of collective behaviour and in the analysis of training dynamics of wide neural networks. When the number of particles NNN is large, the empirical measure of the…

14 thms1 active userReviewed
Mathematical PhysicsPartial Differential EquationsProbability·Captain: mikedeng1

Global-in-Time Mean-Field Convergence for Singular Riesz-Type Diffusive Flows 1: The Expected Modulated Energy Grows at Most Polynomially in TimeResearch Paper

Systems of NNN particles that interact through a singular pair potential and are driven by independent noise are used to model vortices in viscous fluids, collective motion of micro-organisms, aggregation phenomena and, more recently, the training dynamics of wide neural networks and stochastic gradient methods. When NNN is large, one expects the empirical…

14 thms1 active userReviewed
AnalysisPartial Differential EquationsProbability·Captain: mikedeng1

Diffusion Approximation for Fully Coupled Stochastic Differential Equations 1: The Parametric Poisson Equation Has a Unique Centered Solution with Optimal Regularity in x and yResearch Paper

Poisson equations for the generator of an ergodic diffusion are a standard tool in stochastic averaging, homogenization and diffusion approximation: to show that a fast ergodic component averages out in a slow equation, one writes the fluctuation f(Xt,Yt)f(X_t,Y_t)f(Xt​,Yt​) as L0u\mathscr L_0 uL0​u and applies Itô's formula to uuu. This requires a solution uuu whose regularity is…

8 thms1 active userReviewed
Algorithmic Game TheoryDynamic ProgrammingProbability·Captain: mikedeng1

Approximate Markov-Nash Equilibria for Discrete-Time Risk-Sensitive Mean-Field Games 2: The Mean-Field Equilibrium Policy Is an ε-Markov-Nash Equilibrium of Every Large Enough N-Agent GameResearch Paper

Games with many interacting agents, such as traffic participants, users of a shared communication channel or firms in a market, are rarely solvable exactly: a Nash equilibrium of an NNN-player stochastic game requires each agent to track the whole population, and its computation grows with NNN. Mean-field game theory replaces the population by its limiting…

16 thms1 active userReviewed
Dynamical SystemsProbability·Captain: mikedeng1

Propagation of Chaos for Stochastic Spatially Structured Neuronal Networks with Delay driven by Jump Diffusions 1: The Spatially Structured McKean–Vlasov Delay Equation with Jumps Is Well-PosedResearch Paper

Networks of conductance-based neurons, such as FitzHugh–Nagumo networks, are modelled by systems of stochastic differential equations in which each neuron interacts with the others through synapses, and the signal from one neuron reaches another only after a transmission delay. Biological neurons sit at positions in space, belong to a few distinct subpopulat…

17 thms1 active userReviewed
Algorithmic Game TheoryDynamic ProgrammingProbability·Captain: mikedeng1

Approximate Markov-Nash Equilibria for Discrete-Time Risk-Sensitive Mean-Field Games 1: A Risk-Sensitive Mean-Field Game with Compact Actions and Weakly Continuous Kernel Has a Mean-Field EquilibriumResearch Paper

Mean-field games describe large populations of identical agents who interact only through the distribution of their states. Each agent solves a stochastic control problem in which the population appears through a deterministic flow of distributions, and an equilibrium requires that this flow coincide with the distribution the agents generate themselves. The…

15 thms1 active userReviewed
Algorithmic Game TheoryGraph TheoryProbability·Captain: mikedeng1

A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes II: Large-Graph Limits of the Equilibrium Through the Laplacian Eigenvalue DistributionResearch Paper

Mean field games describe large populations of agents who interact symmetrically: every agent sees the same average of all the others. Many populations interact instead along a network, where each agent responds only to its neighbours. Lacker and Soret (arXiv:2005.14102v2, 2021; Math. Oper. Res. 2022) study a linear-quadratic stochastic differential game on…

17 thms1 active userReviewed
Algorithmic Game TheoryGraph TheoryProbability·Captain: mikedeng1

A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes III: The Mean Field Game Control Is an ε-Nash Equilibrium on Any Finite Graph, With ε_v ∝ deg(v)^(-1/2)Research Paper

Mean field games (MFGs) describe the limit of symmetric stochastic differential games as the number of players tends to infinity, when every player interacts with the empirical distribution of all the others. Their main practical use is the converse direction: an equilibrium of the limiting game supplies a simple, decentralized control that is an approximate…

14 thms1 active userReviewed
Control TheoryOptimizationProbability·Captain: mikedeng1

Open-Loop and Closed-Loop Solvabilities for Stochastic Linear Quadratic Optimal Control Problems 1: The Cost Is Uniformly Convex iff the Riccati Equation Has a Strongly Regular SolutionResearch Paper

The stochastic linear quadratic (LQ) optimal control problem asks to steer a linear stochastic differential equation by a control so as to minimize a quadratic cost. It is the basic model of stochastic control: Wonham studied it in 1968 (Wonham 1968), and it is the model on which feedback design, mean-field control and LQ differential games are built (Yong–Z…

14 thms1 active userReviewed
AnalysisProbability·Captain: mikedeng1

On Well-Posedness of Forward–Backward SDEs—A Unified Approach 1: Under Cases I–III the FBSDE Has a Decoupling Field with Bounded Difference Quotients and a Unique L² Solution on [0, T]Research Paper

A forward–backward stochastic differential equation (FBSDE) couples a forward SDE, solved from an initial state, with a backward SDE, solved from a terminal condition that depends on the forward state. Such systems arise from the stochastic maximum principle, from quasilinear parabolic PDEs through Feynman–Kac formulas, and in mathematical finance. Whenever…

14 thms1 active userReviewed
AnalysisProbability·Captain: mikedeng1

Affine Volterra Processes 3: Global Solutions with Nonpositive Real Part of the Square-Root Riccati–Volterra EquationResearch Paper

The Volterra square-root model describes a nonnegative, time-dependent state whose present value depends on a weighted history. Ordinary square-root diffusions use a constant kernel and have a Markov state; replacing that kernel by a function of elapsed time allows persistent or singular memory. This matters for the transform formulas used to characterize…

8 thms1 active userReviewed
AnalysisProbability·Captain: mikedeng1

Affine Volterra Processes 2: The Exponential-Affine Transform Formula via the Riccati–Volterra EquationResearch Paper

Many stochastic models have a present state that depends on a weighted history of past drift and noise. A stochastic Volterra equation captures this dependence through a kernel KKK: a recent increment and an older increment can enter the current state with different weights. Classical affine diffusions arise from the special constant kernel K=IK=IK=I. For those…

14 thms1 active userReviewed
AnalysisProbability·Captain: mikedeng1

Affine Volterra Processes 1: Nonnegative Weak Solutions of Stochastic Volterra Equations with Resolvent-Monotone KernelsResearch Paper

Many stochastic models use a process whose response to a disturbance depends on the time elapsed since that disturbance. An ordinary stochastic differential equation uses only the current state and instantaneous coefficients. A stochastic Volterra equation instead weights its past drift and noise through a convolution kernel. Such equations include the…

12 thms1 active userReviewed
AnalysisDynamical SystemsProbability·Captain: mikedeng1

Averaging Dynamics Driven by Fractional Brownian Motion: Young Solutions of dxⁿ = fₙ(t, xⁿ)dB Converge in Probability in C^α to the Solution of dx = f̄(x)dB When |fₙ − f̄|_{−κ,γ} → 0Research Paper

An equation driven by fractional Brownian motion can respond to a rapidly varying coefficient even when that coefficient has no useful pointwise limit. Hairer and Li study this issue for fractional Brownian motion with Hurst index above one half. Their Section 3 isolates a deterministic averaging statement: if the time antiderivatives of the coefficients…

9 thms1 active userReviewed
Control TheoryDynamic ProgrammingProbability·Captain: mikedeng1

McKean–Vlasov Optimal Control: The Dynamic Programming Principle 1: The Weak Formulation's Value Function Is Upper Semi-Analytic and Satisfies the DPPResearch Paper

A McKean–Vlasov control problem asks a planner to steer a stochastic differential equation whose coefficients depend not only on the current path of the state but also on its (conditional) distribution. Such problems describe the cooperative optimum of a large population of interacting agents: when each agent reacts to the empirical distribution of all…

14 thms1 active userReviewed
Control TheoryDynamic ProgrammingProbability·Captain: mikedeng1

McKean–Vlasov Optimal Control: The Dynamic Programming Principle 2: Under Lipschitz Coefficients the Common-Noise-Adapted Strong Formulation Satisfies the DPPResearch Paper

A controller may act on a large population of interacting particles while all particles also experience a shared random disturbance. In the population limit, the state of a representative particle depends on the distribution of states conditional on the common noise. The controller therefore influences both its own state and the conditional population law.…

14 thms1 active userReviewed
Control TheoryPartial Differential EquationsProbability·Captain: mikedeng1

Reflected Solutions of Backward SDE's, and Related Obstacle Problems for PDE's 3: Uniqueness for the Parabolic Obstacle ProblemResearch Paper

Reflected backward stochastic differential equations describe processes that must remain above a prescribed obstacle. El Karoui, Kapoudjian, Pardoux, Peng and Quenez connect that probabilistic construction to a parabolic partial differential equation with an obstacle in their 1997 paper. A representation by a stochastic process is useful only if the…

14 thms1 active userReviewed
PreviousPage 24 of 26Next

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