The Social Network model
At time 0 start several independent lazy simple random walks on a finite or infinite connected graph (for instance, start with 1 walker at each vertex). When two walkers visit the same vertex at the same time they are declared acquaintance. The social connectivity time is defined to be the minimal time in which any two walkers have a path of acquaintances between them. The main result in the finite settings (Joint work with Itai Benjamini and Gady Kozma) is poly-logarithmic bounds on the social connectivity time (when the underlying graph is of bounded degree). As time permits a joint work with Ben Morris, Allan Sly and Chuan Qin in which we study the model on infinite graphs will also be discussed. The main question studied: Is it true that a.s. any two walkers will have a path of acquaintances between them? The answer provides a characterization of amenability.
Speaker Details
Jonathan Hermon is currently a p.h.d student at UC Berkeley (statistics). He wrote a Master’s Thesis at the Weizman Institute with Itai Benjamini as advisor.
- Series:
- Microsoft Research Talks
- Date:
- Speakers:
- Jonathan Hermon
- Affiliation:
- UC Berkeley
-
-
Jeff Running
-
Series: Microsoft Research Talks
-
-
-
-
Galea: The Bridge Between Mixed Reality and Neurotechnology
Speakers:- Eva Esteban,
- Conor Russomanno
-
Current and Future Application of BCIs
Speakers:- Christoph Guger
-
Challenges in Evolving a Successful Database Product (SQL Server) to a Cloud Service (SQL Azure)
Speakers:- Hanuma Kodavalla,
- Phil Bernstein
-
Improving text prediction accuracy using neurophysiology
Speakers:- Sophia Mehdizadeh
-
-
DIABLo: a Deep Individual-Agnostic Binaural Localizer
Speakers:- Shoken Kaneko
-
-
Recent Efforts Towards Efficient And Scalable Neural Waveform Coding
Speakers:- Kai Zhen
-
-
Audio-based Toxic Language Detection
Speakers:- Midia Yousefi
-
-
From SqueezeNet to SqueezeBERT: Developing Efficient Deep Neural Networks
Speakers:- Sujeeth Bharadwaj
-
Hope Speech and Help Speech: Surfacing Positivity Amidst Hate
Speakers:- Monojit Choudhury
-
-
-
-
-
'F' to 'A' on the N.Y. Regents Science Exams: An Overview of the Aristo Project
Speakers:- Peter Clark
-
Checkpointing the Un-checkpointable: the Split-Process Approach for MPI and Formal Verification
Speakers:- Gene Cooperman
-
Learning Structured Models for Safe Robot Control
Speakers:- Ashish Kapoor
-
-