MS-E1603 - Random Graphs and Network Statistics D, Lecture, 13.9.2021-21.10.2021
This course space end date is set to 21.10.2021 Search Courses: MS-E1603
Topic outline
-
The lectures follow the lecture notes: Random graphs and network statistics (Lasse Leskelä, 2019).
Updates to lecture notes are announced separately.
Online lecturer contact hours every Mon 12:15–14:00 via Zoom (Meeting ID: 665 4105 4702, https://aalto.zoom.us/j/66541054702).-
-
-
Definition and probability distribution of a Bernoulli random graph
-
Interesting events and random variables related to random graphs
-
-
Mean number of isolated nodes in dense and sparse graphs.
-
Markov's inequality related the mean and the tail of a distribution
-
Nonexistence of isolated nodes in sufficiently dense graphs.
-
-
-
Second moment method for proving that a random integer is strictly positive with high probability
-
-
Simulated Bernoulli graphs below and above the critical threshold, for n=500.
-
-
Inhomogeneous Bernoulli graphs, including latent position graph models as special cases, especially Erdös-Rényi graphs, stochastic block models, random intersection graphs, random geometric graphs, and graphons
-
Stochastic coupling method, illustration for ordering tails of binomial random variables
-
-
-
-
Stochastic ordering of inhomogeneous Bernoulli graphs
-
Connectivity of inhomogeneous Bernoulli graphs
-
-
-
-
Generating function of the population size distribution at time t
-
-
Sure extinction occurs when the mean number of children is at most one
-
Bernoulli graphs with average degree strictly larger than one admit a unique giant component
-
-
Definition of total variation distance for probability distributions on a countable space
-
Total variation theorem (i): Total variation distance equals half L1-distance
-
Total variation theorem (ii): Upper bound using an arbitrary coupling
-
Total variation theorem (iii): Existence of an optimal coupling
-
Optimal coupling of two Bernoulli distributions
-
Total variation distance for probability measures on a general measurable space (not part of course requirements)
-
Average error in binary hypothesis testing and the likelihood ratio test
-
-
Statistical similarity of Bernoulli random graphs, upper bound on total variation distance
-
Updated version (2020-09-24) of Chapter 6 in the lecture notes
-
-
Stochastic block models: definition, average degree, sparsity
-
Approximating a sum of coin flips by a Poisson distribution, a.k.a. Le Cam's inequality
-
Blockwise degree distribution in a stochastic block model
-
Mixed Poisson distribution: Definition and representation as a random integer
-
Degree distribution of a typical node in a stochastic block model
-
-
-
-
-
-
-
Expected subgraph counts in homogeneous Bernoulli random graphs.
-
Lollipops provide a famous counterexample for which the expected subgraph count can be large in a Bernoulli graph which does not contain any such lollipops with high probability.
-
-
-
Learning tasks associated with block network data.
-
Maximum likelihood estimation of the block interaction matrix when the block memberships are known (or estimated by other means)
-
Doubly stochastic block models, Bayesian approach using a prior block membership distribution
-
Estimating theoretical model subgraph densities using empirical subgraph densities computed from the observed graph sample
-
Moment method for learning block interaction parameters based on subgraph covering densities
-
-
-
Discussion about spectral graph theory techniques: graph Laplacians, random walks, adjacency matrix powers
-
Maximum likelihood estimation of block memberships in homogeneous stochastic block models, reduction to min-cut problem
-
Measuring error rates using symmetric Hamming distances, strongly and weakly consistent estimators
-
-
Transitivity (a.k.a. global clustering coefficient) of a nonrandom graph
-
-
Random intersection graphs. Presentation based on the article:
Moment-based parameter estimation in binomial random intersection graph models [J Karjalainen, L Leskelä 2017]
-
Next-generation network models: Random geometric graphs on hyperbolic spaces, network models with overlapping communities, preferential attachment and hybrid models
-