Matchings in Benjamini–Schramm convergent graph sequences

Author:

Abért Miklós,Csikvári Péter,Frenkel Péter,Kun Gábor

Abstract

We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree.

A graph parameter is said to be estimable if it converges along every Benjamini–Schramm convergent sparse graph sequence. We prove that the normalized logarithm of the number of matchings is estimable. We also show that the analogous statement for perfect matchings already fails for d d –regular bipartite graphs for any fixed d 3 d\ge 3 . The latter result relies on analyzing the probability that a randomly chosen perfect matching contains a particular edge.

However, for any sequence of d d –regular bipartite graphs converging to the d d –regular tree, we prove that the normalized logarithm of the number of perfect matchings converges. This applies to random d d –regular bipartite graphs. We show that the limit equals the exponent in Schrijver’s lower bound on the number of perfect matchings.

Our analytic approach also yields a short proof for the Nguyen–Onak (also Elek–Lippner) theorem saying that the matching ratio is estimable. In fact, we prove the slightly stronger result that the independence ratio is estimable for claw-free graphs.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Reference26 articles.

1. Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs;Abért, Miklós;Combinatorica,2015

2. M. Abért, A. Thom and B. Virág, Benjamini-Schramm convergence and pointwise convergence of the spectral measure, preprint at http://www.math.uni-leipzig.de/MI/thom/

3. Recurrence of distributional limits of finite planar graphs;Benjamini, Itai;Electron. J. Probab.,2001

4. The independence ratio of regular graphs;Bollobás, Béla;Proc. Amer. Math. Soc.,1981

5. The number of matchings in random regular graphs and bipartite graphs;Bollobás, B.;J. Combin. Theory Ser. B,1986

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

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

2. Evaluations of Tutte polynomials of regular graphs;Journal of Combinatorial Theory, Series B;2022-11

3. Perfect matchings in inhomogeneous random bipartite graphs in random environment;Cubo (Temuco);2022-08

4. Atoms of the matching measure;Electronic Journal of Probability;2022-01-01

5. Enumeration and randomized constructions of hypertrees;Random Structures & Algorithms;2019-01-15

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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