Small-world properties of the Indian railway network

Emergence of overlap in ensembles of spatial multiplexes and statistical mechanics of spatial interacting network ensembles

Spatial networks range from the brain networks, to transportation networks and infrastructures. Recently interacting and multiplex networks are attracting great attention because their dynamics and robustness cannot be understood without treating at the same time several networks. Here we present maximal entropy ensembles of spatial multiplex and spatial interacting networks that can be used in order to model spatial multilayer network structures and to build null models of real data sets. We show that spatial multiplexes naturally develop a significant overlap of the links, a noticeable property of many multiplexes that can affect significantly the dynamics taking place on them. Additionally, we characterize ensembles of spatial interacting networks and we analyze the structure of interacting airport and railway networks in India, showing the effect of space in determining the link probability.

How can social network analysis contribute to social behavior research in applied ethology?

Social network analysis is increasingly used by behavioral ecologists and primatologists to describe the patterns and quality of interactions among individuals. We provide an overview of this methodology, with examples illustrating how it can be used to study social behavior in applied contexts. Like most kinds of social interaction analyses, social network analysis provides information about direct relationships (e.g. dominant-subordinate relationships). However, it also generates a more global model of social organization that determines how individual patterns of social interaction relate to individual and group characteristics. A particular strength of this approach is that it provides standardized mathematical methods for calculating metrics of sociality across levels of social organization, from the population and group levels to the individual level. At the group level these metrics can be used to track changes in social network structures over time, evaluate the effect of the environment on social network structure, or compare social structures across groups, populations or species. At the individual level, the metrics allow quantification of the heterogeneity of social experience within groups and identification of individuals who may play especially important roles in maintaining social stability or information flow throughout the network.

Universal fractal scaling of self-organized networks

There is an abundance of literature on complex networks describing a variety of relationships among units in social, biological, and technological systems. Such networks, consisting of interconnected nodes, are often self-organized, naturally emerging without any overarching designs on topological structure yet enabling efficient interactions among nodes. Here we show that the number of nodes and the density of connections in such self-organized networks exhibit a power law relationship. We examined the size and connection density of 47 self-organizing networks of various biological, social, and technological origins, and found that the size-density relationship follows a fractal relationship spanning over 6 orders of magnitude. This finding indicates that there is an optimal connection density in self-organized networks following fractal scaling regardless of their sizes.

Onset of cooperation between layered networks

Functionalities of a variety of complex systems involve cooperations among multiple components; for example, a transportation system provides convenient transfers among airlines, railways, roads, and shipping lines. A layered model with interacting networks can facilitate the description and analysis of such systems. In this paper we propose a model of traffic dynamics and reveal a transition at the onset of cooperation between layered networks. The cooperation strength, treated as an order parameter, changes from zero to positive at the transition point. Numerical results on artificial networks as well as two real networks, Chinese and European railway-airline transportation networks, agree well with our analysis.

The complex network of global cargo ship movements

Transportation networks play a crucial role in human mobility, the exchange of goods and the spread of invasive species. With 90 per cent of world trade carried by sea, the global network of merchant ships provides one of the most important modes of transportation. Here, we use information about the itineraries of 16 363 cargo ships during the year 2007 to construct a network of links between ports. We show that the network has several features that set it apart from other transportation networks. In particular, most ships can be classified into three categories: bulk dry carriers, container ships and oil tankers. These three categories do not only differ in the ships' physical characteristics, but also in their mobility patterns and networks. Container ships follow regularly repeating paths whereas bulk dry carriers and oil tankers move less predictably between ports. The network of all ship movements possesses a heavy-tailed distribution for the connectivity of ports and for the loads transported on the links with systematic differences between ship types. The data analysed in this paper improve current assumptions based on gravity models of ship movements, an important step towards understanding patterns of global trade and bioinvasion.

Eigenvalue spectra of spatial-dependent networks

Many real-life networks exhibit a spatial dependence; i.e., the probability to form an edge between two nodes in the network depends on the distance between them. We investigate the influence of spatial dependence on the spectral density of the network. When increasing spatial dependence in Erdös-Rényi, scale-free, and small-world networks, it is found that the spectrum changes. Due to the spatial dependence the degree of clustering and the number of triangles increase. This results in a higher asymmetry (skewness). Our results show that the spectrum can be used to detect and quantify clustering and spatial dependence in a network.

