I am an EPSRC postdoctoral fellow and a lecturer at the University of Bath, where I am a member of
the probability group ProbL@B.
Between 2013 and 2016, I was a postdoc at ProbL@B, as part of Peter Mörters' EPSRC project Emergence of Condensation in Stochastic Networks.
Between 2010 and 2013, I was a PhD student whithin the Laboratoire de Mathématiques de Versailles
under the supervision of Brigitte Chauvin and Danièle Gardy.
I am interested in:
 branching processes
 Pólya's urns and stochastic approximation
 random networks, preferential attachment
 statistical physics: zerorange model, preferential attachment
 satisfiability, random Boolean trees and analytic combinatorics
News
The next conferences I will attend are:
Publications
Preprints
Journal Publications

Multiple drawing multicolour urns by stochastic approximation. (20 pages)
Nabil Lasmar, Cécile Mailler and Olfa Selmi.
Journal of Applied Probability, 55(1), pp 254281, 2018.

Describing the asymptotic behaviour of multicolour Pólya urns via smoothing systems analysis. (26 pages)
Cécile Mailler.
Latin American Journal of Probability and Mathematical Statistics  ALEA, XV, pp 375408, 2018.

And/or trees: a local limit point of view. (33 pages)
Nicolas Broutin and Cécile Mailler.
Random Structures and Algorithms, 53(1), pp 1558, 2018.

Measurevalued Pólya processes. (37 pages)
Cécile Mailler and JeanFrançois Marckert.
Electronic Journal of Probability 22, paper no. 26, pp 33 (DOI:10.1214/17EJP47), 2017.
I gave a talk on this work at the Workshop on Analytic and Probabilistic Combinatorics at BIRS (Banff, Canada); the video of this talk is available here.

Non extensive condensation in reinforced branching processes. (20 pages)
Steffen Dereich, Cécile Mailler and Peter Mörters.
Annals of Applied Probability 27(4), pp 25392568, 2017.

A bijective study of Basketball walks. (20 pages)
Jérémie Bettinelli, Éric Fusy, Cécile Mailler and Lucas Randazzo.
Séminaire Lotharingien de Combinatoire, 77, Art. B77a, pp 1–24, 2017.

The relation between tree size complexity and probability for Boolean functions generated by uniform random trees. (22 pages)
Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus and Cécile Mailler.
Applicable Analysis and Discrete Mathematics, Volume 10(2), pp 408446 (DOI 10.2298/AADM160715015D), 2016.

Condensation and symmetrybreaking in the zerorange process with weak site disorder. (22 pages)
Cécile Mailler, Peter Mörters
and Daniel Ueltschi.
Stochastic Processes and their Applications 126(11), pp 32833309 (DOI 10.1016/j.spa.2016.04.028), 2016.

Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability. (23 pages)
Antoine Genitrini et Cécile Mailler.
Algorithmica 76(4), pp 11061138, 2016.

Associative and commutative tree representations for Boolean functions. (36 pages)
Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus and Cécile Mailler.
Theoretical Computer Science, 570, pp 70101 (DOI : 10.1016/j.tcs.2014.12.025), 2015.

A sprouting tree model for random Boolean functions. (23 pages)
Brigitte Chauvin, Danièle Gardy and Cécile Mailler.
Random Structures and Algorithms, 47(4), page 635, 2015.

Smoothing equations for large Pólya urns. (26 pages)
Brigitte Chauvin, Cécile Mailler and Nicolas Pouyanne.
Journal of Theoretical Probability, 28, pages 923957, 2015.

Probabilities of Boolean functions given by random implicational formulas. (20 pages)
Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus and Cécile Mailler.
Electronic Journal of Combinatorics, 19, No. 2, P37 (electronic), 2012.
Articles in conference proceedings

No Shannon effect induced by And/Or trees.
Antoine Genitrini, Bernhard Gittenberger et Cécile Mailler.
In proc. 25th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'14), DMTCS, pages 109120, 2014.

Equivalence classes of random Boolean trees and application to the Catalan satisfiability problem.
Antoine Genitrini and Cécile Mailler.
In proc. 11^{th} Latin American Theoretical INformatics Symposium (LATIN), LNCS volume 8392, pages 466477, 2014.

The growing tree distribution for Boolean functions.
Brigitte Chauvin, Danièle Gardy and Cécile Mailler.
In proc. 8^{th} SIAM Workshop on Analytic and Combinatorics (ANALCO), pages 4556, 2011.
PhD Thesis
Teaching at summer schools
Selected Talks
Measurevalued Pólya processes.
 Journées ALÉA, CIRM, Luminy, France, March 21st, 2017. [video  in French]
 Workshop on Analytic and Probabilistic Combinatorics at BIRS, Banff, Canada, October 27, 2016. [video  in English]
 Séminaire de Probabilités de l'Institut Élie Cartan, Nancy, France, November 9, 2016.
Nonextensive condensation in reinforced branching processes.
 Fourth BathParis Branching meeting, June 28, 2016.
 Probability seminar, Cambridge, UK, January 26, 2016.
 Probability in the North East (PiNE) seminar series, Sheffield, UK, January 27, 2016.
Condensation and symmetrybreaking in the inhomogeneous zerorange process.
 AofA'15, Strobl, Austria, June 9, 2015.
 Conference in honour of Svante Janson's 60^{th} birthday, Krusenberg, Sweden, June 5, 2015.
 Probability seminar, University of Warwick, UK, November 12, 2014.
 Probability workshop, Oxford, UK, May 26, 2014.
And/or trees: A local limit point of view.
 Journées Alea, CIRM, Luminy, France, March 11, 2016.
 Combinatorics seminar, LaBRI, Bordeaux, France, December 18, 2015.
 Probability, trees and algorithms workshop, Oberwolfach, Germany, November 5, 2014.
Large Pólya urns and smoothing equations.
 Probability CRMISM Seminar, Montréal, Canada, November 28, 2013.
 AofA, Menorca, Spain, May 30, 2013.
 Random Combinatorial Structures and Statistical Mechanics workshop, Venice, Italy, May 7, 2013.
 ALÉA meeting, CIRM, Luminy, March 22, 2013.
Pólya urns: an invitation to research in probability.
The Catalan satisfiability problem.
 Journées de combinatoire de Bordeaux, Bordeaux I University, February 13, 2014.
 Combinatorial Probability and Statistical Mechanics Workshop, Queen Mary University, London, February 23, 2013.
 CLA Workshop, Jagiellonian University, Krakow, Poland, July 6, 2012.
Commutative and associative trees for representing random Boolean functions.
The growing tree model for random Boolean functions.