From the 1 of 1.1k papers with an AI index.
29.3k citations
- F. Rossi2 profiles18 · h 27
- F. Bach17 · h 108
- S. Tixeuil2 profiles16 · h 35
- Laurent Romary3 profiles15 · h 26
- Konstantin Avrachenkov2 profiles13 · h 41
- S. Vérel13 · h 28
- Marc Schoenauer2 profiles12 · h 49
- Francis Bach2 profiles11
- B. Mourrain10 · h 44
- Fabien Mathieu2 profiles10 · h 15
- Laetitia Vermeulen-Jourdan10 · h 26
- M. Fliess2 profiles10 · h 51
- Centre National de la Recherche ScientifiqueFR125 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR123 papers
- Centre Inria de SaclayFR106 papers
- Centre Inria de l'Université de LilleFR57 papers
- Institut de Recherche en Informatique et Systèmes AléatoiresFR41 papers
- Université Grenoble AlpesFR38 papers
- Centre Inria de l'université de BordeauxFR36 papers
- Sorbonne UniversitéFR34 papers
- École PolytechniqueFR29 papers
- Institut Élie Cartan de LorraineFR29 papers
- LIP6FR28 papers
- Laboratoire de l'Informatique du ParallélismeFR27 papers
12 papers · 2 filters
On Ornstein-Uhlenbeck driven by Ornstein-Uhlenbeck processes
Bernard Bercu, Frederic Proia, Nicolas Savy
We investigate the asymptotic behavior of the maximum likelihood estimators of the unknown parameters of positive recurrent Ornstein-Uhlenbeck processes driven by Ornstein-Uhlenbec…
Birth and death processes on certain random trees: Classification and stationary laws
Guy Fayolle, Maxim Krikun, Jean-Marc Lasgouttes
The main substance of the paper concerns the growth rate and the classification (ergodicity, transience) of a family of random trees. In the basic model, new edges appear according…
Best-effort networks: modeling and performance analysis via large networks asymptotics
Guy Fayolle, Arnaud De La Fortelle, Jean-Marc Lasgouttes +2
In this paper we introduce a class of Markov models, termed best-effort networks, designed to capture performance indices such as mean transfer times in data networks with best-eff…
Stationary IPA Estimates for Non-Smooth G/G/1/ Functionals via Palm Inversion and Level-Crossing Analysis
Pierre Bremaud, Jean-Marc Lasgouttes
We give stationary estimates for the derivative of the expectation of a non-smooth function of bounded variation f of the workload in a G/G/1/ queue, with respect to a para…
Asymptotics and scalings for large product-form networks via the Central Limit Theorem
Guy Fayolle, Jean-Marc Lasgouttes
The asymptotic behaviour of a closed BCMP network, with queues and clients, is analyzed when and become simultaneously large. Our method relies on Berry-Esseen…
A State-Dependent Polling Model with Markovian Routing
Guy Fayolle, Jean-Marc Lasgouttes
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalizes the classical Markovian polling model, in the sense that two routing matrices…