114 citations · 246 across the 3 of their papers we have counts for
2 papers
cond-mat.dis-nn2003★ 114 cited
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…
cond-mat.stat-mech2001★ 18 cited
Learning to coordinate in a complex and non-stationary world
M. Marsili, R. Mulet, F. Ricci-Tersenghi +1
We study analytically and by computer simulations a complex system of adaptive agents with finite memory. Borrowing the framework of the Minority Game and using the replica formali…