Petr Hliněný

2001

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

Whom Petr Hliněný trusts overall

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

  1. Svante Janson
  2. Béla Bollobás

Who trusts Petr Hliněný overall

  1. Gayathri Mahalingam
  2. Benny Sudakov
  3. Stanislaw P. Radziszowski

Papers from Petr Hliněný's perspective

Ordered by how strongly the researchers Petr Hliněný trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
  2. Emergence of Scaling in Random Networks
  3. Limits of dense graph sequences (J. Comb. Theory B)
  4. Graph limits and exchangeable random graphs
  5. Emergence of Scaling in Random Networks
  6. Error and attack tolerance of complex networks
  7. Breakdown of the internet under intentional attack. (Physical Review Letters)
  8. Random graphs with arbitrary degree distributions and their applications. (Physical review. E, Statistical, nonlinear, and soft matter physics)
  9. The average distances in random graphs with given expected degrees
  10. Statistical mechanics of complex networks

Their papers