Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Optional Stopping Theorem: Proof and Applications
Graph Chatbot
Related lectures (29)
Previous
Page 3 of 3
Next
Compression: Kraft Inequality
Explains compression and Kraft inequality in codes and sequences.
Relative Homology: Exact Sequence
Covers the long exact sequence of relative homology groups and chain complexes.
Distributions and Derivatives
Covers distributions, derivatives, convergence, and continuity criteria in function spaces.
Fourier Transform: Properties and Applications
Covers the properties and applications of the Fourier transform and its relation to Heisenberg's uncertainty principle.
Sparsest Cut: Bourgain's Theorem
Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.
Doob's Martingale
Covers the concept of Doob's martingale and its properties, including integrability and convergence theorem.
Martingales: Definitions and Theorems
Explores martingales, adaptability, and stopping times in stochastic processes.
Proof of Convergence Rate Theorem
Covers the proof of the convergence rate theorem, emphasizing the correction of a missing factor sqrt{pi_j} in the proof.
Probability Theory: Conditional Expectation
Covers conditional expectation, convergence of random variables, and the strong law of large numbers.