Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnaya Matematika, 1999, Volume 11, Issue 4, Pages 58–64
DOI: https://doi.org/10.4213/dm399
(Mi dm399)
 

Probabilities of events related to common predecessors of two vertices in a generalized model of recursive trees

D. A. Kuropatkin
Abstract: We say that a random tree $T_n$ with $n$ vertices and $n-1$ edges is a generalized recursive one if either $n=1$, or $n>1$ and $T_n$ is the result of linking some $n$th vertex to some vertex of a random recursive tree $T_{n-1}$. The probability to choose a particular vertex is defined by some sequence $\{\alpha_i\colon \alpha_i>0\}_{i=1}^\infty$. We study the probabilities of some events related to common predecessors of vertices.
Received: 25.08.1998
Bibliographic databases:
UDC: 519.2
Language: Russian
Citation: D. A. Kuropatkin, “Probabilities of events related to common predecessors of two vertices in a generalized model of recursive trees”, Diskr. Mat., 11:4 (1999), 58–64; Discrete Math. Appl., 9:5 (1999), 473–480
Citation in format AMSBIB
\Bibitem{Kur99}
\by D.~A.~Kuropatkin
\paper Probabilities of events related to common predecessors of two vertices in a generalized model of recursive trees
\jour Diskr. Mat.
\yr 1999
\vol 11
\issue 4
\pages 58--64
\mathnet{http://mi.mathnet.ru/dm399}
\crossref{https://doi.org/10.4213/dm399}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1761012}
\zmath{https://zbmath.org/?q=an:0966.05071}
\transl
\jour Discrete Math. Appl.
\yr 1999
\vol 9
\issue 5
\pages 473--480
Linking options:
  • https://www.mathnet.ru/eng/dm399
  • https://doi.org/10.4213/dm399
  • https://www.mathnet.ru/eng/dm/v11/i4/p58
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:313
    Full-text PDF :182
    First page:2
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024