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.
Jean-Loup Guillaume and Matthieu Latapy Complex Systems 16, pages 83-94, 2005 In order to study some complex networks like the Internet, the Web, social networks or biological networks, one first has to explore them. This gives a partial and biased view of the real object, which is generally assumed to be representative of the whole. …
Jean-Loup Guillaume, Matthieu Latapy and Damien Magoni Computer Networks 50, pages 3197-3224, 2006. Extended abstract published in the proceedings of the 24-th IEEE international conference Infocom’05, 2005, Miami, USA Internet maps are generally constructed using the traceroute tool from a few sources to many destinations. It appeared recently that this exploration process gives a partial …
Fabien Viger and Matthieu Latapy Extended abstract published in LNCS, proceedings of the 11-th international conference on Computing and Combinatorics COCOON’05, 2005, Kunming, Yunnan, Chine We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm suitable …
Jean-Loup Guillaume, Matthieu Latapy and Stevens Le-Blond LNCS, proceedings of the 6-th International Workshop on Distributed Computing IWDC’04, 2004, Kolkata, India Despite their crucial impact on the performances of P2P systems, very few is known on peers behaviors in such networks. We propose here a study of these behaviors in a running environment using a …
Jean-Loup Guillaume and Matthieu Latapy Information Processing Letters (IPL) 90:5, pages 215-221, 2004 The analysis and modelling of various complex networks has received much attention in the last few years. Some such networks display a natural bipartite structure: two kinds of nodes coexist with links only between nodes of different kinds. This bipartite structure has …
Continuer la lecture de « Bipartite Structure of all Complex Networks »
Jean-Loup Guillaume, Matthieu Latapy and Laurent Viennot LNCS, proceedings of the 3-rd international conference Web-Age Information Management WAIM’02, 2002, Beijing, Chine. Abstract published in the proceedings of the 11-th international conference World Wide Web WWW’02, 2002, Honolulu, Hawaï In this paper, we propose a set of simple and efficient methods based on standard, free and …
Continuer la lecture de « Efficient and Simple Encodings for the Web Graph »