No Arabic abstract
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
We base our study on the statistical analysis of the Rigan earthquake 2010 December 20, which consists of estimating the earthquake network by means of virtual seismometer technique, and also considering the avalanche-type dynamics on top of this complex network.The virtual seismometer complex network shows power-law degree distribution with the exponent $gamma=2.3pm 0.2$. Our findings show that the seismic activity is strongly intermittent, and have a textit{cyclic shape} as is seen in the natural situations, which is main finding of this study. The branching ratio inside and between avalanches reveal that the system is at (or more precisely close to) the critical point with power-law behavior for the distribution function of the size and the mass and the duration of the avalanches, and with some scaling relations between these quantities. The critical exponent of the size of avalanches is $tau_S=1.45pm 0.02$. We find a considerable correlation between the dynamical Green function and the nodes centralities.
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.
A continuous-time quantum walk is investigated on complex networks with the characteristic property of community structure, which is shared by most real-world networks. Motivated by the prospect of viable quantum networks, I focus on the effects of network instabilities in the form of broken links, and examine the response of the quantum walk to such failures. It is shown that the reconfiguration of the quantum walk is determined by the community structure of the network. In this context, quantum walks based on the adjacency and Laplacian matrices of the network are compared, and their responses to link failures is analyzed.
We present a new layout algorithm for complex networks that combines a multi-scale approach for community detection with a standard force-directed design. Since community detection is computationally cheap, we can exploit the multi-scale approach to generate network configurations with close-to-minimal energy very fast. As a further asset, we can use the knowledge of the community structure to facilitate the interpretation of large networks, for example the network defined by protein-protein interactions.