IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v127y2017icp42-48.html
   My bibliography  Save this article

Computing an expected hitting time for the 3-urn Ehrenfest model via electric networks

Author

Listed:
  • Chen, Yung-Pin
  • Goldstein, Isaac H.
  • Lathrop, Eve D.
  • Nelsen, Roger B.

Abstract

We study a three-urn version of the Ehrenfest model. This model can be viewed as a simple random walk on the graph represented by Z3M, the M-fold direct product of the cyclic group Z3 of order 3, where M is the total number of balls distributed in the three urns. We build an electric network by placing a unit resistance on each edge of the graph. We then apply a series of circuit analysis techniques, including the series and parallel circuit laws and the Delta-Y transformation, to establish shorted triangular resistor networks. A recurrence relation is derived for the effective resistance between two corner vertices of the triangular resistor networks. The recurrence relation is then used to obtain an explicit formula for the expected hitting time between two extreme states where all balls reside in one of the three urns.

Suggested Citation

  • Chen, Yung-Pin & Goldstein, Isaac H. & Lathrop, Eve D. & Nelsen, Roger B., 2017. "Computing an expected hitting time for the 3-urn Ehrenfest model via electric networks," Statistics & Probability Letters, Elsevier, vol. 127(C), pages 42-48.
    • Handle: RePEc:eee:stapro:v:127:y:2017:i:c:p:42-48
    DOI: 10.1016/j.spl.2017.03.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S016771521730113X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spl.2017.03.013?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. Shunqi Wu & Zhongzhi Zhang & Guanrong Chen, 2011. "Random walks on dual Sierpinski gaskets," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 82(1), pages 91-96, July.
    Full references (including those not matched with items on IDEAS)

    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. Zhang, Jingyuan & Xiang, Yonghong & Sun, Weigang, 2018. "A discrete random walk on the hypercube," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 494(C), pages 1-7.

    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:eee:stapro:v:127:y:2017:i:c:p:42-48. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.