- Dynamics of three-state excitable units on Poisson vs power-law random networks
- Estimating properties in dynamic systems: the case of churn in P2P networks
- Ten weeks in the life of an eDonkey server Frederic Aidouni, Matthieu Latapy and Clemence Magnien
- Coding Distributive Lattices with Edge Firing Games
- prsente pour obtenir le grade de DOCTEUR DE L'COLE POLYTECHNIQUE
- Mobile IPv6 Deployments: Graphbased Analysis and practical Guidelines
- Comparison of Failures and Attacks on Random and Scalefree Networks
- Dynamics of threestate excitable units on Poisson vs powerlaw random networks
- Lattices Induced by Chip Firing Games and Related Models
- Classes of Lattices Induced by Chip Firing (and Sandpile) Dynamics
- Ten weeks in the life of an eDonkey server Frederic Aidouni, Matthieu Latapy and Clemence Magnien
- arXiv:0908.3154v1[cond-mat.stat-mech]21Aug2009 Impact of Random Failures and Attacks on
- Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs
- This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
- Quantifying Paedophile Queries in a Large P2P System
- Impact of Sources and Destinations on the Observed Properties of the Internet Topology
- Sandpile Models and Lattices: A Comprehensive Survey.
- Detecting Events in the Dynamics of Ego-centered Measurements
- A Radar for the Internet Matthieu Latapy 1
- Characterisation of Lattices Induced by (extended) Chip Firing Games
- Complex Network Measurements: Estimating the Relevance of Observed Properties
- Evolving networks Pierre BORGNAT a
- Evolving networks Pierre BORGNAT a Eric FLEURY b JeanLoup GUILLAUME c,1
- Basic Notions for the Analysis of Large Two-mode Networks
- Measurement of eDonkey Activity with Distributed Honeypots
- A Radar for the Internet Matthieu Latapy 1,2 , Cl emence Magnien 1,2 , Fr ed eric Ou edraogo 1,2,3
- Fast dynamics in Internet topology: observations and first explanations
- Mobile IPv6 Deployments: Graph-based Analysis and practical Guidelines
- Link prediction in bipartite graphs using internal links and weighted projection
- A Radar for the Internet Matthieu Latapy1,2
- Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs
- Internal link prediction: a new approach for predicting links in bipartite graphs
- Impact of power-law topology on IP-level routing dynamics: simulation results
- Noname manuscript No. (will be inserted by the editor)
