PubMed Health⌕ Search

Biomedical subjects

Vito Latora

Publications and source records attributed to Vito Latora.

11 recordsLinked to original sources

Structural properties of planar graphs of urban street patterns.

Recent theoretical and empirical studies have focused on the structural properties of complex relational networks in social, biological, and technological systems. Here we study the basic properties of twenty 1-square-mile samples of street patterns of different world cities. Samples are turned into spatial valued graphs. In such graphs, the nodes are embedded in the two-dimensional plane and represent street intersections, the edges represent streets, and the edge values are equal to the street lengths. We evaluate the local properties of the graphs by measuring the meshedness coefficient and counting short cycles (of three, four, and five edges), and the global properties by measuring global efficiency and cost. We also consider, as extreme cases, minimal spanning trees (MST) and greedy triangulations (GT) induced by the same spatial distribution of nodes. The measures found in the real and the artificial networks are then compared. Surprisingly, cities of the same class, e.g., grid-iron or medieval, exhibit roughly similar properties. The correlation between a priori known classes and statistical properties is illustrated in a plot of relative efficiency vs cost.

Journal Article↗

Centrality measures in spatial networks of urban streets.

We study centrality in urban street patterns of different world cities represented as networks in geographical space. The results indicate that a spatial analysis based on a set of four centrality indices allows an extended visualization and characterization of the city structure. A hierarchical clustering analysis based on the distributions of centrality has a certain capacity to distinguish different classes of cities. In particular, self-organized cities exhibit scale-free properties similar to those found in nonspatial networks, while planned cities do not.

Journal Article↗

Network of sexual contacts and sexually transmitted HIV infection in Burkina Faso.

Two thirds of the people who have been infected by human immunodeficiency virus (HIV) in the world live in Sub-Saharan African countries. The results of a study measuring the degree distribution of the network of sexual contacts in Burkina Faso are described. Such a network is responsible for the spread of sexually transmitted diseases, and in particular of HIV. It has been found that the number of different sexual partners reported by males is a power law distribution with an exponent gamma = 2.9 (0.1). This is consistent with the degree distribution of scale-free networks. On the other hand, the females can be divided into two groups: the prostitutes with an average of 400 different partners per year, and females with a stable partner, having a rapidly decreasing degree distribution. Such a result may have important implications on the control of sexually transmitted diseases and in particular of HIV. Since scale-free networks have no epidemic threshold, a campaign based on prevention and anti-viral treatment of few highly connected nodes can be more successful than any policy based on enlarged but random distribution of the available anti-viral treatments.

Adolescent↗

Centrality in networks of urban streets.

Centrality has revealed crucial for understanding the structural properties of complex relational networks. Centrality is also relevant for various spatial factors affecting human life and behaviors in cities. Here, we present a comprehensive study of centrality distributions over geographic networks of urban streets. Five different measures of centrality, namely degree, closeness, betweenness, straightness and information, are compared over 18 1-square-mile samples of different world cities. Samples are represented by primal geographic graphs, i.e., valued graphs defined by metric rather than topologic distance where intersections are turned into nodes and streets into edges. The spatial behavior of centrality indices over the networks is investigated graphically by means of color-coded maps. The results indicate that a spatial analysis, that we term multiple centrality assessment, grounded not on a single but on a set of different centrality indices, allows an extended comprehension of the city structure, nicely capturing the skeleton of most central routes and subareas that so much impacts on spatial cognition and on collective dynamical behaviors. Statistically, closeness, straightness and betweenness turn out to follow similar functional distribution in all cases, despite the extreme diversity of the considered cities. Conversely, information is found to be exponential in planned cities and to follow a power-law scaling in self-organized cities. Hierarchical clustering analysis, based either on the Gini coefficients of the centrality distributions, or on the correlation between different centrality measures, is able to characterize classes of cities.

Journal Article↗

Vulnerability and protection of infrastructure networks.

Infrastructure systems are a key ingredient of modern society. We discuss a general method to find the critical components of an infrastructure network, i.e., the nodes and the links fundamental to the perfect functioning of the network. Such nodes, and not the most connected ones, are the targets to protect from terrorist attacks. The method, used as an improvement analysis, can also help to better shape a planned expansion of the network.

Journal Article↗

Method to find community structures based on information centrality.

Community structures are an important feature of many social, biological, and technological networks. Here we study a variation on the method for detecting such communities proposed by Girvan and Newman and based on the idea of using centrality measures to define the community boundaries [M. Girvan and M. E. J. Newman, Proc. Natl. Acad. Sci. U.S.A. 99, 7821 (2002)]. We develop an algorithm of hierarchical clustering that consists in finding and removing iteratively the edge with the highest information centrality. We test the algorithm on computer generated and real-world networks whose community structure is already known or has been studied by means of other methods. We show that our algorithm, although it runs to completion in a time O(n4) , is very effective especially when the communities are very mixed and hardly detectable by the other methods.

Algorithms↗

Glassy phase in the Hamiltonian mean-field model.

We study the relaxation dynamics of a Hamiltonian system of N fully coupled XY spins. The thermodynamics of the system predicts a ferromagnetic and a paramagnetic phase. Starting from out-of-equilibrium initial conditions, the dynamics at constant energy drives the system into quasistationary states (QSSs) characterized by dynamical frustration. We introduce the spin polarization as an order parameter which allows us to interpret the dynamically generated QSS regime as a glassy phase of the model.

Journal Article↗

Model for cascading failures in complex networks.

Large but rare cascades triggered by small initial shocks are present in most of the infrastructure networks. Here we present a simple model for cascading failures based on the dynamical redistribution of the flow on the network. We show that the breakdown of a single node is sufficient to collapse the efficiency of the entire system if the node is among the ones with largest load. This is particularly important for real-world networks with a highly hetereogeneous distribution of loads as the Internet and electrical power grids.

Journal Article↗

Power-law time distribution of large earthquakes.

We study the statistical properties of time distribution of seismicity in California by means of a new method of analysis, the diffusion entropy. We find that the distribution of time intervals between a large earthquake (the main shock of a given seismic sequence) and the next one does not obey Poisson statistics, as assumed by the current models. We prove that this distribution is an inverse power law with an exponent mu=2.06+/-0.01. We propose the long-range model, reproducing the main properties of the diffusion entropy and describing the seismic triggering mechanisms induced by large earthquakes.

Journal Article↗

Lévy scaling: the diffusion entropy analysis applied to DNA sequences.

We address the problem of the statistical analysis of a time series generated by complex dynamics with the diffusion entropy analysis (DEA) [N. Scafetta, P. Hamilton, and P. Grigolini, Fractals 9, 193 (2001)]. This method is based on the evaluation of the Shannon entropy of the diffusion process generated by the time series imagined as a physical source of fluctuations, rather than on the measurement of the variance of this diffusion process, as done with the traditional methods. We compare the DEA to the traditional methods of scaling detection and prove that the DEA is the only method that always yields the correct scaling value, if the scaling condition applies. Furthermore, DEA detects the real scaling of a time series without requiring any form of detrending. We show that the joint use of DEA and variance method allows to assess whether a time series is characterized by Lévy or Gauss statistics. We apply the DEA to the study of DNA sequences and prove that their large-time scales are characterized by Lévy statistics, regardless of whether they are coding or noncoding sequences. We show that the DEA is a reliable technique and, at the same time, we use it to confirm the validity of the dynamic approach to the DNA sequences, proposed in earlier work.

Biophysical Phenomena↗