Tobias Friedrich visits the School of Electrical Engineering, Tel Aviv University (אוניברסיטת תל אביב) and gives a talk on "Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms" in the Network Algorithms Seminar. Hosts are Boaz Patt-Shamir and Guy Even.
Abstract: 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.
Time: Tuesday, January 31, 11:30am
Place: Kitot Handassa 011, School of Electrical Engineering, Tel Aviv University
