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
🏆Completed
Complexity TheoryLinear OptimizationOperations Research+1·Captain: mikedeng1

A Comment on "Computational Complexity of Stochastic Programming Problems" 3: An ε-Optimal Decision of the Random-Recourse Program (11) Decides the Integer Feasibility ProblemResearch Paper

A linear two-stage stochastic program chooses a first-stage decision xxx before an uncertain parameter ξ~\tilde\xiξ~​ is revealed, and pays the optimal value Q(x,ξ)Q(x,\xi)Q(x,ξ) of a second-stage linear program once the realization ξ\xiξ is known. Such programs are the basic model of planning under uncertainty in operations research, and their computational complexity…

8 thms3 active usersReviewed
🏆Completed
CombinatoricsComplexity TheoryOperations Research+1·Captain: mikedeng1

A Comment on "Computational Complexity of Stochastic Programming Problems" 2: The Expected Recourse Value of (10) Is 1 − Vol(P(S; ⪯)), and a 1/(2k!)-Accurate Value Counts Linear ExtensionsResearch Paper

A two-stage stochastic program chooses a first action before uncertainty is observed and then takes a recourse action after the observation. Evaluating the expected optimal recourse value can be difficult even when the recourse problem for each fixed observation is a small linear program. This mission isolates the example in Section 3 of Hanasusanto, Kuhn…

8 thms3 active usersReviewed
🏆Completed
Complexity TheoryOperations ResearchOptimization+1·Captain: mikedeng1

A Comment on "Computational Complexity of Stochastic Programming Problems" 1: δ-Accurate Expected Recourse Values of Problem (2) Determine the #Parity Count of a Knapsack PolytopeResearch Paper

A two-stage stochastic program chooses a decision before uncertainty is observed and a recourse decision afterward. Its objective can involve the expected optimal value of the recourse problem. Even with linear constraints, evaluating that expectation can be difficult when the random input has many coordinates. Dyer and Stougie's 2006 complexity paper studie…

10 thms3 active usersReviewed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Asymptotic Optimality of Constant-Order Policies for Lost Sales Inventory Models with Large Lead Times: The Best Constant-Order Policy Costs at Most 1 + ε Times the Optimum Once L ≥ y(ε)Research Paper

The lost-sales inventory model with a positive lead time is one of the basic models of inventory theory. A retailer reviews stock once per period, places an order that arrives LLL periods later, and loses (rather than backlogs) any demand that cannot be met from stock on hand. Lost sales are the norm in retail, where a customer facing an empty shelf buys…

22 thms3 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

Martingale Proofs of Many-Server Heavy-Traffic Limits for Markovian Queues 1: The Centered and √n-Scaled M/M/∞ Queue Converges in D to an Ornstein–Uhlenbeck ProcessResearch Paper

Large service systems (call centers, hospital wards, cloud server pools) run with many servers, and for many of them no exact formula describes how the number of busy servers moves over time. Heavy-traffic limits replace such a system by a diffusion process that is easier to analyze. The many-server regime, in which the number of servers and the arrival…

23 thms3 active usersReviewed
🏆Completed
Probability·Captain: marwahaha

Directional transience implies ballisticityOpen Problem

Escape to infinity can be arbitrarily slow for a general stochastic process. The source asks whether independent uniformly elliptic lattice environments force a positive deterministic speed whenever a direction is transient. The source is OpenAI's September 2026 manuscript.

20 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Designing a Call Center with Impatient Customers III: Square-Root Staffing Is Equivalent to a Nondegenerate Delay Probability and to Abandonment of Order 1/√NResearch Paper

A telephone call center must decide how many agents NNN to staff against an offered load R=λ/μR=\lambda/\muR=λ/μ (arrival rate over service rate). Staff too few and callers wait and hang up; staff too many and agents sit idle. For large centers the industry rule of thumb is square-root safety staffing, N≈R+βRN\approx R+\beta\sqrt RN≈R+βR​, and the question is what service level…

13 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Inventory Management of a Fast-Fashion Retail Network 1: Expected Sales Under the Major-Size Display Policy Are Non-Decreasing, Discretely Concave and SupermodularResearch Paper

