A Hamiltonian approach for explosive percolation

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages, 4 figures

Scientific paper

We introduce a cluster growth process that provides a clear connection between equilibrium statistical mechanics and an explosive percolation model similar to the one recently proposed by Achlioptas et al. [Science 323, 1453 (2009)]. We show that the following two ingredients are essential for obtaining an abrupt (first-order) transition in the fraction of the system occupied by the largest cluster: (i) the size of all growing clusters should be kept approximately the same, and (ii) the inclusion of merging bonds (i.e., bonds connecting vertices in different clusters) should dominate with respect to the redundant bonds (i.e., bonds connecting vertices in the same cluster). Moreover, in the extreme limit where only merging bonds are present, a complete enumeration scheme based on tree-like graphs can be used to obtain an exact solution of our model that displays a first-order transition. Finally, the proposed mechanism can be viewed as a generalization of standard percolation that discloses an entirely new family of models with potential application in growth and fragmentation processes of real network systems.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Hamiltonian approach for explosive percolation 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 A Hamiltonian approach for explosive percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Hamiltonian approach for explosive percolation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-90332

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.