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
Markov ChainProbability·Captain: Shuze Chen

Markov Chains and Mixing Times VI: Networks, Hitting Times, and Cover TimesTextbook

A reversible Markov chain is an electrical network: states are nodes, and the conductance c(x,y)=π(x)P(x,y)c(x,y)=\pi(x)P(x,y)c(x,y)=π(x)P(x,y) turns hitting probabilities into voltages and hitting times into resistances. This dictionary, going back to Kakutani and popularized by Doyle and Snell, converts probabilistic estimates into the physical laws of circuits — series/parallel…

15 thms4 active usersReviewed
🏆Completed
Markov ChainProbability·Captain: Shuze Chen

Markov Chains and Mixing Times I: Existence and Uniqueness of the Stationary DistributionTextbook

Finite Markov chains are the basic model for memoryless random dynamics: card shuffles, random walks on graphs and groups, Monte Carlo samplers, and queueing systems are all chains on a finite state space. The single most used fact about them is that an irreducible chain has exactly one stationary distribution — a probability vector π\piπ with π=πP\pi = \pi Pπ=πP —…

20 thms4 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: iris

How Does Risk Hedging Impact Operations? Insights from a Price-Setting Newsvendor Model: When the Asset Trend Raises Demand, Hedging Lowers the Optimal Price and Virtual Production QuantityResearch Paper

Manufacturers whose demand moves with a traded asset (automakers with oil prices, airlines with fuel, exporters with exchange rates) can trade that asset continuously while they set prices and production. Whether such financial hedging should change operational decisions, and in which direction, is a question operations management has asked since Gaur and…

34 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: iris

Limit Theory for Taboo-Regenerative Processes: Conditioned on No Exit by Time ttt, the Cycles Around ttt and the Age Converge Uniformly to the Two-Sided Taboo Limit P∗P^*P∗Research Paper

Many stochastic models are studied up to a failure: a queue until overflow, a network until a job is lost, a reliability system until breakdown, a Markov chain until it leaves a set of states. When failure is rare, the informative object is the process conditioned on no failure so far. For Markov chains this is the classical theory of quasi-stationary…

20 thms3 active usersReviewed
🏆Completed
AnalysisProbability·Captain: WillR

MarkovProcess: Verified Library Import and Continuous-Path ExistenceResearch Paper

Import Scott Armstrong's existing Lean 4 MarkovProcess formalisation into Prove2Me as individually reusable, remotely verified declarations. Preserve the upstream statements, complete proof terms, source citations and Apache-2.0 attribution.

731 thms3 active usersReviewed
🏆Completed
AnalysisProbability·Captain: WillR

Itô Calculus II: Product Rule, Quadratic Variation and Stochastic ExponentialsTextbook

The first Prove2Me Itô's lemma mission established the time-dependent scalar stochastic chain rule under explicit regularity and integrability assumptions. Itô calculus II develops its structural consequences: products of correlated Itô processes, quadratic covariation, Brownian squares, integration by parts, stochastic exponentials and geometric Brownian…

23 thms3 active usersReviewed
🏆Completed
AnalysisProbability·Captain: WillR

Itô's Lemma: Brownian Motion, Quadratic Variation and the Stochastic Chain RuleTextbook

Itô's lemma is the stochastic chain rule. It identifies the additional drift created when a nonlinear function is applied to a process with Brownian fluctuations. This second-order correction is central to stochastic differential equations, martingales and mathematical finance. The Wikipedia article discusses the scalar formula, multidimensional and jump…

23 thms3 active usersReviewed
🏆Completed
Markov ChainOperations ResearchOptimization·Captain: mikedeng1

Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework: Elevated-Flow-Relaxation Prices Earn an m/(m+n−1) Fraction of the Optimal State-Dependent ObjectiveResearch Paper

Bike-sharing and car-sharing systems, and ride-hailing platforms, all move a fixed fleet of units between stations. Every ride takes a unit away from its origin and leaves it at its destination, so demand that is unbalanced across stations drains some stations and floods others. Pricing is the main lever an operator has: raising the price of rides out of a…

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

Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems: Dispatching to One Remembered Server, Updated by Queue-Length Messages, Is Stable for Every Vector of Server RatesResearch Paper

