Do you want to publish a course? Click here

Finite data-size scaling of clustering in earthquake networks

133   0   0.0 ( 0 )
 Added by Sumiyoshi Abe
 Publication date 2010
  fields Physics
and research's language is English
 Authors Sumiyoshi Abe




Ask ChatGPT about the research

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.



rate research

Read More

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 sketched. The finite size scaling method is described. Recent results for the critical exponents of the different symmetry classes are summarised. The importance of corrections to scaling are emphasised. A comparison with experiment is made, and a direction for future work is suggested.
166 - Keith Slevin , Tomi Ohtsuki 2012
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 published work of other authors. In this paper, we update our finite size scaling analysis of the Chalker-Coddington model and suggest the origin of the previous underestimate by other authors. We also compare our results with the predictions of Lutken and Ross (Physics Letters B 653, 363 (2007)).
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 structure. It is found that the maximum of the modularity measure quantifying existence of communities exhibits a peculiar behavior: its maximum value stays at a large value before a main shock, suddenly drops to a small value at the main shock, and then increases to relax to a large value again relatively slowly. Thus, a main shock absorbs and merges communities to create a larger community, showing how a main shock can be characterized in the complex-network representation of seismicity.
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 configuration of spanning clusters. A finite size scaling theory for such transition is developed and numerically verified. The scaling functions are found to depend on both g and rho. The singularities at the critical growth probability gc of a given rho are described by appropriate critical exponents. The values of the critical exponents are found to be same as that of the original percolation at all values of rho at the respective gc . The model then belongs to the same universality class of percolation for the whole range of rho.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا