Branching Processes: Networks, Genealogy, Avalanche

Related lectures (32)

Page 1 of 4

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

Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.

Covers percolation theory, absorbed polymers, giant molecules, phase transition, scaling assumptions, and universal behavior in percolation models.

Covers the setup of a Gitlab agent for Kubernetes, focusing on installation, version control, and troubleshooting.

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring.

Explores properties of clusters and colorability threshold in graph coloring, including average connectivity and rigidity.

Covers the normal distribution, including its properties and calculations.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.