7 papers
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…
A noisy min-max game on trees
Omer Angel, Gourab Ray, Yinon Spinka
We study a noisy version of a min-max type zero-sum game on the -ary tree. Each edge of the tree is assigned an i.i.d.\ cookie, distributed uniformly on . The game is…
Long-range order in discrete spin systems
Ron Peled, Yinon Spinka
We establish long-range order for discrete nearest-neighbor spin systems on satisfying a certain symmetry assumption, when the dimension is higher than an explic…
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 typ…
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…