Estimating the parameters of the Waxman random graph

DOI10.1007/978-3-030-25070-6_6MaRDI QIDQ6154912zbMATH OpenOpenAlexFDO

Authors Matthew Roughan, Jonathan Tuke, Eric Parsonage

Publication date 16 February 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

maximum likelihood estimatorphysical networks modelling

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Abstract: The Waxman random graph is a generalisation of the simple ErdH{o}s-R'enyi or Gilbert random graph. It is useful for modelling physical networks where the increased cost of longer links means they are less likely to be built, and thus less numerous than shorter links. The model has been in continuous use for over two decades with many attempts to select parameters which match real networks. In most the parameters have been arbitrarily selected, but there are a few cases where they have been calculated using a formal estimator. However, the performance of the estimator was not evaluated in any of these cases. This paper presents both the first evaluation of formal estimators for the parameters of these graphs, and a new Maximum Likelihood Estimator with $O(n)$ computational time complexity that requires only link lengths as input.

Recommendations

• Paths in the simple random graph and the Waxman graph
• Estimating parameters of a directed weighted graph model with beta-distributed edge-weights
• Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
• Parameter estimation in a 3‐parameter p‐star random graph model
• New consistent and asymptotically normal parameter estimates for random-graph mixture models

This page was built for publication: Estimating the parameters of the Waxman random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154912)