Optimal unimodular matchings

DOI10.1007/S00440-025-01429-XMaRDI QIDQ7253718zbMATH OpenFDO

Authors Nathanaël Enriquez, Mike Liu, L. Ménard, Vianney Perchet

Publication date 27 May 2026

Published in Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00440-025-01429-X

zbMATH Keywords

local convergenceoptimal matchingssparse random graphsunimodularity

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotics in the random assignment problem
• Endogeny for the logistic recursive distributional equation
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 2042286 (Why is no real title available?)
• Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
• Matchings in Benjamini-Schramm convergent graph sequences
• Matchings on infinite graphs
• Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
• Processes on unimodular random networks
• Random Graphs and Complex Networks
• Random graphs and complex networks. Volume 1
• Recurrence of distributional limits of finite planar graphs
• The (2) limit in the random assignment problem
• Unimodular random trees
• Weighted enumeration of spanning subgraphs in locally tree-like graphs

This page was built for publication: Optimal unimodular matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253718)