Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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

Problemy Peredachi Informatsii, 2015, Volume 51, Issue 1, Pages 72–81 (Mi ppi2163)  
This article is cited in 4 scientific papers (total in 4 papers)

Communication Network Theory

Activity maxima in some models of information networks with random weights and heavy tails

A. V. Lebedev

Probability Theory Department, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Moscow, Russia
Full-text PDF (182 kB) Citations (4)
References:
PDF
HTML
Abstract: We consider models of information networks described by random graphs and hypergraphs where each node has a random information activity with distribution having a heavy (regularly varying) tail. We derive sufficient conditions under which the maximum of the aggregate activities (over a node and its neighbors or over communities) asymptotically grows in the same way as the maximum of individual activities and the Fréchet limit law holds for them.
Received: 08.09.2014
English version:
Problems of Information Transmission, 2015, Volume 51, Issue 1, Pages 66–74
DOI: https://doi.org/10.1134/S003294601501007X
Bibliographic databases:
Document Type: Article
UDC: 621.394/395.74+519.2
Language: Russian
Citation: A. V. Lebedev, “Activity maxima in some models of information networks with random weights and heavy tails”, Probl. Peredachi Inf., 51:1 (2015), 72–81; Problems Inform. Transmission, 51:1 (2015), 66–74
Citation in format AMSBIB
\Bibitem{Leb15}
\by A.~V.~Lebedev
\paper Activity maxima in some models of information networks with random weights and heavy tails
\jour Probl. Peredachi Inf.
\yr 2015
\vol 51
\issue 1
\pages 72--81
\mathnet{http://mi.mathnet.ru/ppi2163}
\elib{https://elibrary.ru/item.asp?id=27042373}
\transl
\jour Problems Inform. Transmission
\yr 2015
\vol 51
\issue 1
\pages 66--74
\crossref{https://doi.org/10.1134/S003294601501007X}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000352985900007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84957956128}
Linking options:
  • https://www.mathnet.ru/eng/ppi2163
  • https://www.mathnet.ru/eng/ppi/v51/i1/p72
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025