Triangle percolation in mean field random graphs -- with PDE
Mathematical Physics
2009-11-13 v2 math.MP
Abstract
We apply a PDE-based method to deduce the critical time and the size of the giant component of the ``triangle percolation'' on the Erd\H{o}s-R\'enyi random graph process investigated by Palla, Der\'enyi and Vicsek
Keywords
Cite
@article{arxiv.0712.2646,
title = {Triangle percolation in mean field random graphs -- with PDE},
author = {Balázs Ráth and Bálint Tóth},
journal= {arXiv preprint arXiv:0712.2646},
year = {2009}
}
Comments
Summary of the changes made: We have changed a remark about k-clique percolation in the first paragraph. Two new paragraphs are inserted after equation (4.4) with two applications of the equation. We have changed the names of some variables in our formulas