Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method

Random Structures and Algorithms

Volumn 28, Issue 1, 2006, Pages 76-106

  Gamarnik, David ^a   Nowicki, Tomasz ^a   Swirszcz, Grzegorz ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645288546     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20072     Document Type: Article

References (25)

1. D. Aldous, Asymptotics in the random assignment problem, Probab Theory Related Fields 93 (1992), 507-534.
2. D. Aldous, The ζ(2) limit in the random assignment problem, Random Structures Algorithms 18(2001), 381-418.
3. D. Aldous, Some open problems, http://stat-www.berkeley.edu/users/aldous/ Research/ problems.ps.
4. D. Aldous and A. Bandyopadhyay, A survey of max-type recursive distributional equations, Ann Appl Probab, to appear.
5. D. Aldous and J. M. Steele, "The objective method: Probabilistic combinatorial optimization and local weak convergence," Discrete combinatorial probability, H. Resten, (Editor), Springer, New York, 2003, pp. 1-72.
6. J. Aronson, B. Pittel, and A. Frieze, Maximum matchings in sparse random graphs: Karp-Sipser revisited, Random Structures Algorithms 12 (1998), 11-178.
7. A. Bandyopadhyay, Bivariate uniqueness in the logistic fixed point equation, Technical Report 629, Department of Statistics, University of California, Berkeley, 2002.
8. A. Bandyopadhyay, Max-type recursive distributional equations, Ph.D. thesis, University of California, Berkeley, 2003.
9. B. Bollabas, A probabilistic proof of an asymptotic formula for the number of regular graphs, European J Combinat 1 (1980), 311-316.
10. B. Bollabas, The independence radio of regular graphs, Proc Amer Math Soc 83(2) (1981), 433-436.
11. G. R. Brightwell and P. Winkler, Gibbs extremality for the hard-care model on a Bethe lattice, preprint, 2003.
12. R. Durrett, Probability: Theory and examples, 2nd edition, Duxbury Press, Belmont, 1996.
13. A. Frieze and S. Suen, On the independence number of random cubic graphs, Random Structures Algorithms 5 (1994), 649-664.
14. D. Gamarnik, Linear phase transition in random linear constraint satisfaction problems, Probab Theory Related Fields. 129(3) (2004), 410-440.
15. A. K. Hartmann and M. Weigt, Statistical mechanics perspective on the phase transition of vertex covering of finite-connectivity random graphs, Theoret Comput Sci 265 (2001), 199-225.
16. S. Janson, T. Łuczak, and A. Rucinske, Random graphs, Wiley New York, 2000.
17. R. Karp and M. Sipser, Maximum matchings in sparse random graphs, 22nd Annu Symp Foundations of Computer Science, 1981, pp. 364-375.
18. F. Kelly, Stochastic models of computer communication systems, J Roy Statist Soc Ser B 47(3) (1985), 379-395.
19. J. Martin, Reconstruction thresholds on regular trees, Discrete Random Walks, DRW'03, C. Banderier and C. Krattenthaler, (Editors), Discrete Mathematics and Theoretical Computer Science Proceedings AC, DMTCS, Nancy, France, 2003, pp. 191-203.
20. E. Mossel, Survey: Information flow on trees. Graphs, morphisms and statistical physiscs, J. Nestril and P. Winkler, (Editors), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, 2004, pp. 155-170.
21. U. A. Rozikov and Y. M. Suhov, A hard-core model on a Cayley tree: An example of a loss network, preprint, 2003.
22. Joel H. Spencer, Ten lectures on the probabilistic method, 2nd edition, SIAM, Philadelphia, 1994.
23. J. M. Steele, "Minimal spanning trees for graphs with random edge lenghts," Mathematics and computer science II. Algorithms, trees, combinatorics and probabilities, B. Chauvin, Ph. Faljolet, D. Gardy, and A. Mokkadem, (Editors), Birkhäuser, Boston, 2002, pp. 223-245.
24. M. Talagrand, An assignment problem at high temperature, Ann Probab 31 (2) (2003), 818-848.
25. N. Wormald, Differential equations forrandom processes and random graphs, Ann Appl Probab 5(1995), 1217-1235.