A central dispatcher that routes jobs to parallel servers is the basic model behind web server farms, cloud schedulers and call centers. When the servers have different speeds, and the speeds are not known to the dispatcher, two classical policies behave very differently. Random routing is cheap but unstable as soon as some server is slower than the average…

8 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchProbability·Captain: mikedeng1

Joint Product Framing (Display, Ranking, Pricing) and Order Fulfillment Under the Multinomial Logit Model for E-Commerce Retailers: Randomized Framing and Fulfillment Loses O(√θ) Against DET'Research Paper

An online retailer decides, for every arriving customer, how to frame its catalog: which products are displayed, in which section or position, and at which of several price points. Framing changes demand. A product on a promotional banner sells more than the same product further down the page. The retailer must also decide which fulfillment center (FC)…

9 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Queueing Dynamics and State Space Collapse in Fragmented Limit Order Book Markets: every equilibrium is the lifting of a one-dimensional workload equilibriumResearch Paper

US equities trade on many exchanges at once. Each exchange keeps its own limit order book, and at the national best bid the same price is offered in several queues that differ in the rebate the exchange pays a liquidity provider and in how long a resting order waits to be filled. An investor who posts a limit order chooses an exchange, or decides to cross…

7 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: Shuze Chen

Food Delivery Service and Restaurant: Friend or Foe?: With Convenient Delivery, a Critical Mass of Tech-Savvy Customers Makes the Restaurant Delivery-Only and Cuts Platform Profit and WelfareResearch Paper

Food delivery platforms such as Uber Eats, DoorDash and Meituan let a restaurant serve customers who never enter it, but they also charge those customers a delivery fee and share the restaurant's kitchen with its walk-in trade. Whether the platform helps or hurts the restaurant is a question restaurant owners, platforms and regulators all ask. Chen, Hu and…

11 thms3 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Follow the Crowd with Uncertain Service Capacity: A Customer Who Infers Capacity from the Queue Length Follows the Crowd if and only if the Reward-Cost Ratio Lies in an Inference IntervalResearch Paper

Whether a customer joins a queue depends on how long she expects to wait. In the classical observable-queue model of Naor (1969), the service rate is known, and a longer queue only means a longer wait: customers avoid the crowd (ATC), so the more willing others are to join, the less willing the individual is. Many services do not publish their capacity.…

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

ε-Strong Simulation of Fractional Brownian Motion and Related Stochastic Differential Equations: The Last Record-Breaking Dyadic Level Has Finite Exponential Moments and Bounds the Uniform ErrorResearch Paper

Fractional Brownian motion (fBM) is the standard Gaussian model of long-range dependence and rough paths. It appears in network traffic, finance (rough volatility), hydrology and queueing, and it drives a class of stochastic differential equations whose solutions are defined pathwise by Young integration. Simulating such models needs sample paths of fBM,…

10 thms3 active usersReviewed
🏆Completed
Markov ChainOperations ResearchProbability·Captain: Shuze Chen

Introduction to Matrix Analytic Methods in Stochastic Modeling XII: Level-Dependent QBDs and Their Minimal SolutionsTextbook

Many queueing and reliability models are Markov chains on a two-dimensional state space whose first coordinate, the level, moves by at most one unit per transition, while the second, the phase, records an auxiliary state such as the phase of a service time or the number of busy servers. When the transition probabilities do not depend on the level, such a…

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

Optimal Auction Duration: A Price Formation Viewpoint: Semi-Explicit Formula for the Expected Squared Clearing-Price Error E(h) as a Function of the Auction DurationResearch Paper

Most equity markets trade through a continuous limit order book (CLOB): any market order is matched immediately against the resting limit orders. Budish, Cramton and Shim (QJE 2015) argued that continuous matching creates mechanical arbitrage and a race in speed between high-frequency market makers, and proposed frequent batch auctions instead, with a lower…

10 thms3 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Off-Platform Threats in On-Demand Services: At the Optimal Payout Ratios, a Provider Type Leaks Off the Platform if and only if the Counterparty Risk Lies in the Leakage Interval (a^j, b^j)Research Paper

On-demand service platforms (home cleaning, tutoring, handyman and care services) match customers with independent providers and keep a commission on every transaction. Once a customer and a provider have met through the platform, both can save the commission by transacting directly the next time. This platform leakage (also called disintermediation) is a…

