Chernoff bounds for expander walks - Christopher Beck
Christopher Beck Member, School of Mathematics March 10, 2015 Expander walk sampling is an important tool for derandomization. For any bounded function, sampling inputs from a random walk on an expander graph yields a sample average which is quite close to the true mean, and moreover the d
From playlist Computer Science/Discrete Mathematics
Expander Random Walks: A Fourier-Analytic Approach - Gil Cohen
Computer Science/Discrete Mathematics Seminar I Topic: Expander Random Walks: A Fourier-Analytic Approach Speaker: Gil Cohen Affiliation: Tel Aviv University Date: September 20, 2021 A random walk on expanders, despite its strong underlying correlations, poses extremely useful pseudora
From playlist Mathematics
Powered by https://www.numerise.com/ Surveys & questionnaires (2)
From playlist Collecting data
Statistics Lecture 1.5 Part 1: Sampling Techniques
From playlist Statistics Playlist 1
High Dimensional Expanders - Ori Parzanchevski
Ori Parzanchevski Hebrew University of Jerusalem; Member, School of Mathematics October 1, 2013 For more videos, visit http://video.ias.edu
From playlist Mathematics
Research Methods 1: Sampling Techniques
In this video, I discuss several types of sampling: random sampling, stratified random sampling, cluster sampling, systematic sampling, and convenience sampling. The figures presented are adopted/adapted from: https://www.pngkey.com/detail/u2y3q8q8e6o0u2t4_population-and-sample-graphic-de
From playlist Research Methods
Dimension expanders via rank condensers - Micheal Forbes
Michael Forbes Member, School of Mathematics February 3, 2015 Expander graphs are sparse graphs with good connectivity properties and they have become ubiquitous in theoretical computer science. Dimension expanders are a linear-algebraic variant where we ask for a constant number of linea
From playlist Mathematics
Building Expanders in Three Steps - Amir Yehudayoff
Amir Yehudayoff Technion-Israel; Institute for Advanced Study February 23, 2012 The talk will have 2 parts (between the parts we will have a break). In the first part, we will discuss two options for using groups to construct expander graphs (Cayley graphs and Schreier diagrams). Specifica
From playlist Mathematics
Nexus Trimester - Christian Sohler (TU Dortmund)
Testing Cluster Structure of Graphs Christian Sohler (TU Dortmund) march 07, 2016 Abstract: We study the problem of recognizing the cluster structure of a graph in the framework of property testing in the bounded degree model. Given a parameter eps, a d-bounded degree graph is defined to
From playlist 2016-T1 - Nexus of Information and Computation Theory - CEB Trimester
Random Walks on Dynamic Graphs by John Augustine
Games, Epidemics and Behavior URL: http://www.icts.res.in/discussion_meeting/geb2016/ DATES: Monday 27 Jun, 2016 - Friday 01 Jul, 2016 VENUE : Madhava lecture hall, ICTS Bangalore DESCRIPTION: The two main goals of this Discussion Meeting are: 1. To explore the foundations of policy d
From playlist Games, Epidemics and Behavior
Solving Laplacian Systems of Directed Graphs - John Peebles
Computer Science/Discrete Mathematics Seminar II Topic: Solving Laplacian Systems of Directed Graphs Speaker: John Peebles Affiliation: Member, School of Mathematics Date: March 02, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Bounded Harmonic Functions on Graphs by Itai Benjamini
PROGRAM: PROBABILISTIC METHODS IN NEGATIVE CURVATURE (ONLINE) ORGANIZERS: Riddhipratim Basu (ICTS - TIFR, Bengaluru), Anish Ghosh (TIFR, Mumbai) and Mahan M J (TIFR, Mumbai) DATE & TIME: 01 March 2021 to 12 March 2021 VENUE: Online Due to the ongoing COVID pandemic, the meeting will
From playlist Probabilistic Methods in Negative Curvature (Online)
Strongly log concave polynomials...Bases of Matroids - Shayan Oveis Gharan
More videos on http://video.ias.edu
From playlist Mathematics
Directed Laplacian Matrices - John Peebles
Short Talks by Postdoctoral Members Topic: Directed Laplacian Matrices Speaker: John Peebles Affiliation: Member, School of Mathematics Date: September 28, 2021
From playlist Mathematics
List decoding with double samplers - Inbal Livni-Navon
Computer Science/Discrete Mathematics Seminar I Topic: List decoding with double samplers Speaker: Inbal Livni-Navon Affiliation: Weizmann Institute Date: December 6, 2021 The ABNNR encoding is a classical encoding scheme that amplifies the distance of an error correcting code. The enco
From playlist Mathematics
#21. Finding the Sample Size Needed to Estimate a Population Proportion using StatCrunch
Please Subscribe here, thank you!!! https://goo.gl/JQ8Nys #21. Finding the Sample Size Needed to Estimate a Population Proportion using StatCrunch
From playlist Statistics Final Exam
Localization schemes: A framework for proving mixing bounds for Markov chains - Ronen Eldan
Computer Science/Discrete Mathematics Seminar II Topic: Localization schemes: A framework for proving mixing bounds for Markov chains Speaker: Ronen Eldan Affiliation: von Neumann Fellow, School of Mathematics Date: March 15, 2022 Two recent and seemingly-unrelated techniques for proving
From playlist Mathematics
Sigmoid functions for population growth and A.I.
Some elaborations on sigmoid functions. https://en.wikipedia.org/wiki/Sigmoid_function https://www.learnopencv.com/understanding-activation-functions-in-deep-learning/ If you have any questions of want to contribute to code or videos, feel free to write me a message on youtube or get my co
From playlist Analysis
High dimensional expanders - Part 2 - Irit Dinur
Computer Science/Discrete Mathematics Seminar II Topic: High dimensional expanders - Part 2 Speaker: Irit Dinur Affiliation: Weizmann Institute of Science; Visiting Professor, School of Mathematics Date: March 24, 2020 For more video please visit http://video.ias.edu
From playlist Mathematics