Related papers: Bethe approximation for self-interacting lattice t…
Variational inference in probabilistic graphical models aims to approximate fundamental quantities such as marginal distributions and the partition function. Popular approaches are the Bethe approximation, tree-reweighted, and other types…
We discuss analytical approximation schemes for the dynamics of diluted spin models. The original dynamics of the complete set of degrees of freedom is replaced by a hierarchy of equations including an increasing number of global…
Lattice animals provide a discretized model for the theta transition displayed by branched polymers in solvent. Exact graph enumeration studies have given some indications that the phase diagram of such lattice animals may contain two…
We study the localisation of lattice polymer models near a permeable interface in two dimensions. Localisation can arise due to an interaction between the polymer and the interface, and can be altered by a preference for the bulk solvent on…
The lattice spin model with $Q$--component discrete spin variables restricted to have orientations orthogonal to the faces of $Q$-dimensional hypercube is considered on the Bethe lattice, the recursive graph which contains no cycles. The…
There are few exactly solvable lattice models and even fewer solvable quantum lattice models. Here we address the problem of finding the spectrum of the tight-binding model (equivalently, the spectrum of the adjacency matrix) on Cayley…
We propose a novel "tree-averaging" model that utilizes the ensemble of classification and regression trees (CART). Each constituent tree is estimated with a subset of similar data. We treat this grouping of subsets as Bayesian ensemble…
We solve the problem of a chain, modeled as a self-avoiding walk, grafted o the wall limiting a semi-infinite Bethe lattice of arbitrary coordination number q. In particular, we determine the pressure exerted by the polymer on the wall, as…
This article introduces a flexible and adaptive nonparametric method for estimating the association between multiple covariates and power spectra of multiple time series. The proposed approach uses a Bayesian sum of trees model to capture…
We propose a new form of the inversion method in terms of a selfenergy expansion to access the phase diagram of the Bose-Einstein transition. The dependence of the critical temperature on the interaction parameter is calculated. This is…
The main purpose of this review paper is to give systematically all the known results on phase diagrams corresponding to lattice models (Ising and Potts) on Cayley tree (or Bethe lattice) and chandelier networks. A detailed survey of…
Any spanning tree in a loopy interaction graph can be used for communicating the effect of the loopy interactions by introducing messages that are passed along the edges in the spanning tree. This defines an exact mapping of the problem on…
Finding a minimum spanning tree (MST) for $n$ points in an arbitrary metric space is a fundamental primitive for hierarchical clustering and many other ML tasks, but this takes $\Omega(n^2)$ time to even approximate. We introduce a…
We review critically the concepts and the applications of Cayley Trees and Bethe Lattices in statistical mechanics in a tentative effort to remove widespread misuse of these simple, but yet important - and different - ideal graphs. We…
We use a simple lattice statistical model to analyze the effects of directional interactions on the phase diagram of a fluid of two-state Janus particles. The problem is formulated in terms of nonlinear recursion relations along the…
Recent experiments on twisted bilayer graphene show the urgent need for establishing a low-energy lattice model for the system. We use the constrained random phase approximation to study the interaction parameters of such models taking into…
Exact analyses are given for two three-dimensional lattice systems: A system of close-packed dimers placed in layers of honeycomb lattices and a layered triangular-lattice interacting domain wall model, both with nontrivial interlayer…
In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…
We prove an inequality on decision trees on monotonic measures which generalizes the OSSS inequality on product spaces. As an application, we use this inequality to prove a number of new results on lattice spin models and their…
The magnetic properties of the mixed spin-$\frac{1}{2}$ and spin-$\frac{7}{2}$ Ising model with a crystal-field in a longitudinal magnetic field are investigated on the Bethe lattice using exact recursion relations. The ground-state phase…