Bo Soderberg

We investigate a class of random graph ensembles based on the Feynman graphs of multidimensional integrals, representing statistical-mechanical partition functions. We show that the resulting ensembles of random graphs strongly resemble…

We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub-coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global…

We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…

There exists a generic relationship between the thermodynamics of a continuous polymer with a generic self-interaction and the two-point function of an interacting field-theory. In addition, the (2N)-point function of the resulting field…

We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…

For combinatorial optimization problems that can be formulated as Ising or Potts spin systems, the Mean Field (MF) approximation yields a versatile and simple ANN heuristic, Deterministic Annealing. For assignment problems the situation is…

A novel artificial neural network approach to constraint satisfaction problems is presented. Based on information-theoretical considerations, it differs from a conventional mean-field approach in the form of the resulting free energy. The…