Triangle percolation in mean field random graphs -- with PDE

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ős-Rényi random graph process investigated by Palla, Derényi and Vicsek

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

References in corpus (2)

• Clique percolation in random networks
• The critical point of k-clique percolation in the Erdos-Renyi graph