Critical behavior ofk-core percolation: Numerical studies
نویسندگان
چکیده
منابع مشابه
Critical phenomena in heterogeneous k-core percolation.
k-core percolation is a percolation model which gives a notion of network functionality and has many applications in network science. In analyzing the resilience of a network under random damage, an extension of this model is introduced, allowing different vertices to have their own degree of resilience. This extension is named heterogeneous k-core percolation and it is characterized by several...
متن کاملCore percolation in random graphs: a critical phenomena analysis
We study both numerically and analytically what happens to a random graph of average connectivity α when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated vertices plus an induced subgraph we call the core. In the thermodynamic limit of an infinite random graph, we compute analytically the dynamics of leaf removal, the n...
متن کاملMapping functions and critical behavior of percolation on rectangular domains.
The existence probability E_{p} and the percolation probability P of bond percolation on rectangular domains with different aspect ratios R are studied via the mapping functions between systems with different aspect ratios. The superscaling behavior of E_{p} and P for such systems with exponents a and b , respectively, found by Watanabe [Phys. Rev. Lett. 93, 190601 (2004)] can be understood fro...
متن کاملCritical Behavior of Random Resistor Networks Near the Percolation Threshold
We use low-density series expansions to calculate critical exponents for the behavior of random resistor networks near the percolation threshold as a function of the spatial dimension d. By using scaling relations, we obtain values of the conductivity exponent μ. For d=2 we find μ=1.43±0.02, and for d=3, μ=1.95±0.03, in excellent agreement with the experimental result of Abeles et al. Our resul...
متن کاملTransience, Recurrence and Critical Behavior for Long-Range Percolation
We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions d = 1, 2, where x and y are connected with probability ∼ β/‖x − y‖−s. We show that when d < s < 2d the walk is transient, and when s ≥ 2d, the walk is recurrent. The proof of transience is based on a renormalization argument. As a corollary of this renormalization argument, we ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2016
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.94.062307