Show simple item record

dc.contributor.authorDrmota, Michael
dc.contributor.authorRamos Garrido, Lander
dc.contributor.authorRué Perna, Juan José
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2017-10-10T13:38:22Z
dc.date.available2018-05-01T00:30:28Z
dc.date.issued2017-04-01
dc.identifier.citationDrmota, M., Ramos, L., Rue, J. Subgraph statistics in subcritical graph classes. "Random structures and algorithms", 1 Abril 2017, p. 1-43.
dc.identifier.issn1042-9832
dc.identifier.urihttp://hdl.handle.net/2117/108598
dc.description.abstractLet H be a fixed graph and math formula a subcritical graph class. In this paper we show that the number of occurrences of H (as a subgraph) in a graph in math formula of order n, chosen uniformly at random, follows a normal limiting distribution with linear expectation and variance. The main ingredient in our proof is the analytic framework developed by Drmota, Gittenberger and Morgenbesser to deal with infinite systems of functional equations [Drmota, Gittenberger, and Morgenbesser, Submitted]. As a case study, we obtain explicit expressions for the number of triangles and cycles of length 4 in the family of series-parallel graphs.
dc.format.extent43 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshCombinatorial analysis
dc.subject.otheranalytic combinatorics
dc.subject.othergenerating functions
dc.subject.otherrandom graphs
dc.subject.othersubcritical graph classes
dc.subject.otherseries-parallel graphs
dc.titleSubgraph statistics in subcritical graph classes
dc.typeArticle
dc.subject.lemacAnàlisi combinatòria
dc.contributor.groupUniversitat Politècnica de Catalunya. MD - Matemàtica Discreta
dc.identifier.doi10.1002/rsa.20721
dc.relation.publisherversionhttp://onlinelibrary.wiley.com/doi/10.1002/rsa.20721/abstract
dc.rights.accessOpen Access
drac.iddocument20329390
dc.description.versionPostprint (author's final draft)
upcommons.citation.authorDrmota, M., Ramos, L., Rue, J.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameRandom structures and algorithms
upcommons.citation.startingPage1
upcommons.citation.endingPage43


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder