194 citations · 442 across the 9 of their papers we have counts for
9 papers
Theory and learning protocols for the material tempotron model
Carlo Baldassi, Alfredo Braunstein, Riccardo Zecchina
Neural networks are able to extract information from the timing of spikes. Here we provide new results on the behavior of the simplest neuronal model which is able to decode inform…
Sign problem in the Bethe approximation
A. Ramezanpour, R. Zecchina
We propose a message-passing algorithm to compute the Hamiltonian expectation with respect to an appropriate class of trial wave functions for an interacting system of fermions. To…
Cavity approach to sphere packing in Hamming space
A. Ramezanpour, R. Zecchina
In this paper we study the hard sphere packing problem in the Hamming space by the cavity method. We show that both the replica symmetric and the replica symmetry breaking approxim…
Statistical physics approach to graphical games: local and global interactions
A. Ramezanpour, J. Realpe-Gomez, R. Zecchina
In a graphical game agents play with their neighbors on a graph to achieve an appropriate state of equilibrium. Here relevant problems are characterizing the equilibrium set and di…
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…
Statistical Mechanics of Steiner trees
M. Bayati, C. Borgs, A. Braunstein +3
The Minimum Weight Steiner Tree (MST) is an important combinatorial optimization problem over networks that has applications in a wide range of fields. Here we discuss a general te…
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…
Complexity transitions in global algorithms for sparse linear systems over finite fields
A. Braunstein, M. Leone, F. Ricci-Tersenghi +1
We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Us…