RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Mat. Zametki, 2012, Volume 92, Issue 3, Pages 463–480 (Mi mz9066)  

This article is cited in 2 scientific papers (total in 2 papers)

Gigantic Component in Random Distance Graphs of Special Form

A. R. Yarmuhametov

M. V. Lomonosov Moscow State University

Abstract: We consider the problem of threshold probability for the existence of a gigantic component in a certain series of random distance graphs. The results obtained generalize the classical Erdős–Rényi theorems in the case of geometric graphs of special form.

Keywords: random distance graph, gigantic component in a random graph, classical Erdős–Rényi theorems, $k$-vertex tree, Stirling's formula

DOI: https://doi.org/10.4213/mzm9066

Full text: PDF file (542 kB)
References: PDF file   HTML file

English version:
Mathematical Notes, 2012, 92:3, 426–441

Bibliographic databases:

UDC: 519.172
Received: 02.03.2011
Revised: 20.06.2011

Citation: A. R. Yarmuhametov, “Gigantic Component in Random Distance Graphs of Special Form”, Mat. Zametki, 92:3 (2012), 463–480; Math. Notes, 92:3 (2012), 426–441

Citation in format AMSBIB
\Bibitem{Yar12}
\by A.~R.~Yarmuhametov
\paper Gigantic Component in Random Distance Graphs of Special Form
\jour Mat. Zametki
\yr 2012
\vol 92
\issue 3
\pages 463--480
\mathnet{http://mi.mathnet.ru/mz9066}
\crossref{https://doi.org/10.4213/mzm9066}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3201582}
\zmath{https://zbmath.org/?q=an:06123754}
\elib{http://elibrary.ru/item.asp?id=20731606}
\transl
\jour Math. Notes
\yr 2012
\vol 92
\issue 3
\pages 426--441
\crossref{https://doi.org/10.1134/S0001434612090167}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000310228200016}
\elib{http://elibrary.ru/item.asp?id=20497615}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84867953559}


Linking options:
  • http://mi.mathnet.ru/eng/mz9066
  • https://doi.org/10.4213/mzm9066
  • http://mi.mathnet.ru/eng/mz/v92/i3/p463

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. R. Yarmuhametov, “Gigantic and Small Components in Random Distance Graphs of Special Form”, Math. Notes, 93:1 (2013), 201–205  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib
    2. S. N. Popova, “Zero-one law for random distance graphs with vertices in $\{-1,0,1\}^n$”, Problems Inform. Transmission, 50:1 (2014), 57–78  mathnet  crossref  isi
  • Математические заметки Mathematical Notes
    Number of views:
    This page:393
    Full text:104
    References:38
    First page:16

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020