On random Cameo graphs with independent edges Part I: path connectivity and essential diameter

Simple item page
dc.creatorBlanchard, Philippe
dc.creatorKrueger, Tyll
dc.creatorSirugue-Collin, Madeleine
dc.date2006-09-07
dc.date2006-09-07
dc.date.accessioned2026-07-07T07:24:36Z
dc.date.available2026-07-07T07:24:36Z
dc.descriptionWe study growth properties of the number of paths of lenght k for a variant of Cameo graphs introduced in an earlier paper. Sharp results are obtained for threshold for the k-path connectivity and the essential diameter.
dc.identifierhttps://arxiv.org/abs/math/0609202
dc.identifierhttp://arxiv.org/abs/math/0609202
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116419
dc.subjectProbability
dc.titleOn random Cameo graphs with independent edges Part I: path connectivity and essential diameter
dc.typetext

Files

Collections

arXiv