Strong and weighted matchings in inhomogenous random graphs

DOI10.1214/21-ECP408zbMath1480.05117arXiv2108.07650OpenAlexW3176338096MaRDI QIDQ2064836

Ghurumuruhan Ganesan

Publication date: 6 January 2022

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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

zbMATH Keywords

inhomogeneous random graphsweighted matchingsstrong matchings

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the speed of convergence in first-passage percolation
• Random matching problems on the complete graph
• A proof of Parisi's conjecture on the random assignment problem
• The ?(2) limit in the random assignment problem
• Minimum Cost Matching in a Random Graph with Random Costs
• The Diameter of Random Graphs
• Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
• Large Induced Matchings in Random Graphs

This page was built for publication: Strong and weighted matchings in inhomogenous random graphs