Nathanael Leedom Ackerman

Geometry and Topology · 2012

A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Nathanael Leedom Ackerman trusts overall

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

  1. Tim Austin
  2. Persi Diaconis
  3. Alexander A. Razborov
  4. Svante Janson
  5. L. Lov'asz
  6. Balázs Szegedy

Papers from Nathanael Leedom Ackerman's perspective

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

  1. Graph limits and exchangeable random graphs
  2. On exchangeable random variables and the statistics of large graphs and hypergraphs
  3. Limits of dense graph sequences (J. Comb. Theory B)
  4. Flag algebras (Journal of Symbolic Logic (JSL))
  5. Regularity Partitions and The Topology of Graphons
  6. La prévision : ses lois logiques, ses sources subjectives
  7. Recurrence of Distributional Limits of Finite Planar Graphs
  8. Emergence of Scaling in Random Networks
  9. The degree sequence of a scale‐free random graph process (Random Struct. Algorithms)
  10. Processes on Unimodular Random Networks

Their papers