Standard

Exponential Chebyshev Inequalities for Random Graphons and Their Applications. / Logachov, A. V.; Mogulskii, A. A.

In: Siberian Mathematical Journal, Vol. 61, No. 4, 01.07.2020, p. 697-714.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

Logachov AV, Mogulskii AA. Exponential Chebyshev Inequalities for Random Graphons and Their Applications. Siberian Mathematical Journal. 2020 Jul 1;61(4):697-714. doi: 10.1134/S0037446620040114

Author

Logachov, A. V. ; Mogulskii, A. A. / Exponential Chebyshev Inequalities for Random Graphons and Their Applications. In: Siberian Mathematical Journal. 2020 ; Vol. 61, No. 4. pp. 697-714.

BibTeX

@article{e5630b35f35e42b49e63ddcec0e054fc,
title = "Exponential Chebyshev Inequalities for Random Graphons and Their Applications",
abstract = "We prove some exponential Chebyshev inequality andderive the large deviation principle and the law of large numbersfor the graphons constructed from a sequence of Erd{\H o}s–R{\'e}nyi random graphs with weights.Also, we obtain a new version of the large deviation principlefor the number of triangles included in an Erd{\H o}s–R{\'e}nyi graph.",
keywords = "519.2, Erd{\H o}s–R{\'e}nyi graph, graphon, large deviation principle, law of large numbers, 2, Erdos-Renyi graph, CONVERGENT SEQUENCES, 519",
author = "Logachov, {A. V.} and Mogulskii, {A. A.}",
year = "2020",
month = jul,
day = "1",
doi = "10.1134/S0037446620040114",
language = "English",
volume = "61",
pages = "697--714",
journal = "Siberian Mathematical Journal",
issn = "0037-4466",
publisher = "MAIK NAUKA/INTERPERIODICA/SPRINGER",
number = "4",

}

RIS

TY - JOUR

T1 - Exponential Chebyshev Inequalities for Random Graphons and Their Applications

AU - Logachov, A. V.

AU - Mogulskii, A. A.

PY - 2020/7/1

Y1 - 2020/7/1

N2 - We prove some exponential Chebyshev inequality andderive the large deviation principle and the law of large numbersfor the graphons constructed from a sequence of Erdős–Rényi random graphs with weights.Also, we obtain a new version of the large deviation principlefor the number of triangles included in an Erdős–Rényi graph.

AB - We prove some exponential Chebyshev inequality andderive the large deviation principle and the law of large numbersfor the graphons constructed from a sequence of Erdős–Rényi random graphs with weights.Also, we obtain a new version of the large deviation principlefor the number of triangles included in an Erdős–Rényi graph.

KW - 519.2

KW - Erdős–Rényi graph

KW - graphon

KW - large deviation principle

KW - law of large numbers

KW - 2

KW - Erdos-Renyi graph

KW - CONVERGENT SEQUENCES

KW - 519

UR - http://www.scopus.com/inward/record.url?scp=85088698705&partnerID=8YFLogxK

U2 - 10.1134/S0037446620040114

DO - 10.1134/S0037446620040114

M3 - Article

AN - SCOPUS:85088698705

VL - 61

SP - 697

EP - 714

JO - Siberian Mathematical Journal

JF - Siberian Mathematical Journal

SN - 0037-4466

IS - 4

ER -

ID: 24868307