Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Markov Chain

295 missions · 185 completed

Missions

Open110Completed185All295
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Fundamentals of Queueing Theory V: Closed Jackson Networks and the Mean-Value RecursionTextbook

Networks of queues model systems in which a job visits several service stations in turn: jobs in a computer system alternating between CPU and disks, machines cycling between operation and repair, parts routed through a job shop. In a closed network no job enters or leaves; a fixed population of NNN customers circulates among kkk nodes. Closed networks are the…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Fundamentals of Queueing Theory IV: The Stationary Distribution of the M/M/1 Retrial QueueTextbook

In many service systems a customer who finds every server busy does not join a queue. A caller who hears a busy signal hangs up and redials later; a request rejected by a saturated server is resent after a timeout; an aircraft that cannot land circles and tries again. These retrial queues are the subject of a substantial literature in telephone traffic…

10 thms3 active usersReviewed
🏆Completed
AnalysisOperations ResearchProbability+1·Captain: mikedeng1

Fundamentals of Queueing Theory III: The Transient M/M/1 Queue via Modified Bessel FunctionsTextbook

Steady-state formulas describe a queue that has been running forever. Many practical questions are about a queue that has not: a call centre just after opening, a server just after a reset, a system under a burst of load. For these, the relevant quantity is the transient distribution pn(t)=Pr⁡{N(t)=n}p_n(t) = \Pr\{N(t) = n\}pn​(t)=Pr{N(t)=n} of the number N(t)N(t)N(t) in the system at a finite time …

15 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Fundamentals of Queueing Theory II: Erlang's Formulas and the Halfin–Whitt Square-Root Staffing LawTextbook

Every call center, hospital ward, cloud server pool and telephone exchange that is sized by formula is sized by one of a handful of explicit expressions from Markovian queueing theory. The two oldest are A. K. Erlang's: the Erlang-B (loss) formula of 1917, which gives the fraction of calls lost when ccc trunks carry an offered load of rrr erlangs, and the Erlang…

12 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Fundamentals of Queueing Theory I: Foster's Criterion for Positive RecurrenceTextbook

Almost every model in queueing theory is analysed through a Markov chain. The number of customers in an M/M/c queue is a continuous-time birth–death chain; the number left behind by departing customers of an M/G/1 queue is a discrete-parameter chain on {0,1,2,… }\{0,1,2,\dots\}{0,1,2,…} (the imbedded Markov chain); networks of queues are chains on vectors of queue lengths.…

11 thms3 active usersReviewed
Dynamic ProgrammingOperations ResearchProbability+1·Captain: mikedeng1

Stochastic Dynamic Programming and the Control of Queueing Systems VII: The (BOR) Assumptions and Positive Recurrence of Optimal PoliciesTextbook

Queueing control problems (admission control, routing, service rate selection) are naturally modelled as Markov decision chains with a countably infinite state space and unbounded costs, for instance a holding cost that grows with the queue length. For such models the long-run average cost criterion is often the relevant one, and the central question is…

15 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Dynamic Programming and the Control of Queueing Systems XIII: Lyapunov Criteria and z Standard Markov Chains with CostsTextbook

Average cost control of queues rests on a small amount of Markov chain theory: when does a chain with costs have a well defined long-run average cost, and how can that be checked for a concrete model with an unbounded state space? Appendix C of L. I. Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999, doi:10.1002/9780470…

12 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Stochastic Dynamic Programming and the Control of Queueing Systems VIII: Computing Average Cost Optimal Policies by Approximating SequencesTextbook

Control problems for queueing systems (admission control, service rate control, routing to parallel servers) are naturally modelled as Markov decision chains whose state is a vector of queue lengths. The state space is therefore denumerably infinite, and the performance measure of interest is usually the long-run average cost per slot. For such models the…

14 thms3 active users
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Stochastic Dynamic Programming and the Control of Queueing Systems IV: Average Cost Optimal Stationary Policies Exist for Finite State SpacesTextbook

Controlled queues, inventories and communication links are run for a long time, and the quantity an operator usually cares about is the long-run average cost per period rather than a discounted total. The average cost criterion is harder to work with than the discounted one: its value is a lim sup⁡\limsuplimsup of Cesàro means, it is not given by a contraction, and for…

