Michael Krivelevich
Statistics and Probability · 2000–2012
A researcher in the Science corpus: 8 papers; trusts 6 researchers and is trusted by 22 researchers here, as inferred from the citation graph.
Subfields
- Statistics and Probability — 7 citations into it; #4,548 of 12,932 by trust here, #5,661 by citations
- Algorithms & Complexity — 5 citations into it
Whom Michael Krivelevich trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- George L. Nemhauser
- Béla Bollobás
- Noga Alon
- Alan M. Frieze
- Laurence A. Wolsey
- Richard M. Karp
- Joel H. Spencer
Who trusts Michael Krivelevich overall
- John Lenz
- D. Kühn
- Roberto Imbuzeiro Oliveira
- Sebastian M. Cioaba
- Marcelo Campos
- Daniel A. Spielman
- Terence Tao
- Noga Alon
- Frank McSherry
- Béla Bollobás
Papers from Michael Krivelevich's perspective
Ordered by how strongly the researchers Michael Krivelevich trusts endorse each paper. Same corpus, a different order for every researcher.
- Pseudo-random Graphs
- Reducibility Among Combinatorial Problems
- The critical bias for the Hamiltonicity game is $(1+o(1))n/\ln n$
- Wiley‐Interscience Series in Discrete Mathematics and Optimization
- Better bounds for Max Cut
- Tur an Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Scale-free characteristics of random networks: the topology of the world-wide web
- Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
Their papers
- On the concentration of eigenvalues of random symmetric matrices (2000) — 164 citations
- Pseudo-random Graphs (2005) — 452 citations
- The critical bias for the Hamiltonicity game is $(1+o(1))n/\ln n$ (2009) — 91 citations
- Robust Hamiltonicity of Dirac graphs (2012) — 60 citations
- On two Hamilton cycle problems in random graphs (2008) — 79 citations
- MaxCut in ${\bm H)$-Free Graphs (2005) — 51 citations
- Sparse pseudo-random graphs are Hamiltonian (2003) — 110 citations
- Efficient Testing of Large Graphs (2000) — 384 citations