Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms (Invited Talk)

Author Tobias Friedrich

Thumbnail PDF


  • Filesize: 221 kB
  • 3 pages

Document Identifiers

Author Details

Tobias Friedrich

Cite AsGet BibTex

Tobias Friedrich. Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms (Invited Talk). In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 4:1-4:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


The node degrees of large real-world networks often follow a power-law distribution. Such scale-free networks can be social networks, internet topologies, the web graph, power grids, or many other networks from literally hundreds of domains. The talk will introduce several mathematical models of scale-free networks (e.g. preferential attachment graphs, Chung-Lu graphs, hyperbolic random graphs) and analyze some of their properties (e.g. diameter, average distance, clustering). We then present several algorithms and distributed processes on and for these network models (e.g. rumor spreading, load balancing, de-anonymization, embedding) and discuss a number of open problems. The talk assumes no prior knowledge about scale-free networks, distributed computing or hyperbolic geometry.
  • power-law graphs
  • scale-free graphs
  • random graphs
  • distributed algorithms


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads