Matthieu Latapy

Statistical and Nonlinear Physics · 2003–2008

A researcher in the Science corpus: 5 papers; trusts 40 researchers and is trusted by 13 researchers here, as inferred from the citation graph.

Subfields

• Statistical and Nonlinear Physics — 61 citations into it; #1,707 of 10,127 by trust here, #3,735 by citations
• Computer Networks and Communications — 17 citations into it
• Geometry and Topology — 12 citations into it; #6,133 of 7,422 by trust here, #3,358 by citations
• Molecular Biology — 11 citations into it
• Computational Theory and Mathematics — 9 citations into it; #2,465 of 12,182 by trust here, #5,954 by citations
• Mathematical Physics — 9 citations into it; #7,301 of 8,562 by trust here, #5,088 by citations
• Algorithms & Complexity — 7 citations into it
• Artificial Intelligence — 7 citations into it; #33,465 of 35,345 by trust here, #31,361 by citations

Whom Matthieu Latapy trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Mark Newman
2. Duncan J. Watts
3. Paolo Boldi
4. Béla Bollobás
5. Steven H. Strogatz
6. Albert-László Barabási
7. Don Coppersmith
8. Raphael Yuster
9. Réka Albert
10. Ziv Bar-Yossef

Who trusts Matthieu Latapy overall

1. Ashwin Paranjape
2. Tore Opsahl
3. Charalampos E. Tsourakakis
4. Christopher R. Aberger
5. Austin R. Benson
6. Peng Wang
7. U. Kang
8. Susan Tu
9. Decebal Constantin Mocanu
10. Jure Leskovec

Papers from Matthieu Latapy's perspective

Ordered by how strongly the researchers Matthieu Latapy trusts endorse each paper. Same corpus, a different order for every researcher.

1. Graph structure in the Web (Comput. Networks)
2. Collective dynamics of ‘small-world’ networks
3. Social Network Analysis: Methods and Applications
4. The Structure and Function of Complex Networks
5. Emergence of Scaling in Random Networks
6. Emergence of scaling in random networks
7. The large-scale organization of metabolic networks (Nature)
8. Epidemic spreading in scale-free networks. (Physical Review Letters)
9. Statistical mechanics of complex networks
10. Network robustness and fragility: percolation on random graphs. (Physical Review Letters)

Their papers

• Main-memory triangle computations for very large (sparse (power-law)) graphs (2008) — 468 citations
• Efficient and simple generation of random simple connected graphs with prescribed degree sequence (2005) — 300 citations
• Basic notions for the analysis of large two-mode networks (2008) — 634 citations
• Avoiding traceroute anomalies with Paris traceroute (2006) — 477 citations
• Bipartite Graphs as Models of Complex Networks (2003) — 343 citations