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

Is Network Traffic Approximated by Stable Lévy Motion or Fractional Brownian Motion? 1: Infinite Source Poisson Input Under Slow Growth Converges (fidi) to Totally Skewed α-Stable Lévy MotionResearch Paper

Measurements of Ethernet and Internet traffic in the 1990s showed that the amount of data offered to a link is bursty on every time scale and that the lengths of transmissions (file sizes, connection durations) have heavy, regularly varying tails. Two families of approximations for the cumulative input were proposed: fractional Brownian motion, which has…

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

Is Network Traffic Approximated by Stable Lévy Motion or Fractional Brownian Motion? 4: Superposed ON/OFF Input Under Fast Growth Converges in C[0,∞) to Fractional Brownian MotionResearch Paper

Measurements of Ethernet and Internet traffic in the 1990s showed that cumulative traffic is self-similar and long-range dependent: correlations of the input rate decay so slowly that they are not summable, and fluctuations at large time scales do not average out the way Poisson-type models predict (Leland et al. 1994). A widely accepted explanation is that…

9 thms2 active usersReviewed
🏆Completed
Experimental DesignOperations ResearchProbability+1·Captain: mikedeng1

Stochastic Kriging for Simulation Metamodeling II: The MSE of the Optimal Stochastic Kriging Predictor Exceeds the Kriging MSE by a Positive Definite FormResearch Paper

A simulation metamodel is a cheap surrogate for an expensive stochastic simulation: after running the simulation at a few design settings, one predicts the mean response at settings never simulated. Kriging, the interpolation method of geostatistics and of the design and analysis of computer experiments (DACE; Sacks, Welch, Mitchell and Wynn 1989; Santner,…

4 thms2 active usersReviewed
🏆Completed
Experimental DesignOperations ResearchProbability+1·Captain: mikedeng1

Stochastic Kriging for Simulation Metamodeling I: The Plug-In Stochastic Kriging Predictor Is UnbiasedResearch Paper

Stochastic simulation models of queues, supply chains and manufacturing systems are often too slow to run at every input setting of interest. A metamodel fitted to a moderate number of simulation runs then stands in for the simulation, for instance inside an optimization or a sensitivity analysis. Kriging, developed in geostatistics and in the design and…

6 thms2 active usersReviewed
🏆Completed
Control TheoryProbability·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 4: A Nonsingular Linear Backward-Forward System with Lipschitz Constant 1 Has No Solution on the Horizon T = π/2Research Paper

A backward stochastic equation determines its current value from a conditional expectation of future values. A forward equation determines its current value from past values. Coupling the two makes existence depend on more than integrability of the data: the feedback between the past and future can prevent a solution. Antonelli's 1993 paper studies this…

9 thms2 active usersReviewed
🏆Completed
AnalysisOperations ResearchProbability·Captain: mikedeng1

The G/GI/N Queue in the Halfin–Whitt Regime 2: The Diffusion-Limit Equation Is Equivalent to a Renewal-Function Equation, Which Has a Unique Càdlàg SolutionResearch Paper

A G/GI/N queue has NNN identical servers, a general arrival process, a first-come-first-served waiting room and i.i.d. service times with a general distribution FFF of mean 111. In the Halfin–Whitt regime the number of servers grows while the traffic intensity ρN\rho^NρN approaches 111 at rate N(1−ρN)→β∈R\sqrt N(1-\rho^N)\to\beta\in\mathbb RN​(1−ρN)→β∈R; this is the standard asymptotic model…

11 thms2 active usersReviewed
Probability·Captain: mikedeng1

The Two-Parameter Poisson–Dirichlet Distribution Derived from a Stable Subordinator 4: The Density of V_1 under PD(α, θ) Is Determined by the PD(α, α + θ) Law of V_1Research Paper

A random discrete distribution is a random sequence of frequencies V1≥V2≥⋯≥0V_1 \ge V_2 \ge \cdots \ge 0V1​≥V2​≥⋯≥0 with ∑nVn=1\sum_n V_n = 1∑n​Vn​=1. Such sequences model the relative sizes of species in a large population, of allele classes in population genetics, of cycles of a random permutation, of prime factors of a random integer, and of the excursion intervals of a Brownian motion…

13 thms2 active usersReviewed
Probability·Captain: mikedeng1

The Two-Parameter Poisson–Dirichlet Distribution Derived from a Stable Subordinator 3: Moments E_{α,θ}(V_n^p) of the n-th Largest PD(α, θ) Frequency as One Integral of φ_α and ψ_αResearch Paper

Random discrete distributions — a random sequence of nonnegative frequencies V1≥V2≥…V_1\ge V_2\ge\dotsV1​≥V2​≥… summing to one — model the relative sizes of species in a population, of cycles in a random permutation, of excursion intervals of a Markov process, and of clusters in Bayesian nonparametric models. The two-parameter Poisson–Dirichlet law …

10 thms2 active usersReviewed
Control TheoryProbability·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 3: A Linear Backward-Forward System with Lipschitz Constant 1 Has No Solution on a Horizon T ≥ 1Research Paper

A forward equation evolves from an initial random value, while a backward equation is constrained by a terminal random value. When the two unknown processes appear in both equations, these boundary conditions can be incompatible. Such coupled systems occur in stochastic control, where a state moves forward and a cost or adjoint variable is determined…

8 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Old and New Methods for Lost-Sales Inventory Systems 1: Under Any Policy in Z(s) the State Enters X(s) and Never Leaves, So Every State Outside X(s) Is TransientResearch Paper

The lost-sales inventory system with a positive lead time is one of the basic models of inventory theory. Demand that cannot be met from stock is lost rather than backlogged, and orders arrive a fixed number LLL of periods after they are placed. Unlike the backlog system, where the inventory position is a sufficient one-dimensional state and a base-stock…

5 thms2 active usersReviewed
🏆Completed
AnalysisOperations ResearchProbability·Captain: mikedeng1

Some Useful Functions for Functional Limit Theorems 2: Addition, Supremum and the Reflecting Barrier Preserve J₁ Convergence of Linearly Centered PathsResearch Paper

Queueing models often represent work arriving to and leaving a server by a real-valued input path. The resulting workload cannot fall below a barrier. Functional limit theorems describe what happens to such paths under scaling, but a limit for the input path is useful only when it can be carried through the workload transformation. Ward Whitt’s 1980 paper…

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

Understanding the Efficiency of Multi-Server Service Systems II: In the M/M/s Queue with (1 − ρ)√s = γ, the Wait of a Delayed Customer Is Exponential with Mean 1/(γ√s)Research Paper

A service system with several servers can use a larger fraction of its capacity than a single-server system while still giving customers an acceptable wait. The design question is how much unused capacity is needed as the number of servers grows. Ward Whitt's study begins with a factory manager deciding whether to put four machines in one work area. It uses…

4 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

The G/GI/N Queue in the Halfin–Whitt Regime 3: The Number in a Non-Idling G/GI/N System Satisfies the Infinite-Server System Equation (2.8)Research Paper

A many-server queue has NNN identical servers, a stream of arriving customers, and a buffer in which customers wait when every server is busy. It models call centres, hospital wards and server farms, and the regime of practical interest is the Halfin–Whitt or quality-and-efficiency-driven regime, in which the number of servers NNN grows with the arrival rate …

8 thms2 active usersReviewed
Markov ChainProbability·Captain: mikedeng1

Random Walks in a Random Environment 3: With One-Way Mirrors σ ∈ {0, θ}, X_n/(n/log_θ n) → ½ in Probability if γθ = 1, and n^(−1/ρ)X_n Has Limit Laws Along Subsequences if γθ > 1Research Paper

A random walk in a random environment uses transition probabilities selected once for each site, rather than probabilities resampled at every step. Even when the site environments are independent and identically distributed, the walker revisits the same local bias whenever it returns to a site. Its long-time motion can therefore differ sharply from that of…

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

Regenerative Stochastic Processes 2: The Ergodic Theorem — a Cumulative Process Satisfies w_t/t → κ₁/μ₁ with Probability OneResearch Paper

Many quantities in operations research accumulate over time in a system that periodically starts afresh: the cost incurred by an inventory system that returns to the same stock level, the work completed by a server between successive moments it empties, the reward collected by a machine between repairs. The basic question about such a quantity is its…

9 thms2 active usersReviewed
Probability·Captain: mikedeng1

The Two-Parameter Poisson–Dirichlet Distribution Derived from a Stable Subordinator 2: Wendel's Formula E[exp(−λ/V_n)] = e^{−λ} φ_α(λ)^{n−1} ψ_α(λ)^{−n} for PD(α, 0)Research Paper

A random discrete distribution is a random sequence of nonnegative numbers summing to 111. Ranked in decreasing order, V1≥V2≥⋯V_1\ge V_2\ge\cdotsV1​≥V2​≥⋯, such sequences model the relative sizes of species in a population, of cycles of a random permutation, of excursion intervals of a Markov process, and of atoms of random measures used as priors in Bayesian nonparametrics.…

9 thms2 active usersReviewed
Probability·Captain: mikedeng1

The Two-Parameter Poisson–Dirichlet Distribution Derived from a Stable Subordinator 1: Under PD(α, 0) the Ratios V_{n+1}/V_n Are Independent with beta(nα, 1) LawsResearch Paper

Random partitions describe a population split into species, clusters, or types. If the species frequencies are put in decreasing order, the first frequency is the largest species, the second is the next largest, and so on. The Poisson–Dirichlet distribution gives a family of laws for these ranked frequencies. Its two parameters connect different random…

5 thms2 active usersReviewed
🏆Completed
Control TheoryOperations Research·Captain: mikedeng1

Distributed Scheduling Based on Due Dates and Buffer Priorities 2: Under Last Buffer First Serve the Number of Parts Stays Bounded, Eventually by (λc(ε)+γ)/(1−ρ−λε)Research Paper

Semiconductor wafer fabrication lines are reentrant: a wafer returns to the same photolithography or etching station many times along its route, so the parts competing for a machine are at different stages of completion. In such a line, a local dispatching rule decides at every machine which waiting part goes next, and the question is whether a given rule…

10 thms2 active usersReviewed
🏆Completed
Control TheoryOperations Research·Captain: mikedeng1

Distributed Scheduling Based on Due Dates and Buffer Priorities 1: First Buffer First Serve Is Stable on Every Nonacyclic Flow Line Whose Bursty Arrival Rate Is Below CapacityResearch Paper

Semiconductor wafer fabs are the standard example of a reentrant manufacturing line: a wafer visits the same lithography or etching station many times along a route of hundreds of steps, so each station holds parts at many different stages of completion and must decide, every time a machine frees up, which of them to serve next. Kumar (Re-entrant lines,…

7 thms2 active usersReviewed
🏆Completed
Markov ChainProbability·Captain: mikedeng1

On the Generalized “Birth-and-Death” Process 3: Given the Mean Growth n̄_t, the Rates λ = (n̄′/n̄)⁺, μ = (n̄′/n̄)⁻ Uniquely Minimize Var(n_t) for All tResearch Paper

In a birth-and-death population model, an expected population curve does not determine the amount of random variation. Births and deaths can occur frequently while nearly canceling in the mean, or one of the two rates can vanish while giving the same mean. This distinction matters when a prescribed growth curve is used to model a population: two processes…

6 thms2 active usersReviewed
Control TheoryProbability·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 2: The Coupled Backward-Forward System Has a Unique Adapted Solution When k Times the H∞ Norm of D Is Below OneResearch Paper

A backward-forward stochastic differential equation couples two equations that run in opposite time directions: a forward equation for a state UUU, started from a given input, and a backward equation for a quantity VVV, pinned at a terminal time by a random variable YYY. Each equation's coefficients depend on both unknowns, so the solution at time ttt depends on…

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

METRIC: A Multi-Echelon Technique for Recoverable Item Control 2: Under Poisson Demand Expected Backorders Are Strictly Convex in the Mean, So a Point Estimate Understates ThemResearch Paper

Spare-parts provisioning for repairable ("recoverable") items is a classical inventory problem: aircraft components fail, are sent to repair, and a stock of spares covers the units in the repair pipeline. Sherbrooke's METRIC model (Sherbrooke 1968), developed at RAND for the U.S. Air Force, measures the performance of a stock level by the expected number of…

6 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainOperations Research·Captain: mikedeng1

Quality Control under Markovian Deterioration 1: A Discounted-Optimal Policy Produces, Inspects, Produces Again and Revises on Successive Intervals of the BeliefResearch Paper

A production process deteriorates over time, and the state it is in cannot be observed directly. Each period the operator chooses among three actions: produce without looking, produce and inspect the item (which reveals the current state at a cost), or revise the process back to its good state. This is one of the earliest partially observed Markov decision…

10 thms2 active usersReviewed
OptimizationProbabilityStatistics·Captain: mikedeng1

Stochastic Estimation of the Maximum of a Regression Function: The Kiefer–Wolfowitz Iterates z_n Converge in Probability to the Maximizer θResearch Paper

Many problems in statistics, engineering and operations research ask for the input level xxx at which an unknown response function is largest, when the response can only be measured with noise: the dose that maximizes a yield, the setting that maximizes throughput in a simulation, the parameter that maximizes an expected reward. Robbins and Monro (1951) had…

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

The Theory of Queues with a Single Server: The Waiting-Time Distribution Has a Proper Limit iff E(u) < 0 or u = 0 Almost SurelyResearch Paper

The single-server queue with general independent interarrival and service times (the GI/G/1 queue) is the basic model of congestion in operations research: customers arrive at a service facility, wait if the server is busy, are served in order of arrival, and leave. The first question about any such system is whether it settles down. If customers keep…

11 thms2 active usersReviewed
PreviousPage 20 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