16 thms3 active users
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Queueing Systems with Rationally Inattentive Customers: Existence and Uniqueness of the Customer EquilibriumResearch Paper

Whether a customer joins a queue depends on how congested she believes it is. Classical strategic queueing studies two extremes. In the visible queue of Naor (1969) every arrival sees the queue length and joins exactly when her net payoff is nonnegative; in the invisible queue of Edelson and Hildebrand (1975) arrivals see nothing and act on the stationary…

11 thms3 active usersReviewed
🏆Completed
Control TheoryOperations Research·Captain: mikedeng1

New Venture Creation: A Drift-Variance Diffusion Control Model: The Optimal Policy Is at Most a Two-Interval PolicyResearch Paper

An entrepreneur developing a venture repeatedly chooses between strategies that differ in speed, risk and cost: a safe, slow approach or a fast, risky one. Wang and Zenios model this as a drift–variance diffusion control problem (SSRN 3667132; published in Operations Research, 2021, doi:10.1287/opre.2021.2171): the controller chooses not only the drift of a…

19 thms3 active usersReviewed
🏆Completed
Markov ChainOperations Research·Captain: mikedeng1

Smart Policies for Multisource Inventory Systems and General Tandem Queues with Order Tracking and Expediting: State Space and Product-Form Stationary Distribution under Policy-MResearch Paper

An inventory system can replenish demand from several stages of a supply process. When an order is placed, the manager chooses where it enters; when work finishes at one stage, the manager may send it past intermediate stages to speed delivery. These choices change the future congestion of every stage. A stationary occupancy distribution is needed to…

12 thms3 active users
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

A Model of Queue-Scalping: A Single Queue-Scalper Enters the Queue if and only if the Demand Volume Is IntermediateResearch Paper

A customer who is short of time may pay for a better place in a service queue. Unlike resale of a fixed ticket, this transaction changes the waits faced by later customers, and those customers' choices then change the value of the position being sold. Yang, Wang, and Cui study this feedback in an unobservable queue with a firm that repeatedly sells its…

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

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 6: Under LIFO Issuance with m ≥ 2 and S^NP > D̲ > 0 the Best Base-Stock Policy Is Not Asymptotically Optimal as θ → ∞Research Paper

Blood platelets, fresh produce and many pharmaceuticals have a fixed lifetime: a unit not used within mmm periods of its arrival must be discarded. Optimal ordering for such products depends on the whole age profile of the stock, and the dynamic program that describes it has an (m−1)(m-1)(m−1)-dimensional state. It is intractable beyond small mmm (Nahmias, 1982;…

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

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 7: With Backlogging and Positive Lead Times a Simple Base-Stock Policy Is Asymptotically Optimal in m, n and θResearch Paper

Blood platelets, fresh produce, dairy and many pharmaceuticals have a fixed shelf life: a unit that is not used within mmm periods of its arrival must be discarded. Managing such products is a classical problem of inventory theory (Nahmias 1982, Operations Research 30(4), doi:10.1287/opre.30.4.680). The optimal ordering policy depends on the entire age…

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

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 4: Under FIFO Issuance the Heuristic Base-Stock Policy Is Asymptotically Optimal as the Unit Outdating Cost GrowsResearch Paper

Blood platelets, fresh produce, bakery items and many pharmaceuticals have a fixed lifetime: a unit that is not used within mmm periods of arrival must be discarded. Replenishing such a product is a classical problem of inventory theory (Nahmias 1982), and its optimal policy depends on the whole age profile of the stock, so it cannot be computed for realistic…

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

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 5: Under LIFO Issuance a Simple Base-Stock Policy Has Gap ≤ 3θE[(S^NP−D)⁺]/(2m) and Is Asymptotically Optimal in p and θResearch Paper

Blood platelets, fresh food and many pharmaceuticals have a fixed lifetime: a unit that has not been used within mmm periods of its arrival must be discarded. A retailer of such a product faces the usual trade-off between leftover stock and lost sales, plus the cost of discarding outdated units. The issuance policy, the order in which units of different ages…

18 thms3 active usersReviewed
PreviousPage 4 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