We are interested in all aspects of real world networks and their models, from internet measurements to random graphs, from social network analysis to spreading phenomena, and from graph algorithms to biological networks.
Massoud Seifi, Jean-loup Guillaume, Matthieu Latapy and Bénédicte Le Grand Proceedings of the 8th Workshop on Visualization and Knowledge Extraction (EGC 2010) De nombreux réseaux du monde réel peuvent être modélisés par des grands graphes. Réduire la complexité d’un graphe de manière à ce qu’il puisse être facilement interprété par l’oeil humain est une aide …
Clémence Magnien, Matthieu Latapy and Jean-Loup Guillaume ACM Computing Surveys, 43 (3), 2011. Extended abstract published in LNCS, proceedings of the 8-th International Conference On Principles Of Distributed Systems OPODIS’04, 2004, Grenoble, France (title: Comparison of Failures and Attacks on Random and Scale-free Networks) It appeared recently that the underlying degree distribution of a network …
Fabien Tarissan, Matthieu Latapy and Christophe Prieur In Proceedings of the IEEE International Workshop on Network Science For Communication Networks (NetSciCom’09) Complex networks are at the core of an intense research activity. However, in most cases, intricate and costly measurement procedures are needed to explore their structure. In some cases, these measurements rely on link …
Continuer la lecture de « Efficient Measurement of Complex Networks Using Link Queries »
Frédéric Aidouni, Matthieu Latapy and Clémence Magnien Sixth International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P 2009), May 29, 2009, Rome, Italy This paper presents a capture of the queries managed by an eDonkey server during almost 10 weeks, leading to the observation of almost 9 billion messages involving almost 90 million users and …
Continuer la lecture de « Ten weeks in the life of an eDonkey server »
Clémence Magnien, Frédéric Ouedraogo, Guillaume Valadon, Matthieu Latapy Fourth International Conference on Internet Monitoring and Protection (ICIMP 2009), May 24-28, 2009, Venice, Italy By focusing on what can be observed by running traceroute-like measurements at a high frequency from a single monitor to a fixed destination set, we show that the observed view of the …
Oussama Allali, Matthieu Latapy and Clémence Magnien Sixth International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P 2009), May 29, 2009, Rome, Italy Collecting information about user activity in peer-to-peer systems is a key but challenging task. We describe here a distributed platform for doing so on the eDonkey network, relying on a group of …
Continuer la lecture de « Measurement of eDonkey Activity with Distributed Honeypots »
Matthieu Latapy Theoretical Computer Science (TCS) 407 (1-3), pages 458-473, 2008 Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a detailed survey of proposed main-memory solutions to these problems, in …
Matthieu Latapy, Clémence Magnien and Frédéric Ouédraogo Proceedings of ADN’08: 1st International Workshop on Analysis of Dynamic Networks, in conjunction with IEEE ICDM 2008 In contrast with most internet topology measurement research, our concern here is not to obtain a map as complete and precise as possible of the whole internet. Instead, we claim that …
Clémence Magnien, Matthieu Latapy and Michel Habib ACM Journal of Experimental Algorithmics (JEA), 13, 2009 The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones …
Matthieu Latapy, Clémence Magnien and Nathalie Del Vecchio Social Networks (2008), vol. 30, no1, pp. 31-48 Many large real-world networks actually have a 2-mode nature: their nodes may be separated into two classes, the links being between nodes of different classes only. Despite this, and despite the fact that many ad-hoc tools have been designed …
Continuer la lecture de « Basic Notions for the Analysis of Large Two-mode Networks »
Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, and Renata Teixeira Computer Networks 52-5 (2008), pp. 998-1018. Extended abstract published in the proceedings of the 6-th Internet Measurement Conference IMC’06, 2006, Rio de Janeiro, Brazil Test of time award IMC 2022 Traceroute is widely used: from the diagnosis of network problems …
Matthieu Latapy and Clémence Magnien Infocom’08 Proceedings, Phoenix, USA Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measurement procedures. Until recently, most studies assumed that these procedures eventually lead to samples large enough to be representative of the whole, at …
Rémi Dorat, Matthieu Latapy, Bernard Conein and Nicolas Auray Annals of Telecommunications (2007), vol. 62, no3-4, pp. 325-349 It is well known now that most real-world complex networks have some properties which make them very different from random networks. In the case of interactions between authors of messages in a mailing-list, however, a multi-level structure …
Jérémie Leguay, Matthieu Latapy, Timur Friedman, Kavé Salamatian Computer Networks 51, pages 2067-2087, 2007. Extended abstract published in LNCS, proceedings of the 4-th IFIP international conference on Networking, 2005, Waterloo, Canada This contribution deals with actual routes followed by packets on the internet at IP level. We first propose a set of statistical properties to …
Continuer la lecture de « Describing and simulating routes on the Internet »
Ravi Kumar and Matthieu Latapy Theoretical Computer Science, special issue on Complex Networks, Volume 355, Number 1, 6 April 2006
Jean-Loup Guillaume and Matthieu Latapy Physica A 371, pages 795-813, 2006. Extended abstract published in LNCS, proceedings of the 1-st international workshop on Combinatorial and Algorithmic Aspects of Networking CAAN’04, 2004, Banff, Canada It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since …
Continuer la lecture de « Bipartite graphs as Models of Complex Networks »
Anne-Ruxandra Carvunis, Matthieu Latapy, Annick Lesne, Clémence Magnien and Laurent Pezard Physica A 367, pages 585-612, 2006 The influence of the network topology on the dynamics of systems of coupled excitable units is studied numerically and demonstrates a lower dynamical variability for power-law networks than for Poisson ones. This effect which reflects a robust collective …
Pascal Pons and Matthieu Latapy Journal of Graph Algorithms and Applications (JGAA) vol. 10, no. 2, pages 191-218, 2006. Extended abstract published in LNCS, proceedings of the 20-th International Symposium on Computer and Information Sciences ISCIS’05, 2005, Istambul, Turquie Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important …
Continuer la lecture de « Computing communities in large networks using random walks »
Stevens Le Blond, Jean-Loup Guillaume and Matthieu Latapy LNCS, proceedings of the 4-th International workshop on Peer-to-Peer Systems IPTPS’05, 2005, Ithaka, New York, USA We propose here an analysis of a rich dataset which gives an exhaustive and dynamic view of the exchanges processed in a running eDonkey system. We focus on correlation in term …
Continuer la lecture de « Clustering in P2P exchanges and consequences on performances »
Pierre Fraigniaud, Philippe Gauron and Matthieu Latapy LNCS, proceedings of the 11-th international conference Euro-Par, 2005, Lisbonne, Portugal It appeared recently that user interests in a P2P system possess clustering properties that may be used to reduce significantly the amount of traffic of flooding-based search strategies. It was also observed that they possess scale-free properties …