Nicolas Broutin

Mathematical Physics · 2009–2013

A researcher in the Science corpus: 3 papers; trusts 17 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

• Mathematical Physics — 24 citations into it
• Statistics and Probability — 12 citations into it
• Applied Mathematics — 8 citations into it
• Algorithms & Complexity — 7 citations into it
• Condensed Matter Physics — 6 citations into it
• Geometry and Topology — 6 citations into it
• Discrete Mathematics and Combinatorics — 5 citations into it
• Signal Processing — 5 citations into it

Whom Nicolas Broutin trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Jean-François Le Gall
2. Jean Bertoin
3. Béla Bollobás
4. Alois Panholzer
5. Bénédicte Haas
6. David J. Aldous
7. Jean-François Marckert
8. Svante Janson
9. Grégory Miermont
10. Steven N. Evans

Papers from Nicolas Broutin's perspective

Ordered by how strongly the researchers Nicolas Broutin trusts endorse each paper. Same corpus, a different order for every researcher.

1. SUBTREE PRUNE AND REGRAFT: A REVERSIBLE REAL TREE-VALUED MARKOV PROCESS
2. The Genealogy of Self-similar Fragmentations with Negative Index as a Continuum Random Tree
3. Combinatorial Stochastic Processes
4. Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered trees
5. On random trees
6. The depth first processes of Galton--Watson trees converge to the same Brownian excursion
7. The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence
8. Weak laws of large numbers in geometric probability
9. Probability and Real Trees
10. Random graphs (Wiley-Interscience series in discrete mathematics and optimization)

Their papers

• The local weak limit of the minimum spanning tree of the complete graph (2013) — 49 citations
• Cutting down trees with a Markov chainsaw (2011) — 48 citations
• The continuum limit of critical random graphs (2009) — 153 citations