Balázs Szegedy

Computational Theory and Mathematics · 2001–2018

A researcher in the Science corpus: 10 papers; trusts 13 researchers and is trusted by 38 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 27 citations into it; #557 of 12,182 by trust here, #855 by citations
• Geometry and Topology — 24 citations into it; #487 of 7,422 by trust here, #602 by citations
• Discrete Mathematics and Combinatorics — 22 citations into it; #43 of 2,017 by trust here, #40 by citations
• Mathematical Physics — 15 citations into it; #7,498 of 8,562 by trust here, #7,007 by citations

Whom Balázs Szegedy trusts overall

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

1. L. Lov'asz
2. Christian Borgs
3. Hamed Hatami
4. Jennifer Tour Chayes
5. Vojtech Rödl
6. Noga Alon
7. Gábor Elek
8. Itai Benjamini
9. Michael H. Freedman
10. Vladimir Naumovich Vapnik

Who trusts Balázs Szegedy overall

1. Sourav Chatterjee
2. Svante Janson
3. L. Lov'asz
4. Hamed Hatami
5. Peter Keevash
6. Terence Tao
7. Oleg Pikhurko
8. Tim Austin
9. Christian Borgs
10. Persi Diaconis

Papers from Balázs Szegedy's perspective

Ordered by how strongly the researchers Balázs Szegedy trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Probabilistic Method
2. Limits of dense graph sequences (J. Comb. Theory B)
3. Recurrence of Distributional Limits of Finite Planar Graphs
4. Processes on Unimodular Random Networks
5. Global Aspects of Ergodic Group Actions
6. Moments of Two-Variable Functions and the Uniqueness of Graph Limits
7. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities
8. Large Networks and Graph Limits (Colloquium Publications)
9. Global aspects of ergodic group actions (Mathematical Surveys and Monographs 160)
10. Efficient Testing of Large Graphs (40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039))

Their papers

• Limits of dense graph sequences (2004) — 974 citations
• Szemerédi’s Lemma for the Analyst (2007) — 299 citations
• A measure-theoretic approach to the theory of dense hypergraphs (2008) — 124 citations
• Testing properties of graphs and functions (2008) — 90 citations
• Regularity Partitions and The Topology of Graphons (2010) — 124 citations
• Transversals of additive Latin squares (2001) — 53 citations
• Action convergence of operators and graphs (2018) — 53 citations
• An information theoretic approach to Sidorenko's conjecture (2014) — 80 citations
• Limits of locally–globally convergent graph sequences (2012) — 97 citations
• Limits of Hypergraphs, Removal and Regularity Lemmas. A Non-standard Approach (2007) — 70 citations