194 citations · 563 across the 7 of their papers we have counts for
6 papers
Aligning graphs and finding substructures by a cavity approach
S. Bradde, A. Braunstein, H. Mahmoudi +3
We introduce a new distributed algorithm for aligning graphs or finding substructures within a given graph. It is based on the cavity method and is used to study the maximum-clique…
Core percolation and onset of complexity in Boolean networks
L. Correale, M. Leone, A. Pagnani +2
The determination and classification of fixed points of large Boolean networks is addressed in terms of constraint satisfaction problem. We develop a general simplification scheme…
Polynomial iterative algorithms for coloring and analyzing random graphs
A. Braunstein, R. Mulet, A. Pagnani +2
We study the graph coloring problem over random graphs of finite average connectivity . Given a number of available colors, we find that graphs with low connectivity admit a…
Coloring random graphs
R. Mulet, A. Pagnani, M. Weigt +1
We study the graph coloring problem over random graphs of finite average connectivity . Given a number of available colors, we find that graphs with low connectivity admit a…
Minimal vertex covers on finite-connectivity random graphs - a hard-sphere lattice-gas picture
Martin Weigt, Alexander K. Hartmann
The minimal vertex-cover (or maximal independent-set) problem is studied on random graphs of finite connectivity. Analytical results are obtained by a mapping to a lattice gas of h…
Multifractal analysis of perceptron learning with errors
M. Weigt
Random input patterns induce a partition of the coupling space of a perceptron into cells labeled by their output sequences. Learning some data with a maximal error rate leads to c…