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
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Online Allocation and Pricing: Constant Regret via Bellman Inequalities: Regret Is at Most the Information Loss Plus the Bellman LossResearch Paper

An online allocator must commit to an action after each arrival, although later arrivals can change which actions would have been best. Revenue management and online resource allocation use regret to measure the expected reward lost against a benchmark. If the benchmark sees too much future information, this gap can grow with the horizon even when the…

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

Experimental Design in Two-Sided Platforms: An Analysis of Bias: In Demand-Constrained Markets the Naive Customer-Side Estimator Is Unbiased and the Listing-Side Estimator Is Generically BiasedResearch Paper

Online marketplaces such as lodging, ride-hailing and freelancing platforms test changes to their product (a new ranking, a new fee display, a new photo layout) with randomized experiments. In a two-sided marketplace these experiments are subject to interference: treated and control units compete for the same scarce supply or demand, so the outcome of one…

11 thms2 active usersReviewed
🏆Completed
Control TheoryOperations ResearchProbability·Captain: mikedeng1

Dual Sourcing and Smoothing Under Nonstationary Demand Time Series: Reshoring with SpeedFactories: When the Break-Even Price Is Concave, Dual Sourcing with a SpeedFactory Beats Full Off-ShoringResearch Paper

Firms that moved production offshore for low unit costs pay for it in lead time: a slow global supplier forces large safety stocks, and the cost of those stocks grows with demand variability. A recurring question in operations management is when it pays to re-shore part of production to a fast, local, more expensive plant. Adidas's "SpeedFactories" are the…

10 thms2 active usersReviewed
🏆Completed
AnalysisOperations Research·Captain: mikedeng1

Provably Good Region Partitioning for On-Time Last-Mile Delivery II: An ε-Equitable Partition Keeps Each Subregion's Delivery Time Within 4η/(1−η)² of OptimalResearch Paper

A delivery company can assign each driver a permanent district instead of allowing every driver to serve the whole city. This makes dispatching simpler, but it raises a service question: if the districts receive almost equal shares of demand and travel workload, how different can their expected delivery times be? Carlsson, Liu, Salari and Yu study this…

7 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

Managing Outpatient Service with Strategic Walk-ins I: With Total Capacity μ ≤ √(λC_D/(2R)), the Observable Scheduling Setting Costs No More Than the Unobservable OneResearch Paper

Outpatient clinics serve two kinds of patients: those who book an appointment and those who walk in on the day. Many providers now run open-access or hybrid schedules, which reserve part of the day for walk-ins. Whether patients book or walk in depends on what they know about the appointment delay. Some clinics publish the next available slot in real time…

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

A Dynamic Model for Managing Volunteer Engagement I: The Bellman Equation of the Drift-Rate Control Problem Has a SolutionResearch Paper

Non-profit organizations depend on volunteers whose availability they cannot schedule. They can only influence it, through recruiting drives, reminders and recognition events. Ata, Tongarlak, Lee and Field (arXiv:2312.02920) model a food-recovery non-profit's volunteer pool as a queueing network. Repeat volunteers rest between shifts, one-time volunteers…

17 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Pricing in On-Demand and One-Way Vehicle-Sharing Networks 2: With Workload Budget K, Static Prices Earn a Demand-Independent 1 − O(1/√K) Fraction of the Fluid OptimumResearch Paper

One-way vehicle-sharing systems (car sharing, bike sharing, ride-hailing fleets) set a price for every origin–destination trip. Prices decide which trips are taken, and so they decide where vehicles end up. Pricing that depends on the current position of every vehicle is in principle optimal, but its state space grows combinatorially with the fleet.…

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

Opinion Dynamics on Directed Complex Networks 2: Without Memory on a Galton-Watson Limit, E[R*] = dE[Z_∅] + cE[Z_1] and Var(R*) = d²Var(Z_∅) + ρ*₂d²Var(Z_1)/(1 − ρ₂)Research Paper

