43 citations · 118 across the 4 of their papers we have counts for
4 papers
Return probabilities and hitting times of random walks on sparse Erdos-Renyi graphs
O. C. Martin, P. Sulc
We consider random walks on random graphs, focusing on return probabilities and hitting times for sparse Erdos-Renyi graphs. Using the tree approach which is expected to be exact i…
Random multi-index matching problems
O. C. Martin, M. Mezard, O. Rivoire
The multi-index matching problem (MIMP) generalizes the well known matching problem by going from pairs to d-uplets. We use the cavity method from statistical physics to analyze it…
A frozen glass phase in the multi-index matching problem
O. C. Martin, M. Mezard, O. Rivoire
The multi-index matching is an NP-hard combinatorial optimization problem; for two indices it reduces to the well understood bipartite matching problem that belongs to the polynomi…
The random link approximation for the Euclidean traveling salesman problem
N. J. Cerf, J. Boutet de Monvel, O. Bohigas +2
The traveling salesman problem (TSP) consists of finding the length of the shortest closed tour visiting N ``cities''. We consider the Euclidean TSP where the cities are distribute…