Scale-free networks with tunable degree distribution exponents

We propose and study a model of scale-free growing networks that gives a degree distribution dominated by a power-law behavior with a model-dependent, hence tunable, exponent. The model represents a hybrid of the growing networks based on popularity-driven and fitness-driven preferential attachments. As the network grows, a newly added node establishes $m$ new links to existing nodes with a probability $p$ based on popularity of the existing nodes and a probability $1-p$ based on fitness of the existing nodes. An explicit form of the degree distribution $P(p,k)$ is derived within a mean field approach. For reasonably large $k$, $P(p,k) \sim k^{-\gamma(p)}{\cal F}(k,p)$, where the function ${\cal F}$ is dominated by the behavior of $1/\ln(k/m)$ for small values of $p$ and becomes $k$-independent as $p \to 1$, and $\gamma(p)$ is a model-dependent exponent. The degree distribution and the exponent $\gamma(p)$ are found to be in good agreement with results obtained by extensive numerical simulations.Comment: 12 pages, 2 figures, submitted to PR

Evidence from satellite altimetry for small-scale convection in the mantle

Small scale convection can be defined as that part of the mantle circulation in which upwellings and downwellings can occur beneath the lithosphere within the interiors of plates, in contrast to the large scale flow associated with plate motions where upwellings and downwellings occur at ridges and trenches. The two scales of convection will interact so that the form of the small scale convection will depend on how it arises within the large scale flow. Observations based on GEOS-3 and SEASAT altimetry suggest that small scale convection occurs in at least two different ways

Synchronization in disordered Josephson junction arrays: Small-world connections and the Kuramoto model

We study synchronization in disordered arrays of Josephson junctions. In the first half of the paper, we consider the relation between the coupled resistively- and capacitively shunted junction (RCSJ) equations for such arrays and effective phase models of the Winfree type. We describe a multiple-time scale analysis of the RCSJ equations for a ladder array of junctions \textit{with non-negligible capacitance} in which we arrive at a second order phase model that captures well the synchronization physics of the RCSJ equations for that geometry. In the second half of the paper, motivated by recent work on small world networks, we study the effect on synchronization of random, long-range connections between pairs of junctions. We consider the effects of such shortcuts on ladder arrays, finding that the shortcuts make it easier for the array of junctions in the nonzero voltage state to synchronize. In 2D arrays we find that the additional shortcut junctions are only marginally effective at inducing synchronization of the active junctions. The differences in the effects of shortcut junctions in 1D and 2D can be partly understood in terms of an effective phase model.Comment: 31 pages, 21 figure

Scaling Invariance in Spectra of Complex Networks: A Diffusion Factorial Moment Approach

A new method called diffusion factorial moment (DFM) is used to obtain scaling features embedded in spectra of complex networks. For an Erdos-Renyi network with connecting probability $p_{ER} < \frac{1}{N}$, the scaling parameter is $\delta = 0.51$, while for $p_{ER} \ge \frac{1}{N}$ the scaling parameter deviates from it significantly. For WS small-world networks, in the special region $p_r \in [0.05,0.2]$, typical scale invariance is found. For GRN networks, in the range of $\theta\in[0.33,049]$, we have $\delta=0.6\pm 0.1$. And the value of $\delta$ oscillates around $\delta=0.6$ abruptly. In the range of $\theta\in[0.54,1]$, we have basically $\delta>0.7$. Scale invariance is one of the common features of the three kinds of networks, which can be employed as a global measurement of complex networks in a unified way.Comment: 6 pages, 8 figures. to appear in Physical Review

Clustering in Complex Directed Networks

Many empirical networks display an inherent tendency to cluster, i.e. to form circles of connected nodes. This feature is typically measured by the clustering coefficient (CC). The CC, originally introduced for binary, undirected graphs, has been recently generalized to weighted, undirected networks. Here we extend the CC to the case of (binary and weighted) directed networks and we compute its expected value for random graphs. We distinguish between CCs that count all directed triangles in the graph (independently of the direction of their edges) and CCs that only consider particular types of directed triangles (e.g., cycles). The main concepts are illustrated by employing empirical data on world-trade flows