Linear opinion models describe each individual's opinion as a weighted average of the opinions of the people they listen to, of an outside signal, and of their own previous opinion. The model goes back to DeGroot (DeGroot 1974) and Friedkin–Johnsen, and its basic questions are when a population reaches consensus and when it polarizes. Fraiman, Lin and…

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

Human in the Loop Automation: Ride-Hailing with Remote (Tele-)Drivers 5: In a Large Supply-Rich Market, a Driver-to-Vehicle Ratio of 1/α Asymptotically SufficesResearch Paper

Tele-driving separates a ride-hailing driver from the vehicle: a remote driver operates a car over a wireless link, and on finishing a trip can immediately take control of another car anywhere in the service region. Several companies have run pilots of this model; Benjaafar, Wang and Yang cite Vay's car-sharing service operated by tele-drivers and Halo's…

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

Human in the Loop Automation: Ride-Hailing with Remote (Tele-)Drivers 4: In a Large Intermediate Market, Remote Drivers Bring No Asymptotic Service-Level GainResearch Paper

In a conventional ride-hailing system every vehicle needs its own driver. Tele-driving, in which a vehicle is driven by a remote operator over a network, separates the two: a pool of nnn remote drivers can serve a fleet of m≥nm \ge nm≥n vehicles, each driver taking control of an idle vehicle near the next customer. Fewer drivers mean lower labor cost, but also…

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

Stability of a Queue Fed by Scheduled Traffic at Critical Loading 1: The Critically Loaded S/D/1 Workload Converges to a Finite Limit If and Only If the Perturbations Are Bounded AboveResearch Paper

Many service systems do not receive random, memoryless traffic: customers are given appointments. Outpatient clinics, airport runways, container terminals and delivery slots all schedule arrivals on a regular grid, and the actual arrival deviates from the appointment by a random lateness or earliness. A queue fed by such scheduled traffic is a basic model…

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

Stochastic Dual Dynamic Integer Programming 1: With Valid, Tight and Finite Cuts, Stochastic Nested Decomposition Finds an Optimal Solution in Finitely Many Iterations with Probability OneResearch Paper

Multistage stochastic programs model decisions taken over time while uncertain data are revealed: generation scheduling in hydro-thermal power systems, capacity expansion, unit commitment, portfolio management. When the uncertainty is represented by a finite scenario tree, the problem becomes one very large deterministic program, and decomposition…

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

Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements I: Average-Loss Bound for Deterministic Price ControlResearch Paper

Hotel rooms, rental cars, cloud servers, hospital beds and event spaces are reusable resources: a customer occupies a unit for a while and then returns it. Pricing them differs from classical revenue management, where a sold unit is gone for good. A sale now blocks capacity only for the length of the service, so the binding constraint is how many services…

8 thms2 active usersReviewed
🏆Completed
Dynamical SystemsProbability·Captain: mikedeng1

Propagation of Chaos for Stochastic Spatially Structured Neuronal Networks with Delay driven by Jump Diffusions 2: The Neuronal Network Converges in L² to Its McKean–Vlasov LimitResearch Paper

Large networks of neurons are often modelled as systems of coupled stochastic differential equations: each neuron carries a low-dimensional state (a membrane potential and recovery variables, as in the FitzHugh–Nagumo model), receives synaptic input from the other neurons with a transmission delay, and is perturbed by noise. Because the number of neurons is…

15 thms2 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Limit Theorems for Nearly Unstable Hawkes Processes 2: When T(1 − a_T) → λ the Rescaled Intensity Converges in Law to a CIR Process and the Rescaled Hawkes Process to Its IntegralResearch Paper

An event stream can raise its own future event rate. A Hawkes process models this feedback by adding to a baseline rate the effects of past arrivals. The parameter measuring total excitation can approach its stability boundary, at which long clusters make a fixed time scale an unreliable guide to the observed count. Jaisson and Rosenbaum identify a regime…

14 thms2 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Limit Theorems for Nearly Unstable Hawkes Processes 1: When T(1 − a_T) → ∞ the Rescaled Hawkes Process Is Asymptotically Deterministic in L²Research Paper

