3 citations · 9 across the 20 of their papers we have counts for
23 papers
Probability of a Condorcet Winner for Large Electorates: An Analytic Combinatorics Approach
Emma Caizergues, François Durand, Marc Noy +2
We study the probability that a given candidate is an alpha-winner, i.e. a candidate preferred to each other candidate j by a fraction alpha_j of the voters. This extends the class…
Exact enumeration of satisfiable 2-SAT formulae
Sergey Dovgal, Élie de Panafieu, Vlady Ravelomanana
We obtain exact expressions counting the satisfiable 2-SAT formulae and describe the structure of associated implication digraphs. Our approach is based on generating function mani…
Energy-Efficient Naming in Beeping Networks
Ny Aina Andriambolamalala, Vlady Ravelomanana
A single-hop beeping network is a distributed communication model in which all stations can communicate with one another by transmitting only one-bit messages, called beeps. This p…
Generating Functions of Some Families of Directed Uniform Hypergraphs
Vonjy Rasendrahasina, Vlady Ravelomanana
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowin…
Cycles of given lengths in unicyclic components in sparse random graphs
Marc Noy, Vonjy Rasendrahasina, Vlady Ravelomanana +1
Let be subset of and let be the number of cycles belonging to unicyclic components whose length is in in the random graph . We find…
Threshold functions for small subgraphs in simple graphs and multigraphs
Gwendal Collet, Élie de Panafieu, Danièle Gardy +2
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce th…