Return times of random walk on generalized random graphs

Spatiotemporal Evolution and Determinant Factors of the Intra-Regional Trade Community Structures of the Indian Ocean Region

The Indian Ocean Region (IOR) has become one of the main economic forces globally, and countries within the IOR have attempted to promote their intra-regional trade. This study investigates the spatiotemporal evolution of the community structures of the intra-regional trade and the impact of determinant factors on the formation of trade community structures of the IOR from 1996 to 2017 using the methods of social network analysis. Trade communities are groups of countries with measurably denser intra-trade ties but with extra-trade ties that are measurably sparser among different communities. The results show that the extent of trade integration and the trade community structures of the IOR changed from strengthening between 1996 and 2014 to weakening between 2015 and 2017. The largest explanatory power of the formation of the IOR trade community structures was the IOR countries’ economic size, indicating that market remained the strongest driver. The second-largest explanatory power was geographical proximity, suggesting that countries within the IOR engaged in intra-regional trade still tended to select geographically proximate trading partners. The third- and the fourth-largest were common civilization and regional organizational memberships, respectively. This indicates that sharing a common civilization and constructing intra-regional institutional arrangements (especially open trade policies) helped the countries within the IOR strengthen their trade communities.

Analysis of fluctuations in the first return times of random walks on regular branched networks

The first return time (FRT) is the time it takes a random walker to first return to its original site, and the global first passage time (GFPT) is the first passage time for a random walker to move from a randomly selected site to a given site. We find that in finite networks, the variance of FRT, Var(FRT), can be expressed as Var(FRT) = 2⟨FRT⟩⟨GFPT⟩ - ⟨FRT⟩² - ⟨FRT⟩, where ⟨·⟩ is the mean of the random variable. Therefore a method of calculating the variance of FRT on general finite networks is presented. We then calculate Var(FRT) and analyze the fluctuation of FRT on regular branched networks (i.e., Cayley tree) by using Var(FRT) and its variant as the metric. We find that the results differ from those in such other networks as Sierpinski gaskets, Vicsek fractals, T-graphs, pseudofractal scale-free webs, (u, v) flowers, and fractal and non-fractal scale-free trees.

The noisy voter model on complex networks

We propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for uncorrelated networks, allowing to deal with the network structure as parametric heterogeneity. As an illustration, we study the noisy voter model, a modification of the original voter model including random changes of state. The proposed method is able to unfold the dependence of the model not only on the mean degree (the mean-field prediction) but also on more complex averages over the degree distribution. In particular, we find that the degree heterogeneity--variance of the underlying degree distribution--has a strong influence on the location of the critical point of a noise-induced, finite-size transition occurring in the model, on the local ordering of the system, and on the functional form of its temporal correlations. Finally, we show how this latter point opens the possibility of inferring the degree heterogeneity of the underlying network by observing only the aggregate behavior of the system as a whole, an issue of interest for systems where only macroscopic, population level variables can be measured.

Topological effects on dynamics in complex pulse-coupled networks of integrate-and-fire type

For a class of integrate-and-fire, pulse-coupled networks with complex topology, we study the dependence of the pulse rate on the underlying architectural connectivity statistics. We derive the distribution of the pulse rate from this dependence and determine when the underlying scale-free architectural connectivity gives rise to a scale-free pulse-rate distribution. We identify the scaling of the pairwise coupling between the dynamical units in this network class that keeps their pulse rates bounded in the infinite-network limit. In the process, we determine the connectivity statistics for a specific scale-free network grown by preferential attachment.

Spectral dimensions of hierarchical scale-free networks with weighted shortcuts

Spectral dimensions have been widely used to understand transport properties on regular and fractal lattices. However, they have received little attention with regard to complex networks such as scale-free and small-world networks. Here, we study the spectral dimension and the return-to-origin probability of random walks on hierarchical scale-free networks, which can be either fractal or nonfractal depending on the weight of the shortcuts. Applying the renormalization-group (RG) approach to a Gaussian model, we obtain the exact spectral dimension. While the spectral dimension varies between 1 and 2 for the fractal case, it remains at 2, independent of the variation in the network structure, for the nonfractal case. The crossover behavior between the two cases is studied by carrying out the RG flow analysis. The analytical results are confirmed by simulation results and their implications for the architecture of complex systems are discussed.

Clustering algorithm for determining community structure in large networks

We propose an algorithm to find the community structure in complex networks based on the combination of spectral analysis and modularity optimization. The clustering produced by our algorithm is as accurate as the best algorithms on the literature of modularity optimization; however, the main asset of the algorithm is its efficiency. The best match for our algorithm is Newman's fast algorithm, which is the reference algorithm for clustering in large networks due to its efficiency. When both algorithms are compared, our algorithm outperforms the fast algorithm both in efficiency and accuracy of the clustering, in terms of modularity. Thus, the results suggest that the proposed algorithm is a good choice to analyze the community structure of medium and large networks in the range of tens and hundreds of thousand vertices.

Extremal dynamics on complex networks: analytic solutions

The Bak-Sneppen model displaying punctuated equilibria in biological evolution is studied on random complex networks. By using the rate equation and the random walk approaches, we obtain the analytic solution of the fitness threshold xc to be 1/((k)f+1), where (k)f=(k2)/(k) (=(k)) in the quenched (annealed) updating case, where kn is the nth moment of the degree distribution. Thus, the threshold is zero (finite) for the degree exponent gamma<3 (gamma>3) for the quenched case in the thermodynamic limit. The theoretical value xc fits well to the numerical simulation data in the annealed case only. Avalanche size, defined as the duration of successive mutations below the threshold, exhibits a critical behavior as its distribution follows a power law, Pa(s) approximately s(-3/2).

Fermi-Dirac statistics and traffic in complex networks

We propose an idealized model for traffic in a network, in which many particles move randomly from node to node, following the network's links, and it is assumed that at most one particle can occupy any given node. This is intended to mimic the finite forwarding capacity of nodes in communication networks, thereby allowing the possibility of congestion and jamming phenomena. We show that the particles behave like free fermions, with appropriately defined energy-level structure and temperature. The statistical properties of this system are thus given by the corresponding Fermi-Dirac distribution. We use this to obtain analytical expressions for dynamical quantities of interest, such as the mean occupation of each node and the transport efficiency, for different network topologies and particle densities. We show that the subnetwork of free nodes always fragments into small isolated clusters for a sufficiently large number of particles, implying a communication breakdown at some density for all network topologies. These results are compared to direct simulations.

Voter model on heterogeneous graphs

We study the voter model on heterogeneous graphs. We exploit the nonconservation of the magnetization to characterize how consensus is reached. For a network of N nodes with an arbitrary but uncorrelated degree distribution, the mean time to reach consensus T(N) scales as Nmu(2)1/mu(2), where mu(k) is the kth moment of the degree distribution. For a power-law degree distribution n(k) approximately k(-nu), T(N) thus scales as N for nu > 3, as N/ln(N for nu = 3, as N((2nu-4)/(nu-1)) for 2 < nu < 3, as (lnN)2 for nu = 2, and as omicron(1) for nu < 2. These results agree with simulation data for networks with both uncorrelated and correlated node degrees.