Percolation in insect nest networks: evidence for optimal wiring

Optimization has been shown to be a driving force for the evolution of some biological structures, such as neural maps in the brain or transport networks. Here we show that insect networks also display characteristic traits of optimality. By using a graph representation of the chamber organization of termite nests and a disordered lattice model, it is found that these spatial nests are close to a percolation threshold. This suggests that termites build efficient systems of galleries spanning most of the nest volume at low cost. The evolutionary consequences are outlined.

Synchronization and spatiotemporal patterns in coupled phase oscillators on a weighted planar network

To reveal the relation between network structures found in two-dimensional biological systems, such as protoplasmic tube networks in the plasmodium of true slime mold, and spatiotemporal oscillation patterns emerged on the networks, we constructed coupled phase oscillators on weighted planar networks and investigated their dynamics. Results showed that the distribution of edge weights in the networks strongly affects (i) the propensity for global synchronization and (ii) emerging ratios of oscillation patterns, such as traveling and concentric waves, even if the total weight is fixed. In-phase locking, traveling wave, and concentric wave patterns were, respectively, observed most frequently in uniformly weighted, center weighted treelike, and periphery weighted ring-shaped networks. Controlling the global spatiotemporal patterns with the weight distribution given by the local weighting (coupling) rules might be useful in biological network systems including the plasmodial networks and neural networks in the brain.

Intrinsic properties of Boolean dynamics in complex networks

We study intrinsic properties of attractor in Boolean dynamics of complex networks with scale-free topology, comparing with those of the so-called Kauffman's random Boolean networks. We numerically study both frozen and relevant nodes in each attractor in the dynamics of relatively small networks (20<or=N<or=200). We investigate numerically robustness of an attractor to a perturbation. An attractor with cycle length of l(c) in a network of size N consists of l(c) states in the state space of 2(N) states; each attractor has the arrangement of N nodes, where the cycle of attractor sweeps l(c) states. We define a perturbation as a flip of the state on a single node in the attractor state at a given time step. We show that the rate between unfrozen and relevant nodes in the dynamics of a complex network with scale-free topology is larger than that in Kauffman's random Boolean network model. Furthermore, we find that in a complex scale-free network with fluctuation of the in-degree number, attractors are more sensitive to a state flip for a highly connected node (i.e. input-hub node) than to that for a less connected node. By some numerical examples, we show that the number of relevant nodes increases, when an input-hub node is coincident with and/or connected with an output-hub node (i.e. a node with large output-degree) one another.

Disorder and decision cost in spatial networks

We introduce the concept of decision cost of a spatial graph, which measures the disorder of a given network taking into account not only the connections between nodes but their position in a two-dimensional map. The influence of the network size is evaluated and we show that normalization of the decision cost allows us to compare the degree of disorder of networks of different sizes. Under this framework, we measure the disorder of the connections between airports of two different countries and obtain some conclusions about which of them is more disordered. The introduced concepts (decision cost and disorder of spatial networks) can easily be extended to Euclidean networks of higher dimensions, and also to networks whose nodes have a certain fitness property (i.e., one-dimensional).

Network 'small-world-ness': a quantitative method for determining canonical network equivalence

BACKGROUND

Many technological, biological, social, and information networks fall into the broad class of 'small-world' networks: they have tightly interconnected clusters of nodes, and a shortest mean path length that is similar to a matched random graph (same number of nodes and edges). This semi-quantitative definition leads to a categorical distinction ('small/not-small') rather than a quantitative, continuous grading of networks, and can lead to uncertainty about a network's small-world status. Moreover, systems described by small-world networks are often studied using an equivalent canonical network model--the Watts-Strogatz (WS) model. However, the process of establishing an equivalent WS model is imprecise and there is a pressing need to discover ways in which this equivalence may be quantified.

METHODOLOGY/PRINCIPAL FINDINGS

