Extremal paths in inhomogenous random graphs

DOI10.1016/J.SPL.2019.108593zbMath1437.60042OpenAlexW2969739313WikidataQ127341683 ScholiaQ127341683MaRDI QIDQ2288750

Ghurumuruhan Ganesan

Publication date: 20 January 2020

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2019.108593

zbMATH Keywords

Hamiltonian pathslong pathsinhomogenous random graphsweighted random graphs

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Characterization and structure theory of statistical distributions (62E10)

Related Items (1)

Long paths in heterogeneous random subgraphs of graphs with large minimum degree

Cites Work

• Unnamed Item
• Unnamed Item
• On the value of a random minimum spanning tree problem
• Random Graphs, Geometry and Asymptotic Structure
• Finding Hamilton cycles in random graphs with few queries
• Paths in graphs

This page was built for publication: Extremal paths in inhomogenous random graphs