Related papers: From Cycle Rooted Spanning Forests to the Critical…
The XOR-Ising model on a graph consists of random spin configurations on vertices of the graph obtained by taking the product at each vertex of the spins of two independent Ising models. In this paper, we explicitly relate loop…
We define two families of determinantal random spanning subgraphs of a finite connected graph, one supported by acyclic spanning subgraphs (spanning forests) with fixed number of connected components, the other by connected spanning…
In this paper we study the effect of dependence on detecting a class of structured signals in Ferromagnetic Ising models. Natural examples of our class include Ising Models on lattices, and Mean-Field type Ising Models such as dense…
The corrections to finite-size scaling in the critical two-point correlation function G(r) of 2D Ising model on a square lattice have been studied numerically by means of exact transfer-matrix algorithms. The systems of square geometry with…
Decision trees are popular machine learning models that are simple to build and easy to interpret. Even though algorithms to learn decision trees date back to almost 50 years, key properties affecting their generalization error are still…
The dielectric function method (DFM), which uses a non-adiabatic approach to calculate the critical temperatures for superconductivity, has been quite successful in describing superconductors at low carrier densities. This regime of carrier…
Given a bounded Riemann surface $M$ of finite topological type, we show the existence of a universal and conformally invariant scaling limit for the Temperleyan cycle-rooted spanning forest on any sequence of graphs which approximate $M$ in…
The critical behavior of the random transverse-field Ising model in finite dimensional lattices is governed by infinite disorder fixed points, several properties of which have already been calculated by the use of the strong disorder…
In this PhD thesis we develop the frame work of triple crossing diagram maps (TCD maps), which describes constrained configurations of points in projective spaces and discrete dynamics on these configurations. We are able to capture the…
We introduce a new version of discrete holomorphic observables for the critical planar Ising model. These observables are holomorphic spinors defined on double covers of the original multiply connected domain. We compute their scaling…
We study a higher-order Painlev\'{e}-type equation, arising as a string equation of the $3^{rd}$ order reduction of the KP hierarchy. This equation appears at the multi-critical point of the $2$-matrix model with quartic interactions, and…
We present a innovative relationship between ground states of the Ising model and dimer coverings which sheds new light on the Ising Models with highly degenerated ground states and enables one to construct such models. Thanks to this…
The Ising model is well-known for illustrating the fundamental characteristics of phase transitions in closed systems. In this article, we propose a generalization of the two-dimensional Ising model to open systems, considering the…
We use computer simulations to investigate the extended phase diagram of a supercooled liquid linearly coupled to a quenched reference configuration. An extensive finite-size scaling analysis demonstrates the existence of a random-field…
We present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components along with subsets of at most three vertices into a tree. The polynomial time algorithm…
I derive a formulation of the 2-dimensional critical Ising model on non-uniform simplicial lattices. Surprisingly, the derivation leads to a set of geometric constraints that a lattice must satisfy in order for the model to have a…
In this paper, we study the effect of dependence on detecting a class of signals in Ising models, where the signals are present in a structured way. Examples include Ising Models on lattices, and Mean-Field type Ising Models…
A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended…
We demonstrate that the Ising model on a general triangular graph with 3 distinct couplings $K_1,K_2,K_3$ corresponds to an affine transformed conformal field theory (CFT). Full conformal invariance of the $c= 1/2$ minimal CFT is restored…
We develop a method to prove that certain percolation processes on amenable random rooted graphs are factors of iid (fiid), given that the process is a monotone limit of random finite subgraphs that satisfy a certain independent stochastic…