We defined a precise measure of 'small-world-ness' S based on the trade off between high local clustering and short path length. A network is now deemed a 'small-world' if S>1--an assertion which may be tested statistically. We then examined the behavior of S on a large data-set of real-world systems. We found that all these systems were linked by a linear relationship between their S values and the network size n. Moreover, we show a method for assigning a unique Watts-Strogatz (WS) model to any real-world network, and show analytically that the WS models associated with our sample of networks also show linearity between S and n. Linearity between S and n is not, however, inevitable, and neither is S maximal for an arbitrary network of given size. Linearity may, however, be explained by a common limiting growth process.

CONCLUSIONS/SIGNIFICANCE

We have shown how the notion of a small-world network may be quantified. Several key properties of the metric are described and the use of WS canonical models is placed on a more secure footing.

Social network theory in the behavioural sciences: potential applications

Social network theory has made major contributions to our understanding of human social organisation but has found relatively little application in the field of animal behaviour. In this review, we identify several broad research areas where the networks approach could greatly enhance our understanding of social patterns and processes in animals. The network theory provides a quantitative framework that can be used to characterise social structure both at the level of the individual and the population. These novel quantitative variables may provide a new tool in addressing key questions in behavioural ecology particularly in relation to the evolution of social organisation and the impact of social structure on evolutionary processes. For example, network measures could be used to compare social networks of different species or populations making full use of the comparative approach. However, the networks approach can in principle go beyond identifying structural patterns and also can help with the understanding of processes within animal populations such as disease transmission and information transfer. Finally, understanding the pattern of interactions in the network (i.e. who is connected to whom) can also shed some light on the evolution of behavioural strategies.

Boolean dynamics of Kauffman models with a scale-free network

We studied the Boolean dynamics of the "quenched" Kauffman models with a directed scale-free network, comparing with that of the original directed random Kauffman networks and that of the directed exponential-fluctuation networks. We have numerically investigated the distributions of the state cycle lengths and its changes as the network size N and the average degree k of nodes increase. In the relatively small network (N approximately 150), the median, the mean value and the standard deviation grow exponentially with N in the directed scale-free and the directed exponential-fluctuation networks with k=2, where the function forms of the distributions are given as an almost exponential. We have found that for the relatively large N approximately 10(3) the growth of the median of the distribution over the attractor lengths asymptotically changes from algebraic type to exponential one as the average degree k goes to k=2. The result supports the existence of the transition at k(c)=2 derived in the annealed model.

Empirical analysis of the ship-transport network of China

Structural properties of the ship-transport network of China (STNC) are studied in the light of recent investigations of complex networks. STNC is composed of a set of routes and ports located along the sea or river. Network properties including the degree distribution, degree correlations, clustering, shortest path length, centrality, and betweenness are studied in different definitions of network topology. It is found that geographical constraint plays an important role in the network topology of STNC. We also study the traffic flow of STNC based on the weighted network representation, and demonstrate the weight distribution can be described by power-law or exponential function depending on the assumed definition of network topology. Other features related to STNC are also investigated.

Growing networks under geographical constraints

Inspired by the structure of technological weblike systems, we discuss network evolution mechanisms which give rise to topological properties found in real spatial networks. Thus, we suggest that the peculiar structure of transport and distribution networks is fundamentally determined by two factors. These are the dependence of the spatial interaction range of vertices on the vertex attractiveness (or importance within the network) and on the inhomogeneous distribution of vertices in space. We propose and analyze numerically a simple model based on these generating mechanisms which seems, for instance, to be able to reproduce known structural features of the Internet.

Enhancing robustness and immunization in geographical networks

We find that different geographical structures of networks lead to varied percolation thresholds, although these networks may have similar abstract topological structures. Thus, strategies for enhancing robustness and immunization of a geographical network are proposed. Using the generating function formalism, we obtain an explicit form of the percolation threshold qc for networks containing arbitrary order cycles. For three-cycles, the dependence of qc on the clustering coefficients is ascertained. The analysis substantiates the validity of the strategies with analytical evidence.

Geographical networks evolving with an optimal policy

