Béla Bollobás
Statistical and Nonlinear Physics · 1984–2010
A researcher in the Science corpus: 19 papers; trusts 50 researchers and is trusted by 279 researchers here, as inferred from the citation graph.
Subfields
- Statistical and Nonlinear Physics — 78 citations into it; #56 of 10,175 by trust here, #130 by citations
- Discrete Mathematics and Combinatorics — 35 citations into it; #267 of 2,084 by trust here, #161 by citations
- Computational Theory and Mathematics — 31 citations into it; #332 of 12,489 by trust here, #521 by citations
- Mathematical Physics — 30 citations into it; #455 of 8,596 by trust here, #308 by citations
- Geometry and Topology — 26 citations into it; #30 of 7,435 by trust here, #52 by citations
- Condensed Matter Physics — 21 citations into it; #936 of 1,976 by trust here, #1,183 by citations
- Algorithms & Complexity — 18 citations into it; #88 of 516 by trust here, #38 by citations
- Computer Networks and Communications — 13 citations into it
Whom Béla Bollobás trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Albert-László Barabási
- Réka Albert
- Mark Newman
- Duncan J. Watts
- Christian Borgs
- Oliver Riordan
- Steven H. Strogatz
- L. Lov'asz
- Sergey N. Dorogovtsev
- Svante Janson
Who trusts Béla Bollobás overall
- Remco van der Hofstad
- Mark Newman
- Sourav Chatterjee
- Richard Montgomery
- Johan Wästlund
- Christian Borgs
- Duncan J. Watts
- Réka Albert
- Oliver Riordan
- Francesco Bullo
Papers from Béla Bollobás's perspective
Ordered by how strongly the researchers Béla Bollobás trusts endorse each paper. Same corpus, a different order for every researcher.
- Graph structure in the Web (Comput. Networks)
- Emergence of Scaling in Random Networks
- Random graphs with arbitrary degree distributions and their applications. (Physical review. E, Statistical, nonlinear, and soft matter physics)
- The structure of scientific collaboration networks.
- Statistical mechanics of complex networks
- The large-scale organization of metabolic networks (Nature)
- Emergence of scaling in random networks
- Scale-free characteristics of random networks: the topology of the world-wide web
- Stochastic models for the Web graph (Proceedings 41st Annual Symposium on Foundations of Computer Science)
- Breakdown of the internet under intentional attack. (Physical Review Letters)
Their papers
- Mathematical results on scale‐free random graphs (2005) — 548 citations
- Connectivity of random k-nearest-neighbour graphs (2005) — 122 citations
- Modern Graph Theory (2002) — 2,226 citations
- The phase transition in inhomogeneous random graphs (2005) — 844 citations
- Bootstrap percolation on the hypercube (2006) — 144 citations
- Metrics for sparse graphs (2007) — 100 citations
- Percolation on dense graph sequences. (2007) — 93 citations
- The critical probability for random Voronoi percolation in the plane is 1/2 (2004) — 178 citations
- The evolution of random graphs (1984)
- Bootstrap percolation in three dimensions (2008) — 114 citations
- The sharp threshold for bootstrap percolation in all dimensions (2010) — 210 citations
- A Short Proof of the Harris–Kesten Theorem (2004) — 75 citations
- The Diameter of a Scale-Free Random Graph (2004) — 657 citations
- Robustness and Vulnerability of Scale-Free Random Graphs (2004) — 319 citations
- Directed scale-free graphs (2003) — 440 citations
- A polynomial of graphs on surfaces (2002) — 177 citations
- A Polynomial Invariant of Graphs On Orientable Surfaces (2001) — 118 citations
- Random Graphs: Notation (2001) — 5,192 citations
- The degree sequence of a scale‐free random graph process (2001) — 830 citations