YoVDO

Sublinear Algorithms in Social Networks via Core-Periphery Decomposition

Offered By: Simons Institute via YouTube

Tags

Social Networks Courses Graph Theory Courses Data Structures Courses Computational Complexity Courses Network Analysis Courses Shortest Path Algorithms Courses Sublinear Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 40-minute lecture on sublinear algorithms in social networks, focusing on core-periphery decomposition. Delve into the research of Omri Ben-Eliezer from the Simons Institute as he discusses practical sublinear algorithms for large networks. Examine how structural characteristics like heavy-tailed degree distribution and core-periphery structure can be leveraged to design fast algorithms. Learn about a hierarchical core-periphery decomposition data structure that requires sublinear preprocessing and accelerates tasks such as node sampling, triangle sampling, and shortest path computations. Gain insights into the balance between theoretical justifications and empirical results in this domain. Discover the collaborative efforts behind this research, involving work with Sabyasachi Basu, Talya Eden, Dimitris Fotakis, Nadia Koshima, Joel Oren, Tim Rieder, and C. Seshadhri.

Syllabus

Sublinear algorithms in social networks via core-periphery decomposition


Taught by

Simons Institute

Related Courses

Unordered Data Structures
University of Illinois at Urbana-Champaign via Coursera
Determine Shortest Paths Between Routers Using Python
Coursera Project Network via Coursera
Trees and Graphs: Basics
University of Colorado Boulder via Coursera
Executing Graph Algorithms with GraphFrames on Databricks
Pluralsight
Graph Theory Algorithms
Udemy