IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v156y2020ics0167715219302391.html
   My bibliography  Save this article

Extremal paths in inhomogenous random graphs

Author

Listed:
  • Ganesan, Ghurumuruhan

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.

Suggested Citation

  • Ganesan, Ghurumuruhan, 2020. "Extremal paths in inhomogenous random graphs," Statistics & Probability Letters, Elsevier, vol. 156(C).
  • Handle: RePEc:eee:stapro:v:156:y:2020:i:c:s0167715219302391
    DOI: 10.1016/j.spl.2019.108593
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715219302391
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spl.2019.108593?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ghurumuruhan Ganesan, 2024. "Dirac-type Theorems for Inhomogenous Random Graphs," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 86(2), pages 775-789, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:156:y:2020:i:c:s0167715219302391. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.