Free Online Course offered by MIT OpenCourseWare as an Introduction To Network Models
Topics include spectral graph theory, notions of centrality, random graph models, contagion phenomena, cascades and diffusion, and opinion dynamics.
- English
Tutor Name
MIT Open Course WareAbout the Course
MIT OpenCourseWare is offering a free online course on the theme of “Introduction To Network Models”.
This course provides an introduction to complex networks and their structure and function, with examples from engineering, applied mathematics, and social sciences.
Prerequisites:
Before registering for 1.022, students should complete the following courses or obtain permission from the instructor:
- 1.00 Engineering Computation and Data Science or 1.000 Computer Programming for Engineering Applications
- 1.010 Uncertainty in Engineering
- 18.03 Differential Equations
Topics:
Course specifics, motivation, and intro to graph theory:
- Course specifics: times, office hours, homework, exams, bibliography, etc.
- General motivation: What are networks? What is network science? Impacts, ubiquity, historical background, examples.
- Course description and contents: A quick overview of the things that we are going to learn.
- Basic graph theory: vertices, edges, directed graphs, simple graphs, weighted graphs, neighborhoods, degree, path, cycle.
Introduction to graph theory:
- More on graph theory: Connectivity, components, giant components, distance, small-world phenomenon, adjacency and incidence matrices.
Strong and weak ties, triadic closure, and homophily:
- Homework 1 distributed
Centrality measures:
- Detection and identication of important agents.
- Degree, closeness, betweenness, eigenvector, and Katz centrality.
Centrality and web search, spectral graph theory:
- Page rank and web search.
- Eigenvalues and eigenvectors of graph matrices and their properties.
- Quadratic forms on graphs and Laplacian.
Spectral graph theory, spectral clustering, and community detection:
- Properties of graph Laplacian.
- Derive spectral clustering formulation as a relaxation of modularity maximization.
- Community detection using ratio cut criterion.
- Homework 2 distributed during Lecture 6
See more availablegrants on For9a
See more available jobs in Egypt on For9a
Taught by
MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity. The idea is simple: to publish all of our course materials online and make them widely available to everyone.”
Read more.