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
Dynamical SystemsOperations Research·Captain: mikedeng1

Stability and Instability of Fluid Models for Reentrant Lines 5: Without Immediate Feedback, Every Work-Conserving Fluid Model of a Two-Station Kelly-Type Line Is StableResearch Paper

A multiclass queueing network can be unstable even when every station has enough capacity on average: the queue lengths grow without bound although each server's nominal load is below one. Kumar and Seidman, Lu and Kumar (1991) and Rybko and Stolyar (1992) exhibited such networks under simple priority disciplines. This raised the question of which networks…

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

Asymptotic Optimality of Order-up-to Policies in Lost Sales Inventory Systems: Ordering Up to the Newsvendor Level for Penalty b + τh Is Asymptotically Optimal as b → ∞Research Paper

Periodic-review inventory systems face a simple choice each period: how much to order before the next demand is known. When unmet demand is lost, the order can affect the stock available several periods later without preserving a backlog that records earlier shortages. This makes the optimal policy difficult to describe when replenishment takes time. An orde…

16 thms5 active usersReviewed
🏆Completed
Markov ChainOperations ResearchProbability·Captain: mikedeng1

Reversibility and Stochastic Networks II: Migration Processes with Blocking — Reversibility and Product-Form EquilibriumTextbook

A migration process is a continuous-time Markov model of a population spread over JJJ sites, called colonies, in which individuals move one at a time: between colonies, out of the system, or into it from outside. The model was introduced by Whittle (1967) and Kingman (1969) and is the framework of Chapter 2 of F. P. Kelly, Reversibility and Stochastic Networks…

10 thms5 active usersReviewed
🏆Completed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Stochastic Orders VII: The Multivariate Convex OrderTextbook

Chapter III's convex order compares two real-valued random variables by "how spread out" they are, holding the mean fixed. Chapter VII lifts the same idea to random vectors: XXX is smaller than YYY in the multivariate convex order if every convex function of XXX has smaller expectation than the same function of YYY. This mission formalizes that order, its…

12 thms5 active usersReviewed
🏆Completed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Stochastic Orders VI: The Multivariate Stochastic OrderTextbook

Chapter I's usual stochastic order compares two real-valued random variables by "how large" they tend to be. Chapter VI lifts the same idea to random vectors: XXX is smaller than YYY in the usual multivariate stochastic order if XXX is less likely than YYY to land in any upper set of Rn\mathbb{R}^nRn — any region defined by "at least this large in every coordinate."…

9 thms5 active users
🏆Completed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Stochastic Orders IV: The Increasing Convex and Increasing Concave OrdersTextbook

Chapter I's usual stochastic order compares "how large" two random variables tend to be; Chapter III's convex order compares "how spread out" they are, holding the mean fixed. Chapter IV's increasing convex and increasing concave orders combine the two: X≤icxYX \le_{icx} YX≤icx​Y says XXX is both smaller and less variable than YYY in a single comparison, without forcing…

10 thms5 active users
🏆Completed
Convex OptimizationMachine LearningOperations Research+1·Captain: mikedeng1

First-Order and Stochastic Optimization Methods for Machine Learning IV: Variance-Reduced Mirror Descent for Finite-Sum ProblemsTextbook

Empirical-risk-minimization objectives in machine learning are finite sums: Ψ(x)=1m∑i=1mfi(x)+h(x)\Psi(x) = \frac{1}{m}\sum_{i=1}^m f_i(x) + h(x)Ψ(x)=m1​∑i=1m​fi​(x)+h(x), one smooth term fif_ifi​ per training example (or per worker, in a distributed setting), plus a simple nonsmooth regularizer hhh. Chapter 4's basic stochastic mirror descent handles this by sampling a single random component gradient …

10 thms5 active users
🏆Completed
Markov ChainProbability·Captain: Shuze Chen

Markov Chains and Mixing Times XII: Continuous Time and Countable State SpacesTextbook

The whole series so far lived in discrete time on finite state spaces. Chapters 20–21 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) lift both restrictions. Running the jumps of a chain at the arrivals of a rate-one Poisson clock produces the continuous-time chain, whose transition semigroup — the heat kernel — converges to stationarity…

17 thms5 active usersReviewed
🏆Completed
Markov ChainProbability·Captain: Shuze Chen

Markov Chains and Mixing Times VII: Eigenvalues and the Cheeger InequalityTextbook

