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

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 2: Under FIFO Issuance the Heuristic Base-Stock Policy's Optimality Gap Decays Exponentially in Demand Population SizeResearch Paper

Perishable products (blood platelets, fresh food, pharmaceuticals) have a fixed lifetime: units not sold within mmm periods expire and are discarded. Managing such inventory well is a classical problem in operations research, going back to Nahmias (1975). The difficulty is that the state of the system is the whole age profile of the stock, so the optimal…

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

Courier Dispatch in On-Demand Delivery I: With Exogenous Demand, Dedicated Delivery Has the Shorter Wait Exactly Below One Threshold in Demand Rate and in Service RadiusResearch Paper

On-demand delivery platforms for meals and groceries promise delivery within minutes, and the main operational lever they control is how a courier is dispatched. A courier can carry each order as soon as it is ready (dedicated delivery), or wait until two orders are available and deliver them in one trip (batch delivery). Batching saves travel per order but…

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

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 1: Under FIFO Issuance the Heuristic Base-Stock Policy's Optimality Gap Decays Exponentially in the Product LifetimeResearch Paper

Blood platelets, fresh produce, dairy and many pharmaceuticals have a fixed shelf life: a unit that has not been used within mmm periods of its arrival must be discarded. Managing such stock is a classical problem of inventory theory, going back to Nahmias (1975), and it remains of practical interest for hospital blood banks and grocery retail. The difficulty…

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

Load Balancing Under Strict Compatibility Constraints 1: On Proportionally Sparse Subcritical Compatibility Graphs, JSQ(d) Has the Fully Flexible Mean-Field Limit and Steady StateResearch Paper

In large server farms and cloud platforms, not every server can process every task. Data locality, licences, hardware and security rules restrict each task type to a subset of servers. Such compatibility constraints are modelled by a bipartite compatibility graph between task types (dispatchers) and servers. Classical mean-field results for load balancing,…

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

Pricing in On-Demand and One-Way Vehicle-Sharing Networks 1: Static Prices Earn at Least K/(N+K−1+Λ/μ) of the Fluid Optimum, via Increasingly Tight Availability BoundsResearch Paper

In one-way car sharing, bike sharing and ride hailing, a vehicle that serves a trip from location iii to location jjj ends up at jjj. Prices therefore do two jobs: they collect revenue and they steer the fleet. The best dynamic (state-dependent) pricing policy reacts to where every vehicle is, but computing it is a Markov decision problem over a state space that…

28 thms3 active users
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Opinion Dynamics on Directed Complex Networks 3: On a Galton-Watson Limit, the Stationary Opinion with Memory Has Variance at Most That of the Proportional No-Memory RecursionResearch Paper

Linear opinion models describe how individuals in a social network revise their views by averaging what their neighbours think, what external media tell them, and what they themselves believed a moment ago. The last ingredient, an autoregressive or memory term, appears in the Friedkin–Johnsen family of models and in its stochastic variants. Fraiman, Lin and…

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

Human in the Loop Automation: Ride-Hailing with Remote (Tele-)Drivers 3: In a Large Supply-Limited Market, Choosing the Number of Remote Drivers Raises Service Level by a Factor of at Least 2 − αResearch Paper

Autonomous vehicles that cannot yet drive every trip on their own can be supervised or driven by remote (tele-)drivers who sit in a control center and take over a vehicle only while it serves a customer. Because a remote driver is not tied to one vehicle, a platform may operate more vehicles than drivers. Benjaafar, Wang and Yang ask when this decoupling…

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

Human in the Loop Automation: Ride-Hailing with Remote (Tele-)Drivers 2: With Ample Vehicles, Service Level Strictly Increases in the Number of Drivers, with an Explicit Lower BoundResearch Paper

Remote driving, or tele-driving, lets a human operator in a control center drive a vehicle over a wireless link. A ride-hailing platform that adopts it decouples drivers from vehicles: a driver is attached to a vehicle only while that vehicle carries or fetches a customer, and is released the moment the trip ends. Since an idle vehicle needs no driver, the…

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

Human in the Loop Automation: Ride-Hailing with Remote (Tele-)Drivers 1: With Scarce Vehicles, Service Level Rises Then Falls in the Number of Drivers Exactly When Condition (5) HoldsResearch Paper

Remote driving, or tele-driving, separates the driver from the vehicle: a human sitting in a control centre drives a car over a network link and can switch to another car as soon as a trip ends. Commercial pilots of this model exist for car delivery and ride-hailing, and it gives a platform a new design choice. A conventional ride-hailing fleet has one…

6 thms3 active usersReviewed
🏆Completed
Partial Differential EquationsProbability·Captain: LG

Black–Scholes Model: Pricing Formula, PDE and GreeksTextbook

