ﻻ يوجد ملخص باللغة العربية
Earthquake network is known to be of the small-world type. The values of the network characteristics, however, depend not only on the cell size (i.e., the scale of coarse graining needed for constructing the network) but also on the size of a seismic data set. Here, discovery of a scaling law for the clustering coefficient in terms of the data size, which is refereed to here as finite data-size scaling, is reported. Its universality is shown to be supported by the detailed analysis of the data taken from California, Japan and Iran. Effects of setting threshold of magnitude are also discussed.
This chapter describes the progress made during the past three decades in the finite size scaling analysis of the critical phenomena of the Anderson transition. The scaling theory of localisation and the Anderson model of localisation are briefly ske
In Ref.1 (Physical Review B 80, 041304(R) (2009)), we reported an estimate of the critical exponent for the divergence of the localization length at the quantum Hall transition that is significantly larger than those reported in the previous publishe
Earthquake network is known to be complex in the sense that it is scale-free, small-world, hierarchically organized and assortatively mixed. Here, the time evolution of earthquake network is analyzed around main shocks in the context of the community
An article for the Springer Encyclopedia of Complexity and System Science
A two parameter percolation model with nucleation and growth of finite clusters is developed taking the initial seed concentration rho and a growth parameter g as two tunable parameters. Percolation transition is determined by the final static config