Yinon Spinka

Consider a point process in Euclidean space obtained by perturbing the integer lattice with IID Gaussians. Our goal is to match the perturbed points with the points of the lattice in an invariant way and such that the typical matching distance is as...

In the late 70s, in a series of three seminal papers, Keane and Smorodinsky proved a finitary version of the Ornstein isomorphism theorem, first for Bernoulli schemes and then for Markov shifts. For Markov chains over a countable state space, the...

In this talk we will explore the connection between the two seemingly unrelated concepts appearing in the title. Phase transitions occur when a system undergoes an abrupt change in behaviour as a consequence of a small change in parameters. While...

A Lipschitz function on a graph G is a function f:V->Z from the vertex set of the graph to the integers which changes by at most 1 along any edge of the graph. Given a finite connected graph G, and fixing the value of the function to be 0 on at least...

A process Y is a factor of a process X if it can be written as Y=F(X) for some function F which commutes with translations. The factor is finitary if Y_0 is almost surely determined by some finite portion of the input X. Given a process Y, the...

Given a nonamenable transitive graph, does the plus state of the Ising model at low temperature stochastically dominate a high-density Bernoulli percolation? We'll discuss this question (asked by Liggett and Steif) and other questions of stochastic...

We present a new condition for the existence of long-range order in discrete spin systems, which emphasizes the role of entropy and high dimension. The condition applies to all symmetric nearest-neighbor discrete spin systems with an internal...

Consider two translation-invariant continuous-time processes X=(X_t) and Y=(Y_t). The two processes are isomorphic if there exists an invertible (bimeasurable) map from X to Y which commutes with translations. The map is finitary if in order to...

A process Y is a factor of a process X if it can be written as Y=F(X) for some function F which commutes with translations. The factor is finitary if Y_0 is almost surely determined by some finite portion of the input X. Given a process Y, the...