Lecture

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

Description

This lecture by the instructor covers topics related to graph statistics, including random graph generation, graph homomorphisms, and network analysis. The lecture delves into the definition of functional t(F, G) for two graphs F and G, the metric for comparing networks, and practical approaches for comparing graphs. It also discusses network descriptors, fitting network models, and non-parametric summaries such as centrality measures like closeness centrality, harmonic centrality, and betweenness centrality. The lecture concludes with a discussion on clustering coefficients and parametric properties of graphs.

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.

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.