Category Archives: Plots

> Marwan Ghanem, Clémence Magnien and Fabien Tarissan One of the main indicators of graph analyses is the centrality, which quantifies the importance of a node in the network. We are interested particularly in the closeness centrality, which relies on the shortest distance between the considered node and all other nodes in the network. As […]

Posted in Plots |

Accurate characterizing of session lengths in P2P system

Accurate characterizing of session lengths in P2P system

> Lamia Benamara et Clémence magnien When trying to characterize the dynamics of a system, we are faced with two problems. First, the observation window must be long enough to be representative. Second, the fact that it is finite still induces a bias in the observations, sessions beginning/ending before/after the measurement window are not seen […]

Posted in Plots | Tagged , , |

Link prediction in a file-provider network

Link prediction in a file-provider network

> By Oussama Allali, Matthieu Latapy and Clémence Magnien Link prediction is a key research problem within the analysis of network dynamics. It aims at predicting the links which will appear in future evolution of the network. We consider here a set of peers and files, where each peer is linked to the files it […]

Posted in Plots | Tagged , , , |

Quantifying paedophile users on a P2P system

Quantifying paedophile users on a P2P system

> By Raphaël Fournier and Matthieu Latapy P2P systems are known to host a large amount of paedophile activity. Thus, quantifying the number of paedophile users on a P2P system is crucial, for many reasons: easy access to such content is a major societal concern, policy making and law-enforcement budgeting rely on this figure and […]

Posted in Plots | Tagged , |

Keywords popularity in eDonkey queries

Keywords pupularity in eDonkey queries

> Bénédicte Le Grand This plot represents the evolution of the popularity of the keywords ‘avi’, ‘madonna’ and ‘jackson’ in eDonkey queries (captured on an eDonkey server during 102 days in 2009). The values on the y-axis represent the proportion of occurrences of these keywords in eDonkey queries for each day of the capture (x-axis). […]

Posted in Plots | Tagged |

Evaluation of the real degree of IP routers

Evaluation of the real degree of IP routers

> By Elie Rotenberg, Christophe Crespelle and Matthieu Latapy Here, we aim at measuring the IP-level neighborhood of internet core routers in a rigorous way. We proceed as follows. First, we send traceroute probes from many monitors distributed in the internet towards a given target router. Then we consider the last but one IP adress […]

Posted in Plots | Tagged , |

Following and Followers in Twitter

Following and Followers in Twitter

> By Guillaume Valadon and Korlam Gautam Twitter is a micro-blogging platform that allows its users to post short messages (aka Tweets) to be displayed on their profile pages. A social network is also embedded in Twitter: users can receive messages from users they follow. In the Twitter terminology, there are following and followers. Given […]

Posted in Plots | Tagged , |

Number of file-id discovered in a client-side eDonkey measurement

Number of file-id discovered in a client-side eDonkey measurement

> By Christophe Berger, Clémence Magnien, Matthieu Latapy, Firas Bessadok and Phillipe Jarlov We conduct a measurement of files available in eDonkey as follows. Our client connects to all eDonkey servers it discovers (it knows an initial lists of servers and explores the set of all servers reachable from these). Then it sends every 12 […]

Posted in Plots | Tagged , , |

Social networks conceptual analysis

Social networks conceptual analysis

> By Bénédicte Le Grand These figures represent Galois lattices built from two samples of online social networks (Myspace and DailyMotion). Galois lattices, from Formal Concept Analysis, cluster data (here the members of a social network sample) according to their common properties (here the members’ contacts). Each node of the lattice is called a concept; […]

Posted in Plots | Tagged , |

Measuring clustering coefficient with different strategies

Measuring clustering coefficient with different strategies

By Fabien Tarissan, Matthieu Latapy and Christophe Prieur In a previous study presented in Efficient Measurement of Complex Networks Using Link Queries, we showed that different measurement strategies behave very differently as regard the rapidity for retrieving existing links in large complex networks. It appeared in particular that the strategies based on the degree distribution […]

Posted in Plots | Tagged , |