Vito Latora

Bio: Vito Latora is an academic researcher from Queen Mary University of London. The author has contributed to research in topics: Complex network & Centrality. The author has an hindex of 78, co-authored 332 publications receiving 35697 citations. Previous affiliations of Vito Latora include University of Catania & University of Paris.

Community structure of cortical networks in spinal cord injured patients

Abstract: In the present study, we estimated the cortical networks were from high-resolution EEG recordings in a group of spinal cord injured patients and in a group of healthy subjects, during the preparation of a limb movement. Then, we use the Markov Clustering method to analyse the division of the network into community structures. The results indicate large differences between the injured patients and the healthy subjects. In particular, the networks of spinal cord injured patient exhibited a higher density of clusters. In the Alpha (7–12 Hz) frequency band, the two observed largest communities were mainly composed by the cingulate motor areas with the supplementary motor areas, and by the pre-motor areas with the right primary motor area of the foot. This functional separation could reflect the partial alteration in the primary motor areas because of the effects of the spinal cord injury.

The advantages of interdisciplinarity in modern science

Abstract: As the increasing complexity of large-scale research requires the combined efforts of scientists with expertise in different fields, the advantages and costs of interdisciplinary scholarship have taken center stage in current debates on scientific production. Here we conduct a comparative assessment of the scientific success of specialized and interdisciplinary researchers in modern science. Drawing on comprehensive data sets on scientific production, we propose a two-pronged approach to interdisciplinarity. For each scientist, we distinguish between background interdisciplinarity, rooted in knowledge accumulated over time, and social interdisciplinarity, stemming from exposure to collaborators' knowledge. We find that, while abandoning specialization in favor of moderate degrees of background interdisciplinarity deteriorates performance, very interdisciplinary scientists outperform specialized ones, at all career stages. Moreover, successful scientists tend to intensify the heterogeneity of collaborators and to match the diversity of their network with the diversity of their background. Collaboration sustains performance by facilitating knowledge diffusion, acquisition and creation. Successful scientists tend to absorb a larger fraction of their collaborators' knowledge, and at a faster pace, than less successful ones. Collaboration also provides successful scientists with opportunities for the cross-fertilization of ideas and the synergistic creation of new knowledge. These results can inspire scientists to shape successful careers, research institutions to develop effective recruitment policies, and funding agencies to award grants of enhanced impact.

Centrality and cities: multiple centrality assessment as a tool for urban analysis and design

Abstract: This chapter discusses the spatial analysis of urban systems, multiple centrality assessment and the dynamics on street networks.

Intermittency in the Fisher's droplet model

Abstract: Intermittent behaviour of fragment multiplicity distributions in the nuclear liquid-gas phase transition is studied in terms of the droplet model of Fisher. The anomalous fractal dimensions are compared with data on heavy ion reactions and classical molecular dynamics simulations. A signature of the transition in the anomalous fractal dimensions is shown.

Author Correction: Dynamically induced cascading failures in power grids

Abstract: The original version of this Article omitted the following from the Acknowledgements: 'Finally, we gratefully acknowledge support from the German Science Foundation (DFG) by a grant toward the Cluster of Excellence "Center for Advancing Electronics Dresden" (cfaed)'. This has been corrected in both the PDF and HTML versions of the Article.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A

Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。

The Structure and Function of Complex Networks

Abstract: Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

Finding and evaluating community structure in networks.

Abstract: We propose and study a set of algorithms for discovering community structure in networks-natural divisions of network nodes into densely connected subgroups. Our algorithms all share two definitive features: first, they involve iterative removal of edges from the network to split it into communities, the edges removed being identified using any one of a number of possible "betweenness" measures, and second, these measures are, crucially, recalculated after each removal. We also propose a measure for the strength of the community structure found by our algorithms, which gives us an objective metric for choosing the number of communities into which a network should be divided. We demonstrate that our algorithms are highly effective at discovering community structure in both computer-generated and real-world network data, and show how they can be used to shed light on the sometimes dauntingly complex structure of networked systems.