This article discusses the question of how elasticity of the system is intertwined with external stochastic disturbances. The speed at which a displaced system returns to its equilibrium is a measure of density depend...This article discusses the question of how elasticity of the system is intertwined with external stochastic disturbances. The speed at which a displaced system returns to its equilibrium is a measure of density dependence in population dynamics. Population dynamics in random environments, linearized around the equilibrium point, can be represented by a Langevin equation, where populations fluctuate under locally stable (not periodic or chaotic) dynamics. I consider a Langevin model in discrete time, driven by time-correlated random forces, and examine uncertainty in locating the population equilibrium. There exists a time scale such that for times shorter than this scale the dynamics can be approximately described by a random walk;it is difficult to know whether the system is heading toward the equilibrium point. Density dependence is a concept that emerges from a proper coarse-graining procedure applied for time-series analysis of population data. The analysis is illustrated using time-series data from fisheries in the North Atlantic, where fish populations are buffeted by stochastic harvesting in a random environment.展开更多
Coarse graining of complex networks is an important method to study large-scale complex networks, and is also in the focus of network science today. This paper tries to develop a new coarse-graining method for complex...Coarse graining of complex networks is an important method to study large-scale complex networks, and is also in the focus of network science today. This paper tries to develop a new coarse-graining method for complex networks, which is based on the node similarity index. From the information structure of the network node similarity, the coarse-grained network is extracted by defining the local similarity and the global similarity index of nodes. A large number of simulation experiments show that the proposed method can effectively reduce the size of the network, while maintaining some statistical properties of the original network to some extent. Moreover, the proposed method has low computational complexity and allows people to freely choose the size of the reduced networks.展开更多
文摘This article discusses the question of how elasticity of the system is intertwined with external stochastic disturbances. The speed at which a displaced system returns to its equilibrium is a measure of density dependence in population dynamics. Population dynamics in random environments, linearized around the equilibrium point, can be represented by a Langevin equation, where populations fluctuate under locally stable (not periodic or chaotic) dynamics. I consider a Langevin model in discrete time, driven by time-correlated random forces, and examine uncertainty in locating the population equilibrium. There exists a time scale such that for times shorter than this scale the dynamics can be approximately described by a random walk;it is difficult to know whether the system is heading toward the equilibrium point. Density dependence is a concept that emerges from a proper coarse-graining procedure applied for time-series analysis of population data. The analysis is illustrated using time-series data from fisheries in the North Atlantic, where fish populations are buffeted by stochastic harvesting in a random environment.
文摘Coarse graining of complex networks is an important method to study large-scale complex networks, and is also in the focus of network science today. This paper tries to develop a new coarse-graining method for complex networks, which is based on the node similarity index. From the information structure of the network node similarity, the coarse-grained network is extracted by defining the local similarity and the global similarity index of nodes. A large number of simulation experiments show that the proposed method can effectively reduce the size of the network, while maintaining some statistical properties of the original network to some extent. Moreover, the proposed method has low computational complexity and allows people to freely choose the size of the reduced networks.
