Bounds for the expected value of one-step processes

  title={Bounds for the expected value of one-step processes},
  author={Benjamin Armbruster and {\'A}d{\'a}m Besenyei and P{\'e}ter L. Simon},
Mean-field models are often used to approximate Markov processes with large state-spaces. One-step processes, also known as birth-death processes, are an important class of such processes and are processes with state space $\{0,1,\ldots,N\}$ and where each transition is of size one. We derive explicit bounds on the expected value of such a process, bracketing it between the mean-field model and another simple ODE. Our bounds require that the Markov transition rates are density dependent… 

Figures from this paper

On bounding exact models of epidemic spread on networks

In this paper we use comparison theorems from classical ODE theory in order to rigorously show that closures or approximations at individual or node level lead to mean-field models that bound the

Mean-field approximation of counting processes from a differential equation perspective

Deterministic limit of a class of continuous time Markov chains is considered based purely on differential equation techniques. Starting from the linear system of master equations, ordinary

Mathematics of Epidemics on Networks: From Exact to Approximate Models

This textbook provides an exciting new addition to the area of network science featuring a stronger and more methodical link of models to their mathematical origin and explains how these relate to

Ornstein-Uhlenbeck approximation of one-step processes: a differential equation approach

The steady state of the Fokker-Planck equation corresponding to a density dependent one-step process is approximated by a suitable normal distribution. Starting from the master equations of the



An elementary proof of convergence to the mean-field equations for an epidemic model

A short proof in this case for convergence in mean-square on finite time-intervals using a system of two ODEs and a moment inequality is provided and the first lower bound on the expected fraction of infected nodes is obtained.

From exact stochastic to mean-field ODE models : a new approach to prove convergence results

A unifying framework is proposed that incorporates and discusses the details of two existing proofs and a new ODE-based proof is put forward that may serve as a building block to prove similar convergence results for more complex networks.

General transient solution of the one-step master equation in one dimension.

A linear algebraic method is proposed for simplifying the solution of any master equation as the exponential of a matrix, which requires the calculation of the eigenvalues and eigenvectors of the matrix, and it is shown that the computational time is significantly reduced.

Differential equation approximations of stochastic network processes: An operator semigroup approach

For Markov chains where the transition rates satisfy some sign conditions, a new approach for proving convergence to the mean-field limit is proposed and it turns out that the proof holds for cases that are slightly more general than the usual density dependent one.

Markov Processes: Characterization and Convergence

Introduction. 1. Operator Semigroups. 2. Stochastic Processes and Martingales. 3. Convergence of Probability Measures. 4. Generators and Markov Processes. 5. Stochastic Integral Equations. 6. Random

Solutions of ordinary differential equations as limits of pure jump markov processes

  • T. Kurtz
  • Mathematics
    Journal of Applied Probability
  • 1970
In a great variety of fields, e.g., biology, epidemic theory, physics, and chemistry, ordinary differential equations are used to give continuous deterministic models for dynamic processes which are

Stochastic processes in physics and chemistry

Preface to the first edition. Preface to the second edition. Abbreviated references. I. Stochastic variables. II. Random events. III. Stochastic processes. IV. Markov processes. V. The master

Dynamical Processes on Complex Networks

A new and recent account presents a comprehensive explanation of the effect of complex connectivity patterns on dynamical phenomena in a vast number of everyday systems that can be represented as large complex networks.

Networks and the Epidemiology of Infectious Disease

A personalised overview into the areas of network epidemiology that have seen the greatest progress in recent years or have the greatest potential to provide novel insights is provided, focusing on the interplay between network theory and epidemiology.

A First Course In Probability

A first course in probability, which is universally compatible with any devices to read, is available in the book collection an online access to it is set as public so you can download it instantly.