Louigi Addario-Berry

Mathematical Physics · 2007–2013

A researcher in the Science corpus: 6 papers; trusts 24 researchers and is trusted by 14 researchers here, as inferred from the citation graph.

Subfields

• Mathematical Physics — 33 citations into it; #2,011 of 8,562 by trust here, #2,288 by citations
• Statistics and Probability — 17 citations into it; #4,217 of 12,932 by trust here, #5,294 by citations
• Condensed Matter Physics — 10 citations into it
• Applied Mathematics — 8 citations into it; #2,624 of 7,620 by trust here, #3,589 by citations
• Algorithms & Complexity — 7 citations into it
• Artificial Intelligence — 7 citations into it
• Geometry and Topology — 6 citations into it; #4,710 of 7,422 by trust here, #5,351 by citations
• Statistical and Nonlinear Physics — 6 citations into it; #5,869 of 10,127 by trust here, #8,981 by citations

Whom Louigi Addario-Berry 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. Svante Janson
6. Bénédicte Haas
7. David J. Aldous
8. Jean-François Marckert
9. Thomas Duquesne
10. Nicholas I. Fisher

Who trusts Louigi Addario-Berry overall

1. Zhan Shi
2. Igor Kortchemski
3. Elliot Paquette
4. L. Arguin
5. Elie Aidékon
6. Ofer Zeitouni
7. Konstantinos Panagiotou
8. Jian Ding
9. Thomas Madaule
10. Matthew I. Roberts

Papers from Louigi Addario-Berry's perspective

Ordered by how strongly the researchers Louigi Addario-Berry 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. A limit theorem for the contour process of condidtioned Galton--Watson trees
4. Combinatorial Stochastic Processes
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. Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered trees
9. Random Trees: An Interplay between Combinatorics and Probability
10. Weak laws of large numbers in geometric probability

Their papers

• Minima in branching random walks (2007) — 157 citations
• Ballot Theorems, Old and New (2008) — 59 citations
• 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
• Sub-Gaussian tail bounds for the width and height of conditioned Galton--Watson trees (2010) — 64 citations
• The continuum limit of critical random graphs (2009) — 153 citations