A Hawkes process is a model for events that make further events more likely for a time. It is used when event times cluster, including transaction arrivals in financial markets. Jaisson and Rosenbaum study what happens when the feedback approaches the threshold at which the usual stable model ceases to have a finite long-run mean intensity. The behavior…

11 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryProbability·Captain: mikedeng1

Separation of Time-Scales and Model Reduction for Stochastic Reaction Networks 1: The Balance Condition for Linear Combinations of Species Decomposes over Strongly Connected ComponentsResearch Paper

A stochastic reaction network tracks the counts of chemical species as reactions occur. Different species and reaction rates may grow at different powers of a large system-size parameter. Kang and Kurtz's model-reduction paper uses these powers to identify candidate time scales and combinations of species that can remain bounded. Before a reduced model can…

6 thms2 active usersReviewed
🏆Completed
Mechanism DesignOperations ResearchProbability·Captain: mikedeng1

Pricing and Matching with Forward-Looking Buyers and Sellers 1: Waiting-Adjusted Fixed Prices with Greedy Matching Earn at Least 1 − (1 + 2(b+h)T/(3(p*−w*)))/√µ* of the Fluid Profit BoundResearch Paper

An intermediary such as a ride platform must attract buyers and sellers who arrive at different times. A buyer may wait for a seller; a seller may wait for a buyer. Both sides can choose when to request a match, so an ask price and a bid price affect participation as well as the intermediary's margin. Chen and Hu study whether a simple posted-price policy…

12 thms2 active usersReviewed
🏆Completed
Operations ResearchPartial Differential EquationsProbability·Captain: mikedeng1

Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin-Whitt Regime 2: The JSQ Diffusion Limit Satisfies a Foster-Lyapunov Drift ConditionResearch Paper

Join-the-shortest-queue (JSQ) is the basic load-balancing rule for a system of nnn parallel single-server queues: every arriving customer joins a queue of minimal length. It is optimal in several senses for homogeneous servers and is the reference policy against which cheaper rules (power-of-ddd choices, join-the-idle-queue) are measured. In the Halfin–Whitt…

9 thms2 active usersReviewed
🏆Completed
Control TheoryOperations ResearchProbability·Captain: mikedeng1

Time-Inconsistent Stochastic Linear–Quadratic Control II: With a Scalar State and Deterministic Coefficients, Coupled Riccati Equations Give an Explicit Linear Feedback EquilibriumResearch Paper

In a time-inconsistent control problem, a control that is optimal when planned at time ttt stops being optimal when the problem is re-solved at a later time. Two sources of time inconsistency are common in finance and economics. One is a variance term in the objective, as in continuous-time Markowitz mean–variance portfolio selection (Zhou–Li 2000; Basak–Chaba…

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

Some Useful Functions for Functional Limit Theorems 1: Composition Preserves J₁ Convergence When the Outer Path Is Continuous or the Inner Path Is Continuous and Strictly IncreasingResearch Paper

Random time changes occur when a process is observed on an operational clock rather than calendar time. In queueing models, for example, an arrival-count path may be evaluated at an evolving service clock. A functional limit theorem for the outer path and another for the clock are useful together only when evaluating one path at the times supplied by the…

6 thms2 active usersReviewed
🏆Completed
Probability·Captain: marwahaha

A directional zero–one law under strict ellipticityOpen Problem

A random environment can favor different directions at different sites. The source asks whether escape in one prescribed real direction can have an intermediate probability after averaging over the environment. The source is OpenAI's September 2026 manuscript.

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

Law of Large Numbers Limits for Many-Server Queues 1: The Fluid Equations Have at Most One Solution, Given Explicitly by the Age Representation (3.11)Research Paper

Large service systems such as call centers and hospital wards are modelled as many-server queues: NNN identical servers, customers arriving according to a general process, service requirements drawn independently from a general distribution GGG, and a single first-come-first-served queue. When GGG is not exponential the number of customers in system is not…

10 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
PreviousPage 11 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