Laurent Massoulié
Laurent Massoulié is a French computer scientist whose research spans applied probability, network science, distributed algorithms, and machine learning. He is the author of foundational work on bandwidth-sharing congestion control, gossip-based information dissemination, community detection in stochastic block models, and asynchronous distributed optimization, with co-authorship on five INFOCOM, SIGMETRICS, CoNEXT, and NeurIPS Best Paper Awards. As of May 2026, he is a Senior Research Director at Inria, Scientific Delegate of the Inria Paris Centre, Director of the Microsoft Research-Inria Joint Centre, Professor at the Applied Mathematics Centre of École Polytechnique, and a chair holder at the Prairie Institute.
At a glance
- Education: Engineer's degree, École Polytechnique (X88 promotion, 1988 to 1991); DEA in probability theory; PhD in probability theory and stochastic processes, Université Paris-Sud Orsay (Paris XI), 1995, advised by Pierre Brémaud; Habilitation à diriger des recherches, Université Paris VII Diderot, 2010.
- Current roles: Senior Research Director at Inria (Argo project-team, since 2024); Scientific Delegate of the Inria Paris Centre; Director of the Microsoft Research-Inria Joint Centre (since 2012); Professor at the Applied Mathematics Centre of École Polytechnique; chair holder at the Prairie Institute (PSL).
- Key contributions: Bandwidth sharing: objectives and algorithms (INFOCOM 1999, Best Paper); Epidemic information dissemination in distributed systems (IEEE Computer 2004); Community detection thresholds and the weak Ramanujan property (STOC 2014); Optimal Algorithms for Non-Smooth Distributed Optimization in Networks (NeurIPS 2018, Best Paper).
- LinkedIn: laurentmassoulie
- Personal site: di.ens.fr/laurent.massoulie
- Google Scholar: TvVmLjUAAAAJ
- OpenReview: Laurent_Massoulié1
- dblp: 58/4130
Origins
Massoulié was born and raised in France. He entered École Polytechnique in 1988 as a member of the X88 promotion and graduated in 1991. After Polytechnique, he briefly considered a finance career before choosing a DEA (diplôme d'études approfondies) in probability theory, the path that took him into doctoral research at Université Paris-Sud Orsay under Pierre Brémaud, a leading French researcher on point processes and applied probability for queueing systems.
Career
Massoulié defended his PhD in 1995 at Université Paris-Sud Orsay under Pierre Brémaud with a thesis titled "Stabilité, simulation et optimisation des systèmes à événements discrets." The thesis line on stochastic stability and discrete-event systems established the probabilistic foundation for his next three decades of research on networks and distributed systems.
From 1995 to 1998, Massoulié was a researcher at France Télécom R&D (then known as CNET, the Centre national d'études des télécommunications). The France Telecom period produced his work on bandwidth sharing and admission control for internet traffic, including the Bandwidth sharing: objectives and algorithms paper at INFOCOM 1999 with James Roberts, which introduced rate-allocation models that became reference material for TCP-congestion-control analysis and won the 1999 INFOCOM Best Paper Award.
In 1999, Massoulié moved to Microsoft Research Cambridge as a researcher in the systems and networking group. The Cambridge period through 2006 produced his most-cited work on peer-to-peer systems and gossip-based information dissemination. The 2003 paper Peer-to-peer membership management for gossip-based protocols (with Anne-Marie Kermarrec and Ayalvadi Ganesh) introduced the SCAMP protocol for membership management in large-scale gossip systems. The 2004 Epidemic information dissemination in distributed systems survey at IEEE Computer crystallized the line, followed by the 2005 SIGMETRICS Best Paper and the 2007 ACM CoNEXT Best Paper for Push-to-Peer video-on-demand systems.
In 2006, Massoulié joined Thomson (which became Technicolor in 2010) as a research scientist and went on to head the Paris Research Lab, with research extending to social-network analysis and peer-to-peer multimedia distribution. He was elected a Technicolor Fellow in 2011 and defended his Habilitation à diriger des recherches in 2010 at Université Paris VII Diderot.
In 2012, Massoulié moved to Inria as Research Director (directeur de recherche) and was appointed Director of the Microsoft Research-Inria Joint Centre, the joint center established in 2005 in Saclay. The Inria period produced the community-detection line on stochastic block models, including the Community detection thresholds and the weak Ramanujan property paper at STOC 2014, which provided the first rigorous proof of the conjectured phase transition in the symmetric stochastic block model. The 2018 Nonbacktracking spectrum of random graphs paper in the Annals of Probability extended the line.
The Inria period also produced the distributed-optimization line. The 2018 Optimal Algorithms for Non-Smooth Distributed Optimization in Networks paper with Kevin Scaman, Francis Bach, Sébastien Bubeck, and Yin Tat Lee won the NeurIPS 2018 Best Paper Award. A NeurIPS 2021 Best Paper followed for related work on accelerated decentralized optimization. The same period produced collaborations on graph alignment, federated learning, and asynchronous distributed algorithms with PhD advisees including Mathieu Even, Hadrien Hendrikx, and Luca Ganassali.
In parallel, Massoulié has held a Professor appointment at the Applied Mathematics Centre of École Polytechnique (CMAP) and a chair at the Prairie Institute (PSL) since the institute's 2019 establishment under the French national AI strategy. As of May 2026, he serves as Senior Research Director at Inria within the Argo project-team, Scientific Delegate of the Inria Paris Centre, Director of the Microsoft Research-Inria Joint Centre, and Professor at École Polytechnique.
Affiliations
- École Polytechnique: Engineering student, X88 promotion, 1988 to 1991.
- Université Paris-Sud Orsay (Paris XI): PhD candidate in probability theory and stochastic processes, advised by Pierre Brémaud, defended 1995.
- France Télécom R&D / CNET: Researcher, 1995 to 1998.
- Microsoft Research Cambridge: Researcher, 1999 to 2006.
- Thomson / Technicolor: Research scientist and head of Paris Research Lab, 2006 to 2012; Technicolor Fellow from 2011.
- Inria: Research Director (directeur de recherche), 2012 to present; Senior Research Director and Scientific Delegate of the Inria Paris Centre as of 2024; Argo project-team.
- Microsoft Research-Inria Joint Centre: Director, 2012 to present.
- École Polytechnique (Applied Mathematics Centre): Professor, joint appointment with Inria.
- Prairie Institute (PSL): Chair holder, 2019 to present.
Notable contributions
Massoulié's record runs from stochastic-stability work at Orsay, through the bandwidth-sharing line at France Telecom, the gossip and epidemic-dissemination line at Microsoft Research Cambridge, the social-network and peer-to-peer line at Technicolor, and the community-detection and distributed-optimization lines at Inria. His Google Scholar profile lists approximately 18,559 citations, an h-index of 63, and an i10-index of 160 as of mid-2026, across roughly 100 publications and 20 patents.
- Bandwidth sharing: objectives and algorithms (INFOCOM 1999, Best Paper). With James Roberts; the foundational paper on max-min and proportional fairness rate allocation that became reference material for TCP-congestion-control analysis, with over 980 citations.
- Peer-to-peer membership management for gossip-based protocols (IEEE TC 2003). With Ayalvadi Ganesh and Anne-Marie Kermarrec; introduced the SCAMP gossip-membership protocol with over 730 citations.
- Epidemic information dissemination in distributed systems (IEEE Computer 2004). With Kermarrec and Ganesh; survey of epidemic-style information dissemination, with over 870 citations.
- The effect of network topology on the spread of epidemics (INFOCOM 2005). With Ganesh and Kermarrec; over 1,030 citations on the spectral characterization of epidemic thresholds.
- Community detection thresholds and the weak Ramanujan property (STOC 2014). The first rigorous proof of the conjectured detection threshold in the symmetric stochastic block model, applying spectral methods on non-backtracking matrices. Extended in Nonbacktracking spectrum of random graphs (Annals of Probability 2018) with Charles Bordenave and Marc Lelarge.
- Optimal Algorithms for Non-Smooth Distributed Optimization in Networks (NeurIPS 2018, Best Paper). With Kevin Scaman, Francis Bach, Sébastien Bubeck, and Yin Tat Lee; optimal complexity bounds for non-smooth decentralized optimization.
- NeurIPS 2021 Best Paper. Co-authored work on accelerated decentralized optimization with bounded delays.
- Awards. Grand Prix Scientifique Cino Del Duca of the French Academy of Sciences (2017); Markov Lecture of the Informs Applied Probability Society (2019); ACM SIGMETRICS Achievement Award (2023) "in recognition of his contributions to the theory and practice of large-scale distributed networks and systems"; Technicolor Fellow (2011); INFOCOM 1999 Best Paper Award; SIGMETRICS 2005 Best Paper Award; ACM CoNEXT 2007 Best Paper Award; NeurIPS 2018 and 2021 Best Paper Awards.
Investments and boards
No public investor activity on record in AI, semiconductors, datacenters, software, or energy as of May 2026.
Network
Massoulié's research collaborations trace through three overlapping cohorts. The first is his Orsay PhD lineage with Pierre Brémaud as doctoral advisor, and the bandwidth-sharing line at France Telecom CNET with James Roberts.
The second is the Microsoft Research Cambridge cohort. The gossip and epidemic-dissemination line ran with Anne-Marie Kermarrec (later EPFL) and Ayalvadi Ganesh (later University of Bristol), with collaborations with Don Towsley at the University of Massachusetts and Milan Vojnović.
The third is the Inria and Prairie cohort. The community-detection line ran with Marc Lelarge, Charles Bordenave, and Lennart Gulikers. The distributed-optimization line ran with Francis Bach and Kevin Scaman. PhD advisees at Inria-DI ENS include Gulikers, Mathieu Even, Hadrien Hendrikx, and Luca Ganassali, with current students Pierre Aguié, Alexandra Kortchemski, Louis Vassaux, Jakob Maier, and Killian Bakong.
Position in the field
As of May 2026, Massoulié occupies a position at the intersection of three research trajectories. The first is the applied-probability and network-science line through bandwidth sharing, gossip protocols, epidemic dissemination, and stochastic-block-model community detection. The second is the distributed-optimization line through the NeurIPS 2018 and 2021 Best Papers and the broader federated-learning literature. The third is the institutional-leadership line through the Microsoft Research-Inria Joint Centre direction since 2012, the Prairie Institute chair since 2019, and the Inria Paris Centre Scientific Delegate role.
The five Best Paper Awards across INFOCOM, SIGMETRICS, CoNEXT, and two NeurIPS editions, the 2017 Cino Del Duca Grand Prix, the 2019 Markov Lecture, and the 2023 ACM SIGMETRICS Achievement Award place him among the most credentialed senior French applied-probability and network-science researchers of his generation. He maintains an academic homepage at DI ENS and presents regularly at INFOCOM, SIGMETRICS, NeurIPS, ICML, and STOC.
Outlook
Open questions over the next 6 to 18 months:
- Argo project-team direction. The trajectory of the Argo team's research line on learning, graphs, and distributed optimization, including newer publications on graph alignment and privacy-preserving decentralized learning.
- Microsoft Research-Inria Joint Centre. Whether the Joint Centre's direction continues at the cadence and program scope set since 2012, particularly in light of broader Microsoft Research portfolio adjustments.
- PhD pipeline. Whether prior advisees and current students continue producing high-impact research through the DI ENS pipeline.
- Inria Paris Centre direction. Whether the Scientific Delegate role expands into broader French academic-AI research-program leadership.
- Federated-learning and graph-alignment lines. The continued development of decentralized-optimization and graph-correlation-testing methods through 2026 to 2027.
Sources
- Laurent Massoulié's personal site at DI ENS. Personal homepage with research focus, current positions, and PhD-student listing.
- Laurent Massoulié's MSR-Inria Joint Centre page. Microsoft Research-Inria Joint Centre researcher profile.
- Laurent Massoulié's Prairie Institute chair page. Prairie Institute chair profile listing his current Inria, Polytechnique, and MSR-Inria roles.
- Laurent Massoulié's Google Scholar profile. Citation metrics, h-index, and chronological publication record.
- Laurent Massoulié on dblp. Bibliographic record.
- Laurent Massoulié on the Mathematics Genealogy Project. Doctoral record listing the 1995 Orsay thesis with advisor Pierre Brémaud.
- Laurent Massoulié (88), mathématicien du réseau. La Jaune et la Rouge profile (in French) covering his career trajectory.
- The 2023 ACM SIGMETRICS Achievement Award. 2023 award citation covering his contributions to congestion control, peer-to-peer networks, community detection, and federated learning.
- Laurent Massoulié on idref.fr. French national authority record listing his Inria appointment, Argo team affiliation, and Scientific Delegate role at the Inria Paris Centre.
- Bandwidth sharing: objectives and algorithms. The 1999 INFOCOM Best Paper introducing rate-allocation models for internet bandwidth sharing.
- Peer-to-peer membership management for gossip-based protocols. The 2003 paper introducing the SCAMP gossip-membership protocol.
- Epidemic information dissemination in distributed systems. The 2004 IEEE Computer survey of epidemic-style information dissemination.
- Community detection thresholds and the weak Ramanujan property. The 2014 STOC paper providing the first rigorous proof of the symmetric-stochastic-block-model detection threshold.
- Optimal Algorithms for Non-Smooth Distributed Optimization in Networks. The 2018 NeurIPS Best Paper on optimal-complexity decentralized optimization.
- Fast Distributed Optimization with Asynchrony and Time Delays. 2021 Inria seminar on accelerated decentralized optimization.
- Photo: Laurent Massoulié's personal site at DI ENS, used as the source portrait under press-use convention for the academic personal-page photograph.