On random Cameo graphs with independent edges Part I: path connectivity and essential diameter
Probability
2007-05-23 v2
Abstract
We 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.
Keywords
Cite
@article{arxiv.math/0609202,
title = {On random Cameo graphs with independent edges Part I: path connectivity and essential diameter},
author = {Philippe Blanchard and Tyll Krueger and Madeleine Sirugue-Collin},
journal= {arXiv preprint arXiv:math/0609202},
year = {2007}
}