Related papers: Statistical physics of loopy interactions: Indepen…

If we have a system of binary variables and we measure the pairwise correlations among these variables, then the least structured or maximum entropy model for their joint distribution is an Ising model with pairwise interactions among the…

In this paper we derive the equations for Loop Corrected Belief Propagation on a continuous variable Gaussian model. Using the exactness of the averages for belief propagation for Gaussian models, a different way of obtaining the…

We introduce a method for computing corrections to Bethe approximation for spin models on arbitrary lattices. Unlike cluster variational methods, the new approach takes into account fluctuations on all length scales. The derivation of the…

In this paper we develop a Bethe approximation, based on the cluster variation method, which is apt to study lattice models of branched polymers. We show that the method is extremely accurate in cases where exact results are known as, for…

Maximum A Posteriori inference in graphical models is often solved via message-passing algorithms, such as the junction-tree algorithm, or loopy belief-propagation. The exact solution to this problem is well known to be exponential in the…

Probabilistic graphical models offer a powerful framework to account for the dependence structure between variables, which is represented as a graph. However, the dependence between variables may render inference tasks intractable. In this…

In a series of two papers, we investigate the large deviations and asymptotic behavior of stochastic models of brain neural networks with random interaction coefficients. In this first paper, we take into account the spatial structure of…

This paper concerns the long-term behaviour of a system of interacting random walks labeled by vertices of a finite graph. The model is reversible which allows to use the method of electric networks in the study. In addition, examples of…

We consider interacting particle systems with unbounded interaction range on general countably infinite graphs $S$ and prove explicit non-asymptotic error bounds for approximations of the infinite-volume dynamics by systems of finitely many…

We derive exact density functionals for systems of hard rods with first-neighbor interactions of arbitrary shape but limited range on a one-dimensional lattice. The size of all rods is the same integer unit of the lattice constant. The…

We discuss the relationships between large deviations in stochastic systems, and "effective interactions" that induce particular rare events. We focus on the nature of these effective interactions in physical systems with many interacting…

To construct models of large, multivariate complex systems, such as those in biology, one needs to constrain which variables are allowed to interact. This can be viewed as detecting "local" structures among the variables. In the context of…

We argue that complex systems must possess long range correlations and illustrate this idea on the example of the mean field spin glass model. Defined on the complete graph, this model has no genuine concept of distance, but the long range…

Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…

The inverse statistical problem of finding direct interactions in complex networks is difficult. In the natural sciences, well-controlled perturbation experiments are widely used to probe the structure of complex networks. However, our…

Variational approximation, such as mean-field (MF) and tree-reweighted (TRW), provide a computationally efficient approximation of the log-partition function for a generic graphical model. TRW provably provides an upper bound, but the…

Given a network and a partition in communities, we consider the issues "how communities influence each other" and "when two given communities do communicate". Specifically, we address these questions in the context of small-world networks,…

Infinite-range spin-glass models with Levy-distributed interactions show a spin-glass transition with similarities to both the Sherrington-Kirkpatrick model and to disordered spin systems on finite connectivity random graphs. Despite the…

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

The collection of all the strongly connected components in a directed graph, among each cluster of which any node has a path to another node, is a typical example of the intertwining structure and dynamics in complex networks, as its…