Concept

Clustering coefficient

Related lectures (21)

Graph Statistics: Random Graphs, Graph Homomorphisms, and Network Analysis

Explores graph statistics, random graph generation, network analysis, centrality measures, and clustering coefficients.

Explores centrality, hubs, eigenvectors, clustering coefficients, small-world networks, network failures, and percolation theory in brain networks.

Clustering: Dimensionality Reduction

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

Centrality and Hubs

Delves into centrality and hubs in network neuroscience, exploring node importance, small-world networks, brain structural connectome, and percolation theory.

Neural Signals and Connectomes

Explores neural signals, connectomes, graph theory, and multi-voxel pattern analysis in fMRI trials.

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 metrics: Statistical analysis

Explores graph metrics and statistical analysis in network clustering, including ERGMs application in sociology and asymptotics.

Clusters and Communities

Explores clustering, community detection, K-means, GMM, modularity, and the Louvain method.

Graph Mining: Social Networks and Data Analysis

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

Algorithms: Union Find and Minimum Spanning Trees

Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.

Handling Networks: Graph Theory

Covers the fundamentals of handling networks and centrality measures in graph theory.

Social and Information Networks: Structure

Explores the structure of social and information networks, focusing on giant components, clustering, tie formation, and network connectivity.

Handling Network Data

Covers handling network data, types of graphs, centrality measures, and properties of real-world networks.

Virus Propagation and Growing Networks

Explores virus propagation, network resilience, and growing networks dynamics.

Network clustering

Explores network clustering, spectral clustering, k-means algorithm, eigenvalue properties, block model estimation, and structural similarity measurement.

Social Networks: Weak Ties and Triadic Closure

Explores weak ties' significance in social networks, job finding, and information diffusion, emphasizing the Triadic Closure principle and the paradox of weak ties in job finding.

Learning from the Interconnected World with Graphs

Explores learning from interconnected data using graphs, covering challenges, GNN design, research landscapes, and democratization of Graph ML.

Handling Networks: Graph Theory

Explores graph theory concepts, centrality measures, and real-world network properties, providing insights into handling diverse types of networks.

Graph Models and Brain Connectomics

Explores graph theory in brain connectomics, MRI applications, network analysis relevance, and individual fingerprinting.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Related lectures (21)

Graph Statistics: Random Graphs, Graph Homomorphisms, and Network Analysis

Explores graph statistics, random graph generation, network analysis, centrality measures, and clustering coefficients.

Centrality and Hubs

Explores centrality, hubs, eigenvectors, clustering coefficients, small-world networks, network failures, and percolation theory in brain networks.

Clustering: Dimensionality Reduction

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

Centrality and Hubs

Delves into centrality and hubs in network neuroscience, exploring node importance, small-world networks, brain structural connectome, and percolation theory.

Neural Signals and Connectomes

Explores neural signals, connectomes, graph theory, and multi-voxel pattern analysis in fMRI trials.

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 metrics: Statistical analysis

Explores graph metrics and statistical analysis in network clustering, including ERGMs application in sociology and asymptotics.

Clusters and Communities

Explores clustering, community detection, K-means, GMM, modularity, and the Louvain method.

Graph Mining: Social Networks and Data Analysis

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

Algorithms: Union Find and Minimum Spanning Trees

Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.

Handling Networks: Graph Theory

Covers the fundamentals of handling networks and centrality measures in graph theory.

Social and Information Networks: Structure

Explores the structure of social and information networks, focusing on giant components, clustering, tie formation, and network connectivity.

Handling Network Data

Covers handling network data, types of graphs, centrality measures, and properties of real-world networks.

Virus Propagation and Growing Networks

Explores virus propagation, network resilience, and growing networks dynamics.

Network clustering

Explores network clustering, spectral clustering, k-means algorithm, eigenvalue properties, block model estimation, and structural similarity measurement.

Social Networks: Weak Ties and Triadic Closure

Explores weak ties' significance in social networks, job finding, and information diffusion, emphasizing the Triadic Closure principle and the paradox of weak ties in job finding.

Learning from the Interconnected World with Graphs

Explores learning from interconnected data using graphs, covering challenges, GNN design, research landscapes, and democratization of Graph ML.

Handling Networks: Graph Theory

Explores graph theory concepts, centrality measures, and real-world network properties, providing insights into handling diverse types of networks.

Graph Models and Brain Connectomics

Explores graph theory in brain connectomics, MRI applications, network analysis relevance, and individual fingerprinting.