In this article we propose a growing network model based on an optimal policy involving both topological and geographical measures. In this model, at each time step, a node, having randomly assigned coordinates in a 1x1 square, is added and connected to a previously existing node i, which minimizes the quantity ri2/kialpha, where ri is the geographical distance, ki the degree, and alpha a free parameter. The degree distribution obeys a power-law form when alpha=1, and an exponential form when alpha=0. When alpha is in the interval (0, 1), the network exhibits a stretched exponential distribution. We prove that the average topological distance increases in a logarithmic scale of the network size, indicating the existence of the small-world property. Furthermore, we obtain the geographical edge length distribution, the total geographical length of all edges, and the average geographical distance of the whole network. Interestingly, we found that the total edge length will sharply increase when alpha exceeds the critical value alphac=1, and the average geographical distance has an upper bound independent of the network size. All the results are obtained analytically with some reasonable approximations, which are well verified by simulations.

Modelling disease spread and control in networks: implications for plant sciences

Networks are ubiquitous in natural, technological and social systems. They are of increasing relevance for improved understanding and control of infectious diseases of plants, animals and humans, given the interconnectedness of today's world. Recent modelling work on disease development in complex networks shows: the relative rapidity of pathogen spread in scale-free compared with random networks, unless there is high local clustering; the theoretical absence of an epidemic threshold in scale-free networks of infinite size, which implies that diseases with low infection rates can spread in them, but the emergence of a threshold when realistic features are added to networks (e.g. finite size, household structure or deactivation of links); and the influence on epidemic dynamics of asymmetrical interactions. Models suggest that control of pathogens spreading in scale-free networks should focus on highly connected individuals rather than on mass random immunization. A growing number of empirical applications of network theory in human medicine and animal disease ecology confirm the potential of the approach, and suggest that network thinking could also benefit plant epidemiology and forest pathology, particularly in human-modified pathosystems linked by commercial transport of plant and disease propagules. Potential consequences for the study and management of plant and tree diseases are discussed.

Extraction and analysis of traffic and topologies of transportation networks

The knowledge of real-life traffic patterns is crucial for a good understanding and analysis of transportation systems. These data are quite rare. In this paper we propose an algorithm for extracting both the real physical topology and the network of traffic flows from timetables of public mass transportation systems. We apply this algorithm to timetables of three large transportation networks. This enables us to make a systematic comparison between three different approaches to construct a graph representation of a transportation network; the resulting graphs are fundamentally different. We also find that the real-life traffic pattern is very heterogenous, in both space and traffic flow intensities, which makes it very difficult to approximate the node load with a number of topological estimators.

Layered complex networks

Many complex networks are only a part of larger systems, where a number of coexisting topologies interact and depend on each other. We introduce a layered model to facilitate the description and analysis of such systems. As an example of its application, we study the load distribution in three transportation systems, where the lower layer is the physical infrastructure and the upper layer represents the traffic flows. This layered view allows us to capture the fundamental differences between the real load and commonly used load estimators, which explains why these estimators fail to approximate the real load.

Evolving networks by merging cliques

We propose a model for evolving networks by merging building blocks represented as complete graphs, reminiscent of modules in biological system or communities in sociology. The model shows power-law degree distributions, power-law clustering spectra, and high average clustering coefficients independent of network size. The analytical solutions indicate that a degree exponent is determined by the ratio of the number of merging nodes to that of all nodes in the blocks, demonstrating that the exponent is tunable, and are also applicable when the blocks are classical networks such as Erdös-Rényi or regular graphs. Our model becomes the same model as the Barabási-Albert model under a specific condition.

Statistical analysis of 22 public transport networks in Poland

Public transport systems in 22 Polish cities have been analyzed. The sizes of these networks range from N = 152 to 2881. Depending on the assumed definition of network topology, the degree distribution can follow a power law or can be described by an exponential function. Distributions of path lengths in all considered networks are given by asymmetric, unimodal functions. Clustering, assortativity, and betweenness are studied. All considered networks exhibit small-world behavior and are hierarchically organized. A transition between dissortative small networks N approximately < or = 500 and assortative large networks N approximately > or = 500 is observed.

Maximal planar networks with large clustering coefficient and power-law degree distribution

