Katalin Vesztergombi

Computational Theory and Mathematics · 2003–2012

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

Subfields

Whom Katalin Vesztergombi trusts overall

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

  1. L. Lov'asz
  2. Béla Bollobás

Who trusts Katalin Vesztergombi overall

  1. Sourav Chatterjee
  2. Christian Borgs
  3. Béla Bollobás
  4. Charles Bordenave
  5. Roberto Imbuzeiro Oliveira
  6. Persi Diaconis
  7. Jennifer Tour Chayes

Papers from Katalin Vesztergombi's perspective

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

  1. Limits of dense graph sequences (J. Comb. Theory B)
  2. Emergence of Scaling in Random Networks
  3. Emergence of Scaling in Random Networks
  4. Counting Graph Homomorphisms
  5. Stochastic models for the Web graph (Proceedings 41st Annual Symposium on Foundations of Computer Science)
  6. The degree sequence of a scale‐free random graph process (Random Struct. Algorithms)
  7. Mathematical results on scale‐free random graphs
  8. Directed scale-free graphs (ACM-SIAM Symposium on Discrete Algorithms)
  9. The Diameter of a Scale-Free Random Graph (Comb.)
  10. Property testing and its connection to learning and approximation

Their papers