Vera T. Sós

Computational Theory and Mathematics · 2001–2012

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

Subfields

Whom Vera T. Sós trusts overall

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

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

Who trusts Vera T. Sós overall

  1. Sourav Chatterjee
  2. Christian Borgs
  3. Béla Bollobás
  4. Jennifer Tour Chayes
  5. Charles Bordenave
  6. Roberto Imbuzeiro Oliveira
  7. Persi Diaconis
  8. Roman Glebov
  9. L. Lov'asz

Papers from Vera T. Sós's perspective

Ordered by how strongly the researchers Vera T. Sós 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. Stochastic models for the Web graph (Proceedings 41st Annual Symposium on Foundations of Computer Science)
  4. Emergence of Scaling in Random Networks
  5. Counting Graph Homomorphisms
  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