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



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






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


Probl. Peredachi Inf., 2014, Volume 50, Issue 1, Pages 64–86 (Mi ppi2132)  

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

Large Systems

Zero-one law for random distance graphs with vertices in $\{-1,0,1\}^n$

S. N. Popova

Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Moscow, Russia

Abstract: We study zero-one laws for random distance graph with vertices in $\{-1,0,1\}^n$ depending on a set of parameters. We give some conditions under which sequences of random distance graphs obey or do not obey the zero-one law.

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

English version:
Problems of Information Transmission, 2014, 50:1, 57–78

Bibliographic databases:

UDC: 621.391.1+519.1
Received: 06.06.2013
Revised: 10.01.2014

Citation: S. N. Popova, “Zero-one law for random distance graphs with vertices in $\{-1,0,1\}^n$”, Probl. Peredachi Inf., 50:1 (2014), 64–86; Problems Inform. Transmission, 50:1 (2014), 57–78

Citation in format AMSBIB
\Bibitem{Pop14}
\by S.~N.~Popova
\paper Zero-one law for random distance graphs with vertices in~$\{-1,0,1\}^n$
\jour Probl. Peredachi Inf.
\yr 2014
\vol 50
\issue 1
\pages 64--86
\mathnet{http://mi.mathnet.ru/ppi2132}
\transl
\jour Problems Inform. Transmission
\yr 2014
\vol 50
\issue 1
\pages 57--78
\crossref{https://doi.org/10.1134/S0032946014010049}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000334517000004}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84899528500}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2132
  • http://mi.mathnet.ru/eng/ppi/v50/i1/p64

    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. Popova S.N., “Zero-One Laws For Random Distance Graphs With Vertices in (0,1)(N)”, Dokl. Math., 90:2 (2014), 535–538  crossref  mathscinet  zmath  isi  elib  scopus
    2. 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
    3. S. N. Popova, “Zero-one law for random subgraphs of some distance graphs with vertices in $\mathbb Z^n$”, Sb. Math., 207:3 (2016), 458–478  mathnet  crossref  crossref  mathscinet  adsnasa  isi  elib
    4. S. N. Popova, “Zero-one laws for random graphs with vertices in a Boolean cube”, Siberian Adv. Math., 27:1 (2017), 26–75  mathnet  crossref  crossref  mathscinet  elib
    5. A. V. Burkin, M. E. Zhukovskii, “Small subgraphs and their extensions in a random distance graph”, Sb. Math., 209:2 (2018), 163–186  mathnet  crossref  crossref  adsnasa  isi  elib
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:233
    Full text:43
    References:32
    First page:30

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