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
Operations ResearchProbability·Captain: mikedeng1

Learning and Balancing Unknown Loads in Large-Scale Systems I: The Refined Learning Scheme Settles the Threshold at mΔ and Balances the Load on (m, Δ)-Bounded IntervalsResearch Paper

In adaptive video streaming and online gaming, tasks are dispatched to one of nnn identical server pools; all tasks in a pool are served in parallel, so a task's duration does not depend on the load, but its quality of service does. The total number of tasks then does not depend on how tasks are dispatched (the pools together form an infinite-server system),…

18 thms2 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

Learning and Balancing Unknown Loads in Large-Scale Systems II: Under Coxian Service Times the Basic Learning Scheme Settles the Threshold at ⌊ρ⌋_Δ and Balances the LoadResearch Paper

Large data centers and cloud platforms route a stream of incoming tasks to many server pools, each pool able to serve several tasks at once. A dispatcher that sends each task to the least loaded pool (join-the-shortest-queue, JSQ) balances the load best, but it needs the exact number of tasks at every pool, which is costly to maintain at scale. A threshold…

12 thms2 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

Sample-Path Large Deviations for Unbounded Additive Functionals of the Reflected Random Walk: The Partial Sums of X_i^p Satisfy a Sample-Path LDP in the M1' Topology at Speed n^(1/(1+p))Research Paper

