258 citations · 779 across the 12 of their papers we have counts for
12 papers
Unsupervised and semi-supervised clustering by message passing: Soft-constraint affinity propagation
Michele Leone, Sumedha, Martin Weigt
Soft-constraint affinity propagation (SCAP) is a new statistical-physics based clustering technique. First we give the derivation of a simplified version of the algorithm and discu…
(Un)detectable cluster structure in sparse networks
Joerg Reichardt, Michele Leone
We study the problem of recovering a known cluster structure in a sparse network, also known as the planted partitioning problem, by means of statistical mechanics. We find a sharp…
Finite size corrections to random Boolean networks
Michele Leone, Andrea Pagnani, Giorgio Parisi +1
Since their introduction, Boolean networks have been traditionally studied in view of their rich dynamical behavior under different update protocols and for their qualitative analo…
Statistical mechanics of combinatorial auctions
Tobias Galla, Michele Leone, Matteo Marsili +3
Combinatorial auctions are formulated as frustrated lattice gases on sparse random graphs, allowing the determination of the optimal revenue by methods of statistical physics. Tran…
Criticality on networks with topology-dependent interactions
C. V. Giuraniuc, J. P. L. Hatchett, J. O. Indekeu +4
Weighted scale-free networks with topology-dependent interactions are studied. It is shown that the possible universality classes of critical behaviour, which are known to depend o…
Computational core and fixed-point organisation in Boolean networks
L. Correale, M. Leone, A. Pagnani +2
In this paper, we analyse large random Boolean networks in terms of a constraint satisfaction problem. We first develop an algorithmic scheme which allows to prune simple logical c…