15 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Analysis and Algorithms for Service Parts Supply Chains VI: The Shortfall Distribution of Capacity-Limited SystemsTextbook

Service parts supply chains are often limited by a capacitated resource, such as a production line or a repair shop, instead of by lead times alone. Once capacity binds, the classical tools for setting stock levels (Palm's theorem and the Poisson distribution of units in resupply) no longer apply, and the quantity that determines how much stock is needed is…

15 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations Research·Captain: mikedeng1

Analysis and Algorithms for Service Parts Supply Chains II: The Single-Unit Single-Customer DecompositionTextbook

A base-stock (order-up-to) policy orders, in every period, exactly enough to bring the inventory position (stock on hand plus stock on order minus backorders) up to a target level. It is the policy used in practice for repairable and consumable service parts, and the analysis of every later chapter of Muckstadt's book assumes it. Its optimality is therefore…

8 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: mikedeng1

Computing Optimal (s, S) Inventory Policies III: Selecting an (s, S) Policy That Is Optimal for Every Starting StockResearch Paper

The periodic-review inventory model with a fixed ordering cost is one of the basic models of operations research. When every order incurs a set-up cost KKK in addition to holding and shortage costs, the optimal replenishment rule over an infinite horizon is, under standard convexity assumptions, a stationary (s,S)(s, S)(s,S) policy: whenever the stock falls below the…

6 thms3 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

Jobshop-Like Queueing Systems: The Equilibrium Distribution with State-Dependent Arrival and Service RatesResearch Paper

A jobshop is a factory in which each job visits a sequence of machine groups, the sequence differing from job to job. J. R. Jackson's 1963 paper Jobshop-Like Queueing Systems (Management Science 10(1), 131–142) models such a shop as a network of queues and computes its long-run distribution of queue lengths in closed form. It generalizes his 1957 paper Netwo…

6 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: mikedeng1

Markov-Renewal Programming. I: Formulation, Finite Return Models: Policy Iteration Finds an Optimal Stationary Policy for the Discounted Infinite-Horizon Markov-Renewal ProgramResearch Paper

Many operational systems move between a finite number of states at random times: a machine alternates between working and repair, a queue between occupancy levels, an inventory between stock positions. When the time spent in a state is not exponential and not a fixed period, neither discrete-time Markov decision processes nor continuous-time Markov chains…

12 thms3 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: naimengye

Stochastic Networks II: Migration Processes and Product FormTextbook

A queueing network is a collection of service stations through which customers — jobs, packets, telephone calls, patients — move one at a time. The state of such a network is a vector of occupancy counts, one per station, and the number of states grows exponentially in the number of stations, so solving the equilibrium equations directly is hopeless for any…

11 thms3 active usersReviewed
Graph TheoryProbabilityTheoretical Computer Science·Captain: Shuze Chen

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local UniformityResearch Paper

Counting the proper kkk-colorings of a graph approximately, and sampling one nearly uniformly, are equivalent problems, and both are classical test cases for Markov chain Monte Carlo. The simplest sampler is the Glauber dynamics, which recolors one vertex at a time. Jerrum (Jer95) showed that it mixes in O(nlog⁡n)O(n\log n)O(nlogn) steps whenever k>2Δk>2\Deltak>2Δ, where Δ\DeltaΔ is…

24 thms2 active usersReviewed
Graph TheoryProbability·Captain: mikedeng1

Sampling Matchings in Near-linear TimeResearch Paper

A matching is a collection of edges in a graph such that no vertex belongs to two selected edges. Random matchings are basic examples in sampling and approximate counting: when every matching has equal weight, the normalizing constant counts all matchings. More generally, edge weights specify a distribution that favors some matchings over others. The…

30 thms2 active usersReviewed
Machine LearningProbabilityStatistics+1·Captain: Shuze Chen

Averaged Annealed Markov Chains Achieve the Algorithmic Threshold for Tensor PCA, Part I: Glauber DynamicsResearch Paper

In tensor PCA (the spiked tensor model of Richard and Montanari, 2014) one observes an order-kkk tensor that is a rank-one signal buried in Gaussian noise and must recover the hidden direction. The model is a standard testbed for the gap between what is statistically possible and what efficient algorithms achieve. Weak recovery is information-theoretically…

21 thms2 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: iris

An O~(n3)\widetilde{O}(n^3)O(n3)-time FPRAS for the PermanentResearch Paper

The permanent of an n×nn\times nn×n matrix A=(aij)A=(a_{ij})A=(aij​) is per(A)=∑σ∈Sn∏i=1nai,σ(i)\mathrm{per}(A)=\sum_{\sigma\in S_n}\prod_{i=1}^n a_{i,\sigma(i)}per(A)=∑σ∈Sn​​∏i=1n​ai,σ(i)​. For a 0/1 matrix it counts the perfect matchings of the bipartite graph G=(V1∪V2,E)G=(V_1\cup V_2,E)G=(V1​∪V2​,E) whose adjacency matrix is AAA. Valiant showed in 1979 that computing it exactly is #P-complete even for 0/1 matrices, so the question became how fast it…

30 thms2 active usersReviewed
Probability·Captain: Shuze Chen

Fine-Grained Complexity Across the Computational Phase TransitionResearch Paper

The hard-core model on a graph GGG is the law of a random independent set III with probability proportional to λ∣I∣\lambda^{|I|}λ∣I∣. It is the basic repulsive spin system of statistical physics and a central test case for approximate sampling and counting. For graphs of maximum degree d≥3d\ge3d≥3 the threshold λc(d)=(d−1)d−1/(d−2)d\lambda_c(d)=(d-1)^{d-1}/(d-2)^dλc​(d)=(d−1)d−1/(d−2)d, the uniqueness threshold of…

22 thms2 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: Shuze Chen

Discrete Isoperimetric Inequalities via CurvatureResearch Paper

Isoperimetric inequalities on the Boolean hypercube relate the variance of a Boolean function f:{±1}n→{±1}f:\{\pm1\}^n\to\{\pm1\}f:{±1}n→{±1} to how often flipping one coordinate changes its value. They drive sharp-threshold theorems, junta approximation, noise sensitivity, percolation, social choice and hardness of approximation (O'Donnell, Analysis of Boolean Functions, 2014).…

23 thms2 active usersReviewed
ProbabilityStatistics·Captain: Shuze Chen

Identity Testing of Markov Chains from a Single TrajectoryResearch Paper

A common statistical question about a stochastic system is whether its dynamics agree with a reference model. Examples are a calibrated queueing simulator, a fitted mobility model, or a Markov chain Monte Carlo sampler that is supposed to implement a known kernel. Often the only data is one trajectory: the chain cannot be restarted, its initial state is not…

21 thms2 active usersReviewed
Functional AnalysisLinear algebra·Captain: iris

Recursive Operator Localization and Spectral Gap Descent via the Geometry of Local Spectral ExpansionResearch Paper

Lower bounds on spectral gaps control the directions outside the kernel of a positive operator: the gap of a Hamiltonian above its ground-state energy, or the gap of a reversible Markov generator above its stationary subspace. For large systems such bounds are hard to obtain directly. Local-to-global methods combine tractable local estimates with control of…

34 thms2 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

Exact Agreement Expansion up to the Top via Non-polarityResearch Paper

An agreement test checks whether a collection of local functions comes from one global function. Each set KKK of a weighted family carries a local function FK:K→ΣF_K:K\to\SigmaFK​:K→Σ. The test samples a smaller set HHH, then two sets K,K′⊇HK,K'\supseteq HK,K′⊇H, and accepts when FKF_KFK​ and FK′F_{K'}FK′​ agree on HHH. Soundness says that a test that rarely rejects forces most FKF_KFK​ to be…

12 thms2 active usersReviewed
Functional AnalysisProbability·Captain: mikedeng1

Spectral gaps of Hit-and-Run and Coordinate Hit-and-RunResearch Paper

A uniform sampler produces random points whose probabilities are proportional to volume inside a prescribed region. This is a basic operation in randomized integration and volume computation. For a region described by constraints, a sampling step can be simple even when drawing an independent uniform point is difficult. The relevant question is how quickly…

19 thms2 active usersReviewed
PreviousPage 7 of 12Next

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