In this article, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called random Apollonian networks (RANs) as they can be considered as a variation of Apollonian networks. We obtain the analytic results of power-law exponent gamma=3 and clustering coefficient C= (46/3)-36 ln 3/2 approximately 0.74, which agree with the simulation results very well. We prove that the increasing tendency of average distance of RANs is a little slower than the logarithm of the number of nodes in RANs. Since most real-life networks are both scale-free and small-world networks, RANs may perform well in mimicking the reality. The RANs possess hierarchical structure as C(k) approximately k(-1) that are in accord with the observations of many real-life networks. In addition, we prove that RANs are maximal planar networks, which are of particular practicability for layout of printed circuits and so on. The percolation and epidemic spreading process are also studied and the comparisons between RANs and Barabási-Albert (BA) as well as Newman-Watts (NW) networks are shown. We find that, when the network order N (the total number of nodes) is relatively small (as N approximately 10(4)), the performance of RANs under intentional attack is not sensitive to N , while that of BA networks is much affected by N. And the diseases spread slower in RANs than BA networks in the early stage of the susceptible-infected process, indicating that the large clustering coefficient may slow the spreading velocity, especially in the outbreaks.

Subgraphs and network motifs in geometric networks

Many real-world networks describe systems in which interactions decay with the distance between nodes. Examples include systems constrained in real space such as transportation and communication networks, as well as systems constrained in abstract spaces such as multivariate biological or economic data sets and models of social networks. These networks often display network motifs: subgraphs that recur in the network much more often than in randomized networks. To understand the origin of the network motifs in these networks, it is important to study the subgraphs and network motifs that arise solely from geometric constraints. To address this, we analyze geometric network models, in which nodes are arranged on a lattice and edges are formed with a probability that decays with the distance between nodes. We present analytical solutions for the numbers of all three- and four-node subgraphs, in both directed and nondirected geometric networks. We also analyze geometric networks with arbitrary degree sequences and models with a bias for directed edges in one direction. Scaling rules for scaling of subgraph numbers with system size, lattice dimension, and interaction range are given. Several invariant measures are found, such as the ratio of feedback and feed-forward loops, which do not depend on system size, dimension, or connectivity function. We find that network motifs in many real-world networks, including social networks and neuronal networks, are not captured solely by these geometric models. This is in line with recent evidence that biological network motifs were selected as basic circuit elements with defined information-processing functions.

Properties of dense partially random graphs

We study the properties of random graphs where for each vertex a neighborhood has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbors or not, as happens in small-world graphs (SWG's). But we consider the case where the average degree of each node is of order of the size of the graph (unlike SWG's, which are sparse). This allows us to calculate the mean distance and clustering, which are qualitatively similar (although not in such a dramatic scale range) to the case of SWG's. We also obtain analytically the distribution of eigenvalues of the corresponding adjacency matrices. This distribution is discrete for large eigenvalues and continuous for small eigenvalues. The continuous part of the distribution follows a semicircle law, whose width is proportional to the "disorder" of the graph, whereas the discrete part is simply a rescaling of the spectrum of the substrate. We apply our results to the calculation of the mixing rate and the synchronizability threshold.

Complex network study of Brazilian soccer players

Although being a very popular sport in many countries, soccer has not received much attention from the scientific community. In this paper, we study soccer from a complex network point of view. First, we consider a bipartite network with two kinds of vertices or nodes: the soccer players and the clubs. Real data were gathered from the 32 editions of the Brazilian soccer championship, in a total of 13 411 soccer players and 127 clubs. We find a lot of interesting and perhaps unsuspected results. The probability that a Brazilian soccer player has worked at N clubs or played M games shows an exponential decay while the probability that he has scored G goals is power law. Now, if two soccer players who have worked at the same club at the same time are connected by an edge, then a new type of network arises (composed exclusively by soccer player nodes). Our analysis shows that for this network the degree distribution decays exponentially. We determine the exact values of the clustering coefficient, the assortativity coefficient and the average shortest path length and compare them with those of the Erdös-Rényi and configuration model. The time evolution of these quantities are calculated and the corresponding results discussed.

Navigation in a small world with local information