Fast-fashion retailers such as Zara replenish their stores several times a week from a central warehouse, and the warehouse holds a limited stock of each garment that must be split across hundreds of stores. Caro and Gallien built the store-level sales model behind the shipment-allocation system they developed with Zara and tested in a live pilot (Caro and…

9 thms3 active usersReviewed
🏆Completed
AnalysisOperations Research·Captain: mikedeng1

The Power of Two Choices in Randomized Load Balancing II: T_d(λ)/log T_1(λ) → 1/log d as λ → 1⁻, an Exponential Improvement over One ChoiceResearch Paper

A dispatcher assigns each arriving job to one of nnn servers. Sending it to a uniformly random server is simple but produces long queues near capacity; sending it to the globally shortest queue requires full state information. The power of ddd choices sits between the two: each job samples ddd servers at random and joins the shortest of them. Mitzenmacher's…

5 thms3 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

Designing a Call Center with Impatient Customers II: In the Halfin–Whitt Regime the Scaled Erlang-A Queue Converges to a Diffusion with Piecewise-Linear DriftResearch Paper

Telephone call centers are large service systems: hundreds of agents answer callers who wait in a queue and hang up when their patience runs out. Staffing them is a trade-off between the cost of agents and the quality of service, and in large centers both the efficiency (agents busy almost all the time) and the service level (most callers answered almost…

9 thms3 active usersReviewed
Markov ChainProbability·Captain: mikedeng1

The Two-Parameter Poisson–Dirichlet Distribution Derived from a Stable Subordinator 5: PD(α, θ) Is a Y_1^θ-Tilt of Independent beta(θ + nα, 1) Ratios, and (Y_n) Is a Markov ChainResearch Paper

The two-parameter Poisson–Dirichlet distribution PD(α,θ)\mathrm{PD}(\alpha,\theta)PD(α,θ) is a law on decreasing sequences V1≥V2≥⋯>0V_1 \ge V_2 \ge \cdots > 0V1​≥V2​≥⋯>0 with ∑nVn=1\sum_n V_n = 1∑n​Vn​=1. It describes the ranked frequencies of species in Bayesian nonparametric models (the Pitman–Yor process), the ranked lengths of excursions of Bessel processes and bridges, and the ranked cycle or block…

15 thms3 active usersReviewed
🏆Completed
AnalysisOperations ResearchProbability+1·Captain: mikedeng1

Some Useful Functions for Functional Limit Theorems 3: The First-Passage-Time Map Is M₁-Continuous and J₁-Continuous at Strictly Increasing PathsResearch Paper

Functional limit theorems in queueing and applied probability are rarely proved from scratch. A limit theorem is established once for a primitive process, such as a random walk, a cumulative input or a renewal-reward process, and then transferred to the quantities of interest through the continuous mapping theorem: if Xn⇒XX_n \Rightarrow XXn​⇒X in a function space…

14 thms3 active usersReviewed
🏆Completed
Graph TheoryOperations ResearchProbability·Captain: mikedeng1

Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks II: Outside C̄′ the Queues Grow to Infinity a.s. under Every PolicyResearch Paper

In a multihop radio network, links that are close to each other interfere, so only certain sets of links can transmit in the same time slot. Tassiulas and Ephremides (IEEE TAC 1992) modelled this as a constrained queueing system and asked which arrival rates any scheduler can sustain. Their answer has two halves. The first, Theorem 3.2, shows that a…

9 thms3 active usersReviewed
Control TheoryOperations ResearchProbability·Captain: mikedeng1

Reflected Solutions of Backward SDE's, and Related Obstacle Problems for PDE's 2: With a Concave Coefficient, the Reflected BSDE Is the Value of a Minimax Optimal Stopping–Control ProblemResearch Paper

A backward stochastic differential equation (BSDE) prescribes the terminal value of an adapted process instead of its initial value. Pardoux and Peng (1990) proved existence and uniqueness for Lipschitz coefficients, and BSDEs have since become a standard tool in stochastic control, mathematical finance and the probabilistic treatment of semilinear PDEs. El…

13 thms3 active usersReviewed
🏆Completed
AnalysisOperations ResearchProbability·Captain: mikedeng1

Some Useful Functions for Functional Limit Theorems 4: Time Reversal Is a J₁ Isometry and Reversal from the Origin Is 2-LipschitzResearch Paper

Functional limit theorems describe the behavior of entire time-indexed paths under scaling. In queueing and other stochastic models, a path of departures, workload, or accumulated input may be related to another path by reversing a finite observation window. To carry a limit theorem through that change of viewpoint, one needs to know how reversal acts on…

7 thms3 active usersReviewed
Markov ChainOperations Research·Captain: mikedeng1

Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks I: Policy π₀ Is Throughput-Optimal, C′ ⊂ C_π₀ ⊂ C ⊂ C̄′Research Paper

In a wireless multihop network, a switch, or a parallel computer, transmissions interfere: two links that share a receiver, or two crossbar paths that share a port, cannot be active in the same time slot. The scheduler must choose, slot by slot, a set of links that may operate together and decide which traffic each one carries. The basic question is which…

9 thms3 active usersReviewed
AnalysisOperations ResearchOptimization·Captain: mikedeng1

Dynamic Scheduling with Convex Delay Costs: The Generalized cμ Rule: Policies Equalizing the Indices μ_k c_k(W_k/ρ_k) Attain the Heavy-Traffic Lower Bound on Cumulative Delay CostResearch Paper

A single server shared by several classes of jobs must decide, at every moment, which class to work on. When each class kkk incurs a linear delay cost ckc_kck​ per unit of waiting time and needs mean service time 1/μk1/\mu_k1/μk​, the classical cμc\mucμ rule (serve the waiting class with the largest ckμkc_k\mu_kck​μk​) minimizes expected cost in many settings, from the M/G/1 queue to…

16 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Regenerative Stochastic Processes 4: Cumulative Processes on the Same Regeneration Points Are Jointly Asymptotically NormalResearch Paper

Many quantities in queueing, inventory and reliability models are additive functionals of a regenerative process: the total work processed by a server up to time ttt, the cost accumulated by an inventory policy, the time a machine spends broken. Each such quantity grows by independent, identically distributed amounts over the cycles between successive…

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

A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales: The Dual-Balancing Policy Costs at Most Twice Any Nonanticipatory Policy under Independent DemandsResearch Paper

Inventory systems in which unmet demand is lost, not backlogged, are the norm in retail: a customer who finds an empty shelf buys elsewhere. With a positive lead time LLL between ordering and delivery, the optimal policy for such a system depends on the entire pipeline of outstanding orders, so dynamic programming is intractable beyond small LLL. Optimal…

12 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainOperations Research·Captain: mikedeng1

Quality Control under Markovian Deterioration 3: Sufficient Conditions for a Three-Region Optimal Policy and for an Optimal Policy That Never InspectsResearch Paper

Inspection and revision cost money, but continued production can allow a deteriorating process to remain in a costly state. A controller therefore needs a rule that converts incomplete information about the process into an action. Ross's two-state model makes that decision precise: the process can be good or bad, the bad state persists until revision, and…

8 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainOperations Research·Captain: mikedeng1

Quality Control under Markovian Deterioration 2: Never Inspecting or Revising Is Optimal Exactly When R ≥ C/(1 − β(1 − π))Research Paper

A production process can deteriorate without an operator seeing its current condition. Producing a unit, inspecting the process, and revising the process have different immediate costs and different effects on what can be known or controlled next period. The operator therefore needs a rule based on a belief about deterioration, rather than on the hidden…

8 thms3 active usersReviewed
🏆Completed
Markov ChainOperations ResearchProbability·Captain: mikedeng1

Contact Interactions on a Lattice II: If λₖ/μ < k/(2d − 1), the Expected Size of a Contact Process Is Integrable in TimeResearch Paper

The contact process is the basic model of an infection spreading on a graph: infected sites recover at a constant rate, and healthy sites are infected at a rate that depends on how many of their neighbours are infected. T. E. Harris introduced it in Contact Interactions on a Lattice (Ann. Probab. 2, 1974, doi:10.1214/aop/1176996493), and it became one of…

13 thms3 active usersReviewed
🏆Completed
AnalysisHarmonic AnalysisProbability·Captain: mikedeng1

Distribution Function Inequalities for Martingales 3: For Brownian Motion Stopped at Any Stopping Time τ, EΦ(X*(τ)) and EΦ(τ^{1/2}) Are ComparableResearch Paper

The size of a martingale can be measured in two ways: by its maximal function, the largest absolute value it reaches, and by a quadratic quantity that records how much it has moved, the square function in discrete time or the elapsed time in the case of Brownian motion. The Burkholder–Davis–Gundy inequalities say that these two measurements are comparable…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Implicit Renewal Theory and Tails of Solutions of Random Equations 1: The Implicit Renewal Theorem — If E|M|^κ = 1 Then P(R > t) ~ C₊t^{−κ} and P(R < −t) ~ C₋t^{−κ}Research Paper

Many stochastic models produce a stationary quantity RRR that solves a random equation R=dΨ(R)R \overset{d}{=} \Psi(R)R=dΨ(R), with Ψ\PsiΨ a random map independent of RRR. The random difference equation R=dQ+MRR \overset{d}{=} Q + MRR=dQ+MR (perpetuities in insurance and finance, the ARCH and GARCH volatility models, random walks in random environments), the Lindley equation …

14 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy: The Zheng–Federgruen Algorithm Terminates with an Optimal (s, S) Policy and c⁰ = c*Research Paper

The (s, S) policy is the standard control rule for a single item reviewed periodically: when the inventory position reaches or drops below a reorder level sss, order enough to bring it up to the order-up-to level SSS. Under a fixed ordering cost and fairly general holding and shortage costs, some (s, S) policy minimizes the long-run average cost among all…

14 thms3 active usersReviewed
PreviousPage 9 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