Coalescence in Branching Trees and Branching Random Walks

Channel:
Microsoft Research
Subscribers:
343,000
Published on ● Video Link: https://www.youtube.com/watch?v=S9yRiak03Ic


Duration: 52:39
38 views
0

Consider a branching tree with one root at the origin. Assuming that at the n -th level there are at least two vertices. Pick two of them by simple random sampling without replacement. Now trace their lines back till they meet. Call that level X n . In this talk we discuss the behavior of the distribution of X n as n goes to infinity for the supercritical, critical, and subcritical Galton Watson branching trees. We also discuss the explosive case when the offspring mean is infinite and the offspring distribution is heavy tailed. We apply these results to study branching random walks. Some open problems will be described.



Other Videos By Microsoft Research


2016-06-22Machine Learning as Creative Tool for Designing Real-Time Expressive Interactions
2016-06-22Symposium: Deep Learning - Sergey Ioffe
2016-06-22Multi-rate neural networks for efficient acoustic modeling
2016-06-22Robust Spectral Inference for Joint Stochastic Matrix Factorization and Topic Modeling
2016-06-22Computational Limits in Statistical Inference: Hidden Cliques and Sum of Squares
2016-06-22Extreme Classification: A New Paradigm for Ranking & Recommendation
2016-06-22A Lasserre-Based (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints
2016-06-22Oral Session: Learning Theory and Algorithms for Forecasting Non-stationary Time Series
2016-06-22Recent Developments in Combinatorial Optimization
2016-06-22Invited Talks: Computational Principles for Deep Neuronal Architectures
2016-06-22Coalescence in Branching Trees and Branching Random Walks
2016-06-22Oral Session: Randomized Block Krylov Methods
2016-06-22Oral Session: Fast Convergence of Regularized Learning in Games
2016-06-22Ito Processes, Correlated Sampling and Applications
2016-06-22Statistical and computational trade-offs in estimation of sparse principal components.
2016-06-22How to Write a Great Research Paper
2016-06-22Graphical Bandits
2016-06-22Tutorial: Monte Carlo Inference Methods
2016-06-22Symposium: Deep Learning - Welcome
2016-06-22Welcome, Introductions, & Short Talk Ideas
2016-06-22Symposium: Algorithms Among Us - Panel "What if we succeed? Research priorities for beneficial AI"


Tags:
microsoft research
algorithms