Probabilistic analysis of an election algorithm in a tree

  • Yves Métivier
  • Nasser Saheb
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 787)


In this paper we consider the well-known case of election in a tree, and we study the probability for any vertex of a given tree to be elected. In particular, we show that if we consider the probability distribution based on the comparison of the election probabilities of neighbour vertices, there is one or two vertices having the highest probability of being elected. We give a very simple algorithm to compute these vertices, and we prove that in fact they are the medians.

Exact computations are done for special families of trees as filiform trees, wheels and crystals.


Election Labelled Graphs Median Probabilistic analysis Tree 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Angluin. Local and global properties in networks of processors, Proceedings of the 12th STOC, (1980) 82–93.Google Scholar
  2. 2.
    C. Berge. Graphes et Hypergraphes, Dunod, Paris (1970).Google Scholar
  3. 3.
    L. Comtet. Advanced combinatorics, D.Reidel Publishing Company, (1974).Google Scholar
  4. 4.
    R. Cori and Y. Métivier. Recognizable subsets of free partially commutative monoids, Theoret. Comput. Sci. 58, (1988) 201–208.CrossRefGoogle Scholar
  5. 5.
    R. Cori and D. Perrin. Sur la reconnaissabilité dans les monoïdes partiellement commutatifs libres, RAIRO Inform. Théor. 58, (1985) 21–32.Google Scholar
  6. 6.
    W. Feller. Introduction to probability theory and its applications, Wiley, New York, (1970).Google Scholar
  7. 7.
    H. Garcia-Molina. Election in a distributed computing system, IEEE Trans. Comput. C31, 1 (1982) 48–59.Google Scholar
  8. 8.
    O. Gerstel and S. Zaks. A new characterization of tree medians with applications to distributed algorithms, DAIMI PB-364, Computer Science Department AArhus University (1991).Google Scholar
  9. 9.
    E. Korach, D. Rotem and N. Santoro. Distributed algorithms for finding centers and medians in network, ACM Trans. on Programming Languages and Systems 6, No3 (July 1984) 380–401.CrossRefGoogle Scholar
  10. 10.
    I. Litovsky, Y. Métivier and W. Zielonka. The power and the limitations of local computations on graphs and networks, In: proceedings of 18th International workshop on Graph-Theoretic Concepts in Computer Science, WG 92, Lecture Notes in Comput. Sci. 657 (1993) 333–345.Google Scholar
  11. 11.
    M. Lothaire. Combinatorics on words, Addison-Wesley Publishing Company, (1983).Google Scholar
  12. 12.
    A. Mazurkiewicz. Solvability of asynchronous ranking problem, Inform. Proc. Letters 28, (1988) 221–224.CrossRefGoogle Scholar
  13. 13.
    S. Mitchell. Another characterization of the centroid of a tree, Discrete Mathematics 24, (1978) 277–280.CrossRefGoogle Scholar
  14. 14.
    R.-P. Stanley. Enumerative Combinatorics, Wadsworth and Brooks /Cole (1986).Google Scholar
  15. 15.
    B. Zelinka. Medians and peripherians of trees, Arch. Math., (Brno) (1968) 87–95.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Yves Métivier
    • 1
  • Nasser Saheb
    • 1
  1. 1.LaBRIUniversité Bordeaux I, ENSERBTalenceFrance

Personalised recommendations