Matematicheskie Trudy
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


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




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

Matematicheskie Trudy, 2023, Volume 26, Number 2, Pages 30–43
DOI: https://doi.org/10.33048/mattrudy.2023.26.202 (Mi mt678) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Exponential inequalities for the tail probabilities of the number of cycles in generalized random graphs

A. A. Bystrova, N. V. Volod'kob

a Novosibirsk State University, Novosibirsk, 630090, Russia
b Sobolev Institute of Mathematics, Novosibirsk, 630090, Russia
Full-text PDF (295 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.33048/mattrudy.2023.26.202
Abstract: Let $R_n$ be the centered and normalized number of cycles of fixed length contained in a generalized random graph with $n$ vertices. We obtain a Höffding-type exponential inequality for the tail probability of $R_n$.
Key words: random graph, number of subgraphs, cycle, Höffding's inequality.
Funding agency Grant number
Russian Science Foundation 22-21-00414
The work was supported by the Russian Science Foundation (project №. 22-21-00414).
Received: 21.06.2023
Revised: 23.07.2023
Accepted: 05.10.2023
English version:
Siberian Advances in Mathematics, 2023, Volume 33, Issue 3, Pages 181–189
DOI: https://doi.org/10.1134/S1055134423030021
Document Type: Article
UDC: 519.175.4
Language: Russian
Citation: A. A. Bystrov, N. V. Volod'ko, “Exponential inequalities for the tail probabilities of the number of cycles in generalized random graphs”, Mat. Tr., 26:2 (2023), 30–43; Siberian Adv. Math., 33:3 (2023), 181–189
Citation in format AMSBIB
\Bibitem{BysVol23}
\by A.~A.~Bystrov, N.~V.~Volod'ko
\paper Exponential inequalities for the tail probabilities of the number of cycles in generalized random graphs
\jour Mat. Tr.
\yr 2023
\vol 26
\issue 2
\pages 30--43
\mathnet{http://mi.mathnet.ru/mt678}
\transl
\jour Siberian Adv. Math.
\yr 2023
\vol 33
\issue 3
\pages 181--189
\crossref{https://doi.org/10.1134/S1055134423030021}
Linking options:
  • https://www.mathnet.ru/eng/mt678
  • https://www.mathnet.ru/eng/mt/v26/i2/p30
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические труды Siberian Advances in Mathematics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025