Network reconstruction is a fundamental problem for understanding many complex systems with unknown interaction structures. In many complex systems, there are indirect interactions between two individuals without immediate connection but with common neighbors. Despite recent advances in network reconstruction, we continue to lack an approach for reconstructing complex networks with indirect interactions. Here we introduce a two-step strategy to resolve the reconstruction problem, where in the first step, we recover both direct and indirect interactions by employing the Lasso to solve a sparse signal reconstruction problem, and in the second step, we use matrix transformation and optimization to distinguish between direct and indirect interactions. The network structure corresponding to direct interactions can be fully uncovered. We exploit the public goods game occurring on complex networks as a paradigm for characterizing indirect interactions and test our reconstruction approach. We find that high reconstruction accuracy can be achieved for both homogeneous and heterogeneous networks, and a number of empirical networks in spite of insufficient data measurement contaminated by noise. Although a general framework for reconstructing complex networks with arbitrary types of indirect interactions is yet lacking, our approach opens new routes to separate direct and indirect interactions in a representative complex system.

Online social networks have become increasingly ubiquitous and understanding their structural, dynamical, and scaling properties not only is of fundamental interest but also has a broad range of applications. Such networks can be extremely dynamic, generated almost instantaneously by, for example, breaking-news items. We investigate a common class of online social networks, the user-user retweeting networks, by analyzing the empirical data collected from Sina Weibo (a massive twitter-like microblogging social network in China) with respect to the topic of the 2011 Japan earthquake. We uncover a number of algebraic scaling relations governing the growth and structure of the network and develop a probabilistic model that captures the basic dynamical features of the system. The model is capable of reproducing all the empirical results. Our analysis not only reveals the basic mechanisms underlying the dynamics of the retweeting networks, but also provides general insights into the control of information spreading on such networks.

Our ability to uncover complex network structure and dynamics from data is fundamental to understanding and controlling collective dynamics in complex systems. Despite recent progress in this area, reconstructing networks with stochastic dynamical processes from limited time series remains to be an outstanding problem. Here we develop a framework based on compressed sensing to reconstruct complex networks on which stochastic spreading dynamics take place. We apply the methodology to a large number of model and real networks, finding that a full reconstruction of inhomogeneous interactions can be achieved from small amounts of polarized (binary) data, a virtue of compressed sensing. Further, we demonstrate that a hidden source that triggers the spreading process but is externally inaccessible can be ascertained and located with high confidence in the absence of direct routes of propagation from it. Our approach thus establishes a paradigm for tracing and controlling epidemic invasion and information diffusion in complex networked systems.

Most previous works on complete synchronization of chaotic oscillators focused on the one-channel interaction scheme where the oscillators are coupled through only one variable or a symmetric set of variables. Using the standard framework of master-stability function (MSF), we investigate the emergence of complex synchronization behaviors under all possible configurations of two-channel coupling, which include, for example, all possible cross coupling schemes among the dynamical variables. Utilizing the classic Rössler and Lorenz oscillators, we find a rich variety of synchronization phenomena not present in any previously extensively studied, single-channel coupling configurations. For example, in many cases two coupling channels can enhance or even generate synchronization where there is only weak or no synchronization under only one coupling channel, which has been verified in a coupled neuron system. There are also cases where the oscillators are originally synchronized under one coupling channel, but an additional synchronizable coupling channel can, however, destroy synchronization. Direct numerical simulations of actual synchronization dynamics verify the MSF-based predictions. Our extensive computation and heuristic analysis provide an atlas for synchronization of chaotic oscillators coupled through two channels, which can be used as a systematic reference to facilitate further research in this area.

We discuss a method of constructing solutions of the initial value problem for diffusion-type equations in terms of solutions of certain Riccati and Ermakov-type systems. A nonautonomous Burgers-type equation is also considered. Examples include, but are not limited to the Fokker-Planck equation in physics, the Black-Scholes equation and the Hull-White model in finance.