N. Wormald
Statistical and Nonlinear Physics · 1979–2008
A researcher in the Science corpus: 4 papers; trusts 5 researchers and is trusted by 7 researchers here, as inferred from the citation graph.
Subfields
- Statistical and Nonlinear Physics — 12 citations into it
- Computational Theory and Mathematics — 6 citations into it; #4,929 of 12,182 by trust here, #7,851 by citations
Whom N. Wormald trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Vivek Shripad Borkar
- Béla Bollobás
- Albert-László Barabási
- Daniel Fernholz
- William Aiello
- Fan Chung Graham
- Andreas J. Winter
Who trusts N. Wormald overall
- Roberto Imbuzeiro Oliveira
- Brendan D. McKay
- Joseph K. Blitzstein
- Jeffrey W. Miller
- Giovanni Neglia
- Tom Britton
- Joel A. Tropp
- Steven R. Howard
- Ankit Singla
- Andrei M. Raigorodskii
Papers from N. Wormald's perspective
Ordered by how strongly the researchers N. Wormald trusts endorse each paper. Same corpus, a different order for every researcher.
- Emergence of scaling in random networks
- Graph structure in the Web (Comput. Networks)
- A random graph model for massive graphs (Symposium on the Theory of Computing)
- Scale-free characteristics of random networks: the topology of the world-wide web
- The large-scale organization of metabolic networks (Nature)
- A Random Graph Model for Power Law Graphs (Experimental Mathematics)
- Directed graphs, Hamiltonicity and doubly stochastic matrices
- The power of two random choices: a survey of tech-niques and results
- The k-orientability thresholds for Gn, p
- Balanced Allocations
Their papers
- Distribution of subgraphs of random regular graphs (2008) — 49 citations
- The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation (2007) — 73 citations
- Uniform Generation of Random Regular Graphs of Moderate Degree (1990)
- A 4-chromatic graph with a special plane drawing (1979)