Non-parametric regression for networks

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (33)

Convergence of Random Walks Log in to Mediaspace to watch this video

Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.

Statistical analysis of network data Log in to Mediaspace to watch this video

Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.

Expander Graphs: Properties and Eigenvalues Log in to Mediaspace to watch this video

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Network clustering Log in to Mediaspace to watch this video

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

Graphical Models: Probability Distributions and Factor Graphs Log in to Mediaspace to watch this video

Covers graphical models for probability distributions and factor graphs representation.

Graph Theory: Girth and Independence Log in to Mediaspace to watch this video

Covers girth, independence, probability, union bound, sets, and hypergraph recoloring.

Cheeger's Inequality Log in to Mediaspace to watch this video

Explores Cheeger's inequality and its implications in graph theory.

Pseudorandomness: Expander Mixing Lemma Log in to Mediaspace to watch this video

Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.

Assembly: Physics of Manufacturing Log in to Mediaspace to watch this video

Discusses the importance of assembly in manufacturing and covers common couplings, stability, and spatial vectors.

Isogenic Graphs: Spectral Analysis and Mathematical Applications Log in to Mediaspace to watch this video

Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.

Sparsest Cut: Leighton-Rao Algorithm Log in to Mediaspace to watch this video

Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.

Graph Theory Basics Log in to Mediaspace to watch this video

Introduces induced flows, basis matrices, and tree solutions in graph theory.

Design and Analysis of Experiments Log in to Mediaspace to watch this video

Covers the design and analysis of experiments, focusing on statistics for experimenters.

Page 2 of 2