Related papers: Bethe approximation for self-interacting lattice t…
We develop a theory describing density profile of the semi-flexible polymers absorbed onto a planar surface. The theoretical analysis consists of two parts. As a first part, we calculate a density profile of the adsorbed polymers by…
Stretched polymers with attractive interaction are studied in two and three dimensions. They are described by biased self-avoiding random walks with nearest neighbour attraction. The bias corresponds to opposite forces applied to the first…
We show how the theory of the critical behaviour of $d$-dimensional polymer networks of arbitrary topology can be generalized to the case of networks confined by hyperplanes. This in particular encompasses the case of a single polymer chain…
We apply the Bethe-Peierls approximation to the problem of the inverse Ising model and show how the linear response relation leads to a simple method to reconstruct couplings and fields of the Ising model. This reconstruction is exact on…
In this paper, for the first time a theory is formulated that predicts velocity and spatial correlations between occupation numbers that occur in lattice gas automata violating semi-detailed balance. Starting from a coupled BBGKY hierarchy…
In graphical models, factor graphs, and more generally energy-based models, the interactions between variables are encoded by a graph, a hypergraph, or, in the most general case, a partially ordered set (poset). Inference on such…
The dynamical behaviours of a kinetically constrained spin model (Fredrickson-Andersen model) on a Bethe lattice are investigated by a perturbation analysis that provides exact final states above the nonergodic transition point. It is…
A new supersymmetric model for electrons with generalized hopping terms and Hubbard interaction on a one-dimensional lattice is solved by means of the Bethe Ansatz. We investigate the phase diagram of this model by studying the ground state…
We present a fine-grained approach to identify clusters and perform percolation analysis in a 2D lattice system. In our approach, we develop an algorithm based on the linked-list data structure whereby the members of a cluster are nodes of…
A kernel-independent treecode (KITC) is presented for fast summation of particle interactions. The method employs barycentric Lagrange interpolation at Chebyshev points to approximate well-separated particle-cluster interactions. The KITC…
We study two free energy approximations (Bethe and plaquette-CVM) for the Random Field Ising Model in two dimensions. We compare results obtained by these two methods in single instances of the model on the square grid, showing the…
We study tree approximations to classical two-body partition functions on sparse and loopy graphs via the Brydges-Kennedy-Abdessalam-Rivasseau forest expansion. We show that for sparse graphs (with large cycles), the partition function…
Message passing equations yield a sharp percolation transition in finite graphs, as an artifact of the locally treelike approximation. For an arbitrary finite, connected, undirected graph we construct an infinite tree having the same local…
The need for interpreting machine learning models is addressed through prototype explanations within the context of tree ensembles. An algorithm named Adaptive Prototype Explanations of Tree Ensembles (A-PETE) is proposed to automatise the…
Avalanches in sandpiles are represented throughout a process of percolation in a Bethe lattice with a feedback mechanism. The results indicate that the frequency spectrum and probability distribution of avalanches resemble more to…
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…
We use series expansion techniques for analyzing properties of the phase transition between the Mott insulating and superfluid phase for bosons on the kagome lattice, and the multicritical point in the ground-state phase diagram for…
We consider the entropy of polydisperse chains placed on a lattice. In particular, we study a model for equilibrium polymerization, where the polydispersivity is determined by two activities, for internal and endpoint monomers of a chain.…
We consider the number and distribution of minima in random landscapes defined on non-Euclidean lattices. Using an ensemble where random landscapes are reweighted by a fugacity factor $z$ for each minimum they contain, we construct first a…
We develop, clarify and test various aspects of cluster methods dynamical mean field methods using a soluble toy model as a benchmark. We find that the Cellular Dynamical Mean Field Theory (C-DMFT) converges very rapidly and compare its…