D
Diego Garlaschelli
Researcher at Leiden University
Publications - 202
Citations - 7279
Diego Garlaschelli is an academic researcher from Leiden University. The author has contributed to research in topics: Complex network & Financial networks. The author has an hindex of 40, co-authored 190 publications receiving 6240 citations. Previous affiliations of Diego Garlaschelli include Sant'Anna School of Advanced Studies & École Normale Supérieure.
Papers
More filters
Journal ArticleDOI
Structure and evolution of the world trade network
TL;DR: In this article, the authors studied the temporal dependence of the parameters describing the WTW topology, exploiting the peculiar reciprocity structure of WTW to recover the directed nature of international trade channels.
Journal ArticleDOI
Patterns of Link Reciprocity in Directed Networks
TL;DR: It is found that real networks are always either correlated or anticorrelated, and that networks of the same type display similar values of the reciprocity.
Journal ArticleDOI
Complexity theory and financial regulation
Stefano Battiston,J. Doyne Farmer,J. Doyne Farmer,Andreas Flache,Diego Garlaschelli,Andrew Haldane,Hans Heesterbeek,Cars Hommes,Cars Hommes,Carlo Jaeger,Carlo Jaeger,Robert M. May,Marten Scheffer +12 more
TL;DR: Economic policy needs interdisciplinary network analysis and behavioral modeling for better monitoring and management of highly interconnected economic and financial systems and, thus, may help anticipate and manage future crises.
Journal ArticleDOI
Fitness-Dependent Topological Properties of the World Trade Web
TL;DR: It is found that the power-law distributed gross domestic product can be successfully identified with the hidden variable determining the topology of the world trade web: all previously studied properties up to third-order correlation structure are found to be in excellent agreement with the predictions of the model.
Journal ArticleDOI
Universal scaling relations in food webs
TL;DR: It is proposed to describe food webs as transportation networks by extending to them the concept of allometric scaling (how branching properties change with network size), and it is shown that, whereas the number of loops varies significantly across real webs, spanning trees are characterized by universal scaling relations.