#### Filter Results:

- Full text PDF available (52)

#### Publication Year

1946

2017

- This year (2)
- Last 5 years (26)
- Last 10 years (47)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

Learn More

- Alfredo Braunstein, Marc Mézard, Riccardo Zecchina
- Random Struct. Algorithms
- 2005

We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be most difficult when α = M/N is close to the experimental threshold αc separating the region where almost all formulas are SAT from the region where all formulas are UNSAT. Recent… (More)

- Alfredo Braunstein, Riccardo Zecchina
- ArXiv
- 2003

It has been shown experimentally that a decimation algorithm based on Survey Propagation (SP) equations allows to solve efficiently some combinatorial problems over random graphs. We show that these equations can be derived as sum-product equations for the computation of marginals in an extended space where the variables are allowed to take an additional… (More)

- Alfredo Braunstein, Marc Mézard, Martin Weigt, Riccardo Zecchina
- ArXiv
- 2002

A. Braunstein, M. Mézard, M. Weigt, R. Zecchina International School for Advanced Studies (SISSA), via Beirut 9, 34100 Trieste, Italy Laboratoire de Physique Théorique et Modèles Statistiques, CNRS and Université Paris Sud, Bât. 100, 91405 Orsay cedex, France 3 Institute for Theoretical Physics, University of Göttingen, Tammannstr. 1, 37077 Göttingen,… (More)

- Marc Bailly-Bechet, Christian Borgs, +4 authors Riccardo Zecchina
- Proceedings of the National Academy of Sciences…
- 2011

External information propagates in the cell mainly through signaling cascades and transcriptional activation, allowing it to react to a wide spectrum of environmental changes. High-throughput experiments identify numerous molecular components of such cascades that may, however, interact through unknown partners. Some of them may be detected using data… (More)

- Alfredo Braunstein, Roberto Mulet, Andrea Pagnani, Martin Weigt, Riccardo Zecchina
- Physical review. E, Statistical, nonlinear, and…
- 2003

We study the graph coloring problem over random graphs of finite average connectivity c. Given a number q of available colors, we find that graphs with low connectivity admit almost always a proper coloring whereas graphs with high connectivity are uncolorable. Depending on q, we find with a one-step replica-symmetry breaking approximation the precise value… (More)

- Alfredo Braunstein, E V Goryachenkova, Egitz Tolosa, Ingo Willhardt, L L Yefremova
- Biochimica et biophysica acta
- 1971

- Carlo Baldassi, Alfredo Braunstein, Nicolas Brunel, Riccardo Zecchina
- BMC Neuroscience
- 2007

Recent experimental studies indicate that synaptic changes induced by neuronal activity are discrete jumps between a small number of stable states. Learning in systems with discrete synapses is known to be a computationally hard problem. Here, we study a neurobiologically plausible on-line learning algorithm that derives from belief propagation algorithms.… (More)

- Fabrizio Altarelli, Alfredo Braunstein, Luca Dall'Asta, Alejandro Lage-Castellanos, Riccardo Zecchina
- Physical review letters
- 2014

We study several Bayesian inference problems for irreversible stochastic epidemic models on networks from a statistical physics viewpoint. We derive equations which allow us to accurately compute the posterior distribution of the time evolution of the state of each node given some observations. At difference with most existing methods, we allow very general… (More)

- Nurcan Tuncbag, Alfredo Braunstein, +5 authors Ernest Fraenkel
- Journal of Computational Biology
- 2012

Signaling and regulatory networks are essential for cells to control processes such as growth, differentiation, and response to stimuli. Although many "omic" data sources are available to probe signaling pathways, these data are typically sparse and noisy. Thus, it has been difficult to use these data to discover the cause of the diseases and to propose new… (More)

- Mahsa Bayati, Christian Borgs, Alfredo Braunstein, Jennifer T. Chayes, Abolfazl Ramezanpour, Riccardo Zecchina
- Physical review letters
- 2008

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 technique to translate the imposed global connectivity constrain into many local ones that can be analyzed with cavity equation techniques. This approach leads to a new optimization… (More)