Matchings on trees and the adjacency matrix: A determinantal viewpoint

DOI10.1002/rsa.21167zbMath1522.05384arXiv2011.04012OpenAlexW3106018864MaRDI QIDQ6076733

András Mészáros

Publication date: 17 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.04012

zbMATH Keywords

local weak convergencedeterminantal measure

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Measures of information, entropy (94A17)

Cites Work

• Matchings on infinite graphs
• Matchings in vertex-transitive bipartite graphs
• The rank of diluted random graphs
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
• Gibbs measures and phase transitions on sparse random graphs
• Alternating-sign matrices and domino tilings. I
• Recurrence of distributional limits of finite planar graphs
• Conformal invariance of domino tiling.
• Dominos and the Gaussian free field.
• Determinantal probability measures
• Limiting entropy of determinantal processes
• Processes on unimodular random networks
• Matchings in Benjamini–Schramm convergent graph sequences
• The statistics of dimers on a lattice
• Borel oracles. An analytical approach to constant-time algorithms
• Matchings and walks in graphs
• Counting matchings in irregular bipartite graphs and random lifts
• Dimer problem in statistical mechanics-an exact result
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Matchings on trees and the adjacency matrix: A determinantal viewpoint