17 citations · 64 across the 27 of their papers we have counts for
36 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…
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…
Characterizations of amenability through stochastic domination and finitary codings
Gourab Ray, Yinon Spinka
We establish new characterizations of amenability of graphs through two probabilistic notions: stochastic domination and finitary codings (also called finitary factors). On the sto…
Random walks on regular trees can not be slowed down
Omer Angel, Jacob Richey, Yinon Spinka +1
A random walk on a regular tree (or any non-amenable graph) has positive speed. We ask whether such a walk can be slowed down by applying carefully chosen time-dependent permutatio…
Entropy-efficient finitary codings
Tom Meyerovitch, Yinon Spinka
We show that any finite-entropy, countable-valued finitary factor of an i.i.d process can also be expressed as a finitary factor of a finite-valued i.i.d process whose entropy is a…
Independent sets in random subgraphs of the hypercube
Gal Kronenberg, Yinon Spinka
Let be the random subgraph of the -dimensional hypercube , where each edge is retained independently with probability . We study the asymptotic number of…
Uniform even subgraphs and graphical representations of Ising as factors of i.i.d
Omer Angel, Gourab Ray, Yinon Spinka
We prove that the Loop O(1) model, a well-known graphical expansion of the Ising model, is a factor of i.i.d. on unimodular random rooted graphs under various conditions, including…
A tale of two balloons
Omer Angel, Gourab Ray, Yinon Spinka
From each point of a Poisson point process start growing a balloon at rate 1. When two balloons touch, they pop and disappear. Is every point contained in balloons infinitely often…
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…
Proper 3-colorings of are Bernoulli
Gourab Ray, Yinon Spinka
We consider the unique measure of maximal entropy for proper 3-colorings of , or equivalently, the so-called zero-slope Gibbs measure. Our main result is that this me…
Three lectures on random proper colorings of
Ron Peled, Yinon Spinka
A proper -coloring of a graph is an assignment of one of colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all pro…
Finitary isomorphisms of renewal point processes and continuous-time regenerative processes
Yinon Spinka
We show that a large class of stationary continuous-time regenerative processes are finitarily isomorphic to one another. The key is showing that any stationary renewal point proce…
Geometric random graphs on circles
Omer Angel, Yinon Spinka
Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 ar…
Markov chains with exponential return times are finitary
Omer Angel, Yinon Spinka
Consider an ergodic Markov chain on a countable state space for which the return times have exponential tails. We show that the stationary version of any such chain is a finitary f…
Finitary codings for gradient models and a new graphical representation for the six-vertex model
Gourab Ray, Yinon Spinka
It is known that the Ising model on at a given temperature is a finitary factor of an i.i.d. process if and only if the temperature is at least the critical tempera…
A short proof of the discontinuity of phase transition in the planar random-cluster model with
Gourab Ray, Yinon Spinka
The goal of this paper is to provide a short proof of the discontinuity of phase transition for the random-cluster model on the square lattice with parameter . This result was…
Mixing properties of colorings of the lattice
Noga Alon, Raimundo Briceño, Nishant Chandgotia +2
We study and classify proper -colorings of the lattice, identifying three regimes where different combinatorial behavior holds: (1) When , there exist fr…
Pairwise optimal coupling of multiple random variables
Omer Angel, Yinon Spinka
We generalize the optimal coupling theorem to multiple random variables: Given a collection of random variables, it is possible to couple all of them so that any two differ with pr…
Finitely dependent processes are finitary
Yinon Spinka
We show that any finitely dependent invariant process on a transitive amenable graph is a finitary factor of an i.i.d. process. With an additional assumption on the geometry of the…