Search

The extreme eigenvalues of adjacency matrices are important indicators on the influence of topological structures to the collective dynamical behavior of complex networks. Recent findings on the ensemble averageability of the extreme eigenvalue have further authenticated its applicability to the study of network dynamics. However, the ensemble average of extreme eigenvalue has only been solved analytically up to the second order correction. Here, we determine the ensemble average of the extreme eigenvalue and characterize its deviation across the ensemble through the discrete form of random scale-free network. Remarkably, the analytical approximation derived from the discrete form shows significant improvement over previous results, which implies a more accurate prediction of the epidemic threshold. In addition, we show that bimodal networks, which are more robust against both random and targeted removal of nodes, are more vulnerable to the spreading of diseases.

It has been shown that synchronizability of a network is determined by the local structure rather than the global properties. With the same global properties, networks may have very different synchronizability. In this paper, we numerically studied, through the spectral properties, the synchronizability of ensembles of networks with prescribed statistical properties. Given a degree sequence, it is found that the eigenvalues and eigenratios characterizing network synchronizability have well-defined distributions, and statistically, the networks with extremely poor synchronizability are rare. Moreover, we compared the synchronizability of three network ensembles that have the same nodes and average degree. Our work reveals that the synchronizability of a network can be significantly affected by the local pattern of connections, and the homogeneity of degree can greatly enhance network synchronizability for networks of a random nature.

Usually, complete synchronization (CS) is regarded as the form of synchronization proper of identical chaotic systems, while generalized synchronization (GS) extends CS in nonidentical systems. However, this generally accepted view ignores the role that the coupling plays in determining the type of synchronization. In this work, we show that by choosing appropriate coupling strategies, CS can be observed in coupled chaotic systems with parameter mismatch, and GS can also be achieved in coupled identical systems. Numerical examples are provided to demonstrate these findings. Moreover, experimental verification based on electronic circuits has been carried out to support the numerical results. Our work provides a method to obtain robust CS in synchronization-based chaos communications.

Different chaos synchronization based encryption schemes are reviewed and compared from the practical point of view. As an efficient cryptanalysis tool for chaos encryption, a proposal based on the error function attack is presented systematically and used to evaluate system security. We define a quantitative measure (quality factor) of the effective applicability of a chaos encryption scheme, which takes into account the security, the encryption speed, and the robustness against channel noise. A comparison is made of several encryption schemes and it is found that a scheme based on one-way coupled chaotic map lattices performs outstandingly well, as judged from quality factor., (Copyright 2004 American Institute of Physics.)

We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up by Newman and Leicht (2007 Proc. Natl. Acad. Sci. USA 104 9564), we develop an algorithm that is applicable to a network with any degree distribution. The partition of a network suggested by this algorithm also applies to its complementary network. In general, groups of similar components are not necessarily identical with the communities in a community network; thus partitioning a network into groups of similar components provides additional information of the network structure. The proposed algorithm can also be used for community detection when the groups and the communities overlap. By introducing a tunable parameter that controls the involved effects of the heterogeneity, we can also investigate conveniently how the group structure can be coupled with the heterogeneity characteristics. In particular, an interesting example shows a group partition can evolve into a community partition in some situations when the involved heterogeneity effects are tuned. The extension of this algorithm to weighted networks is discussed as well. [ABSTRACT FROM AUTHOR]

A parallel genetic algorithm (PGA) is proposed for the solution of two-dimensional inverse heat conduction problems involving unknown thermophysical material properties. Experimental results show that the proposed PGA is a feasible and effective optimization tool for inverse heat conduction problems. [ABSTRACT FROM AUTHOR]

Sound waves are propagating pressure fluctuations and are typically several orders of magnitude smaller than the pressure variations in the flow field that account for flow acceleration. On the other hand, these fluctuations travel at the speed of sound in the medium, not as a transported fluid quantity. Due to the above two properties, the Reynolds averaged Navier–Stokes (RANS) equations do not resolve the acoustic fluctuations. Direct numerical simulation of turbulent flow is still a prohibitively expensive tool to perform noise analysis. This paper proposes a distributed algorithm, based on the acoustic correction method, which leads to an efficient method for computational aeroacoustics and noise analysis. Software issues and advantages are discussed. Numerical experiments on a flow induced noise problem are included. [ABSTRACT FROM AUTHOR]

Abstract: A distributed algorithm is developed to solve nonlinear Black-Scholes equations in the hedging of portfolios. The algorithm is based on an approximate inverse Laplace transform and is particularly suitable for problems that do not require detailed knowledge of each intermediate time steps. [Copyright &y& Elsevier]

[p]A flexible elimination algorithm is presented and is applied to the solution of dense systems of linear equations. Properties of the algorithm are exploited in relation to panel element methods for potential flow and subsonic compressible flow. Further properties in relation to distributed computing are also discussed.[/p] [ABSTRACT FROM AUTHOR]

Sound waves are propagating pressure fluctuations and are typically several orders of magnitude smaller than the pressure variations in the flow field that account for flow acceleration. On the other hand, these fluctuations travel at the speed of sound in the medium, not as a transported fluid quantity. Due to the above two properties, the Reynolds averaged Navier-Stokes (RANS) equations do not resolve the acoustic fluctuations. Direct numerical simulation of turbulent flow is still a prohibitively expensive tool to perform noise analysis. This paper proposes the acoustic correction method, an alternative and affordable tool based on a modified defect correction concept, which leads to an efficient algorithm for computational aeroacoustics and noise analysis. [Copyright &y& Elsevier]

Abstract: Community structure is an important feature in many real-world networks. Many methods and algorithms for identifying communities have been proposed and have attracted great attention in recent years. In this paper, we present a new approach for discovering the community structure in networks. The novelty is that the algorithm uses the strength of the ties for sorting out nodes into communities. More specifically, we use the principle of weak ties hypothesis to determine to what community the node belongs. The advantages of this method are its simplicity, accuracy, and low computational cost. We demonstrate the effectiveness and efficiency of our algorithm both on real-world networks and on benchmark graphs. We also show that the distribution of link strength can give a general view of the basic structure information of graphs. [Copyright &y& Elsevier]