IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v31y2018i3d10.1007_s10959-017-0747-3.html
   My bibliography  Save this article

Conservative and Semiconservative Random Walks: Recurrence and Transience

Author

Listed:
  • Vyacheslav M. Abramov

    (Monash University
    Royal Melbourne Institute of Technology)

Abstract

In the present paper, we define conservative and semiconservative random walks in $$\mathbb {Z}^d$$ Z d and study various families of random walks. The family of symmetric random walks is one of the families of conservative random walks, and simple (Pólya) random walks are their representatives. The classification of random walks given in the present paper enables us to provide a new approach to random walks in $$\mathbb {Z}^d$$ Z d by reduction to birth-and-death processes. We construct nontrivial examples of recurrent random walks in $$\mathbb {Z}^d$$ Z d for any $$d\ge 3$$ d ≥ 3 and transient random walks in $$\mathbb {Z}^2$$ Z 2 .

Suggested Citation

  • Vyacheslav M. Abramov, 2018. "Conservative and Semiconservative Random Walks: Recurrence and Transience," Journal of Theoretical Probability, Springer, vol. 31(3), pages 1900-1922, September.
    • Handle: RePEc:spr:jotpro:v:31:y:2018:i:3:d:10.1007_s10959-017-0747-3
    DOI: 10.1007/s10959-017-0747-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-017-0747-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10959-017-0747-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ronald W. Wolff, 1982. "Poisson Arrivals See Time Averages," Operations Research, INFORMS, vol. 30(2), pages 223-231, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vyacheslav M. Abramov, 2023. "Crossings States and Sets of States in Random Walks," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-34, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tetsuji Hirayama, 2003. "Mean sojourn times in multiclass feedback queues with gated disciplines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 719-741, October.
    2. Mohebbi, E., 2008. "A note on a production control model for a facility with limited storage capacity in a random environment," European Journal of Operational Research, Elsevier, vol. 190(2), pages 562-570, October.
    3. Huseyin C. Ozmutlu, 2009. "Markovian analysis for automatic new topic identification in search engine transaction logs," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 25(6), pages 737-768, November.
    4. Zsolt Saffer & Sergey Andreev & Yevgeni Koucheryavy, 2016. "$$M/D^{[y]}/1$$ M / D [ y ] / 1 Periodically gated vacation model and its application to IEEE 802.16 network," Annals of Operations Research, Springer, vol. 239(2), pages 497-520, April.
    5. Kim, Young Joo & Hwang, Hark, 2009. "Incremental discount policy of cell-phone carrier with connection success rate constraint," European Journal of Operational Research, Elsevier, vol. 196(2), pages 682-687, July.
    6. Josh Reed & Bo Zhang, 2017. "Managing capacity and inventory jointly for multi-server make-to-stock queues," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 61-94, June.
    7. Lee, Doo Ho & Kim, Bo Keun, 2015. "A note on the sojourn time distribution of an M/G/1 queue with a single working vacation and vacation interruption," Operations Research Perspectives, Elsevier, vol. 2(C), pages 57-61.
    8. Hum, Sin-Hoon & Parlar, Mahmut & Zhou, Yun, 2018. "Measurement and optimization of responsiveness in supply chain networks with queueing structures," European Journal of Operational Research, Elsevier, vol. 264(1), pages 106-118.
    9. Johansen, Søren Glud, 2021. "The Markov model for base-stock control of an inventory system with Poisson demand, non-crossing lead times and lost sales," International Journal of Production Economics, Elsevier, vol. 231(C).
    10. Noah Gans & Yong-Pin Zhou, 2007. "Call-Routing Schemes for Call-Center Outsourcing," Manufacturing & Service Operations Management, INFORMS, vol. 9(1), pages 33-50, May.
    11. Tijms, H.C., 1988. "Numerical methods for queueing models," Serie Research Memoranda 0043, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    12. Brill, Percy H., 2015. "Note on the service time in an M/G/1 queue with bounded workload," Statistics & Probability Letters, Elsevier, vol. 96(C), pages 162-169.
    13. Chydzinski, Andrzej & Adamczyk, Blazej, 2020. "Response time of the queue with the dropping function," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    14. Mohebbi, Esmail, 2006. "A production-inventory model with randomly changing environmental conditions," European Journal of Operational Research, Elsevier, vol. 174(1), pages 539-552, October.
    15. Gu, Weihua & Li, Yuwei & Cassidy, Michael J. & Griswold, Julia B., 2011. "On the capacity of isolated, curbside bus stops," Transportation Research Part B: Methodological, Elsevier, vol. 45(4), pages 714-723, May.
    16. Zeephongsekul, P. & Bedford, A., 2006. "Waiting time analysis of the multiple priority dual queue with a preemptive priority service discipline," European Journal of Operational Research, Elsevier, vol. 172(3), pages 886-908, August.
    17. Laurens G. Debo & Christine Parlour & Uday Rajan, 2012. "Signaling Quality via Queues," Management Science, INFORMS, vol. 58(5), pages 876-891, May.
    18. Sean X. Zhou & Chaolin Yang, 2016. "Continuous-Review ( R, nQ ) Policies for Inventory Systems with Dual Delivery Modes," Operations Research, INFORMS, vol. 64(6), pages 1302-1319, December.
    19. Andersson, Jonas & Malmberg, Filip & Marklund, Johan, 2023. "Exact analysis of One-Warehouse-Multiple-Retailer inventory systems with quantity restricted deliveries," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1161-1172.
    20. Mohebbi, Esmail & Hao, Daipeng, 2008. "An inventory model with non-resuming randomly interruptible lead time," International Journal of Production Economics, Elsevier, vol. 114(2), pages 755-768, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jotpro:v:31:y:2018:i:3:d:10.1007_s10959-017-0747-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.