Itai Benjamini
Mathematical Physics · 2000–2013
A researcher in the Science corpus: 14 papers; trusts 14 researchers and is trusted by 52 researchers here, as inferred from the citation graph.
Subfields
- Mathematical Physics — 27 citations into it; #284 of 8,562 by trust here, #349 by citations
- Geometry and Topology — 20 citations into it; #2,865 of 7,422 by trust here, #3,547 by citations
- Statistics and Probability — 15 citations into it; #2,598 of 12,932 by trust here, #2,261 by citations
- Computational Theory and Mathematics — 9 citations into it; #1,012 of 12,182 by trust here, #2,419 by citations
- Discrete Mathematics and Combinatorics — 9 citations into it; #1,141 of 2,017 by trust here, #471 by citations
Whom Itai Benjamini trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Omer Angel
- Oded Schramm
- Volodymyr V. Nekrashevych
- Gregory F. Lawler
- Gábor Elek
- Grégory Miermont
- Jean-François Le Gall
- David J. Aldous
- William T. Gowers
- Noga Alon
Who trusts Itai Benjamini overall
- Omer Angel
- Charles Bordenave
- Russell Lyons
- Nicolas Curien
- Jian Ding
- Christian Borgs
- David J. Aldous
- Pietro Caputo
- Tim Austin
- Gábor Elek
Papers from Itai Benjamini's perspective
Ordered by how strongly the researchers Itai Benjamini trusts endorse each paper. Same corpus, a different order for every researcher.
- Uniform Infinite Planar Triangulations
- Processes on Unimodular Random Networks
- Growth and percolation on the uniform infinite planar triangulation
- Sofic equivalence relations
- The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence
- The Brownian map is the scaling limit of uniform random plane quadrangulations
- Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-Impedances
- 6.856 — Randomized Algorithms
- A measurable-group-theoretic solution to von Neumann’s problem
- The Probabilistic Method
Their papers
- Recurrence of Distributional Limits of Finite Planar Graphs (2000) — 747 citations
- Uniform spanning forests (2001) — 271 citations
- Non-backtracking random walks mix faster (2006) — 192 citations
- Is the critical percolation probability local? (2009) — 92 citations
- Critical Percolation on any Nonamenable Group has no Infinite Clusters (2011) — 80 citations
- Excited Random Walk (2003) — 132 citations
- First Passage Percolation Has Sublinear Distance Variance (2002) — 167 citations
- Coarse geometry and randomness (2013) — 50 citations
- Point-to-Point Distance in First Passage Percolation on (Tree) ×Z (2013) — 67 citations
- Simple random walk on the uniform infinite planar quadrangulation: subdiffusivity via pioneer points (2012) — 78 citations
- Unimodular random trees (2012) — 68 citations
- On the separation profile of infinite graphs (2010) — 57 citations
- Poisson asymptotics for random projections of points on a high-dimensional sphere (2009) — 63 citations
- Percolation on finite graphs and isoperimetric inequalities (2002) — 152 citations