Extremal paths in inhomogenous random graphs

Ghurumuruhan Ganesan

Statistics & Probability Letters, 2020, vol. 156, issue C

Abstract: In this paper, we study long open paths in an inhomogenous Erdős–Rényi random graph G obtained from the complete graph Kn on n vertices by allowing each edge e to be open with probability pn(e), independently of other edges. If the edge probability assignment sequence satisfies certain neighbour density conditions, then G has a long path containing nearly all the vertices with high probability, i.e., with probability converging to one as n→∞. Our methods extend to random weighted graphs with nonidentical weight distributions and we describe conditions under which the minimum weight Hamiltonian path has weight bounded above by a constant, with high probability.

Keywords: Inhomogenous random graphs; Long paths; Hamiltonian paths; Weighted random graphs (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715219302391
Full text for ScienceDirect subscribers only

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:eee:stapro:v:156:y:2020:i:c:s0167715219302391

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spl.2019.108593

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().