L. Lov'asz
Computational Theory and Mathematics · 1982–2014
A researcher in the Science corpus: 20 papers; trusts 41 researchers and is trusted by 79 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 43 citations into it; #385 of 12,489 by trust here, #415 by citations
- Discrete Mathematics and Combinatorics — 31 citations into it; #49 of 2,084 by trust here, #28 by citations
- Geometry and Topology — 28 citations into it; #266 of 7,435 by trust here, #219 by citations
- Mathematical Physics — 20 citations into it; #2,406 of 8,596 by trust here, #1,536 by citations
- Computer Graphics and Computer-Aided Design — 14 citations into it; #171 of 1,641 by trust here, #410 by citations
- Statistical and Nonlinear Physics — 13 citations into it; #8,396 of 10,175 by trust here, #9,727 by citations
- Statistics and Probability — 8 citations into it; #1,521 of 13,188 by trust here, #1,823 by citations
- Artificial Intelligence — 7 citations into it
Whom L. Lov'asz trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Santosh Srinivas Vempala
- Hamed Hatami
- Olav Kallenberg
- Vladimir Nikiforov
- David L. Applegate
- Vojtech Rödl
- Balázs Szegedy
- Persi Diaconis
- Christian Borgs
- David Conlon
Who trusts L. Lov'asz overall
- Sourav Chatterjee
- Blaine Nelson
- Santosh Srinivas Vempala
- Hamed Hatami
- Svante Janson
- Persi Diaconis
- Francis R. Bach
- Christian Borgs
- Martin Jaggi
- Balázs Szegedy
Papers from L. Lov'asz's perspective
Ordered by how strongly the researchers L. Lov'asz trusts endorse each paper. Same corpus, a different order for every researcher.
- The Probabilistic Method
- Limits of dense graph sequences (J. Comb. Theory B)
- Recurrence of Distributional Limits of Finite Planar Graphs
- Emergence of Scaling in Random Networks
- Counting Graph Homomorphisms
- Processes on Unimodular Random Networks
- Graph limits and exchangeable random graphs
- Emergence of Scaling in Random Networks
- The degree sequence of a scale‐free random graph process (Random Struct. Algorithms)
- Moments of Two-Variable Functions and the Uniqueness of Graph Limits
Their papers
- Hit-and-run from a corner (2004) — 305 citations
- Limits of dense graph sequences (2004) — 974 citations
- Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing (2007) — 699 citations
- Szemerédi’s Lemma for the Analyst (2007) — 299 citations
- Counting Graph Homomorphisms (2006) — 213 citations
- Moments of Two-Variable Functions and the Uniqueness of Graph Limits (2008) — 160 citations
- Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics (2012) — 355 citations
- Reflection positivity, rank connectivity, and homomorphism of graphs (2004) — 199 citations
- Large Networks and Graph Limits (2012) — 553 citations
- Simulated annealing in convex bodies and an O*(n4) volume algorithm (2006) — 295 citations
- Testing properties of graphs and functions (2008) — 90 citations
- A correction: orthogonal representations and connectivity of graphs (2000) — 56 citations
- Regularity Partitions and The Topology of Graphons (2010) — 124 citations
- Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm (2003) — 76 citations
- Geometric representations of graphs (2014) — 65 citations
- Limits of locally–globally convergent graph sequences (2012) — 97 citations
- Discrete analytic functions: An exposition (2004) — 65 citations
- The Geometry of Logconcave Functions and Sampling Algorithms ∗ (2003)
- Random Walks on Graphs: A Survey (2001) — 747 citations
- Submodular functions and convexity (1982)