Finite data-size scaling of clustering in earthquake networks

Abstract

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.

arXiv comment29 pages, 5 figures

References in corpus (12)

• Emergence of scaling in random networks
• Error and attack tolerance of complex networks
• Assortative mixing in networks
• Hierarchical Organization in Complex Networks
• Long-Term Clustering, Scaling, and Universality in the Temporal Occurrence of Earthquakes
• Scale-free statistics of time interval between successive earthquakes
• Law for the distance between successive earthquakes
• Small-world structure of earthquake network
• Complex earthquake networks: Hierarchical organization and assortative mixing
• Dynamical evolution of clustering in complex network of earthquakes
• Determination of the scale of coarse graining in earthquake network
• Scaling relation for earthquake networks

Cited by in corpus (7)

• Earthquake networks based on similar activity patterns
• Dynamical evolution of the community structure of complex earthquake network
• Universal law for waiting internal time in seismicity and its implication to earthquake network
• Network similarity and statistical analysis of earthquake seismic data
• Aftershocks in Modern Perspectives: Complex Earthquake Network, Aging, and Non-Markovianity
• Shear deformation in CuZr metallic glass: A statistical and complex network analysis
• The earthquake network: the best time scale for network construction