Triangle percolation in mean field random graphs -- with PDE
classification
🧮 math-ph
math.MP
keywords
enyipercolationrandomtriangleapplycomponentcriticaldeduce
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.