Boulder, CO, United States
Boulder, CO, United States
SEARCH FILTERS
Time filter
Source Type

Sanz J.,University of Zaragoza | Xia C.-Y.,University of Zaragoza | Xia C.-Y.,Tianjin University of Technology | Meloni S.,University of Zaragoza | And 2 more authors.
Physical Review X | Year: 2014

Current modeling of infectious diseases allows for the study of complex and realistic scenarios that go from the population to the individual level of description. However, most epidemic models assume that the spreading process takes place on a single level (be it a single population, a metapopulation system, or a network of contacts). In particular, interdependent contagion phenomena can be addressed only if we go beyond the scheme-one pathogen-one network. In this paper, we propose a framework that allows us to describe the spreading dynamics of two concurrent diseases. Specifically, we characterize analytically the epidemic thresholds of the two diseases for different scenarios and compute the temporal evolution characterizing the unfolding dynamics. Results show that there are regions of the parameter space in which the onset of a disease's outbreak is conditioned to the prevalence levels of the other disease. Moreover, we show, for the susceptible-infected-susceptible scheme, that under certain circumstances, finite and not vanishing epidemic thresholds are found even at the limit for scale-free networks. For the susceptibleinfected-removed scenario, the phenomenology is richer and additional interdependencies show up. We also find that the secondary thresholds for the susceptible-infected-susceptible and susceptibleinfected-removed models are different, which results directly from the interaction between both diseases. Our work thus solves an important problem and paves the way toward a more comprehensive description of the dynamics of interacting diseases.


Perc M.,University of Maribor | Gomez-Gardenes J.,University of Zaragoza | Szolnoki A.,Hungarian Academy of Sciences | Floria L.M.,University of Zaragoza | And 2 more authors.
Journal of the Royal Society Interface | Year: 2013

Interactions among living organisms, from bacteria colonies to human societies, are inherently more complex than interactions among particles and non-living matter. Group interactions are a particularly important and widespread class, representative of which is the public goods game. In addition, methods of statistical physics have proved valuable for studying pattern formation, equilibrium selection and self-organization in evolutionary games. Here, we review recent advances in the study of evolutionary dynamics of group interactions on top of structured populations, including lattices, complex networks and coevolutionary models. We also compare these results with those obtained on well-mixed populations. The review particularly highlights that the study of the dynamics of group interactions, like several other important equilibrium and non-equilibrium dynamical processes in biological, economical and social sciences, benefits from the synergy between statistical physics, network science and evolutionary game theory. © 2013 The Authors.


De Domenico M.,Rovira i Virgili University | Sole-Ribalta A.,Rovira i Virgili University | Cozzo E.,University of Zaragoza | Kivela M.,Oxford Centre for Industrial and Applied Mathematics | And 5 more authors.
Physical Review X | Year: 2014

A network representation is useful for describing the structure of a large variety of complex systems. However, most real and engineered systems have multiple subsystems and layers of connectivity, and the data produced by such systems are very rich. Achieving a deep understanding of such systems necessitates generalizing "traditional"network theory, and the newfound deluge of data now makes it possible to test increasingly general frameworks for the study of networks. In particular, although adjacency matrices are useful to describe traditional single-layer networks, such a representation is insufficient for the analysis and description of multiplex and time-dependent networks. One must therefore develop a more general mathematical framework to cope with the challenges posed by multilayer complex systems. In this paper, we introduce a tensorial framework to study multilayer networks, and we discuss the generalization of several important network descriptors and dynamical processes-including degree centrality, clustering coefficients, eigenvector centrality, modularity, von Neumann entropy, and diffusion-for this framework. We examine the impact of different choices in constructing these generalizations, and we illustrate how to obtain known results for the special cases of single-layer and multiplex networks. Our tensorial approach will be helpful for tackling pressing problems in multilayer complex systems, such as inferring who is influencing whom (and by which media) in multichannel social networks and developing routing techniques for multimodal transportation systems.


Lancichinetti A.,Lagrange Systems | Lancichinetti A.,Polytechnic University of Turin | Fortunato S.,Lagrange Systems | Fortunato S.,Aalto University
Physical Review E - Statistical, Nonlinear, and Soft Matter Physics | Year: 2011

