260 research outputs found
Simulating non-Markovian stochastic processes
We present a simple and general framework to simulate statistically correct
realizations of a system of non-Markovian discrete stochastic processes. We
give the exact analytical solution and a practical an efficient algorithm alike
the Gillespie algorithm for Markovian processes, with the difference that now
the occurrence rates of the events depend on the time elapsed since the event
last took place. We use our non-Markovian generalized Gillespie stochastic
simulation methodology to investigate the effects of non-exponential
inter-event time distributions in the susceptible-infected-susceptible model of
epidemic spreading. Strikingly, our results unveil the drastic effects that
very subtle differences in the modeling of non-Markovian processes have on the
global behavior of complex systems, with important implications for their
understanding and prediction. We also assess our generalized Gillespie
algorithm on a system of biochemical reactions with time delays. As compared to
other existing methods, we find that the generalized Gillespie algorithm is the
most general as it can be implemented very easily in cases, like for delays
coupled to the evolution of the system, where other algorithms do not work or
need adapted versions, less efficient in computational terms.Comment: Improvement of the algorithm, new results, and a major reorganization
of the paper thanks to our coauthors L. Lafuerza and R. Tora
Clustering in complex networks. II. Percolation properties
The percolation properties of clustered networks are analyzed in detail. In
the case of weak clustering, we present an analytical approach that allows to
find the critical threshold and the size of the giant component. Numerical
simulations confirm the accuracy of our results. In more general terms, we show
that weak clustering hinders the onset of the giant component whereas strong
clustering favors its appearance. This is a direct consequence of the
differences in the -core structure of the networks, which are found to be
totally different depending on the level of clustering. An empirical analysis
of a real social network confirms our predictions.Comment: Updated reference lis
Patterns of dominant flows in the world trade web
The large-scale organization of the world economies is exhibiting increasing levels of local heterogeneity and global interdependency. Understanding the relation between local and global features calls for analytical tools able to uncover the global emerging organization of the international trade network. Here we analyze the world network of bilateral trade imbalances and characterize its overall flux organization, unraveling local and global high-flux pathways that define the backbone of the trade system. We develop a general procedure capable to progressively filter out in a consistent and quantitative way the dominant trade channels. This procedure is completely general and can be applied to any weighted network to detect the underlying structure of transport flows. The trade fluxes properties of the world trade web determine a ranking of trade partnerships that highlights global interdependencies, providing information not accessible by simple local analysis. The present work provides new quantitative tools for a dynamical approach to the propagation of economic crise
Clustering in complex networks. I. General formalism
We develop a full theoretical approach to clustering in complex networks. A
key concept is introduced, the edge multiplicity, that measures the number of
triangles passing through an edge. This quantity extends the clustering
coefficient in that it involves the properties of two --and not just one--
vertices. The formalism is completed with the definition of a three-vertex
correlation function, which is the fundamental quantity describing the
properties of clustered networks. The formalism suggests new metrics that are
able to thoroughly characterize transitive relations. A rigorous analysis of
several real networks, which makes use of the new formalism and the new
metrics, is also provided. It is also found that clustered networks can be
classified into two main groups: the {\it weak} and the {\it strong
transitivity} classes. In the first class, edge multiplicity is small, with
triangles being disjoint. In the second class, edge multiplicity is high and so
triangles share many edges. As we shall see in the following paper, the class a
network belongs to has strong implications in its percolation properties
- …