Related papers: Accuracy criterion for mean field approximations o…
Solving the error correcting code is an important goal with regard to communication theory.To reveal the error correcting code characteristics, several researchers have applied a statistical-mechanical approach to this problem. In our…
For a class of $\zz^2$ Markov Random Fields (MRFs) $\mu$, we show that the sequence of successive differences of entropies of induced MRFs on strips of height $n$ converges exponentially fast (in $n$) to the entropy of $\mu$. These strip…
Markov Random Fields (MRFs), a formulation widely used in generative image modeling, have long been plagued by the lack of expressive power. This issue is primarily due to the fact that conventional MRFs formulations tend to use simplistic…
We consider a population of $N$ individuals, of which we observe the number of actions as time evolves. For each couple of individuals $(i,j)$, $j$ may or not influence $i$, which we model by i.i.d. Bernoulli$(p)$-random variables, for some…
Belief Propagation (BP) is a widely used approximation for exact probabilistic inference in graphical models, such as Markov Random Fields (MRFs). In graphs with cycles, however, no exact convergence guarantees for BP are known, in general.…
We introduce an extension of the dynamical mean field approximation (DMFA) which retains the causal properties and generality of the DMFA, but allows for systematic inclusion of non-local corrections. Our technique maps the problem to a…
It has been shown in the past that many real-world networks exhibit community structures and non-trivial clustering which comes with the occurrence of a notable number of triangular connections. Yet the influence of such connection patterns…
Multi-agent coordination algorithms with randomized interactions have seen use in a variety of settings in the multi-agent systems literature. In some cases, these algorithms can be random by design, as in a gossip-like algorithm, and in…
We present an information-based uncertainty quantification method for general Markov Random Fields. Markov Random Fields (MRF) are structured, probabilistic graphical models over undirected graphs, and provide a fundamental unifying…
Mean-field games (MFGs) are a modeling framework for systems with a large number of interacting agents. They have applications in economics, finance, and game theory. Normalizing flows (NFs) are a family of deep generative models that…
Discrete Markov random fields form a natural class of models to represent images and spatial data sets. The use of such models is, however, hampered by a computationally intractable normalising constant. This makes parameter estimation and…
In the paper, the approximate sequence for entropy of some binary hidden Markov models has been found to have two bound sequences, the low bound sequence and the upper bound sequence. The error bias of the approximate sequence is bound by a…
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…
A number of problems in statistical physics and computer science can be expressed as the computation of marginal probabilities over a Markov random field. Belief propagation, an iterative message-passing algorithm, computes exactly such…
This paper studies a large number of homogeneous Markov decision processes where the transition probabilities and costs are coupled in the empirical distribution of states (also called mean-field). The state of each process is not known to…
In this paper, we propose a method called Convolutional Neural Network-Markov Random Field (CNN-MRF) to estimate the crowd count in a still image. We first divide the dense crowd visible image into overlapping patches and then use a deep…
The mean-field limit in a weakly interacting stochastic many-particle system for multiple population species in the whole space is proved. The limiting system consists of cross-diffusion equations, modeling the segregation of populations.…
Opinion and belief dynamics are a central topic in the study of social interactions through dynamical systems. In this work, we study a model where, at each discrete time, all the agents update their opinion as an average of their intrinsic…
We investigate local-density dependent Markov processes on a class of large graphs sampled from a graphon, where the transition rates of the vertices are influenced by the states of their neighbors. We show that as the average degree…
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact representation, inference in such models is intractable even…