8 citations · 10 across the 9 of their papers we have counts for
14 papers · 1 filter
Random homomorphisms and Lipschitz functions on trees
Alon Heller, Yinon Spinka
A graph homomorphism is an integer-valued function on the vertex set of a graph that assigns values differing by exactly one to adjacent vertices. We consider uniformly random homo…
Optimal factor matchings for point processes on non-amenable unimodular graphs
Yinon Spinka, Oren Yakir
Consider a unit-intensity point process on the vertex set of a transitive non-amenable unimodular graph. We study invariant matchings between and having small typic…
Optimal matchings of randomly perturbed lattices
Dor Elboim, Yinon Spinka, Oren Yakir
Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the la…
Finitary codings and stochastic domination for Poisson representable processes
Yinon Spinka
Construct a random set by independently selecting each finite subset of the integers with some probability depending on the set up to translations and taking the union of the selec…
A new proof of finitary isomorphism for Markov chains
Yinon Spinka
We give a new proof of a result of Rudolph stating that a countable-state mixing Markov chain with exponential return times is finitarily isomorphic to an IID process. Besides bein…
On the local convergence of integer-valued Lipschitz functions on regular trees
Nathaniel Butler, Kesav Krishnan, Gourab Ray +1
We study random integer-valued Lipschitz functions on regular trees. It was shown by Peled, Samotij and Yehudayoff that such functions are localized, however, finer questions about…