5 citations · 8 across the 7 of their papers we have counts for
9 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…
Active clustering for labeling training data
Quentin Lutz, Élie de Panafieu, Alex Scott +1
Gathering training data is a key step of any supervised learning task, and it is both critical and expensive. Critical, because the quantity and quality of the training data has a…
Counting directed acyclic and elementary digraphs
Élie de Panafieu, Sergey Dovgal
Directed acyclic graphs (DAGs) can be characterised as directed graphs whose strongly connected components are isolated vertices. Using this restriction on the strong components, w…
Combinatorics of nondeterministic walks of the Dyck and Motzkin type
Elie De Panafieu, Mohamed Lamine Lamali, Michael Wallner
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. At each step, a nondeterministic walk draws a random set of steps from a predefined s…
Of Kernels and Queues: when network calculus meets analytic combinatorics
Anne Bouillard, Céline Comte, Élie De Panafieu +1
Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However, deriving accurate bounds for networks consisting of several queues…
Threshold functions for small subgraphs: an analytic approach
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, including the case of constrained degrees. Our approach relies heavily on…
Analytic combinatorics of connected graphs
Elie de Panafieu
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound…
Counting connected graphs with large excess
Elie de Panafieu
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using anal…
Complexity Estimates for Two Uncoupling Algorithms
Alin Bostan, Frédéric Chyzak, Élie De Panafieu
Uncoupling algorithms transform a linear differential system of first order into one or several scalar differential equations. We examine two approaches to uncoupling: the cyclic-v…