Show simple item record

dc.contributor.authorNoy Serrano, Marcos
dc.contributor.authorRasendrahasina, Vonjy
dc.contributor.authorRavelomanana, Vlady
dc.contributor.authorRué Perna, Juan José
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2017-12-04T12:51:16Z
dc.date.available2017-12-04T12:51:16Z
dc.date.issued2017
dc.identifier.citationNoy, M., Rasendrahasina, V., Ravelomanana, V., Rue, J. Isolated cycles of critical random graphs. A: Workshop on Analytic Algorithmics and Combinatorics. "Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017". Barcelona: Society for Industrial and Applied Mathematics (SIAM), 2017, p. 46-55.
dc.identifier.isbn978-1-61197-477-5
dc.identifier.urihttp://hdl.handle.net/2117/111536
dc.description.abstractConsider the Erdos-Renyi random graph G(n, M) built with n vertices and M edges uniformly randomly chosen from the set of n2 edges. Let L be a set of positive integers. For any number of edges M 6n/2 + O(n 2/3 ), we compute – via analytic combinatorics – the number of isolated cycles of G(n, M) whose length is in L.
dc.format.extent10 p.
dc.language.isoeng
dc.publisherSociety for Industrial and Applied Mathematics (SIAM)
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi matemàtica::Funcions de variable complexa
dc.subject.lcshRandom variables
dc.subject.otherRandom Constrained graphs
dc.titleIsolated cycles of critical random graphs
dc.typeConference report
dc.subject.lemacVariables aleatòries
dc.contributor.groupUniversitat Politècnica de Catalunya. MD - Matemàtica Discreta
dc.subject.amsClassificació AMS::45 Integral equations::45R05 Random integral equations
dc.relation.publisherversionhttp://epubs.siam.org/doi/book/10.1137/1.9781611974775
dc.rights.accessOpen Access
drac.iddocument21556140
dc.description.versionPostprint (updated version)
dc.relation.projectidUniversite Paris Denis Diderot supported by ANR 2010 BLAN 0204 (Magnum). Partially supported by grants ANR 2010 BLAN 0204 (Magnum) and the Project PHC Procope ID- 57134837 “Analytic, probabilistic and geometric Methods for Random Constrained graphs”. Partially supported by the Project PHC Procope ID-57134837 “Analytic, probabilistic and geometric Methods for Random Constrained graphs”, by the FP7-PEOPLE-2013-CIG project CountGraph (ref. 630749), and the Spanish MICINN projects MTM2014-54745-P, MTM2014-56350-P
upcommons.citation.authorNoy, M., Rasendrahasina, V., Ravelomanana, V., Rue, J.
upcommons.citation.contributorWorkshop on Analytic Algorithmics and Combinatorics
upcommons.citation.pubplaceBarcelona
upcommons.citation.publishedtrue
upcommons.citation.publicationNameProceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017
upcommons.citation.startingPage46
upcommons.citation.endingPage55


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain