Discrete Math and Analyzing Social Graphs

  • 4.4
Approx. 20 hours to complete

Course Summary

Learn how to apply discrete math concepts to analyze social graphs and networks in this course. Gain practical skills in data analysis and visualization using Python.

Key Learning Points

  • Learn how to analyze social graphs and networks using discrete math concepts
  • Gain practical skills in data analysis and visualization using Python
  • Explore unorthodox approaches to social network analysis

Related Topics for further study


Learning Outcomes

  • Apply discrete math concepts to analyze social graphs and networks
  • Use Python to perform data analysis and visualization
  • Develop unorthodox approaches to social network analysis

Prerequisites or good to have knowledge before taking this course

  • Basic knowledge of Python programming
  • Familiarity with discrete math concepts

Course Difficulty Level

Intermediate

Course Format

  • Online
  • Self-paced

Similar Courses

  • Social Network Analysis
  • Data Analysis and Visualization

Related Education Paths


Related Books

Description

The main goal of this course is to introduce topics in Discrete Mathematics relevant to Data Analysis.

Outline

  • Basic Combinatorics
  • Why Counting
  • Rule of Sum
  • Convenient Language: Sets
  • Generalizing Rule of Sum
  • Recursive Counting: Number of Paths
  • Rule of Product
  • Number of Tuples
  • Set Language for Tuples
  • Licence Plates
  • Tuples with Restrictions
  • Permutations
  • Unordered Pairs
  • Combinations
  • Slides
  • Slides
  • Slides
  • Rule of Sum in Programming
  • Numbers Divisible by 2 or 3
  • Sets and Operations with Them
  • Generalized Rule of Sum
  • Number of Paths
  • Rule of Product
  • Rule of Product in Programming
  • Tuples
  • Tuples with Restrictions
  • Number of Segments
  • Nested For Loops
  • Splitting Datasets
  • Advanced Combinatorics
  • Pascal’s Triangle
  • Binomial Theorem
  • Practice Counting
  • Review
  • Salad
  • Combinations with Repetitions
  • Distributing Assignments Among People
  • Distributing Candies Among Kids
  • Numbers with Fixed Sum of Digits
  • Numbers with Non-increasing Digits
  • Splitting into Working Groups
  • Slides
  • Generation of Combinatorial Objects
  • Number of Salads
  • Number of Large Salads
  • Slides
  • Slides
  • Comparing Binomial Coefficients
  • Sums of Binomial Coefficients
  • Applying Binomial Theorem
  • Practice Counting
  • Number of Salads
  • Combinations with Repetitions
  • Distributing Assignments Among People
  • Distributing Candies Among Kids
  • Numbers with Fixed Sum of Digits
  • Numbers with Non-increasing Digits
  • Splitting into Working Groups
  • Problems in Combinatorics
  • Discrete Probability
  • Random experiments, outcomes and events
  • Operations on events
  • Classical probability
  • Probabilities and combinatorics
  • Probabilities and operations on events
  • Analysis of bagging procedure
  • Outcomes with non-equal probabilities
  • Experiments, outcomes and events
  • Operations on events
  • Probabilities by definition
  • Probabilities and combinatorics
  • Finding probabilities using rules
  • Outcomes with non-equal probabilities
  • Introduction to Graphs
  • The Notion of Graph
  • Trees
  • Colorings. Bipartite Graphs
  • Konigsberg Bridges. Euler Cycles
  • Constructing a Euler Cycle
  • Hamiltonian Paths
  • Acyclic Directed Graphs. Topological Sorting
  • Traversing Trees
  • Traversing Graphs: DFS and BFS
  • Slides
  • Slides
  • Slides
  • Trees
  • Coloring
  • Euler Path
  • Hamiltonian Cycle
  • Topological Sorting
  • Traversing trees
  • Basic Graph Parameters
  • Graph Invariants and Graph Isomorphism
  • Handshaking Lemma
  • Clustering Coefficients
  • Distances. Diameter. Eccentricity
  • Cliques, Independent Sets
  • Vertex Covers
  • Approximating Optimal Vertex Cover
  • Connected Graphs and Connected Components
  • Inequations on the Number of Connected Components
  • Circuit Rank
  • Slides
  • Slides
  • Slides
  • Graph Isomorphism
  • Degrees
  • Clustering Coefficient
  • Distances
  • Cliques and Independent Sets
  • Vertex Covers
  • Connected Components and Circuit Rank
  • Graphs of Social Networks
  • Social Network Graphs
  • NetworkX
  • Visualization
  • Computing Graph Parameters
  • Slides

Summary of User Reviews

Discover the world of discrete mathematics and social graph analysis in this highly engaging online course on Coursera. Learn about fundamental concepts of graph theory and its practical applications in social network analysis. Students highly recommend this course for its comprehensive content and interactive approach to teaching.

Key Aspect Users Liked About This Course

The course is highly engaging and interactive.

Pros from User Reviews

  • Comprehensive content on discrete mathematics and social graph analysis
  • Interactive approach to teaching with quizzes and exercises
  • Engaging lectures with clear explanations and examples
  • Practical applications of graph theory in social network analysis
  • Great preparation for further study or work in data science

Cons from User Reviews

  • Some students found the course challenging and required additional resources
  • Lack of personalized feedback from instructors
  • Limited interaction with other students in the course
  • Occasional technical difficulties with the Coursera platform
  • Not suitable for those without a strong background in mathematics
English
Available now
Approx. 20 hours to complete
Владимир Подольский, Ilya V. Schurov, Stepan Kuznetsov
HSE University
Coursera

Instructor

Share
Saved Course list
Cancel
Get Course Update
Computer Courses