Modularity maximization is the most popular technique for the detection of community structure in graphs. The resolution limit of the method is supposedly solvable with the introduction of modified versions of the measure, with tunable resolution parameters. We show that multiresolution modularity suffers from two opposite coexisting problems: the tendency to merge small subgraphs, which dominates when the resolution is low; the tendency to split large subgraphs, which dominates when the resolution is high. In benchmark networks with heterogeneous distributions of cluster sizes, the simultaneous elimination of both biases is not possible and multiresolution modularity is not capable to recover the planted community structure, not even when it is pronounced and easily detectable by other methods, for any value of the resolution parameter. This holds for other multiresolution techniques and it is likely to be a general problem of methods based on global optimization. © 2011 American Physical Society.


Lancichinetti A.,Lagrange Systems | Saramaki J.,Aalto University | Kivela M.,Aalto University | Fortunato S.,Lagrange Systems
PLoS ONE | Year: 2010

Background: Community structure is one of the key properties of complex networks and plays a crucial role in their topology and function. While an impressive amount of work has been done on the issue of community detection, very little attention has been so far devoted to the investigation of communities in real networks.&Methodology/Principal Findings:We present a systematic empirical analysis of the statistical properties of communities in large information, communication, technological, biological, and social networks. We find that the mesoscopic organization of networks of the same category is remarkably similar. This is reflected in several characteristics of community structure, which can be used as ''fingerprints'' of specific network categories. While community size distributions are always broad, certain categories of networks consist mainly of tree-like communities, while others have denser modules. Average path lengths within communities initially grow logarithmically with community size, but the growth saturates or slows down for communities larger than a characteristic size. This behaviour is related to the presence of hubs within communities, whose roles differ across categories. Also the community embeddedness of nodes, measured in terms of the fraction of links within their communities, has a characteristic distribution for each category.&Conclusions/Significance:Our findings, verified by the use of two fundamentally different community detection methods, allow for a classification of real networks and pave the way to a realistic modelling of networks' evolution. © 2010 Lancichinetti et al.


Eom Y.-H.,Lagrange Systems | Fortunato S.,Lagrange Systems
PLoS ONE | Year: 2011

Citation distributions are crucial for the analysis and modeling of the activity of scientists. We investigated bibliometric data of papers published in journals of the American Physical Society, searching for the type of function which best describes the observed citation distributions. We used the goodness of fit with Kolmogorov-Smirnov statistics for three classes of functions: log-normal, simple power law and shifted power law. The shifted power law turns out to be the most reliable hypothesis for all citation networks we derived, which correspond to different time spans. We find that citation dynamics is characterized by bursts, usually occurring within a few years since publication of a paper, and the burst size spans several orders of magnitude. We also investigated the microscopic mechanisms for the evolution of citation networks, by proposing a linear preferential attachment with time dependent initial attractiveness. The model successfully reproduces the empirical citation distributions and accounts for the presence of citation bursts as well. © 2011 Eom, Fortunato.


Fortunato S.,Lagrange Systems
Physics Reports | Year: 2010

The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i.e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e.g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks. © 2009 Elsevier B.V.


Patent
Lagrange Systems | Date: 2013-06-03

The disclosure is directed to routing service requests over a network (50). Service requests may be routed over a network (50) based upon deriving optimized weights for each of a plurality of service providers (130) within a service provider set (135), receiving a plurality of service requests at a broker (110) within the network (50), and routing each of the plurality of service requests from the broker (110) to the plurality of service providers (130) on the network (50). In some implementations, the optimized weights for each of the plurality of service providers (130) may be derived using a non-linear function. In some implementations, the optimized weights for the plurality of service providers (130) associated with a broker (110) may collectively define a weighted distribution. The plurality of service requests may be routed by a broker (110) using its corresponding weighted distribution.


News Article | January 12, 2014
Site: feld.com

I’ve had continual performance problems with Feld Thoughts over the past few years. Yesterday, we moved the site to Lagrange Systems in an effort to meaningfully improve things. How’s it doing? And, more importantly, what’s your favorite high performance, high availability WordPress configuration?

Loading Lagrange Systems collaborators
Loading Lagrange Systems collaborators