The ?(2) limit in the random assignment problem, Random Structures and Algorithms, vol.8, issue.4, pp.381-418, 2001. ,
DOI : 10.1002/rsa.1015
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
Processes on Unimodular Random Networks, Electronic Journal of Probability, vol.12, issue.0, pp.1454-1508, 2007. ,
DOI : 10.1214/EJP.v12-463
URL : http://arxiv.org/abs/math/0603062
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.8102
Counting without sampling, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.452-479, 2008. ,
DOI : 10.1145/1109557.1109655
Simple deterministic approximation algorithms for counting matchings, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, p.127, 2007. ,
DOI : 10.1145/1250790.1250809
URL : http://chandra.ie.cuhk.edu.hk/pub/papers/CM-stoc07.pdf
A rigorous proof of the cavity method for counting matchings, Proc. of the 44th Annual Allerton Conference on Communication, Control and Computing, 2006. ,
Recurrence of distributional limits of finite planar graphs, Electron. J. Probab, vol.6, issue.13, p.pp, 2001. ,
Every minor-closed property of sparse graphs is testable, STOC, pp.393-402, 2008. ,
On the absence of phase transition in the monomer-dimer model, 1998. ,
Convergence of probability measures Wiley Series in Probability and Statistics: Probability and Statistics, 1999. ,
Karp???Sipser on Random Graphs with a Fixed Degree Sequence, Combinatorics, Probability and Computing, vol.1, issue.05, 2009. ,
DOI : 10.1073/pnas.0937490100
Maximum matchings in diluted graphs: the cavity method at positive temperature ,
The rank of diluted random graphs ,
URL : https://hal.archives-ouvertes.fr/hal-00630917
Left and right convergence of graphs with bounded degree Arxiv preprint arXiv, 2010. ,
Ising models on locally tree-like graphs, The Annals of Applied Probability, vol.20, issue.2, pp.565-592, 2010. ,
DOI : 10.1214/09-AAP627
URL : https://hal.archives-ouvertes.fr/hal-00290779
Large deviations techniques and applications, volume 38 of Stochastic Modelling and Applied Probability, 1998. ,
Note on limits of finite graphs, Combinatorica, vol.15, issue.5, pp.503-507, 2007. ,
DOI : 10.1007/s00493-007-2214-8
Linear phase transition in random linear constraint satisfaction problems. Probab. Theory Related Fields, pp.410-440, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-01183947
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method, Random Structures and Algorithms, vol.5, issue.2, pp.76-106, 2006. ,
DOI : 10.1002/rsa.20072
Theory of monomer-dimer systems, Communications in Mathematical Physics, vol.24, issue.4, pp.190-232, 1972. ,
DOI : 10.1007/BF01877590
Negative correlation and log-concavity. Random Structures Algorithms, pp.367-388, 2010. ,
DOI : 10.1002/rsa.20292
URL : http://arxiv.org/abs/0712.3507
Maximum matching in sparse random graphs, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), pp.364-375, 1981. ,
DOI : 10.1109/SFCS.1981.21
Matching theory, 2009. ,
DOI : 10.1090/chel/367
Asymptotic Enumeration of Spanning Trees, Combinatorics, Probability and Computing, vol.14, issue.4, pp.491-522, 2005. ,
DOI : 10.1017/S096354830500684X
Spin glass theory and beyond, World Scientific Lecture Notes in Physics, vol.9, 1987. ,
Towards a theory of negative dependence, Probabilistic techniques in equilibrium and nonequilibrium statistical physics, pp.1371-1390, 2000. ,
DOI : 10.1063/1.533200
The capacity of low-density parity-check codes under message-passing decoding, IEEE Transactions on Information Theory, vol.47, issue.2, pp.599-618, 2001. ,
DOI : 10.1109/18.910577
Counting unbranched subgraphs, Journal of Algebraic Combinatorics, vol.9, issue.2, pp.157-160, 1999. ,
DOI : 10.1023/A:1018690328814
Combinatorial optimization, Polyhedra and efficiency. Algorithms and Combinatorics, vol.24, pp.1-38 ,
Spin glasses: a challenge for mathematicians Cavity and mean field models, Mathematics and Related Areas. 3rd Series. A Series of Modern Surveys in Mathematics, 2003. ,
The complexity of computing the permanent, Theoretical Computer Science, vol.8, issue.2, pp.189-201, 1979. ,
DOI : 10.1016/0304-3975(79)90044-6
Negatively Correlated Random Variables and Mason???s Conjecture for Independent Sets in Matroids, Annals of Combinatorics, vol.12, issue.2, pp.211-239, 2008. ,
DOI : 10.1007/s00026-008-0348-z
Weighted enumeration of spanning subgraphs with degree constraints, Journal of Combinatorial Theory, Series B, vol.99, issue.2, pp.347-357, 2009. ,
DOI : 10.1016/j.jctb.2008.07.007