The Black–Scholes model (Black and Scholes, 1973; Merton, 1973) is the reference model for pricing European options. Its closed-form price, the Black–Scholes formula, is quoted daily by options markets, its partial derivatives (the Greeks) are the standard risk measures that trading desks limit and hedge, and the Black–Scholes equation is the prototype of…

42 thms3 active usersReviewed
🏆Completed
AnalysisDynamical Systems·Captain: mikedeng1

On Well-Posedness of Forward–Backward SDEs—A Unified Approach 2: With Constant Coefficients and σ₃ = 0 the Dominating ODE Has a Bounded Solution for Every T Iff F Has a Suitable Zero or Is LinearResearch 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​. FBSDEs are the probabilistic form of quasilinear parabolic PDEs and appear in stochastic control (the stochastic maximum principle), in mathematical finance (hedging with large investors,…

10 thms3 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Limit Theorems for Nearly Unstable Hawkes Processes 3: The Nearly Unstable Hawkes-Based Price Model Converges in Law to a Heston-Type ProcessResearch Paper

High-frequency prices move by discrete ticks, and successive moves are strongly correlated: an upward tick tends to be followed by a downward one. Bacry, Delattre, Hoffmann and Muzy (BDHM12, BDHM13b) proposed to model the upward and downward price jumps as the two components of a bidimensional Hawkes process, a pair of counting processes in which every…

17 thms3 active usersReviewed
🏆Completed
CombinatoricsProbability·Captain: mikedeng1

Separation of Time-Scales and Model Reduction for Stochastic Reaction Networks 2: Positive Combinations Preserve the Balance Condition When Production and Consumption Sets Are DisjointResearch Paper

Stochastic models of chemical reaction networks in cell biology routinely combine species present in a handful of copies with species present in thousands, and rate constants that differ by orders of magnitude. Simulating such a system exactly is expensive, and model reduction replaces it with a lower-dimensional limit. A systematic approach, developed by Ba…

8 thms3 active usersReviewed
🏆Completed
CombinatoricsProbability·Captain: mikedeng1

Separation of Time-Scales and Model Reduction for Stochastic Reaction Networks 3: The Second Time-Scale r₂ Is Strictly Slower than the First Time-Scale r₁Research Paper

Chemical reaction networks can contain reactions whose rates differ by powers of a large scaling parameter. A species may then change on one time scale while other combinations of species remain nearly fixed until a later one. This matters when replacing a detailed network by a smaller model: the quantities retained at the first scale need not be the…

5 thms3 active usersReviewed
🏆Completed
Dynamical SystemsProbability·Captain: mikedeng1

Coexistence and Extinction for Stochastic Kolmogorov Systems 2: If a Boundary Ergodic Measure Is a Sink, then E(min_i X_i(t))^δ → 0 for Every Small δ > 0Research Paper

A population can disappear because its average growth rate is negative when it is rare, even if its deterministic dynamics would support coexistence. Interactions among several species make this harder to assess: a species may be rare while the remaining species fluctuate among several possible long-run configurations. Hening and Nguyen study this problem…

46 thms3 active usersReviewed
🏆Completed
Dynamical SystemsMarkov ChainProbability·Captain: mikedeng1

Coexistence and Extinction for Stochastic Kolmogorov Systems 1: If Every Boundary Ergodic Measure Repels, X Converges Exponentially Fast in Total Variation to a Unique Interior Stationary LawResearch Paper

Whether interacting species can coexist in a fluctuating environment is one of the basic questions of mathematical ecology. Deterministic models (Lotka–Volterra competition, predator–prey systems, food chains) answer it through invasion criteria: a population persists if, whenever it is rare, it grows. In a random environment the analogous criterion is…

39 thms3 active usersReviewed
🏆Completed
Dynamical SystemsProbability·Captain: mikedeng1

Coexistence and Extinction for Stochastic Kolmogorov Systems 3: Almost Surely the Occupation Measures Settle on One Sink Measure µ, and Every Species Absent from µ Dies Out at Rate λ_i(µ) < 0Research Paper

Ecologists model interacting populations — competitors, predators and prey, food chains — by Kolmogorov systems, in which the growth of each species is proportional to its current abundance. Environmental fluctuations turn these into stochastic differential equations, and the basic question becomes which species persist and which go extinct. Hening and…

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

Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin-Whitt Regime 1: Diffusion-Scaled Stationary Queue Lengths Have Expectations Bounded Uniformly in nResearch Paper

Join-the-shortest-queue (JSQ) is the load-balancing rule in which each arriving job is sent to a server with the fewest jobs. It is a baseline in the design of server farms and data centers, and in the many-server Halfin–Whitt regime, where the load per server approaches one at rate 1/n1/\sqrt n1/n​, it combines near-full utilization with vanishing waiting.…

17 thms3 active usersReviewed
🏆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
🏆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
PreviousPage 5 of 14Next

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