PubMed Health⌕ Search

Biomedical subjects

Alexei Vázquez

Publications and source records attributed to Alexei Vázquez.

11 recordsLinked to original sources

Modeling bursts and heavy tails in human dynamics.

The dynamics of many social, technological and economic phenomena are driven by individual human actions, turning the quantitative understanding of human behavior into a central question of modern science. Current models of human dynamics, used from risk assessment to communications, assume that human actions are randomly distributed in time and thus well approximated by Poisson processes. Here we provide direct evidence that for five human activity patterns, such as email and letter based communications, web browsing, library visits and stock trading, the timing of individual human actions follow non-Poisson statistics, characterized by bursts of rapidly occurring events separated by long periods of inactivity. We show that the bursty nature of human behavior is a consequence of a decision based queuing process: when individuals execute tasks based on some perceived priority, the timing of the tasks will be heavy tailed, most tasks being rapidly executed, while a few experiencing very long waiting times. In contrast, priority blind execution is well approximated by uniform interevent statistics. We discuss two queuing models that capture human activity. The first model assumes that there are no limitations on the number of tasks an individual can handle at any time, predicting that the waiting time of the individual tasks follow a heavy tailed distribution P(tau(w)) approximately tau(w)(-alpha) with alpha=3/2. The second model imposes limitations on the queue length, resulting in a heavy tailed waiting time distribution characterized by alpha=1. We provide empirical evidence supporting the relevance of these two models to human activity patterns, showing that while emails, web browsing and library visitation display alpha=1, the surface mail based communication belongs to the alpha=3/2 universality class. Finally, we discuss possible extension of the proposed queuing models and outline some future challenges in exploring the statistical mechanics of human dynamics.

Journal Article↗

Exact results for the Barabási model of human dynamics.

Human activity patterns display a bursty dynamics with interevent times following a heavy tailed distribution. This behavior has been recently shown to be rooted in the fact that humans assign their active tasks different priorities, a process that can be modeled as a priority queueing system [A.-L. Barabási, Nature (London) 435, 207 (2005)]. In this Letter we obtain exact results for the Barabási model with two tasks, calculating the priority and waiting time distribution of active tasks. We demonstrate that the model has a singular behavior in the extremal dynamics limit, when the highest priority task is selected first. We find that independently of the selection protocol, the average waiting time is smaller or equal to the number of active tasks, and discuss the asymptotic behavior of the waiting time distribution. These results have important implications for understanding complex systems with extremal dynamics.

Activity Cycles↗

Network clustering coefficient without degree-correlation biases.

The clustering coefficient quantifies how well connected are the neighbors of a vertex in a graph. In real networks it decreases with the vertex degree, which has been taken as a signature of the network hierarchical structure. Here we show that this signature of hierarchical structure is a consequence of degree-correlation biases in the clustering coefficient definition. We introduce a definition in which the degree-correlation biases are filtered out, and provide evidence that in real networks the clustering coefficient is constant or decays logarithmically with vertex degree.

Journal Article↗

Statistical theory of Internet exploration.

The general methodology used to construct Internet maps consists in merging all the discovered paths obtained by sending data packets from a set of active computers to a set of destination hosts, obtaining a graphlike representation of the network. This technique, sometimes referred to as Internet tomography, spurs the issue concerning the statistical reliability of such empirical maps. We tackle this problem by modeling the network sampling process on synthetic graphs and by using a mean-field approximation to obtain expressions for the probability of edge and vertex detection in the sampled graph. This allows a general understanding of the origin of possible sampling biases. In particular, we find a direct dependence of the map statistical accuracy upon the topological properties (in particular, the betweenness centrality property) of the underlying network. In this framework, it appears that statistically heterogeneous network topologies are captured better than the homogeneous ones during the mapping process. Finally, the analytical discussion is complemented with a thorough numerical investigation of simulated mapping strategies in network models with varying topological properties.

Journal Article↗

Distance-d covering problems in scale-free networks with degree correlations.

A number of problems in communication systems demand the distributed allocation of network resources in order to provide better services, sampling, and distribution methods. The solution to these issues is becoming more challenging due to the increasing size and complexity of communication networks. We report here on a heuristic method to find near-optimal solutions to the covering problem in real communication networks, demonstrating that whether a centralized or a distributed design is to be used relies upon the degree correlations between connected vertices. We also show that the general belief that by targeting the hubs one can efficiently solve most problems on networks with a power-law degree distribution is not valid for assortative networks.

Journal Article↗

Inhomogeneous evolution of subgraphs and cycles in complex networks.

Subgraphs and cycles are often used to characterize the local properties of complex networks. Here we show that the subgraph structure of real networks is highly time dependent: as the network grows, the density of some subgraphs remains unchanged, while the density of others increase at a rate that is determined by the network's degree distribution and clustering properties. This inhomogeneous evolution process, supported by direct measurements on several real networks, leads to systematic shifts in the overall subgraph spectrum and to an inevitable overrepresentation of some subgraphs and cycles.

Journal Article↗

Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations.

The linear preferential attachment hypothesis has been shown to be quite successful in explaining the existence of networks with power-law degree distributions. It is then quite important to determine if this mechanism is the consequence of a general principle based on local rules. In this work it is claimed that an effective linear preferential attachment is the natural outcome of growing network models based on local rules. It is also shown that the local models offer an explanation for other properties like the clustering hierarchy and degree correlations recently observed in complex networks. These conclusions are based on both analytical and numerical results for different local rules, including some models already proposed in the literature.

Journal Article↗

Topology and correlations in structured scale-free networks.

We study a recently introduced class of scale-free networks showing a high clustering coefficient and nontrivial connectivity correlations. We find that the connectivity probability distribution strongly depends on the fine details of the model. We solve exactly the case of low average connectivity, providing also exact expressions for the clustering and degree correlation functions. The model also exhibits a lack of small-world properties in the whole parameter range. We discuss the physical properties of these networks in the light of the present detailed analysis.

Journal Article↗

Computational complexity arising from degree correlations in networks.

We apply a Bethe-Peierls approach to statistical-mechanics models defined on random networks of arbitrary degree distribution and arbitrary correlations between the degrees of neighboring vertices. Using the nondeterministic polynomial time hard optimization problem of finding minimal vertex covers on these graphs, we show that such correlations may lead to a qualitatively different solution structure as compared to uncorrelated networks. This results in a higher complexity of the network in a computational sense: Simple heuristic algorithms fail to find a minimal vertex cover in the highly correlated case, whereas uncorrelated networks seem to be simple from the point of view of combinatorial optimization.

Journal Article↗

Resilience to damage of graphs with degree correlations.

The existence or nonexistence of a percolation threshold on power law correlated graphs is a fundamental question for which a general criterion is lacking. In this work we investigate the problems of site and bond percolation on graphs with degree correlations and their connection with spreading phenomena. We obtain some general expressions that allow the computation of the transition thresholds or their bounds. Using these results we study the effects of assortative and disassortative correlations on the resilience to damage of networks.

Journal Article↗

Large-scale topological and dynamical properties of the Internet.

We study the large-scale topological and dynamical properties of real Internet maps at the autonomous system level, collected in a 3-yr time interval. We find that the connectivity structure of the Internet presents statistical distributions settled in a well-defined stationary state. The large-scale properties are characterized by a scale-free topology consistent with previous observations. Correlation functions and clustering coefficients exhibit a remarkable structure due to the underlying hierarchical organization of the Internet. The study of the Internet time evolution shows a growth dynamics with aging features typical of recently proposed growing network models. We compare the properties of growing network models with the present real Internet data analysis.

Journal Article↗