Domaines de recherche
Publications
Publications
|
|
Longest increasing subsequences for distributions with atoms, and an inhomogeneous Hammersley process2025 |
|
|
Maximal Entropy Random Walks in Z: Random and non-random environments2025 |
|
|
Dense and nondense limits for uniform random intersection graphs2024 |
|
|
The Ulam-Hammersley problem for multiset permutations2023 |
|
|
A Branching-selection process related to censored Galton-Walton processes2012 |
|
|
Scaling limit of graph classes through split decompositionThe Australasian Journal of Combinatorics, 2025, 92 (3), pp.266-319. ⟨10.48550/arXiv.2207.12253⟩ |
|
|
Maximal Entropy Random Walks in Z: Random and non-random environmentsJournal of Statistical Physics, 2025, 192 (10), pp.140. ⟨10.1007/s10955-025-03516-8⟩ |
|
|
Random cographs: Brownian graphon limit and asymptotic degree distributionRandom Structures and Algorithms, 2022, 60 (2), pp.166-200. ⟨10.1002/rsa.21033⟩ |
|
|
Scaling limits of permutation classes with a finite specification: a dichotomyAdvances in Mathematics, 2022, 405, pp.108513. ⟨10.1016/j.aim.2022.108513⟩ |
|
|
Longest increasing paths with Lipschitz constraintsAnnales de l'Institut Henri Poincaré (B) Probabilités et Statistiques, 2022, 58 (3), ⟨10.1214/21-AIHP1220⟩ |
|
|
Linear-sized independent sets in random cographs and increasing subsequences in separable permutationsCombinatorial Theory, 2022, 2 (3), pp.23340676. ⟨10.5070/C62359179⟩ |
|
|
Universal limits of substitution-closed permutation classesJournal of the European Mathematical Society, 2020, 22 (11), pp.3565-3639. ⟨10.4171/JEMS/993⟩ |
|
|
Longest increasing paths with gapsALEA : Latin American Journal of Probability and Mathematical Statistics, 2019, 16 (2), pp.1141--1163 |
|
|
From Hammersley's lines to Hammersley's treesProbability Theory and Related Fields, 2018, 171 (1-2), pp.1-51. ⟨10.1007/s00440-017-0772-2⟩ |
|
|
The Brownian limit of separable permutationsThe Annals of Probability, 2018, 46 (4), pp.2134 - 2189. ⟨10.1214/17-AOP1223⟩ |
|
|
The Page-Rényi parking processThe Electronic Journal of Combinatorics, 2015, 22 (4), pp.P.4.4 |
|
|
The shape of large balls in highly supercritical percolationElectronic Journal of Probability, 2014, pp.DOI: 10.1214/EJP.v19-3062 |
|
|
Distances in the highly supercritical percolation clusterThe Annals of Probability, 2013, 41 (6), pp.4342-4358 |
|
|
On the algebraic numbers computable by some generalized Ehrenfest urnsDiscrete Mathematics and Theoretical Computer Science, 2012, 14 (2), pp.271-284 |
|
|
Construction of a short path in high dimensional First Passage PercolationElectronic Communications in Probability, 2011, 16, pp.22--28 |
|
|
Examples of Fast and Slow Convergence of 2D Asynchronous Cellular SystemsJournal of Cellular Automata, 2009, 4 (4), pp.323-337 |
|
|
On the convergence of population protocols when population goes to infinityApplied Mathematics and Computation, 2009, Applied Mathematics and Computation, 215, pp.1340-1350. ⟨10.1016/j.amc.2009.04.056⟩ |
|
|
Epidemics and the Eden model : a detailed study of robustnessP.-Y.Louis, F.Nardi. Probabilistic Cellular Automata., Emergence, Complexity and Computation, vol 27, Springer, pp.165-178, 2018, Emergence, Complexity and Computation, ⟨10.1007/978-3-319-65558-1_12⟩ |
|
|
Random sampling of lattice paths with constraints, via transportation21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.317-328, ⟨10.46298/dmtcs.2783⟩ |
On the Convergence of a Population Protocol When Population Goes to InfinityPhysics and Computations, Worshop of Unconventional Computation - UC 2008, Aug 2008, Vienne, Austria |
|
|
|
Asynchronous Cellular Automata and Brownian Motion2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.423-442, ⟨10.46298/dmtcs.3527⟩ |
|
|
Efficient estimation of the cardinality of large data setsFourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.419-422, ⟨10.46298/dmtcs.3492⟩ |
|
|
Percolation, permutations, particules en interactionProbabilités [math.PR]. Paris Saclay, 2018 |