39 citations
- Université de Technologie de CompiègneFR23 papers
- Laboratoire de Mathématiques Blaise PascalFR13 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- CERMICSFR5 papers
- University of La SerenaCL5 papers
- Criteo (France)FR3 papers
- Laboratoire d'Informatique, du Traitement de l'Information et des SystèmesFR3 papers
- Sorbonne UniversitéFR3 papers
- Tohono O'odham Community CollegeUS3 papers
- Université Pierre-et-Marie-CurieFR3 papers
- Centre de Recherche en Éducation de NantesFR2 papers
- Institut de Mécanique et d'Ingénierie de BordeauxFR2 papers
Showing math.PRShow all
3 papers · 1 filter
math.PR2024
Large graph limits of local matching algorithms on Configuration model graphs
Mohamed Habib Aliou Diallo Aoudi, Pascal Moyal, Vincent Robin
In this work, we propose a large-graph limit estimate of the matching coverage for several matching algorithms, on general graphs generated by the configuration model. For a wide c…
math.PR2013★ 4 cited
The Jamming Constant of Uniform Random Graphs
Paola Bermolen, Matthieu Jonckheere, Pascal Moyal
By constructing jointly a random graph and an associated exploration process, we define the dynamics of a "parking process" on a class of uniform random graphs as a measure-valued…
math.PR2008
On the strong approximation and functional limit laws for the increments of the non-overlapping k-spacings processes
Salim Bouzebda, Nabil Nessigha
The first aim of the present paper, is to establish strong approximations of the uniform non-overlapping k-spacings process extending the results of Aly et al. (1984). Our methods…