Statistical physicists, computer scientists and mathematicians commonly use random graphs to model large complex networks and disordered lattices. They are versatile and propitious to analytical study.
A vast research effort is devoted to understanding the properties of their spectra, random walks and iterative propagation algorithms. These three objects are closely related and they are at the core of both theoretical and applied issues. They range from wave propagation in disordered media to community detection in social networks.
The objective of the project SAMARA is to contribute to the mathematical understanding of the spectra, random walks and iterative propagation algorithms on random graphs around four themes:
• Inside the spectrum
• At the edge of the spectrum
• Random walks
• Belief propagation algorithms