title: Random graphs containing arbitrary distributions of subgraphs.
abstract: Traditional random graph models of networks generate networks that are locally treelike, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real networks having strongly nontreelike neighborhoods that contain short loops, cliques, or other biconnected subgraphs. In this paper we propose and analyze a class of random graph models that incorporates general subgraphs, allowing for nontreelike neighborhoods while still remaining solvable for many fundamental network properties. Among other things we give solutions for the size of the giant component, the position of the phase transition at which the giant component appears, and percolation properties for both site and bond percolation on networks generated by the model.
authors.affiliation: Department of Physics, University of Michigan, Ann Arbor, Michigan 48109, USA.
authors.forename: Brian
authors.initials: B
authors.lastname: Karrer
authors.forename: M E J
authors.initials: ME
authors.lastname: Newman