Prediction of Smoothed Sunspot Number Using Dynamic Relations Between the Sun and Planets

Dynamic parameters of sun and planet interaction for predicting sunspot

Statistical mechanics of ecosystem assembly

We introduce a toy model of ecosystem assembly for which we are able to map out all assembly pathways generated by external invasions. The model allows to display the whole phase space in the form of an assembly graph whose nodes are communities of species and whose directed links are transitions between them induced by invasions. We characterize the process as a finite Markov chain and prove that it exhibits a unique set of recurrent states (the endstate of the process), which is therefore resistant to invasions. This also shows that the endstate is independent on the assembly history. The model shares all features with standard assembly models reported in the literature, with the advantage that all observables can be computed in an exact manner.Comment: Accepted for publication in Physical Review Letter

Trajectories for the 1976 - 1980 Grand Tour opportunities. Volume 3 - Trajectory data for alternate Grand Tour missions

Tabulating trajectory data for alternate Grand Tour missions from earth for period 1976 to 198

Modeling the evolution of weighted networks

We present a general model for the growth of weighted networks in which the structural growth is coupled with the edges' weight dynamical evolution. The model is based on a simple weight-driven dynamics and a weights' reinforcement mechanism coupled to the local network growth. That coupling can be generalized in order to include the effect of additional randomness and non-linearities which can be present in real-world networks. The model generates weighted graphs exhibiting the statistical properties observed in several real-world systems. In particular, the model yields a non-trivial time evolution of vertices properties and scale-free behavior with exponents depending on the microscopic parameters characterizing the coupling rules. Very interestingly, the generated graphs spontaneously achieve a complex hierarchical architecture characterized by clustering and connectivity correlations varying as a function of the vertices' degree

Weighted evolving networks: coupling topology and weights dynamics

We propose a model for the growth of weighted networks that couples the establishment of new edges and vertices and the weights' dynamical evolution. The model is based on a simple weight-driven dynamics and generates networks exhibiting the statistical properties observed in several real-world systems. In particular, the model yields a non-trivial time evolution of vertices' properties and scale-free behavior for the weight, strength and degree distributions.Comment: 4 pages, 4 figure

Search in weighted complex networks

We study trade-offs presented by local search algorithms in complex networks which are heterogeneous in edge weights and node degree. We show that search based on a network measure, local betweenness centrality (LBC), utilizes the heterogeneity of both node degrees and edge weights to perform the best in scale-free weighted networks. The search based on LBC is universal and performs well in a large class of complex networks.Comment: 14 pages, 5 figures, 4 tables, minor changes, added a referenc

Quantifying the connectivity of a network: The network correlation function method

Networks are useful for describing systems of interacting objects, where the nodes represent the objects and the edges represent the interactions between them. The applications include chemical and metabolic systems, food webs as well as social networks. Lately, it was found that many of these networks display some common topological features, such as high clustering, small average path length (small world networks) and a power-law degree distribution (scale free networks). The topological features of a network are commonly related to the network's functionality. However, the topology alone does not account for the nature of the interactions in the network and their strength. Here we introduce a method for evaluating the correlations between pairs of nodes in the network. These correlations depend both on the topology and on the functionality of the network. A network with high connectivity displays strong correlations between its interacting nodes and thus features small-world functionality. We quantify the correlations between all pairs of nodes in the network, and express them as matrix elements in the correlation matrix. From this information one can plot the correlation function for the network and to extract the correlation length. The connectivity of a network is then defined as the ratio between this correlation length and the average path length of the network. Using this method we distinguish between a topological small world and a functional small world, where the latter is characterized by long range correlations and high connectivity. Clearly, networks which share the same topology, may have different connectivities, based on the nature and strength of their interactions. The method is demonstrated on metabolic networks, but can be readily generalized to other types of networks.Comment: 10 figure

Analytical solution of a model for complex food webs

We investigate numerically and analytically a recently proposed model for food webs [Nature {\bf 404}, 180 (2000)] in the limit of large web sizes and sparse interaction matrices. We obtain analytical expressions for several quantities with ecological interest, in particular the probability distributions for the number of prey and the number of predators. We find that these distributions have fast-decaying exponential and Gaussian tails, respectively. We also find that our analytical expressions are robust to changes in the details of the model.Comment: 4 pages (RevTeX). Final versio

The shape of ecological networks

We study the statistics of ecosystems with a variable number of co-evolving species. The species interact in two ways: by prey-predator relationships and by direct competition with similar kinds. The interaction coefficients change slowly through successful adaptations and speciations. We treat them as quenched random variables. These interactions determine long-term topological features of the species network, which are found to agree with those of biological systems.Comment: 4 pages, 2 figure

Extinction risk and structure of a food web model

We investigate in detail the model of a trophic web proposed by Amaral and Meyer [Phys. Rev. Lett. 82, 652 (1999)]. We focused on small-size systems that are relevant for real biological food webs and for which the fluctuations are playing an important role. We show, using Monte Carlo simulations, that such webs can be non-viable, leading to extinction of all species in small and/or weakly coupled systems. Estimations of the extinction times and survival chances are also given. We show that before the extinction the fraction of highly-connected species ("omnivores") is increasing. Viable food webs exhibit a pyramidal structure, where the density of occupied niches is higher at lower trophic levels, and moreover the occupations of adjacent levels are closely correlated. We also demonstrate that the distribution of the lengths of food chains has an exponential character and changes weakly with the parameters of the model. On the contrary, the distribution of avalanche sizes of the extinct species depends strongly on the connectedness of the web. For rather loosely connected systems we recover the power-law type of behavior with the same exponent as found in earlier studies, while for densely-connected webs the distribution is not of a power-law type.Comment: 9 pages, 15 figure