Matchings on infinite graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Matchings on infinite graphs

Published:2012-09-30 Issue:1-2 Volume:157 Page:183-208
ISSN:0178-8051
Container-title:Probability Theory and Related Fields
language:en
Short-container-title:Probab. Theory Relat. Fields

Author:

Bordenave Charles,Lelarge Marc,Salez Justin

Publisher

Springer Science and Business Media LLC

Subject

Statistics, Probability and Uncertainty,Statistics and Probability,Analysis

Link

http://link.springer.com/content/pdf/10.1007/s00440-012-0453-0.pdf

Reference27 articles.

1. Aldous, D., Lyons, R.: Processes on unimodular random networks. Electron. J. Probab. 12, 1454–1508 (2007)

2. Aldous, D., Steele, J.M.: The objective method: probabilistic combinatorial optimization and local weak convergence. In: Probability on discrete structures, volume 110 of encyclopaedia mathematical sciences, pp. 1–72. Springer, Berlin (2004)

3. Aldous, D.J., Bandyopadhyay, A.: A survey of max-type recursive distributional equations. Ann. Appl. Probab. 15(2), 1047–1110 (2005)

4. Aronson, J., Frieze, A., Pittel, B.G.: Maximum matchings in sparse random graphs: Karp-Sipser revisited. Random Struct. Algorithms 12(2), 111–177 (1998)

5. Bayati, M. Gamarnik, D., Tetali, P.: Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. In: Schulman, L.J., (ed.) STOC, pp. 105–114. ACM (2010)

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Central limit theorem in disordered Monomer‐Dimer model;Random Structures & Algorithms;2024-08-07

2. Matchings on trees and the adjacency matrix: A determinantal viewpoint;Random Structures & Algorithms;2023-06-15

3. Towards an Optimal Contention Resolution Scheme for Matchings;Integer Programming and Combinatorial Optimization;2023

4. Sparse expanders have negative curvature;Geometric and Functional Analysis;2022-09-22

5. Arithmetic Field Circuit Complexity Bounds for Erasure Encoders;2022 11th International Conference on Communications, Circuits and Systems (ICCCAS);2022-05-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3