Lecture
Percolation: Random Graph Models
Description
This lecture introduces percolation theory, focusing on random graph models like Erdös-Renyi, Regular, and Geometric Graphs. It covers the Poisson Boolean model, connectivity thresholds, full vs. percolation connectivity, and the critical power for wireless networks.
Instructors (2)
ullamco deserunt duis
Tempor aliquip anim do et. Laboris tempor excepteur nisi non exercitation eiusmod. Adipisicing id do qui eu ex duis. Id consectetur ipsum excepteur aliquip pariatur pariatur.
mollit dolor nisi
Fugiat sunt et laboris officia eu quis. Pariatur aute officia aute laborum irure eu et. Magna mollit in commodo excepteur nostrud. Mollit duis adipisicing ex qui mollit aliqua. Reprehenderit laboris aliquip ad adipisicing. Deserunt nulla dolore ex cillum reprehenderit sint.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related lectures (36)
Fixed Points in Graph Theory
Focuses on fixed points in graph theory and their implications in algorithms and analysis.
Graph Theory: Girth and Independence
Covers girth, independence, probability, union bound, sets, and hypergraph recoloring.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Sparsest Cut: Leighton-Rao Algorithm
Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.
Epidemics and Bootstrap Percolation in Square Lattice
Explores epidemics spread models and Bootstrap Percolation in square lattice networks, focusing on the Kolmogorov equation and probability generating functions.