Inferences for Random Graphs Evolved by Clustering Attachment

Natalia Markovich, Maksim Ryzhov, Marijus Vaičiulis

The evolution of random undirected graphs by the clustering attachment (CA) both without node and edge deletion and with uniform node or edge deletion is investigated. Theoretical…