Social Networks: Weak Ties and Triadic Closure

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (20)

Page 2 of 2

Clustering: Dimensionality Reduction

Explores clustering and dimensionality reduction techniques in finance to clean and simplify data.

Statistical Analysis of Network Data: Structures and Models

Explores statistical analysis of network data, covering graph structures, models, statistics, and sampling methods.

Biclustering: Networks MA448

Explores biclustering in data matrices, identifying coherent behavior patterns and discussing computational methods for analysis.

Algorithmic Paradigms for Dynamic Graph Problems

Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.

Graph Coloring: Theory and Applications

Explores graph coloring theory, spectral clustering, community detection, and network structures.

Graph Mining: Social Networks and Data Analysis

Explores graph mining in social networks, covering data analysis and community detection.

Business Models in Communications

Explores business models of popular platforms, impact of targeted advertising, filter bubbles, online harassment, and technology in politics.

Stochastic Blockmodel Estimation

Explores Stochastic Blockmodel estimation, spectral clustering, network modularity, Laplacian matrix, and k-means clustering.

Graph Mining: Social Networks Analysis

Explores graph mining in social networks, covering modularity algorithms and community detection.

Modularity: Community Detection Algorithms

Explores the Louvain Modularity Algorithm for optimizing community quality through modularity and its applications in social network analysis.