Dirac-type Theorems for Inhomogenous Random Graphs

Ghurumuruhan Ganesan ()
Additional contact information
Ghurumuruhan Ganesan: IISER Bhopal

Sankhya A: The Indian Journal of Statistics, 2024, vol. 86, issue 2, No 5, 775-789

Abstract: Abstract In this paper, we study Dirac-type theorems for an inhomogenous random graph $$G$$ G whose edge probabilities are not necessarily all the same. We obtain sufficient conditions for the existence of Hamiltonian paths and perfect matchings, in terms of the sum of edge probabilities. For edge probability assignments with two-sided bounds, we use Pósa rotation and single vertex exclusion techniques to show that $$G$$ G is Hamiltonian with high probability. For weaker one-sided bounds, we use bootstrapping techniques to obtain a perfect matching in $$G,$$ G , with high probability. We also highlight an application of our results in the context of channel assignment problem in wireless networks.

Keywords: Dirac-type Theorems; Hamiltonian Paths; Perfect Matchings; Inhomogenous Random Graphs; 05C62 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13171-024-00353-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sankha:v:86:y:2024:i:2:d:10.1007_s13171-024-00353-x

Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/13171

DOI: 10.1007/s13171-024-00353-x

Access Statistics for this article

Sankhya A: The Indian Journal of Statistics is currently edited by Dipak Dey

More articles in Sankhya A: The Indian Journal of Statistics from Springer, Indian Statistical Institute
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().