Dynamics of k-core percolation in a random graph

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 4 figures

Scientific paper

10.1088/1751-8113/42/7/075005

We study the edge deletion process of random graphs near a k-core percolation point. We find that the time-dependent number of edges in the process exhibits critically divergent fluctuations. We first show theoretically that the k-core percolation point is exactly given as the saddle-node bifurcation point in a dynamical system. We then determine all the exponents for the divergence based on a universal description of fluctuations near the saddle-node bifurcation.

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

Dynamics of k-core percolation in a random graph 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 Dynamics of k-core percolation in a random graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamics of k-core percolation in a random graph will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-27505

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