R. P. Agarwal, M. Meehan, and D. O. Regan, Fixed point theory and applications, volume 141 of Cambridge Tracts in Mathematics, 2001.

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, 2004.
DOI : 10.1007/978-3-662-09444-0_1

J. David and . Aldous, The ?(2) limit in the random assignment problem, Random Structures Algorithms, vol.18, issue.4, pp.381-418, 2001.

J. David, A. Aldous, and . Bandyopadhyay, A survey of max-type recursive distributional equations, Ann. Appl. Probab, vol.15, issue.2, pp.1047-1110, 2005.

I. Benjamini and O. Schramm, Recurrence of distributional limits of finite planar graphs, Electron. J. Probab, vol.6, issue.13, p.pp, 2001.

P. Billingsley, Convergence of probability measures Wiley Series in Probability and Statistics: Probability and Statistics, 1999.

B. Bollobás, A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs, European Journal of Combinatorics, vol.1, issue.4, pp.311-316, 1980.
DOI : 10.1016/S0195-6698(80)80030-8

C. Bordenave, Lecture notes on random graphs and probabilistic combinatorial optimization

C. Bordenave, M. Lelarge, and J. Salez, Matchings on infinite graphs. Probab. Theory Related Fields, pp.183-208, 2013.
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 multiplechoice allocation, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '07, pp.469-476, 2007.

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, 2013.

D. Gamarnik, T. Nowicki, and G. Swirszcz, Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method. Random Structures Algorithms, pp.76-106, 2006.

P. Gao and N. C. Wormald, Load balancing and orientability thresholds for random hypergraphs [extended abstract, STOC'10? Proceedings of the 2010 ACM International Symposium on Theory of Computing, pp.97-103, 2010.

B. Hajek, Performance of global load balancing by local adjustment, IEEE Transactions on Information Theory, vol.36, issue.6, pp.1398-1414, 1990.
DOI : 10.1109/18.59935

B. Hajek, Balanced loads in infinite networks, The Annals of Applied Probability, vol.6, issue.1, pp.48-75, 1996.
DOI : 10.1214/aoap/1034968065

R. Van-der-hofstad and . Hofstad, Random Graphs and Complex Networks, 2013.
DOI : 10.1017/9781316779422

S. Janson, The Probability That a Random Multigraph is Simple, Combinatorics, Probability and Computing, vol.19, issue.1-2, pp.205-225, 2009.
DOI : 10.1016/0196-6774(90)90029-E

M. Khandwawala and R. Sundaresan, Belief propagation for optimal edge cover in the random complete graph, The Annals of Applied Probability, vol.24, issue.6, 2012.
DOI : 10.1214/13-AAP981

M. Mathieu-leconte, L. Lelarge, and . Massoulié, Convergence of multivariate belief propagation, with applications to cuckoo hashing and load balancing, 2012.

M. Lelarge, A new approach to the orientation of random hypergraphs . CoRR, abs/1201, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01270322

R. Lyons, Asymptotic Enumeration of Spanning Trees, Combinatorics, Probability and Computing, vol.14, issue.4, pp.491-522, 2005.
DOI : 10.1017/S096354830500684X

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

J. Salez and D. Shah, Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem, Mathematics of Operations Research, vol.34, issue.2, pp.468-480, 2009.
DOI : 10.1287/moor.1090.0380
URL : https://hal.archives-ouvertes.fr/inria-00358331

M. Shaked and J. G. Shanthikumar, Stochastic orders and their applications. Probability and Mathematical Statistics, 1994.

J. and M. Steele, Minimal Spanning Trees for Graphs with Random Edge Lengths, Mathematics and computer science, II (Versailles Trends Math, pp.223-245, 2002.
DOI : 10.1007/978-3-0348-8211-8_14