Bond percolation on a class of correlated and clustered random graphs

Details Bond percolation on a class of correlated and clustered random graphs Bond percolation on a class of correlated and clustered random graphs

2012-01-22

arxiv.org/abs/1201.4602v1

Physics

Condensed Matter

Statistical Mechanics

9 pages and 7 figures

Scientific paper

We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via different types of hyperedges, edges that can link more than 2 nodes. We argue that the multitype approach coupled with the use of clustered hyperedges can reproduce a wide spectrum of complex patterns, and thus enhances our capability to model real complex networks. As an illustration of this claim, we use our formalism to highlight unusual behaviors of the size and composition of the components (small and giant) in a fictional, albeit realistic, social network.

Affiliated with

Also associated with

No associations

Rating

Bond percolation on a class of correlated and clustered random graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bond percolation on a class of correlated and clustered random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bond percolation on a class of correlated and clustered random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-496265