Isolated cycles of critical random graphs

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/111536

Title:	Isolated cycles of critical random graphs
Author:	Noy Serrano, Marcos; Rasendrahasina, Vonjy; Ravelomanana, Vlady; Rué Perna, Juan José
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtiques; Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
Abstract:	Consider 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.
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi matemàtica::Funcions de variable complexa -Random variables -Random Constrained graphs -Variables aleatòries -Classificació AMS::45 Integral equations::45R05 Random integral equations
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Updated version Conference Object
Published by:	Society for Industrial and Applied Mathematics (SIAM)
Share: