Related papers: Small-world structure of earthquake network
Scale-free power law structure describes complex networks derived from a wide range of real world processes. The extensive literature focuses almost exclusively on networks with power law exponent strictly larger than 2, which can be…
A dissipative stochastic sandpile model is constructed on one and two dimensional small-world networks with different shortcut densities $\phi$ where $\phi=0$ and $1$ represent a regular lattice and a random network respectively. In the…
We reformulated the string formalism given by Aoyama, using an adjacent matrix of a network and introduced a series of generalized clustering coefficients based on it. Furthermore we numerically evaluated Milgram condition proposed by their…
We study two kinds of weighted networks, weighted small-world (WSW) and weighted scale-free (WSF). The weight $w_{ij}$ of a link between nodes $i$ and $j$ in the network is defined as the product of endpoint node degrees; that is…
The small-world property in the context of complex networks implies structural benefits to the processes taking place within a network, such as optimal information transmission and robustness. In this paper, we study a model network of…
Short and long range interactions between earthquakes are attracting increasing interest. Scale invariant properties of seismicity in time, space and energy argue for the presence of complex triggering mechanisms where, like a cascade…
We consider recent reports on small-world topologies of interaction networks derived from the dynamics of spatially extended systems that are investigated in diverse scientific fields such as neurosciences, geophysics, or meteorology. With…
We study fully synchronized states in scale-free networks of chaotic logistic maps as a function of both dynamical and topological parameters. Three different network topologies are considered: (i) random scale-free topology, (ii)…
The concept of memory is of central importance for characterizing complex systems and phenomena. Presence of long-term memories indicates how their dynamics can be less sensitive to initial conditions compared to the chaotic cases. On the…
We consider critical phenomena on heterogeneous small-world networks having a scale-free character but also arbitrary short-loops. After deriving the self-consistent equation for the order parameter and the critical surface, we prove that…
Stimulated by the growing interest in the applications of complex networks framework on time series analysis, we devise a network model in which each of $N$ nodes is associated with a random walk of length $L$. Connectivity between any two…
The clustering coefficient, path length and average vertex degree of two urban train line networks have been calculated. The results are compared with theoretical predictions for appropriate random bipartite graphs. They have also been…
A dissipative sandpile model (DSM) is constructed and studied on small world networks (SWN). SWNs are generated adding extra links between two arbitrary sites of a two dimensional square lattice with different shortcut densities $\phi$.…
The statistical property of a growing scale-free network is studied based on an earlier model proposed by Krapivsky, Rodgers, and Redner [Phys. Rev. Lett. 86, 5401 (2001)], with the additional constraints of forbidden of self-connection and…
Real world complex networks are scale free and possess meso-scale properties like core-periphery and community structure. We study evolution of the core over time in real world networks. This paper proposes evolving models for both…
The clustering coefficient of a vertex in a graph is the proportion of neighbours of the vertex that are adjacent. The minimum clustering coefficient of a graph is the smallest clustering coefficient taken over all vertices. A complete…
Researchers have long observed that the ``small-world" property, which combines the concepts of high transitivity or clustering with a low average path length, is ubiquitous for networks obtained from a variety of disciplines, including…
We propose a novel network measure of topological invariants, called small-worldness, for identifying topological phase transitions of quantum and classical spin models. Small-worldness is usually defined in the study of social networks…
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared with the ones in a random graph. Examples of small-world…
Small-world and scale-free networks are known to be more easily synchronized than regular lattices, which is usually attributed to the smaller network distance between oscillators. Surprisingly, we find that networks with a homogeneous…