Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Probability

2,744 missions · 1,550 completed

Missions

Open1194Completed1550All2744
Operations ResearchStochastic Systems·Captain: mikedeng1

Approximating Systems Fed by Poisson Processes with Rapidly Changing Arrival Rates: A Point Process with Rapidly Fluctuating Arrival Rate Converges Weakly to a Constant-Rate Poisson ProcessResearch Paper

Arrival streams to service systems (call centres, hospitals, web servers) are rarely stationary: their rate changes with the time of day, with external events, or with the state of a self-exciting mechanism. Two asymptotic regimes are standard. When the rate varies slowly relative to service times, the system is approximated by a sequence of stationary…

10 thms2 active usersReviewed
Linear OptimizationOperations ResearchStochastic Systems·Captain: mikedeng1

Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources: The LP-Tracking Policy Is Asymptotically Optimal in Diffusion ScaleResearch Paper

In a fork-join network every arriving job is split into several tasks that are processed in parallel and then joined; the job leaves only when its last task is done. Such networks model parallel computing (map-reduce jobs split across machines), assembly and order fulfilment (an order waits for every component), and health care (a patient waits for several…

21 thms2 active usersReviewed
Control TheoryOperations Research·Captain: mikedeng1

On Singular Control for Lévy Processes: Under a Convex Running Cost, the Barrier Strategy at b* = inf{b : ρ(b) + C ≥ 0} Is Optimal over All Admissible StrategiesResearch Paper

A controller watches a one-dimensional random state XXX (an inventory level, a cash reserve, an exchange rate) and may push it upward at any time, paying a proportional cost CCC per unit of push. A running cost f(Ut)f(U_t)f(Ut​) is paid on the controlled state UUU. Minimizing the discounted sum of the two costs is the classical singular control problem, called singular…

18 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimal TransportStatistics·Captain: mikedeng1

Joint Mixability and Notions of Negative Dependence: The Minimizers of the Worst-Case Quadratic Cost over Subsets of Components Are Exactly the NCD Joint Mixes with Correlation Matrix P*_nResearch Paper

A joint mix is a random vector X=(X1,…,Xn)\mathbf X=(X_1,\dots,X_n)X=(X1​,…,Xn​) whose component sum ∑i=1nXi\sum_{i=1}^n X_i∑i=1n​Xi​ is almost surely constant. For fixed marginal distributions it minimizes the variance, the stop-loss premium and the Expected Shortfall of the aggregate, which comonotonicity maximizes, and for this reason it is regarded as the canonical form of extremal negative…

10 thms2 active usersReviewed
Operations ResearchStatisticsStochastic Systems·Captain: mikedeng1

Quickest Detection Problems for Ornstein–Uhlenbeck Processes: The Optimal Detection Time Is the First Time the Posterior Odds Exceed b(X), the Unique Solution of a Nonlinear Integral EquationResearch Paper

A change in the dynamics of an observed process is often visible only after noisy evidence has accumulated. Stopping early raises a false alarm; waiting too long increases detection delay. The quickest detection problem asks for a rule that balances these losses when the change time is unobserved. Glover and Peskir study this tradeoff for an Ornstein–Uhlenbe…

11 thms2 active usersReviewed
Operations ResearchPartial Differential EquationsStochastic Systems·Captain: mikedeng1

Exact Optimal Stopping for Multidimensional Linear Switching Diffusions: The Optimal Stopping Boundaries Are the Unique Admissible Solution of a Nonlinear Integral EquationResearch Paper

Optimal stopping of a diffusion whose coefficients switch with an exogenous Markov chain is the standard model for decisions taken in a random environment: an investment or abandonment decision when the economy alternates between regimes, a quickest-detection problem whose drift is driven by a hidden chain, a maintenance decision whose degradation rate…

18 thms2 active usersReviewed
Machine LearningOptimizationStatistics·Captain: mikedeng1

Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model: The SDP Clustering Error Is at Most Twice the Oracle Integer Program ErrorResearch Paper

Clustering methods must infer a partition from noisy observations, while the quality of a partition is usually judged against labels that the method cannot see. Fei and Chen study a balanced sub-Gaussian mixture model in which a semidefinite program (SDP) estimates a cluster matrix from pairwise distances. Their Theorem 1 relates its error to a simpler…

13 thms2 active usersReviewed
🏆Completed
Actuarial ScienceOperations Research·Captain: mikedeng1

Endogenous Inverse Demand Functions: Necessary and Sufficient Conditions for a Unique Clearing Price of a Liquidated ClaimResearch Paper

When a bank or fund in distress must sell a large position, the price it receives depends on how much it sells: the market's capacity to absorb the sale is finite. Models of fire sales and systemic risk (for instance Cifuentes, Shin and Ferrucci and Amini, Filipović and Minca) encode this through an inverse demand function, the price per unit as a function…

12 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Strongly Convergent Homogeneous Approximations to Inhomogeneous Markov Jump Processes and Applications: Strong J1 Convergence of the Poisson-Grid Approximations at Rate (log n)n^(−1/2+ε/2)Research Paper

Many stochastic systems switch among a finite set of states at rates that vary with calendar time. A service system may face changing demand through the day; a reliability model may have components whose failure rates change with age. Time-inhomogeneous Markov jump processes describe such changes, but their transition probabilities generally involve product…

10 thms2 active usersReviewed
🏆Completed
Mechanism DesignOperations Research·Captain: mikedeng1

Dynamic Double Auctions: Toward First Best: With One Seller and Many Buyers, the Mechanism That Couples All Promised Utilities Earns First-Best Profit up to O(√(T log T))Research Paper

A platform that matches one seller with several buyers can trade an item whenever a buyer values it more than the seller does. That allocation maximizes the value created by trade in a single period. A platform seeking revenue also has to respect what privately informed agents are willing to report and accept. In a repeated market, it can distribute utility…

7 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Limit Theorems for Default Contagion and Systemic Risk: The Final Size of a Default Cascade on a Random Financial Network Has Asymptotically Gaussian FluctuationsResearch Paper

A bank's failure can make its creditors fail, and those failures can cause further defaults. The final number of failures depends on the network of exposures as well as on each bank's ability to absorb losses. Amini, Cao and Sulem study this question in a directed random network whose banks may have different degrees and different default thresholds. Their…

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

Adaptive Bin Packing with Overflow: Budgeted Greedy Has Expected Cost at Most (3 + 2√2) Times That of the Optimal Policy for I.I.D. Item SizesResearch Paper

Sequential packing matters when an item's size is known statistically before placement but revealed only afterward. A connection request has uncertain bandwidth, a shipment has uncertain final weight, and a virtual machine has uncertain resource use. In each example, exceeding capacity can have a separate cost from opening another container. Perez-Salazar,…

10 thms2 active usersReviewed
Convex OptimizationFunctional AnalysisOperations Research·Captain: mikedeng1

Dual Solutions in Convex Stochastic Optimization: Under Assumption 23 and a Closed Linear pos(dom φ − (0, ū)), No Duality Gap, an Attained Dual Optimum and Scenario-Wise Optimality ConditionsResearch Paper

Multistage stochastic optimization chooses a sequence of decisions while information arrives over time. A decision at time ttt may depend on the observations available by then, but not on later outcomes. That information restriction, called nonanticipativity, links decisions across scenarios. Dual variables for it are useful because they express how an…

11 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Optimal Investment, Heterogeneous Consumption, and Best Time for Retirement: The Optimal Retirement Boundary Increases Near the Mandatory Retirement Age and Tends to Labor Cost over IncomeResearch Paper

Retirement timing is an optimal stopping decision: continuing work earns income but incurs labor cost, while stopping removes both. In the investment model of Jang, Xu and Zheng, the decision also interacts with asset returns and with consumption of basic and luxury goods. The paper separates the retirement decision from the individual's utility…

9 thms2 active usersReviewed
Bandit AlgorithmsLinear algebraMachine Learning·Captain: mikedeng1

The Elliptical Potential Lemma for General Distributions with an Application to Linear Thompson Sampling: For Any Prior and Noise, E[Σ Aₜᵀ Γₜ Aₜ] ≤ 2 max(σ², 1) log det(I + T Γ₁)Research Paper

In a linear bandit problem, a learner chooses a vector and observes a noisy scalar response that carries information about an unknown parameter. Regret analyses often need to control the sum of the learner's uncertainty in the directions it chooses. The familiar elliptical potential lemma does this when uncertainty is represented by the inverse of a…

7 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Power Forward Performance in Semimartingale Markets with Stochastic Integrated Factors: Necessary and Sufficient Conditions for a Power Forward Performance Process under Portfolio ConstraintsResearch Paper

Classical utility maximization fixes a utility function at a terminal horizon and optimizes backwards. Forward investment performance processes (FIPPs), introduced by Musiela and Zariphopoulou (2008; 2010), drop the fixed horizon: the investor's preferences are a random field Ut(x)U_t(x)Ut​(x) specified today and updated forward in time, in such a way that every past…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

Modelling Multiperiod Carbon Markets Using Singular Forward-Backward SDEs: The q-Period Allowance-Price FBSDE with Emission-Dependent Caps Has a Unique Solution and a Unique Decoupling FieldResearch Paper

In a cap-and-trade scheme such as the EU Emissions Trading System, a regulator issues a limited number of emission allowances, firms trade them, and at each compliance date every firm must surrender one allowance per unit emitted or pay a penalty. The allowance price is the quantity regulators and firms care about: it is the marginal cost of emitting.…

14 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Heavy Traffic Limits for Join-the-Shortest-Estimated-Queue Policy Using Delayed Information: Diffusion-Scaled Queue Lengths and Routed Arrivals Converge to the Unique Solution of the Diffusion ModelResearch Paper

Load balancing is the problem of routing a single stream of jobs to several parallel servers so that no server sits idle while another has a long queue. The classical rule, join the shortest queue (JSQ), needs the current length of every queue at every arrival. In large server farms and distributed systems this information arrives late: the dispatcher…

20 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Interior Point Algorithms V: Random Gaussian Feasibility Problems Are Strictly Feasible on One SideTextbook

Worst-case analysis of interior-point methods gives iteration bounds of order n L\sqrt n\,Ln​L or nlog⁡(1/ϵ)\sqrt n\log(1/\epsilon)n​log(1/ϵ), while practical codes finish in a number of iterations that barely grows with the problem size. Chapter 6 of Yinyu Ye's Interior Point Algorithms: Theory and Analysis (Wiley 1997, doi:10.1002/9781118032701) addresses the gap…

6 thms2 active usersReviewed
🏆Completed
Functional AnalysisMachine LearningNumerical Analysis+1·Captain: Shuze Chen

The Nature of Statistical Learning Theory VII: Tikhonov Regularization of Ill-Posed ProblemsTextbook

Estimating a probability density, a conditional probability or a conditional density from data can be written as solving a linear operator equation Af=FAf = FAf=F whose right-hand side FFF is a distribution function. The true FFF is unknown; only its empirical estimate FℓF_\ellFℓ​ is available, built from ℓ\ellℓ observations. The Glivenko–Cantelli theorem and the…

8 thms2 active usersReviewed
🏆Completed
AnalysisHarmonic AnalysisMachine Learning+1·Captain: Shuze Chen

The Nature of Statistical Learning Theory VI: Kernels Generating Regularized Fourier ExpansionsTextbook

A support vector machine never computes its feature map. It only evaluates a kernel K(x,y)K(x, y)K(x,y), the inner product of the feature vectors of xxx and yyy. When the features are the first NNN terms of an expansion, or infinitely many terms damped by regularizing weights, the learning algorithm is practical only if that inner product has a closed form. Chapter 6 of V.…

10 thms2 active usersReviewed
🏆Completed
CombinatoricsMachine LearningStatistics·Captain: Shuze Chen

The Nature of Statistical Learning Theory III: The Growth Function Is Linear or LogarithmicTextbook

Statistical learning theory asks when minimizing the error on a finite sample also controls the error on unseen data. For a set of classifiers, the answer given by Vapnik and Chervonenkis is governed by a single combinatorial quantity: how many different ways the set can label ℓ\ellℓ points. Bounds on the generalization error of empirical risk minimization…

11 thms2 active usersReviewed
Machine LearningStatistics·Captain: Shuze Chen

The Nature of Statistical Learning Theory II: The Basic Inequalities of the Theory of BoundsTextbook

Every guarantee that a learning machine trained by empirical risk minimization will perform well on unseen data rests on one kind of statement: a bound on the probability that, simultaneously over a whole set of functions, observed frequencies stray far from the probabilities they estimate. Vapnik and Chervonenkis proved the first such bounds for sets of…

11 thms2 active usersReviewed
🏆Completed
Markov ChainOperations ResearchStochastic Systems·Captain: Shuze Chen

Introduction to Matrix Analytic Methods in Stochastic Modeling XV: Independence of Level and Phase in QBDsTextbook

A Jackson network of exponential single-server queues has a stationary distribution of product form: the numbers of customers at the nodes are independent in steady state, each geometric (Jackson, 1957; Jackson, 1963). The same property holds for a large family of networks (Kelly, Reversibility and Stochastic Networks, 1979), and it is what makes…

7 thms2 active usersReviewed
🏆Completed
Markov ChainOperations ResearchStochastic Systems·Captain: Shuze Chen

Introduction to Matrix Analytic Methods in Stochastic Modeling XIII: M/G/1- and GI/M/1-Type Chains as QBDsTextbook

Many queueing, inventory and storage models are Markov chains on a two-dimensional state space (n,i)(n, i)(n,i): a level n≥0n \ge 0n≥0 (a queue length, a stock level) and a phase iii (the state of an arrival or service environment). When customers arrive in batches, the level can jump up by several units in one step but comes down one unit at a time; when services are…

9 thms2 active usersReviewed
PreviousPage 69 of 110Next

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