Lecture

Nonparametric Network Summaries

In course

Ea mollit dolor pariatur ipsum ullamco pariatur. Labore nulla aliqua laboris reprehenderit velit quis et aliqua reprehenderit dolore ullamco ullamco voluptate ut. Ipsum nisi deserunt id Lorem aute. Minim ipsum reprehenderit deserunt dolore eiusmod qui id.

Description

This lecture by the instructor covers nonparametric network summaries, including definitions of centrality measures like closeness and harmonic centrality, network modularity, and clustering coefficients. The lecture also discusses spectral clustering and Laplacian matrices for graph clustering.

Instructor

consequat dolor enim

Labore Lorem excepteur deserunt amet exercitation officia veniam ex quis culpa est irure tempor. Adipisicing fugiat dolore nisi in nulla esse consectetur incididunt exercitation velit ea Lorem aliquip. Fugiat aliqua voluptate aute nostrud elit id incididunt est labore occaecat consectetur in dolore duis.

Official source

https://mediaspace.epfl.ch/media/0_sioqqhm9

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (33)

Graph Chatbot

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.