D. Aldous and R. Lyons, Processes on Unimodular Random Networks, Electronic Journal of Probability, vol.12, issue.0, pp.1454-1508, 2007.
DOI : 10.1214/EJP.v12-463

D. Aldous and J. M. Steele, The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence, Probability on discrete structures, pp.1-72
DOI : 10.1007/978-3-662-09444-0_1

J. Aldous and A. Bandyopadhyay, A survey of max-type recursive distributional equations, The Annals of Applied Probability, vol.15, issue.2, pp.1047-1110, 2005.
DOI : 10.1214/105051605000000142

M. Bayati, C. Borgs, J. Chayes, and R. Zecchina, On the exactness of the cavity method for weighted bmatchings on arbitrary graphs and its relation to linear programs, Journal of Statistical Mechanics: Theory and Experiment, issue.06, pp.2008-06001, 2008.

C. Bordenave, M. Lelarge, and J. Salez, Matchings on infinite graphs. Arxiv preprint arXiv:1102.0712, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00935246

J. A. Cain, P. Sanders, and N. Wormald, The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07, pp.469-476, 2007.

M. Chertkov, Exactness of belief propagation for some graphical models with loops, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, p.10016, 2008.
DOI : 10.1088/1742-5468/2008/10/P10016

A. Dembo and A. Montanari, Gibbs measures and phase transitions on sparse random graphs, Brazilian Journal of Probability and Statistics, vol.24, issue.2, pp.137-211, 2010.
DOI : 10.1214/09-BJPS027
URL : http://arxiv.org/abs/0910.5460

M. Dietzfelbinger, A. Goerdt, M. Mitzenmacher, A. Montanari, R. Pagh et al., Tight Thresholds for Cuckoo Hashing via XORSAT, Proceedings of the 37th international colloquium conference on Automata , languages and programming, ICALP'10, pp.213-225, 2010.
DOI : 10.1007/978-3-642-14165-2_19
URL : http://arxiv.org/abs/0912.0287

M. Dietzfelbinger and C. Weidling, Balanced allocation and dictionaries with tightly packed constant size bins, Theoretical Computer Science, vol.380, issue.1-2, pp.47-68, 2007.
DOI : 10.1016/j.tcs.2007.02.054
URL : http://doi.org/10.1016/j.tcs.2007.02.054

D. Fernholz and V. Ramachandran, The k-orientability thresholds for gn, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07, pp.459-468, 2007.

N. Fountoulakis, M. Khosla, and K. Panagiotou, The multiple-orientability thresholds for random hypergraphs, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1222-1236, 2011.

A. Frieze and P. Melsted, Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables, Random Structures & Algorithms, vol.31, issue.3, pp.334-364, 2012.
DOI : 10.1002/rsa.20427

P. Gao and N. C. Wormald, Load balancing and orientability thresholds for random hypergraphs, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.97-104, 2010.
DOI : 10.1145/1806689.1806705

J. H. Kim, Poisson Cloning Model for Random Graphs. ArXiv e-prints, 2008.

F. Krz¸akaakrz¸akaa-la, A. Montanari, F. Ricci-tersenghi, G. Semerjian, and L. Zdeborová, Gibbs states and the set of solutions of random constraint satisfaction problems, Proc. Natl. Acad. Sci. USA, pp.10318-10323, 2007.

M. Leconte, M. Lelarge, and L. Massoulié, Bipartite graph structures for efficient balancing of heterogeneous loads, Proceedings of the 12th ACM SIG- METRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems, SIGMETRICS '12, pp.41-52, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00841296

M. Leconte, M. Lelarge, and L. Massoulié, Convergence of multivariate belief propagation, with applications to cuckoo hashing and load balancing Arxiv preprint arXiv:1207, 1659.

M. Lelarge, A New Approach to the Orientation of Random Hypergraphs, Proceedings of the Twenty- Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '12, pp.251-264, 2012.
DOI : 10.1137/1.9781611973099.23
URL : https://hal.archives-ouvertes.fr/hal-01270322

L. Lovász and M. D. Plummer, Matching theory, 2009.
DOI : 10.1090/chel/367

E. Maneva, E. Mossel, and M. J. Wainwright, A new look at survey propagation and its generalizations, Journal of the ACM, vol.54, issue.4, 2007.
DOI : 10.1145/1255443.1255445

M. Mezard and A. Montanari, Information, Physics, and Computation, 2009.
DOI : 10.1093/acprof:oso/9780198570837.001.0001

M. Mézard, G. Parisi, and M. A. Virasoro, Spin glass theory and beyond, World Scientific Lecture Notes in Physics, vol.9, 1987.

A. Müller and D. Stoyan, Comparison Methods for Stochastic Models and Risks, 2009.

J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference. The Morgan Kaufmann Series in Representation and Reasoning, 1988.

J. Salez, Weighted enumeration of spanning subgraphs in locally tree-like graphs. Random Structures & Algorithms, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00935248

A. Schrijver, Combinatorial Optimization : Polyhedra and Efficiency (Algorithms and Combinatorics)

J. G. Shanthikumar and D. D. Yao, The preservation of likelihood ratio ordering under convolution, Stochastic Processes and their Applications, pp.259-267, 1986.
DOI : 10.1016/0304-4149(86)90039-6

J. Yedidia, W. Freeman, and Y. Weiss, Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms, IEEE Transactions on Information Theory, vol.51, issue.7, pp.2282-2312, 2005.
DOI : 10.1109/TIT.2005.850085
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.9766