Loading [MathJax]/jax/output/SVG/config.js
Teoriya Veroyatnostei i ee Primeneniya
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Teor. Veroyatnost. i Primenen.:
Year:
Volume:
Issue:
Page:
Find




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

Teoriya Veroyatnostei i ee Primeneniya, 1988, Volume 33, Issue 2, Pages 383–387 (Mi tvp3604)  
This article is cited in 3 scientific papers (total in 3 papers)

Short Communications

Calculation of the Expected Value of the Length of a Random Minimal Tree

E. A. Timofeev
Full-text PDF (665 kB) Citations (3)
Received: 22.01.1986
English version:
Theory of Probability and its Applications, 1988, Volume 33, Issue 2, Pages 361–365
DOI: https://doi.org/10.1137/1133056
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: E. A. Timofeev, “Calculation of the Expected Value of the Length of a Random Minimal Tree”, Teor. Veroyatnost. i Primenen., 33:2 (1988), 383–387; Theory Probab. Appl., 33:2 (1988), 361–365
Citation in format AMSBIB
\Bibitem{Tim88}
\by E.~A.~Timofeev
\paper Calculation of the Expected Value of the Length of a~Random Minimal Tree
\jour Teor. Veroyatnost. i Primenen.
\yr 1988
\vol 33
\issue 2
\pages 383--387
\mathnet{http://mi.mathnet.ru/tvp3604}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=954589}
\zmath{https://zbmath.org/?q=an:0672.60017|0647.60015}
\transl
\jour Theory Probab. Appl.
\yr 1988
\vol 33
\issue 2
\pages 361--365
\crossref{https://doi.org/10.1137/1133056}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=A1988U511600020}
Linking options:
  • https://www.mathnet.ru/eng/tvp3604
  • https://www.mathnet.ru/eng/tvp/v33/i2/p383
    • This publication is cited in the following 3 articles:
    1. Louigi Addario-Berry, Nicolas Broutin, Christina Goldschmidt, Grégory Miermont, “The scaling limit of the minimum spanning tree of the complete graph”, Ann. Probab., 45:5 (2017)  crossref
    2. Luc Devroye, Algorithms and Combinatorics, 16, Probabilistic Methods for Algorithmic Discrete Mathematics, 1998, 249  crossref
    3. David Aldous, J. Michael Steele, “Asymptotics for Euclidean minimal spanning trees on random points”, Probab. Th. Rel. Fields, 92:2 (1992), 247  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Теория вероятностей и ее применения Theory of Probability and its Applications
    Statistics & downloads:
    Abstract page:275
    Full-text PDF :90
     
      Contact us:
    math-net2025_04@mi-ras.ru     		 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025