On the convergence of Kikuchi's natural iteration method

In this article we investigate on the convergence of the natural iteration method, a numerical procedure widely employed in the statistical mechanics of lattice systems to minimize Kikuchi's cluster variational free energies. We discuss a sufficient condition for the convergence, based on the coefficients of the cluster entropy expansion, depending on the lattice geometry. We also show that such a condition is satisfied for many lattices usually studied in applications. Finally, we consider a recently proposed general method for the minimization of non convex functionals, showing that the natural iteration method turns out as a particular case of that method.Comment: 18 pages, 1 table, 1 figur

Variational approximations for stochastic dynamics on graphs

We investigate different mean-field-like approximations for stochastic dynamics on graphs, within the framework of a cluster-variational approach. In analogy with its equilibrium counterpart, this approach allows one to give a unified view of various (previously known) approximation schemes, and suggests quite a systematic way to improve the level of accuracy. We compare the different approximations with Monte Carlo simulations on a reversible (susceptible-infected-susceptible) discrete-time epidemic-spreading model on random graphs.Comment: 29 pages, 5 figures. Minor revisions. IOP-style

Dynamical transition in the TASEP with Langmuir kinetics: mean-field theory

We develop a mean-field theory for the totally asymmetric simple exclusion process (TASEP) with open boundaries, in order to investigate the so-called dynamical transition. The latter phenomenon appears as a singularity in the relaxation rate of the system toward its non-equilibrium steady state. In the high-density (low-density) phase, the relaxation rate becomes independent of the injection (extraction) rate, at a certain critical value of the parameter itself, and this transition is not accompanied by any qualitative change in the steady-state behavior. We characterize the relaxation rate by providing rigorous bounds, which become tight in the thermodynamic limit. These results are generalized to the TASEP with Langmuir kinetics, where particles can also bind to empty sites or unbind from occupied ones, in the symmetric case of equal binding/unbinding rates. The theory predicts a dynamical transition to occur in this case as well.Comment: 37 pages (including 16 appendix pages), 6 figures. Submitted to Journal of Physics

Dynamical Transitions in a One-Dimensional Katz–Lebowitz–Spohn Model

Dynamical transitions, already found in the high- and low-density phases of the Totally Asymmetric Simple Exclusion Process and a couple of its generalizations, are singularities in the rate of relaxation towards the Non-Equilibrium Stationary State (NESS), which do not correspond to any transition in the NESS itself. We investigate dynamical transitions in the one-dimensional Katz–Lebowitz–Spohn model, a further generalization of the Totally Asymmetric Simple Exclusion Process where the hopping rate depends on the occupation state of the 2 nodes adjacent to the nodes affected by the hop. Following previous work, we choose Glauber rates and bulk-adapted boundary conditions. In particular, we consider a value of the repulsion which parameterizes the Glauber rates such that the fundamental diagram of the model exhibits 2 maxima and a minimum, and the NESS phase diagram is especially rich. We provide evidence, based on pair approximation, domain wall theory and exact finite size results, that dynamical transitions also occur in the one-dimensional Katz–Lebowitz–Spohn model, and discuss 2 new phenomena which are peculiar to this model

Palette-colouring: a belief-propagation approach

We consider a variation of the prototype combinatorial-optimisation problem known as graph-colouring. Our optimisation goal is to colour the vertices of a graph with a fixed number of colours, in a way to maximise the number of different colours present in the set of nearest neighbours of each given vertex. This problem, which we pictorially call "palette-colouring", has been recently addressed as a basic example of problem arising in the context of distributed data storage. Even though it has not been proved to be NP complete, random search algorithms find the problem hard to solve. Heuristics based on a naive belief propagation algorithm are observed to work quite well in certain conditions. In this paper, we build upon the mentioned result, working out the correct belief propagation algorithm, which needs to take into account the many-body nature of the constraints present in this problem. This method improves the naive belief propagation approach, at the cost of increased computational effort. We also investigate the emergence of a satisfiable to unsatisfiable "phase transition" as a function of the vertex mean degree, for different ensembles of sparse random graphs in the large size ("thermodynamic") limit.Comment: 22 pages, 7 figure