Optimized bolted joint

A method is disclosed for joining segments of the skin of an aircraft. The ends of the skin are positioned in close proximity or abutt each other. The skin is of constant thickness throughout the joint and is sandwiched between splice plates, which taper in thickness from the last to the first bolt rows in order to reduce the stiffness of the splice plate and thereby reduce the load transfer at the location where bypass loads are the highest

Instability of scale-free networks under node-breaking avalanches

The instability introduced in a large scale-free network by the triggering of node-breaking avalanches is analyzed using the fiber-bundle model as conceptual framework. We found, by measuring the size of the giant component, the avalanche size distribution and other quantities, the existence of an abrupt transition. This test of strength for complex networks like Internet is more stringent than others recently considered like the random removal of nodes, analyzed within the framework of percolation theory. Finally, we discuss the possible implications of our results and their relevance in forecasting cascading failures in scale-free networks.Comment: 4 pages, 4 figures, final version to be published in Europhys. Let

Evolution of reference networks with aging

We study the growth of a reference network with aging of sites defined in the following way. Each new site of the network is connected to some old site with probability proportional (i) to the connectivity of the old site as in the Barab\'{a}si-Albert's model and (ii) to $\tau^{-\alpha}$, where $\tau$ is the age of the old site. We consider $\alpha$ of any sign although reasonable values are $0 \leq \alpha \leq \infty$. We find both from simulation and analytically that the network shows scaling behavior only in the region $\alpha < 1$. When $\alpha$ increases from $-\infty$ to 0, the exponent $\gamma$ of the distribution of connectivities ($P(k) \propto k^{-\gamma}$ for large $k$) grows from 2 to the value for the network without aging, i.e. to 3 for the Barab\'{a}si-Albert's model. The following increase of $\alpha$ to 1 makes $\gamma$ to grow to $\infty$. For $\alpha>1$ the distribution $P(k)$ is exponentional, and the network has a chain structure.Comment: 4 pages revtex (twocolumn, psfig), 5 figure

Random matrix analysis of complex networks

We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of adjacency matrix of various model networks, namely, random, scale-free and small-world networks. These distributions follow Gaussian orthogonal ensemble statistic of RMT. To probe long-range correlations in the eigenvalues we study spectral rigidity via $\Delta_3$ statistic of RMT as well. It follows RMT prediction of linear behavior in semi-logarithmic scale with slope being $\sim 1/\pi^2$. Random and scale-free networks follow RMT prediction for very large scale. Small-world network follows it for sufficiently large scale, but much less than the random and scale-free networks.Comment: accepted in Phys. Rev. E (replaced with the final version

SurF: an innovative framework in biosecurity and animal health surveillance evaluation

Surveillance for biosecurity hazards is being conducted by the New Zealand Competent Authority, the Ministry for Primary Industries (MPI) to support New Zealand's biosecurity system. Surveillance evaluation should be an integral part of the surveillance life cycle, as it provides a means to identify and correct problems and to sustain and enhance the existing strengths of a surveillance system. The surveillance evaluation Framework (SurF) presented here was developed to provide a generic framework within which the MPI biosecurity surveillance portfolio, and all of its components, can be consistently assessed. SurF is an innovative, cross‐sectoral effort that aims to provide a common umbrella for surveillance evaluation in the animal, plant, environment and aquatic sectors. It supports the conduct of the following four distinct components of an evaluation project: (i) motivation for the evaluation, (ii) scope of the evaluation, (iii) evaluation design and implementation and (iv) reporting and communication of evaluation outputs. Case studies, prepared by MPI subject matter experts, are included in the framework to guide users in their assessment. Three case studies were used in the development of SurF in order to assure practical utility and to confirm usability of SurF across all included sectors. It is anticipated that the structured approach and information provided by SurF will not only be of benefit to MPI but also to other New Zealand stakeholders. Although SurF was developed for internal use by MPI, it could be applied to any surveillance system in New Zealand or elsewhere