140 citations · 363 across the 28 of their papers we have counts for
Showing math.STShow all
3 papers · 1 filter
math.ST2021
Motif-based tests for bipartite networks
Sarah Ouadah, Pierre Latouche, Stéphane Robin
Bipartite networks are a natural representation of the interactions between entities from two different types. The organization (or topology) of such networks gives insight to unde…
math.ST2015
Degree-based goodness-of-fit tests for heterogeneous random graph models : independent and exchangeable cases
Sarah Ouadah, Stéphane Robin, Pierre Latouche
The degrees are a classical and relevant way to study the topology of a network. They can be used to assess the goodness-of-fit for a given random graph model. In this paper we int…
math.ST2013★ 1 cited
Activity date estimation in timestamped interaction networks
Fabrice Rossi, Pierre Latouche
We propose in this paper a new generative model for graphs that uses a latent space approach to explain timestamped interactions. The model is designed to provide global estimates…