How fast does a Markov chain forget its starting point? For a reversible chain the complete answer is coded in the eigenvalues of its transition matrix: the largest eigenvalue is always 111, and the size of the gap between 111 and the rest of the spectrum is the chain's fundamental time constant — a large gap means fast mixing, a small gap means slow mixing.…

24 thms5 active usersReviewed
🏆Completed
Markov ChainProbability·Captain: Shuze Chen

Markov Chains and Mixing Times IV: Lower Bounds on Mixing TimesTextbook

Missions II–III produce upper bounds on mixing times. Whether such a bound is sharp is a different question: an O(n2)O(n^2)O(n2) bound on a chain that actually mixes in nlog⁡nn\log nnlogn steps hides the truth. Chapter 7 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) develops the standard toolkit of lower bounds: the counting and diameter bounds (a chain…

12 thms5 active usersReviewed
🏆Completed
Markov ChainProbability·Captain: Shuze Chen

Markov Chains and Mixing Times III: Coupling and Strong Stationary TimesTextbook

The Convergence Theorem of Mission II says an irreducible aperiodic chain mixes geometrically, but with constants coming from a crude Doeblin decomposition — useless for actual chains, whose state spaces are exponentially large. Chapters 5–6 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) develop the two classic probabilistic techniques…

22 thms5 active usersReviewed
🏆Completed
Machine LearningOperations ResearchQuantum Information·Captain: tianyipeng

Markov Entanglement: Value Decomposition Error in Multi-agent MDPsResearch Paper

Value decomposition — approximating the value of a joint state by a sum of per-agent local values — is a staple of multi-agent dynamic programming and reinforcement learning, from index policies for restless bandits to modern MARL architectures, yet it is normally used without justification. Chen and Peng (arXiv:2506.02385) supply one. They show a…

25 thms5 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: iris

Cloud Cost Optimization: Model, Bounds, and Asymptotics: The Newsvendor Policy π* Has Optimality Gap at Most √θ Times the Bound (14), So It Is Asymptotically Optimal as Demand Scales by θResearch Paper

Cloud providers sell computing capacity in two ways: reserved resources, paid for every period whether used or not, and on-demand resources, rented one period at a time at a higher price. A firm that runs a stream of computing jobs with deadlines must decide how much capacity to reserve once, how much to rent each period, and which job runs on which…

48 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: Shuze Chen

Markov Decision Processes (Puterman) VIII: Average Optimality for Semi-Markov ModelsTextbook

A controller may make decisions whenever a machine fails, a customer arrives, or a service finishes. The time between two decisions then depends on the state and the chosen action. Counting decisions alone does not measure elapsed operating time: a policy earning a large reward per decision may spend so long between decisions that its reward per unit time…

7 thms4 active usersReviewed
🏆Completed
AnalysisProbability·Captain: WillR

Feynman–Kac Formula: Diffusion PDE Representation and UniquenessTextbook

The Feynman–Kac formula links solutions of parabolic partial differential equations to expectations of functionals of diffusion processes. It provides the probabilistic meaning of a differential equation containing drift, diffusion, discounting and a source term. The Feynman–Kac article presents the one-dimensional terminal-value formula and a martingale…

45 thms4 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Tail-Optimized Caching for LLM Inference: Expected-Tail-Optimized LRU Is an Optimal Online Caching Policy for Tail Excess Latency in the Stochastic Conversation ModelResearch Paper

A large language model serving a multi-turn conversation re-reads the whole conversation history at every turn. The intermediate attention state of that history, the KV cache, can be stored in GPU memory and reused, so that only the uncached part of the prompt must be recomputed before the first output token appears. GPU memory is scarce, so a server must…

8 thms4 active usersReviewed
🏆Completed
Markov ChainOperations ResearchProbability·Captain: Shuze Chen

Stochastic Networks X: Stationary Open Migration Processes Under Time ReversalTextbook

A network of queues records both how many customers occupy each location and how they move between locations. These are different kinds of information. A simple distribution for the occupancies at one time need not make the arrival streams simple, or make the queues independent over time. Open migration processes provide a setting in which the distinction…

10 thms4 active usersReviewed
🏆Completed
Linear algebraMarkov ChainNumerical Analysis+2·Captain: Shuze Chen

Introduction to Matrix Analytic Methods in Stochastic Modeling VII: G, U and R as Minimal Nonnegative SolutionsTextbook

