Andrei M. Raigorodskii
Geometry and Topology · 2000–2013
A researcher in the Science corpus: 5 papers; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Geometry and Topology — 6 citations into it
Whom Andrei M. Raigorodskii trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Andrei M. Raigorodskii's perspective
Ordered by how strongly the researchers Andrei M. Raigorodskii trusts endorse each paper. Same corpus, a different order for every researcher.
- Scale-free characteristics of random networks: the topology of the world-wide web
- Graph structure in the Web (Comput. Networks)
- The large-scale organization of metabolic networks (Nature)
- Emergence of scaling in random networks
- A Random Graph Model for Power Law Graphs (Experimental Mathematics)
- Pseudo-random Graphs
- The phase transition in inhomogeneous random graphs (Random Struct. Algorithms)
- Percolation on finite graphs and isoperimetric inequalities
- Stretched Exponential Fixation in Stochastic Ising Models at Zero Temperature
- Sharp metastability threshold for two-dimensional bootstrap percolation
Their papers
- On the chromatic number of a space (2000) — 149 citations
- Coloring Distance Graphs and Graphs of Diameters (2013) — 140 citations
- Around Borsuk’s hypothesis (2008) — 68 citations
- Surveys in Contemporary Mathematics: Three lectures on the Borsuk partition problem (2007) — 68 citations
- Borsuk's problem and the chromatic numbers of some metric spaces (2001) — 204 citations