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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Izv. RAN. Ser. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Izvestiya: Mathematics, 2012, Volume 76, Issue 3, Pages 607–625
DOI: https://doi.org/10.1070/IM2012v076n03ABEH002597 (Mi im6036) 		 
This article is cited in 3 scientific papers (total in 3 papers)

On the number of subgraphs of the Barabási–Albert random graph

A. A. Ryabchenko, E. A. Samosvat

Moscow Institute of Physics and Technology
English version PDF (296 kB) Citations (3) Russian version article
References:
PDF
HTML
DOI: https://doi.org/10.1070/IM2012v076n03ABEH002597
Abstract: We study a model of a random graph of the type of the Barabási–Albert preferential attachment model. We develop a technique that makes it possible to estimate the mathematical expectation for a fairly wide class of random variables in the model under consideration. We use this technique to prove a theorem on the asymptotics of the mathematical expectation of the number of subgraphs isomorphic to a certain fixed graph in the random graphs of this model.
Keywords: random graph, Internet graph, preferential attachment, Barabási–Albert model, number of subgraphs.
Received: 23.11.2010
Revised: 14.06.2011
Bibliographic databases:
Document Type: Article
UDC: 519.175.4
MSC: 05C80
Language: English
Original paper language: Russian
Citation: A. A. Ryabchenko, E. A. Samosvat, “On the number of subgraphs of the Barabási–Albert random graph”, Izv. Math., 76:3 (2012), 607–625
Citation in format AMSBIB
\Bibitem{RyaSam12}
\by A.~A.~Ryabchenko, E.~A.~Samosvat
\paper On the number of subgraphs of the Barab\'asi--Albert random graph
\jour Izv. Math.
\yr 2012
\vol 76
\issue 3
\pages 607--625
\mathnet{http://mi.mathnet.ru/eng/im6036}
\crossref{https://doi.org/10.1070/IM2012v076n03ABEH002597}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2978113}
\zmath{https://zbmath.org/?q=an:1245.05116}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2012IzMat..76..607R}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000305690000008}
\elib{https://elibrary.ru/item.asp?id=20358849}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84862641443}
Linking options:
  • https://www.mathnet.ru/eng/im6036
  • https://doi.org/10.1070/IM2012v076n03ABEH002597
  • https://www.mathnet.ru/eng/im/v76/i3/p183
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия Российской академии наук. Серия математическая Izvestiya: Mathematics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025