39 citations · 43 across the 3 of their papers we have counts for
4 papers
Algorithms for Combinatorial Systems: Well-Founded Systems and Newton Iterations
Carine Pivoteau, Bruno Salvy, Michele Soria
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing nume…
The connectivity-profile of random increasing k-trees
Alexis Darrasse, Hsien-Kuei Hwang, Olivier Bodini +1
Random increasing k-trees represent an interesting, useful class of strongly dependent graphs for which analytic-combinatorial tools can be successfully applied. We study in this p…
On Buffon Machines and Numbers
Philippe Flajolet, Maryse Pelletier, Michele Soria
The well-know needle experiment of Buffon can be regarded as an analog (i.e., continuous) device that stochastically "computes" the number 2/pi ~ 0.63661, which is the experiment's…
Distances in random Apollonian network structures
Olivier Bodini, Alexis Darrasse, Michèle Soria
In this paper, we study the distribution of distances in random Apollonian network structures (RANS), a family of graphs which has a one-to-one correspondence with planar ternary t…