• DocumentCode
    818584
  • Title

    Growing binary trees in a random environment

  • Author

    Kessler, Ilan ; Sidi, Moshe

  • Author_Institution
    Technion-Israel Inst. of Technol., Haifa, Israel
  • Volume
    39
  • Issue
    1
  • fYear
    1993
  • fDate
    1/1/1993 12:00:00 AM
  • Firstpage
    191
  • Lastpage
    194
  • Abstract
    A class of binary trees that grow in a random environment, where the state of the environment can change at every vertex of the trees, is studied. The trees considered are single-type and two-type binary trees that grow in a two-state Markovian environment. For each kind of tree, the conditions on the environment process for extinction of the tree are determined, and the problem of calculating the expected number of vertices of the tree is addressed. Different ways of growing the trees are compared
  • Keywords
    Markov processes; information theory; multi-access systems; random processes; trees (mathematics); binary trees; multi-access communication; random environment; tree extinction conditions; two-state Markovian environment; vertices; Binary trees; Communication channels; Multiaccess communication; Random variables; Senior members; Sorting; Stability; Stochastic processes; Terrorism; Working environment noise;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.179356
  • Filename
    179356