The Scaling Limit of Diaconis-Fulton Addition

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


Duration: 1:00:41
85 views
1

Given finite sets A and B in the lattice, the Diaconis-Fulton sum is a random set obtained by starting one particle at every point of their symmetric difference, and two particles at every point of their intersection. Each extra particle performs random walk until it reaches an unoccupied site. The law of the resulting random occupied set A+B does not depend on the order of the walks. We find the (deterministic) scaling limit of the sums A+B when A and B consist of the lattice points in some overlapping domains in Euclidean space. The limit is described by focusing on the odometer of the process, which solves a free boundary obstacle problem for the Laplacian. Joint work with Yuval Peres.



Other Videos By Microsoft Research


2016-09-06Feedback Arc Sets and Girth in Digraphs
2016-09-06Anomaly Detection in Large Networks using Approximation Techniques [1/7]
2016-09-06Network Visualization: Two new strategies and their case study evaluations
2016-09-06From Sensors to Semantics: Intelligent Context for Situated Computing [1/4]
2016-09-06Learning Models of Human Activities and Interactions using Multi-Modal Wearable Sensors
2016-09-06I heard it on the network: Recent Transformations in Online Music Fandom
2016-09-06Expressive Speech-Driven Facial Animation
2016-09-06Super Crunchers: Why Thinking-by-Numbers is the New Way to Be Smart
2016-09-06Casual Games Discussion
2016-09-06Universal techniques to analyze preferential attachment trees: Global and Local analysis
2016-09-06The Scaling Limit of Diaconis-Fulton Addition
2016-09-06A Game Developer's Perspective On Parallelism
2016-09-06The IonP2P Project: Empirical Characterizations of P2P Systems
2016-09-06Variable-Aperture Photography
2016-09-06Candidate talk: Domain Adaptation with Structural Correspondence Learning
2016-09-06Developmental Programming and Distributed Robot Control
2016-09-06The History and Future of Serious Games         
2016-09-06Machine Learning Exploration Of Brain fMRI Data To Study Inhibitory Control Mechanisms
2016-09-06Combining Static and Dynamic Analysis for Bug Finding
2016-09-06Counterexamples in the Central Limit Theory of Markov Chains
2016-09-06Ender’s Game for Science: Games for Real, for Now, or we Lose the Brain War           


Tags:
microsoft research