IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v18y2016i2d10.1007_s11009-014-9428-1.html
   My bibliography  Save this article

Bivariate Issues in Leader Election Algorithms with Marshall-Olkin Limit Distribution

Author

Listed:
  • Cheng Zhang

    (The George Washington University)

  • Hosam Mahmoud

    (The George Washington University)

Abstract

Most prior work in leader election algorithms deals with univariate statistics. We consider multivariate issues in a broad class of fair leader election algorithms. We investigate the joint distribution of the duration of two competing candidates. Under rather mild conditions on the splitting protocol, we prove the convergence of the joint distribution of the duration of any two contestants to a limit via convergence of distance (to 0) in a metric space on distributions. We then show that the limiting distribution is a Marshall-Olkin bivariate geometric distribution. Under the classic binomial splitting we are able to say a few more precise words about the exact joint distribution and exact covariance, and to explore (via Rice’s integral method) the oscillatory behavior of the diminishing covariance. We discuss several practical examples and present empirical observations on the rate of convergence of the covariance.

Suggested Citation

  • Cheng Zhang & Hosam Mahmoud, 2016. "Bivariate Issues in Leader Election Algorithms with Marshall-Olkin Limit Distribution," Methodology and Computing in Applied Probability, Springer, vol. 18(2), pages 401-418, June.
    • Handle: RePEc:spr:metcap:v:18:y:2016:i:2:d:10.1007_s11009-014-9428-1
    DOI: 10.1007/s11009-014-9428-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-014-9428-1
    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/s11009-014-9428-1?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. Kalpathy, Ravi & Mahmoud, Hosam M. & Rosenkrantz, Walter, 2013. "Survivors in leader election algorithms," Statistics & Probability Letters, Elsevier, vol. 83(12), pages 2743-2749.
    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. Kalpathy, Ravi & Ward, Mark Daniel, 2014. "On a leader election algorithm: Truncated geometric case study," Statistics & Probability Letters, Elsevier, vol. 87(C), pages 40-47.

    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:metcap:v:18:y:2016:i:2:d:10.1007_s11009-014-9428-1. 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.