It is commonly known that there exist short paths between vertices in a network showing the small-world effect. Yet vertices, for example, the individuals living in society, usually are not able to find the shortest paths, due to the very serious limit of information. To study this issue theoretically, here the navigation process of launching messages toward designated targets is investigated on a variant of the one-dimensional small-world network (SWN). In the network structure considered, the probability of a shortcut falling between a pair of nodes is proportional to r(-alpha) , where r is the lattice distance between the nodes. When alpha=0 , it reduces to the SWN model with random shortcuts. The system shows the dynamic small-world effect, which is different from the well-studied static SW effect. We study the effective network diameter, the path length as a function of the lattice distance, and the dynamics. They are controlled by multiple parameters, and we use data collapse to show that the parameters are correlated. The central finding is that, in the one-dimensional network studied, the dynamic SW effect exists for 0</=alpha</=2 . For each given value of alpha in this region, the point where the dynamic SW effect arises is M L' approximately 1 , where M is the number of useful shortcuts and L' is their average reduced (effective) length.

Reinforcing the resilience of complex networks

Given a connected network, it can be augmented by applying a growing strategy (e.g., random- or preferential-attachment rules) over the previously existing structure. Another approach for augmentation, recently introduced, involves incorporating a direct edge between any two nodes which are found to be connected through at least one self-avoiding path of length L. This work investigates the resilience of random- and preferential-attachment models augmented by using the three schemes identified above. Considering random- and preferential-attachment networks, their giant cluster are identified and reinforced, then the resilience of the resulting networks with respect to highest-degree node attack is quantified through simulations. Statistical characterization of the effects of augmentations over some of the network properties is also provided. The results, which indicate that substantial reinforcement of the resilience of complex networks can be achieved by the expansions, also confirm the superior robustness of the random expansion. An important obtained result is that the initial growth scheme was found to have little effect over the possibilities of further enhancement of the network by subsequent reinforcement schemes.

Accelerated growth in outgoing links in evolving networks: deterministic versus stochastic picture

In several real-world networks such as the Internet, World Wide Web, etc., the number of links grow in time in a nonlinear fashion. We consider growing networks in which the number of outgoing links is a nonlinear function of time but new links between older nodes are forbidden. The attachments are made using a preferential attachment scheme. In the deterministic picture, the number of outgoing links m (t) at any time t is taken as N (t)(theta) where N (t) is the number of nodes present at that time. The continuum theory predicts a power-law decay of the degree distribution: P (k) proportional to k-(1-2/ (1-theta ) ), while the degree of the node introduced at time t(i) is given by k(t(i),t)=t(theta)(i) [t/t(i) ]((1+theta)/2) when the network is evolved till time t. Numerical results show a growth in the degree distribution for small k values at any nonzero theta. In the stochastic picture, m (t) is a random variable. As long as <m (t) > is independent of time, the network shows a behavior similar to the Barabási-Albert (BA) model. Different results are obtained when <m (t) > is time dependent, e.g., when m (t) follows a distribution P (m) proportional to m(-lambda). The behavior of P (k) changes significantly as lambda is varied: for lambda>3, the network has a scale-free distribution belonging to the BA class as predicted by the mean field theory; for smaller values of lambda it shows different behavior. Characteristic features of the clustering coefficients in both models have also been discussed.

Clustering properties of a generalized critical Euclidean network

Many real-world networks exhibit a scale-free feature, have a small diameter, and a high clustering tendency. We study the properties of a growing network, which has all these features, in which an incoming node is connected to its ith predecessor of degree k(i) with a link of length l using a probability proportional to k(beta)(i)l(alpha). For alpha>-0.5, the network is scale-free at beta=1 with the degree distribution P(k) proportional to k(-gamma) and gamma=3.0 as in the Barabási-Albert model (alpha=0,beta=1). We find a phase boundary in the alpha-beta plane along which the network is scale-free. Interestingly, we find a scale-free behavior even for beta>1 for alpha<-0.5, where the existence of a different universality class is indicated from the behavior of the degree distribution and the clustering coefficients. The network has a small diameter in the entire scale-free region. The clustering coefficients emulate the behavior of most real networks for increasing negative values of alpha on the phase boundary.