10 citations · 52 across the 12 of their papers we have counts for
6 papers · 1 filter
Mallows permutations as stable matchings
Omer Angel, Alexander E. Holroyd, Tom Hutchcroft +1
We show that the Mallows measure on permutations of arises as the law of the unique Gale-Shapley stable matching of the random bipartite graph conditioned to be perfec…
Finitely dependent cycle coloring
Alexander E. Holroyd, Tom Hutchcroft, Avi Levy
We construct stationary finitely dependent colorings of the cycle which are analogous to the colorings of the integers recently constructed by Holroyd and Liggett. These colorings…
Mallows Permutations and Finite Dependence
Alexander E. Holroyd, Tom Hutchcroft, Avi Levy
We use the Mallows permutation model to construct a new family of stationary finitely dependent proper colorings of the integers. We prove that these colorings can be expressed as…
Second order logic on random rooted trees
Alexander E. Holroyd, Avi Levy, Moumanti Podder +1
We address questions of logic and expressibility in the context of random rooted trees. Infiniteness of a rooted tree is not expressible as a first order sentence, but is expressib…
Ewens sampling and invariable generation
Gerandy Brito, Christopher Fowler, Matthew Junge +1
We study the number of random permutations needed to invariably generate the symmetric group, , when the distribution of cycle counts has the strong -logarithmic property.…
Finitely Dependent Insertion Processes
Avi Levy
A -coloring of is a random process assigning one of colors to each integer in such a way that consecutive integers receive distinct colors. A process is -depe…