estimate_centrality_threshold

'data.frame' or equivalent object representing the network
graph (see Details)

graph

Desired maximal degree of inaccuracy in centrality estimates<ul>
<li>values will be accurate to within this amount, subject to a constant
scaling factor. Note that threshold values increase non-linearly with
decreasing values of 'tolerance'</li>
</ul>

tolerance

Estimate a value for the 'dist_threshold' parameter of the
<a rd-options="" href="/link/dodgr_centrality?package=dodgr&version=0.2.8" data-mini-rdoc="dodgr::dodgr_centrality">dodgr_centrality</a> function. Providing distance thresholds to this
function generally provides considerably speed gains, and results in
approximations of centrality. This function enables the determination of
values of 'dist_threshold' corresponding to specific degrees of accuracy.

Distances on dual-weighted directed graphs using
priority-queue shortest paths (Padgham (2019) <doi:10.32866/6945>).
Weighted directed graphs have weights from A to B which may differ
from those from B to A. Dual-weighted directed graphs have two sets
of such weights. A canonical example is a street network to be used
for routing in which routes are calculated by weighting distances
according to the type of way and mode of transport, yet lengths of
routes must be calculated from direct distances.

Mark Padgham

dodgr

Distances on Directed Graphs

Andreas Petutschnig

Robin Lovelace

Andrew Smith

Malcolm Morgan

Shane Saunders

estimate_centrality_threshold function

Estimate a value for the 'dist_threshold' parameter of the
<a rd-options='' href='dodgr_centrality'>dodgr_centrality</a> function. Providing distance thresholds to this
function generally provides considerably speed gains, and results in
approximations of centrality. This function enables the determination of
values of 'dist_threshold' corresponding to specific degrees of accuracy.

estimate_centrality_threshold: estimate_centrality_threshold

Description

Usage

Arguments

Value