Coalescence in Branching Trees and Branching Random Walks

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


Duration: 52:18
687 views
16

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.

http://research.microsoft.com



Other Videos By Microsoft Research


2016-06-10Microsoft Research New England: An introduction
2016-06-06Python+Machine Learning tutorial - Data munging for predictive modeling with pandas and scikit-learn
2016-06-06Symposium: Deep Learning - Xiaogang Wang
2016-06-06Symposium: Deep Learning - Leon Gatys
2016-06-06Symposium: Brains, Minds and Machines - Surya Ganguli
2016-06-06Posner Lecture: Probabilistic Machine Learning - Foundations and Frontiers
2016-06-06Invited Talk: Learning with Intelligent Teacher: Similarity Control and Knowledge Transfer
2016-06-06Tutorial: High-Performance Hardware for Machine Learning
2016-06-06Making Sense of Temporal Queries with Interactive Visualization
2016-06-06Oral Session: End-To-End Memory Networks
2016-06-06Coalescence in Branching Trees and Branching Random Walks
2016-06-06Oral Session: Deep Visual Analogy-Making
2016-06-06Panel Discussion: The State of Audio Education in the Pacific Northwest
2016-06-06Panel: Progress in AI: Myths, Realities, and Aspirations
2016-06-06Juggling the Effects of Latency: Motion Prediction Approaches to Reducing Latency in Dynamic Project
2016-06-06Panel 3: Measuring Content: Evaluation, Metrics and Measuring Impact
2016-06-06Hackathon: Eye Gaze Wheelchair
2016-06-06How to Write a Great Research Paper
2016-06-06DNA Join circuit
2016-06-06Bing Code Search Add-in for Visual Studio 2013
2016-06-03Tutorial: Introduction to Reinforcement Learning with Function Approximation


Tags:
Microsoft Research
Coalescence
Branching trees