Related papers: Scaling relation for earthquake networks

An analytic perturbation theory is suggested in order to find finite-size corrections to the scaling power laws. In the frame of this theory it is shown that the first order finite-size correction to the scaling power laws has following…

We introduce a geometric scaling relation that characterizes the local scale behavior of correlations using the informational distance $d_E = K_0/\sqrt{I}$, where $I$ is the mutual information. We define a geometric conversion factor, $G…

The unified scaling law for earthquakes, proposed by Bak, Christensen, Danon and Scanlon, is shown to hold worldwide, as well as for areas as diverse as Japan, New Zealand, Spain or New Madrid. The scaling functions that account for the…

Scaling analysis of seismicity in the space-time-magnitude domain very often starts from the relation N(m,L)=a(L)*10**(-bm)*L**c for the rate of seismic events of magnitude M>m in an area of size L. There is some evidence in favor of…

Through the distinction between ``real'' and ``virtual'' links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with…

We report on parallel observations in two seemingly unrelated areas of dynamical network research. The one is the so-called small world phenomenon and/or the observation of scale freeness in certain types of large (empirical) networks and…

The impact of inhomogeneous arrangement of nodes in space on network organization cannot be neglected in most of real-world scale-free networks. Here, we wish to suggest a model for a geographical network with nodes embedded in a fractal…

Recurrence networks are a novel tool of nonlinear time series analysis allowing the characterisation of higher-order geometric properties of complex dynamical systems based on recurrences in phase space, which are a fundamental concept in…

We present scaling laws that dictate both local and global connectivity properties of bounded wireless networks. These laws are defined with respect to the key system parameters of per-node transmit power and the number of antennas…

We give exact relations for certain types of the hierarchic fractal structures. In the blatant distinction from regular networks of the "small world" (SW) topology [1], regular fractal networks manifests the logarithmic dependence of the…

Scale-free networks, in which the distribution of the degrees obeys a power-law, are ubiquitous in the study of complex systems. One basic network property that relates to the structure of the links found is the degree assortativity, which…

Barab\'asi-Albert's `Scale Free' model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however,…

We introduce a simple model for the size distribution of avalanches based on the idea that the front of an avalanche can be described by a directed random walk. The model captures some of the qualitative features of earthquakes, avalanches…

Waiting-time statistics are generated from the Olami-Feder-Christensen model and shown to mimic some aspects of real seismicity. Preliminary analysis of the model data implies a recently proposed universal scaling law for the distribution…

Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…

The network approach plays a distinguished role in contemporary science of complex systems/phenomena. Such an approach has been introduced into seismology in a recent work [S. Abe and N. Suzuki, Europhys. Lett. 65, 581 (2004)]. Here, we…

In this paper, a simply rule that generates scale-free networks with very large clustering coefficient and very small average distance is presented. These networks are called {\bf Multistage Random Growing Networks}(MRGN) as the adding…

A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…

This article is the first in a series of three papers investigating the detailed geometry of river networks. Large-scale river networks mark an important class of two-dimensional branching networks, being not only of intrinsic interest but…

Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are…