A quasi-birth-and-death process (QBD) is the Markov chain behind queues with phase-type service or arrivals, priority queues, and many models of telecommunication and inventory systems: a level that moves up or down by at most one per step, and a phase that carries the rest of the state. Its stationary distribution is determined by three matrices indexed by…

19 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: Shuze Chen

Average Cost Markov Decision Processes with Weakly Continuous Transition Probabilities: Assumptions (W*) and (B̲) Give the Average Cost Optimality Inequality and a Stationary Optimal PolicyResearch Paper

A Markov decision process (MDP) with the average cost per unit time criterion models a controller who runs a stochastic system indefinitely and cares about long-run cost rather than any finite horizon: inventory control, queueing control, and maintenance are standard examples. The basic questions are whether an optimal policy exists, whether it can be taken …

15 thms4 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

We Are on the Way: Analysis of On-Demand Ride-Hailing Systems: In the One-Direction Approximation, the No-Call Mechanism Never Has a Longer Average Waiting Time Than the Call MechanismResearch Paper

On-demand ride-hailing platforms replaced street-hailing on the promise that matching a passenger to a car at the moment of the request shortens the wait. Feng, Kong and Wang (SSRN 2960991, later published in Manufacturing & Service Operations Management, doi:10.1287/msom.2020.0880) ask whether that is true in a stylized model and find that it need not be:…

14 thms4 active users
🏆Completed
EconomicsOperations ResearchProbability·Captain: mikedeng1

Providing Data Samples for Free: Free Samples Strictly Beat Selling in One Round When the Seller-Side Drift of the Buyer's Bayes Risk Is Initially PositiveResearch Paper

Firms that own data increasingly sell it as a product: market research panels, consulting reports, datasets for training demand models. A common commercial practice is to hand out a free sample of the data before quoting a price for the rest. Under standard Bayesian reasoning this practice looks self-defeating. Every free data point reduces the buyer's…

16 thms4 active users
🏆Completed
Algorithmic Game TheoryConvex OptimizationOperations Research+1·Captain: mikedeng1

On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games 2: Randomized Inexact Best Response Reaches an ϵ-NE in Explicitly Bounded Expected SG StepsResearch Paper

Many noncooperative problems in communication networks, power markets and supply chains are stochastic Nash games. Each player minimizes an expected cost that depends on its own decision and on the decisions of its rivals, and the expectation can only be sampled, not evaluated. A natural distributed way to compute an equilibrium is the best-response scheme:…

21 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationOperations Research+1·Captain: mikedeng1

On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games 1: Synchronous Inexact Best Response Reaches an ϵ-NE in Explicitly Bounded Projected SG StepsResearch Paper

Many equilibrium problems in operations research, such as networked Cournot competition, power markets and communication networks, are stochastic Nash games: each player minimizes an expected cost fi(xi,x−i)=E[ψi(xi,x−i;ξ)]f_i(x_i,x_{-i})=\mathbb E[\psi_i(x_i,x_{-i};\xi)]fi​(xi​,x−i​)=E[ψi​(xi​,x−i​;ξ)] that depends on the rivals' strategies and on a random vector ξ\xiξ whose law is accessible only through samples. B…

13 thms4 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Little's Law as Viewed on Its 50th Anniversary: L = λW Holds Exactly Over Any Finite Window [0, T], With Nonzero Starting and Ending QueuesResearch Paper

Little's Law, L=λWL = \lambda WL=λW, relates three averages of a queuing system: the average number of items in the system LLL, the average arrival rate λ\lambdaλ, and the average time an item spends in the system WWW. It is used throughout operations management and computer architecture, where two of the three quantities are measured and the third is inferred.

10 thms4 active usersReviewed
🏆Completed
Dynamical SystemsOperations ResearchTheoretical Computer Science·Captain: mikedeng1

The Power of Two Choices in Randomized Load Balancing I: In the Limiting Supermarket System the Expected Time Converges to T_d(λ) = Σ λ^((d^i−d)/(d−1))Research Paper

Randomized load balancing asks how much a dispatcher gains from a little information. In the supermarket model, jobs arrive at nnn servers and each job inspects a few servers chosen at random before joining one. With one random choice every server is an independent M/M/1 queue, and the expected time a job spends in the system is 1/(1−λ)1/(1-\lambda)1/(1−λ) at load λ\lambdaλ.…

8 thms4 active usersReviewed
PreviousPage 2 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