2 citations · 4 across the 5 of their papers we have counts for
5 papers
Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
Steven N. Evans, Daniel Lanoue
Given an edge-weighted tree with leaves, sample the leaves uniformly at random without replacement and let , , be the length of the subtree spanned by t…
The Compulsive Gambler Process
David Aldous, Daniel Lanoue, Justin Salez
In the compulsive gambler process there is a finite set of agents who meet pairwise at random times ( and meet at times of a rate- Poisson process) and, upon meeting…
The Metric Coalescent
Daniel Lanoue
The Metric Coalescent (MC) is a measure-valued Markov Process generalizing the classical Kingman Coalescent. We show how the MC arises naturally from a discrete agent based model (…
The iPod Model
Daniel Lanoue
We introduce a Voter Model variant, inspired by social evolution of musical preferences. In our model, agents have preferences over a set of songs and upon meeting update their own…
A family of non-isomorphism results
Collin Bleak, Daniel Lanoue
We give a short argument showing that if , then the groups mV and nV are not isomorphic. This answers a question of Brin.