20 citations
4 papers
Random walks on free products of cyclic groups
Jean Mairesse, Frédéric Mathéus
Let G be a free product of a finite family of finite groups, with the set of generators being formed by the union of the finite groups. We consider a transient nearest-neighbour ra…
Edit Distance between Unlabeled Ordered Trees
Anne Micheli, Dominique Rossin
There exists a bijection between one stack sortable permutations --permutations which avoid the pattern 231-- and planar trees. We define an edit distance between permutations whic…
Fast generation of random connected graphs with prescribed degrees
Fabien Viger, Matthieu Latapy
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 d…
Describing and Simulating Internet Routes
Jeremie Leguay, Matthieu Latapy, Timur Friedman +1
This paper introduces relevant statistics for the description of routes in the internet, seen as a graph at the interface level. Based on the observed properties, we propose and ev…