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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Sbornik: Mathematics, 2016, Volume 207, Issue 3, Pages 458–478
DOI: https://doi.org/10.1070/SM8411 (Mi sm8411) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Zero-one law for random subgraphs of some distance graphs with vertices in Zn

S. N. Popova

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
English version PDF (584 kB) Citations (1) Russian version article
References:
PDF
HTML
DOI: https://doi.org/10.1070/SM8411
Abstract: The zero-one law for the model of random distance graphs with vertices in Zn is studied. Sufficient conditions for a sequence of random distance graphs to obey the zero-one law are derived, as well as conditions under which it contains a subsequence obeying the zero-one law.
Bibliography: 20 titles.
Keywords: random graphs, zero-one law, distance graphs.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation МК-2184.2014.1
This work was supported by the Council of the President of the Russian Federation for the Support of Young Russian Candidates of Science (grant no. MK-2184.2014.1).
Received: 28.07.2014 and 13.07.2015
Bibliographic databases:
Document Type: Article
UDC: 519.179.4
MSC: 05C80, 60F20
Language: English
Original paper language: Russian
Citation: S. N. Popova, “Zero-one law for random subgraphs of some distance graphs with vertices in Zn”, Sb. Math., 207:3 (2016), 458–478
Citation in format AMSBIB
\Bibitem{Pop16}
\by S.~N.~Popova
\paper Zero-one law for random subgraphs of some distance graphs with vertices in~$\mathbb Z^n$
\jour Sb. Math.
\yr 2016
\vol 207
\issue 3
\pages 458--478
\mathnet{http://mi.mathnet.ru/eng/sm8411}
\crossref{https://doi.org/10.1070/SM8411}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3507488}
\zmath{https://zbmath.org/?q=an:1343.05138}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2016SbMat.207..458P}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000376442700008}
\elib{https://elibrary.ru/item.asp?id=25707822}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84971254390}
Linking options:
  • https://www.mathnet.ru/eng/sm8411
  • https://doi.org/10.1070/SM8411
  • https://www.mathnet.ru/eng/sm/v207/i3/p153
    • This publication is cited in the following 1 articles:
    1. M. E. Zhukovskii, A. M. Raigorodskii, “Random graphs: models and asymptotic characteristics”, Russian Math. Surveys, 70:1 (2015), 33–81  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математический сборник Sbornik: Mathematics
    Statistics & downloads:
    Abstract page:458
    Russian version PDF:154
    English version PDF:27
    References:88
    First page:48
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025