The reflected random walk Xn+1=[Xn+Un+1]+X_{n+1}=[X_n+U_{n+1}]^+Xn+1​=[Xn​+Un+1​]+ is the waiting-time sequence of the single-server queue (Lindley's recursion). Additive functionals ∑i≤nXip\sum_{i\le n}X_i^p∑i≤n​Xip​ measure accumulated congestion. For p=1p=1p=1 this is the total waiting time, the area under the workload curve.

27 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Stochastic Dual Dynamic Integer Programming 1: With Valid, Tight and Finite Cuts, Stochastic Nested Decomposition Finds an Optimal Solution in Finitely Many Iterations with Probability OneResearch Paper

Multistage stochastic programs model decisions taken over time while uncertain data are revealed: generation scheduling in hydro-thermal power systems, capacity expansion, unit commitment, portfolio management. When the uncertainty is represented by a finite scenario tree, the problem becomes one very large deterministic program, and decomposition…

10 thms2 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

Universality of Power-of-d Load Balancing in Many-Server Systems 2: JSQ(d(N)) with d(N)/(√N log N) → ∞ Has the Same Halfin–Whitt Diffusion Limit as the Join-the-Shortest-Queue PolicyResearch Paper

A data center or cloud platform routes each incoming task to one of NNN parallel servers. Sending each task to a server with the shortest queue, the join-the-shortest-queue (JSQ) policy, minimizes waiting in a strong sense, but the dispatcher must learn all NNN queue lengths for every arrival. The power-of-d schemes cut this communication: the dispatcher…

10 thms2 active usersReviewed
Control TheoryMarkov Chain·Captain: mikedeng1

Strong and Weak Equilibria for Time-Inconsistent Stochastic Control in Continuous Time 2: Under Pseudo-Exponential Discounting, a Two-State Generator Is a Weak but Not a Strong EquilibriumResearch Paper

An agent whose preferences change over time cannot simply optimize once: a plan that is optimal today may be abandoned tomorrow by the agent's own "future selves". This is time inconsistency, and its standard source is non-exponential discounting, studied since Strotz (1955). The usual response, going back to Strotz and made rigorous in continuous time by…

11 thms2 active usersReviewed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

Learning Unknown Service Rates in Queues 2: Q-UCB Has Queue-Regret at Most 6K v_u(t) log² t / t + (24.004 + UK)/(6t²) in the Late StageResearch Paper

Many service systems must match jobs to servers whose quality is not known in advance: crowdsourcing platforms routing tasks to worker types, wireless schedulers assigning users to channels, and switches in data networks. The scheduler learns server quality only by trying servers, and every poor assignment lets work pile up. The natural performance measure…

12 thms2 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

Universality of Power-of-d Load Balancing in Many-Server Systems 1: JSQ(d(N)) with d(N) → ∞ Has the Same Fluid Limit as the Join-the-Shortest-Queue PolicyResearch Paper

Large data centers and cloud platforms route each incoming job to one of NNN parallel servers through a single dispatcher. The join-the-shortest-queue (JSQ) policy, which sends each job to a server with the fewest jobs, has strong optimality properties for identical exponential servers, but it needs the queue length of every server at every arrival, which is…

17 thms2 active usersReviewed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements II: Average-Loss Bound for Batch-Adjusted DPCResearch Paper

Hotel rooms, rental cars, cloud servers, operating rooms and rental equipment are reusable resources: a customer occupies capacity for a fixed service time, and the capacity returns to the firm afterwards. Many of these settings also allow advance reservation, where a request made today is for a service that starts later. Lei and Jasin study dynamic pricing…

9 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements I: Average-Loss Bound for Deterministic Price ControlResearch Paper

Hotel rooms, rental cars, cloud servers, hospital beds and event spaces are reusable resources: a customer occupies a unit for a while and then returns it. Pricing them differs from classical revenue management, where a sold unit is gone for good. A sale now blocks capacity only for the length of the service, so the binding constraint is how many services…

8 thms2 active usersReviewed
Operations ResearchPartial Differential EquationsProbability·Captain: mikedeng1

Diffusion Approximation for Fully Coupled Stochastic Differential Equations 2: The Slow Component Converges Weakly to the Averaged SDE at an Explicit Rate (Regime 1)Research Paper

Many stochastic models evolve on two time scales: a fast component that equilibrates quickly and a slow component driven by it. Planetary motion, climate models, geophysical flows and intracellular reaction networks are standard examples, and multiscale numerical methods for them approximate the slow component by a reduced equation. Such approximations are…

8 thms2 active usersReviewed
🏆Completed
Dynamical SystemsProbability·Captain: mikedeng1

Propagation of Chaos for Stochastic Spatially Structured Neuronal Networks with Delay driven by Jump Diffusions 2: The Neuronal Network Converges in L² to Its McKean–Vlasov LimitResearch Paper

Large networks of neurons are often modelled as systems of coupled stochastic differential equations: each neuron carries a low-dimensional state (a membrane potential and recovery variables, as in the FitzHugh–Nagumo model), receives synaptic input from the other neurons with a transmission delay, and is perturbed by noise. Because the number of neurons is…

15 thms2 active usersReviewed
Probability·Captain: mikedeng1

Liouville Quantum Gravity and the Brownian Map II: Geodesics and Continuity of the Embedding: A Quantitative Kolmogorov–Čentsov Criterion, P[M ≥ t] ≤ c₁t^(−α) for the Hölder Norm MResearch Paper

The Kolmogorov–Čentsov continuity criterion is the standard way to prove that a random field has a continuous version: a moment bound on increments, E∣Xu−Xv∣α≤c0∣u−v∣d+β\mathbf E|X_u - X_v|^\alpha \le c_0|u - v|^{d+\beta}E∣Xu​−Xv​∣α≤c0​∣u−v∣d+β, yields a modification whose paths are Hölder continuous of every order γ<β/α\gamma < \beta/\alphaγ<β/α (Karatzas–Shreve 1991, §2.2; Revuz–Yor 1999, Ch. I). It is used…

8 thms2 active usersReviewed
Algorithmic Game TheoryGraph TheoryProbability·Captain: mikedeng1

A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes I: An Explicit Markovian Nash Equilibrium on Every Finite Transitive GraphResearch Paper

Mean field games describe Nash equilibria of large populations in which every player interacts with every other player symmetrically, through the empirical distribution of all states. Many systems of interest are not of this kind: agents in a network interact only with their neighbours, and the interaction structure is a graph rather than a complete graph.…

21 thms2 active usersReviewed
Control TheoryOptimizationProbability·Captain: mikedeng1

Open-Loop and Closed-Loop Solvabilities for Stochastic Linear Quadratic Optimal Control Problems 4: A Problem Open-Loop Solvable at Every (t, x) but Closed-Loop Solvable on No [t, 1]Research Paper

In a stochastic linear–quadratic (LQ) optimal control problem a controller steers a linear stochastic differential equation and pays a quadratic cost. When the cost weights are allowed to be indefinite — as in mean–variance portfolio selection, where the control weight is zero — the problem can still be well posed, and two different notions of solution…

13 thms2 active usersReviewed
Control TheoryOptimizationProbability·Captain: mikedeng1

Open-Loop and Closed-Loop Solvabilities for Stochastic Linear Quadratic Optimal Control Problems 3: Open-Loop Solvability Is Equivalent to Convergence of the Riccati Minimizing SequenceResearch Paper

Linear–quadratic (LQ) optimal control is the basic test case of stochastic control: a linear stochastic differential equation, a quadratic cost, and an optimal control that one expects to be a linear feedback of the state computed from a Riccati equation. In the indefinite stochastic case the weighting matrices GGG, QQQ, RRR carry no sign condition. The cost can…

14 thms2 active usersReviewed
AnalysisDynamical Systems·Captain: mikedeng1

On Well-Posedness of Forward–Backward SDEs—A Unified Approach 3: With Constant Coefficients, σ₃ ≠ 0, σ₃h ≠ 1 the Dominating ODE Keeps y and (1 − σ₃y)⁻¹ Bounded for Every T Iff One of Four Cases HoldsResearch Paper

A forward–backward stochastic differential equation (FBSDE) couples a forward diffusion XXX with a backward equation for a pair (Y,Z)(Y,Z)(Y,Z) whose terminal value depends on XTX_TXT​. Such systems arise from the stochastic maximum principle, from option pricing with large investors, and from stochastic differential games. Whether an FBSDE with Lipschitz coefficients has a…

14 thms2 active usersReviewed
Markov ChainProbabilityStatistics·Captain: mikedeng1

Can Local Particle Filters Beat the Curse of Dimensionality?: The Block Particle Filter Has a Local Error Bound Uniform in Time and in the Model DimensionResearch Paper

Nonlinear filtering asks for the conditional law of an unobserved Markov process given noisy partial observations of it. It is the computational core of data assimilation in weather forecasting, oceanography and geophysics, of target tracking, and of inference in large networked systems. The standard numerical method, the particle filter, replaces the…

13 thms2 active usersReviewed
Operations ResearchOptimal TransportProbability·Captain: mikedeng1

A Stochastic Control Approach to No-Arbitrage Bounds Given Marginals, with an Application to Lookback Options: The Robust Superhedging Bound of g(X*_T) Given the Law of X_T Equals μ^HL(g)Research Paper

A lookback option pays a function of the running maximum of the underlying asset over the life of the contract. When the prices of European call options of all strikes at the maturity are quoted, the risk-neutral law μ\muμ of the terminal price is known, but the law of the whole path is not. The robust (model-free) superhedging cost of the lookback payoff is…

13 thms2 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Limit Theorems for Nearly Unstable Hawkes Processes 2: When T(1 − a_T) → λ the Rescaled Intensity Converges in Law to a CIR Process and the Rescaled Hawkes Process to Its IntegralResearch Paper

An event stream can raise its own future event rate. A Hawkes process models this feedback by adding to a baseline rate the effects of past arrivals. The parameter measuring total excitation can approach its stability boundary, at which long clusters make a fixed time scale an unreliable guide to the observed count. Jaisson and Rosenbaum identify a regime…

14 thms2 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Limit Theorems for Nearly Unstable Hawkes Processes 1: When T(1 − a_T) → ∞ the Rescaled Hawkes Process Is Asymptotically Deterministic in L²Research Paper

A Hawkes process is a model for events that make further events more likely for a time. It is used when event times cluster, including transaction arrivals in financial markets. Jaisson and Rosenbaum study what happens when the feedback approaches the threshold at which the usual stable model ceases to have a finite long-run mean intensity. The behavior…

11 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryProbability·Captain: mikedeng1

Separation of Time-Scales and Model Reduction for Stochastic Reaction Networks 1: The Balance Condition for Linear Combinations of Species Decomposes over Strongly Connected ComponentsResearch Paper

A stochastic reaction network tracks the counts of chemical species as reactions occur. Different species and reaction rates may grow at different powers of a large system-size parameter. Kang and Kurtz's model-reduction paper uses these powers to identify candidate time scales and combinations of species that can remain bounded. Before a reduced model can…

6 thms2 active usersReviewed
🏆Completed
Mechanism DesignOperations ResearchProbability·Captain: mikedeng1

Pricing and Matching with Forward-Looking Buyers and Sellers 1: Waiting-Adjusted Fixed Prices with Greedy Matching Earn at Least 1 − (1 + 2(b+h)T/(3(p*−w*)))/√µ* of the Fluid Profit BoundResearch Paper

An intermediary such as a ride platform must attract buyers and sellers who arrive at different times. A buyer may wait for a seller; a seller may wait for a buyer. Both sides can choose when to request a match, so an ask price and a bid price affect participation as well as the intermediary's margin. Chen and Hu study whether a simple posted-price policy…

12 thms2 active usersReviewed
🏆Completed
Operations ResearchPartial Differential EquationsProbability·Captain: mikedeng1

Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin-Whitt Regime 2: The JSQ Diffusion Limit Satisfies a Foster-Lyapunov Drift ConditionResearch Paper

Join-the-shortest-queue (JSQ) is the basic load-balancing rule for a system of nnn parallel single-server queues: every arriving customer joins a queue of minimal length. It is optimal in several senses for homogeneous servers and is the reference policy against which cheaper rules (power-of-ddd choices, join-the-idle-queue) are measured. In the Halfin–Whitt…

9 thms2 active usersReviewed
Control TheoryMachine LearningOperations Research+1·Captain: mikedeng1

Convergence Analysis of Machine Learning for Mean Field Control, Finite Horizon: The N-Agent Discrete-Time Neural-Net Value Is Within O(N^{-1/max(d,4)} + n_in^{-1/(3(d+1))} + √Δt) of the MKV OptimumResearch Paper

Mean field control studies the optimal control of a very large population of interacting agents through the limit in which the population is replaced by its distribution. The limit problem is a McKean–Vlasov (MKV) control problem: the dynamics and the cost of a representative agent depend on the law of its own state. Such problems arise in systemic risk,…

15 thms2 active usersReviewed
PreviousPage 18 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