Related papers: Matching with shift for one-dimensional Gibbs meas…
In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation. This result shows that for a family of limsup sets,…
For any fixed alphabet A, the maximum topological entropy of a Z^d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z^d shifts of finite type which have topological entropy very close to this maximum,…
We consider a model of two (fully) compact polymer chains, coupled through an attractive interaction. These compact chains are represented by Hamiltonian paths (HP), and the coupling favors the existence of common bonds between the chains.…
We present a method for estimating the maximal symmetry of a continuous regression function. Knowledge of such a symmetry can be used to significantly improve modelling by removing the modes of variation resulting from the symmetries.…
We study the percolation properties of geometrical clusters defined in the overlap space of two statistically independent replicas of a square-lattice Ising model that are simulated at the same temperature. In particular, we consider two…
This paper presents an algorithm for estimating the weight of a maximum weighted matching by augmenting any estimation routine for the size of an unweighted matching. The algorithm is implementable in any streaming model including dynamic…
Matching conditions relate couplings to particle masses. We discuss the importance of one-loop matching conditions in Higgs and top-quark sector as well as the choice of the matching scale. We argue for matching scales $\mu_{0,t} \simeq…
Parallel tempering, also known as replica exchange sampling, is an important method for simulating complex systems. In this algorithm simulations are conducted in parallel at a series of temperatures, and the key feature of the algorithm is…
We study local computation algorithms (LCA) for maximum matching. An LCA does not return its output entirely, but reveals parts of it upon query. For matchings, each query is a vertex $v$; the LCA should return whether $v$ is matched -- and…
We consider suspension flows with continuous roof function over the full shift $\Sigma$ on a finite alphabet. For any positive entropy subshift of finite type $Y \subset \Sigma$, we explictly construct a roof function such that the…
Could new physics first manifest itself in Higgs self-coupling measurements? In other words, how large could deviations in the Higgs self-coupling be, if other Higgs and electroweak measurements are compatible with Standard Model…
We design a generic method for reducing the task of finding weighted matchings to that of finding short augmenting paths in unweighted graphs. This method enables us to provide efficient implementations for approximating weighted matchings…
In this paper we consider one model with nearest-neighbor interactions and with the set $[0,1]$ of spin values on the Cayley tree of order three. Translation-invariant Gibbs measures for the model are studied. Results are proved by using…
We present a systematic account of supergravity theories in which the global scaling symmetry is gauged. This generalizes the standard gaugings of non-abelian off-shell symmetries. A particular feature of these theories is an additional…
Gibbs sampling, as a model learning method, is known to produce the most accurate results available in a variety of domains, and is a de facto standard in these domains. Yet, it is also well known that Gibbs random walks usually have…
The overlap formulation is applied to calculate the chiral determinant on a two-dimensional torus with twisted boundary conditions. We evaluate first the continuum overlap, which is convergent and well-defined, and yields the correct string…
This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…
We establish a one-to-one correspondence between one-sided and two-sided regular systems of conditional probabilities on the half-line that preserves the associated chains and Gibbs measures. As an application, we determine uniqueness and…
We study numerically the magnetic susceptibility of the hierarchical model with Ising spins ($\sigma =\pm 1$) above the critical temperature and for two values of the epsilon parameter. The integrations are performed exactly, using…
The Gibbs sampler, also known as the coordinate hit-and-run algorithm, is a Markov chain that is widely used to draw samples from probability distributions in arbitrary dimensions. At each iteration of the algorithm, a randomly selected…