$1/d$ Expansion for $k$-Core Percolation

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

47 pages, 26 figures, revtex4

Scientific paper

10.1103/PhysRevE.72.046123

The physics of $k$-core percolation pertains to those systems whose constituents require a minimum number of $k$ connections to each other in order to participate in any clustering phenomenon. Examples of such a phenomenon range from orientational ordering in solid ortho-para ${\rm H}_2$ mixtures to the onset of rigidity in bar-joint networks to dynamical arrest in glass-forming liquids. Unlike ordinary ($k=1$) and biconnected ($k=2$) percolation, the mean field $k\ge3$-core percolation transition is both continuous and discontinuous, i.e. there is a jump in the order parameter accompanied with a diverging length scale. To determine whether or not this hybrid transition survives in finite dimensions, we present a $1/d$ expansion for $k$-core percolation on the $d$-dimensional hypercubic lattice. We show that to order $1/d^3$ the singularity in the order parameter and in the susceptibility occur at the same value of the occupation probability. This result suggests that the unusual hybrid nature of the mean field $k$-core transition survives in high dimensions.

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

$1/d$ Expansion for $k$-Core 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 $1/d$ Expansion for $k$-Core Percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and $1/d$ Expansion for $k$-Core Percolation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-649879

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