BOUNDS FOR THE EXPECTED VALUE OF ONE-STEP PROCESSES

被引:2
|
作者
Armbruster, Benjamin [1 ]
Besenyei, Adam [2 ,3 ]
Simon, Peter L. [2 ,3 ]
机构
[1] Northwestern Univ, Dept Ind Engn & Management Sci, 633 Clark St, Evanston, IL 60208 USA
[2] Eotvos Lorand Univ, Inst Math, Budapest, Hungary
[3] Hungarian Acad Sci, Numer Anal & Large Networks Res Grp, Budapest, Hungary
关键词
Mean-field model; exact bounds; one-step processes; ODE;
D O I
10.4310/CMS.2016.v14.n7.a6
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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,..., 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. While the mean-field model is a well known approximation, this lower bound is new, and unlike an asymptotic result, these bounds can be used for finite N. Our bounds require that the Markov transition rates are density dependent polynomials that satisfy a sign condition. We illustrate the tightness of our bounds on the SIS epidemic process and the voter model.
引用
下载
收藏
页码:1911 / 1923
页数:13
相关论文
共 50 条
  • [41] ONE-STEP PREDICTION FOR PN-WEAKLY STATIONARY-PROCESSES
    HOSEL, V
    LASSER, R
    MONATSHEFTE FUR MATHEMATIK, 1992, 113 (03): : 199 - 212
  • [42] Implementing a Method for Stochastization of One-Step Processes in a Computer Algebra System
    Gevorkyan, M. N.
    Demidova, A. V.
    Velieva, T. R.
    Korol'kova, A. V.
    Kulyabov, D. S.
    Sevast'yanov, L. A.
    PROGRAMMING AND COMPUTER SOFTWARE, 2018, 44 (02) : 86 - 93
  • [43] ONE-STEP MODEL OF X-RAY PHOTOEMISSION AND AUGER PROCESSES
    GUNNARSSON, O
    SCHONHAMMER, K
    AIP CONFERENCE PROCEEDINGS, 1982, (94) : 517 - 529
  • [44] Implementing a Method for Stochastization of One-Step Processes in a Computer Algebra System
    M. N. Gevorkyan
    A. V. Demidova
    T. R. Velieva
    A. V. Korol’kova
    D. S. Kulyabov
    L. A. Sevast’yanov
    Programming and Computer Software, 2018, 44 : 86 - 93
  • [45] Stochastic Programming Using Expected Value Bounds
    Chinchilla, Raphael
    Hespanha, Joao P.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (06) : 3241 - 3256
  • [46] A general [L, M] one-step integrator for initial value problems
    Aashikpelokhai, U. S. U.
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2011, 88 (02) : 348 - 359
  • [47] Sharp bounds for the expected value of order statistics
    Huang, JS
    STATISTICS & PROBABILITY LETTERS, 1997, 33 (01) : 105 - 107
  • [48] Parallel negabinary signed-digit arithmetic operations: one-step negabinary, one-step trinary, and one-step quaternary addition algorithms
    Cherri, AK
    Kamal, HA
    PHOTONICS APPLICATIONS IN ASTRONOMY, COMMUNICATIONS, INDUSTRY, AND HIGH-ENERGY PHYSICS EXPERIMENTS II, 2004, 5484 : 35 - 45
  • [49] Bounds on the expected length of optimal one-to-one codes
    Cheng, Jay
    Huang, Tien-Ke
    Weidmann, Claudio
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (05) : 1884 - 1895
  • [50] New bounds on the expected length of one-to-one codes
    Blundo, C
    DePrisco, R
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (01) : 246 - 250