An extrapolation algorithm for estimating river bed grain size distributions across basins

Abstract. Values representing grain size distributions of stream reaches are essential for estimating sediment transport at the reach scale. Various modeling frameworks exist that attempt to simulate reach-scale sediment transport across entire drainage basins to characterize sediment dynamics at a watershed scale. Such frameworks require estimates of grain size at each reach. Because obtaining direct measurements at this scale is impractical and logistically difficult, methods to estimate or extrapolate grain size measurements are needed, however, few currently exist. Here I present an extrapolation algorithm that uses one or more pebble counts to extrapolate full grain size distributions to each reach of a drainage network. In addition to the pebble count measurements, the tool requires a stream network geospatial feature class, attributed with values for reach-averaged slope and some consistent measure of relative flow magnitude (or a proxy for flow). I tested the tool in a set of sub-watersheds in the Bitterroot River basin of western Montana, US, with varying valley morphologies, and compared predictions to measurements at 16 sites. When using multiple measurements for calibration, mean absolute percent error averaged 5.8 % of the measured grain sizes in the phi scale. When using a single measurement for calibration, error averaged 8.4 %.

Authors

Institutions

Publication Details

Journal
Earth Surface Dynamics
Published
2025-12-18
DOI
https://doi.org/10.5194/esurf-13-1307-2025
Primary Topic
Hydrology and Sediment Transport Processes
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An extrapolation algorithm for estimating river bed grain size distributions across basins

Jordan Gilbert
Earth Surface Dynamics
Hydrology and Sediment Transport Processes
article

An extrapolation algorithm for estimating river bed grain size distributions across basins

Jordan Gilbert
article en

Abstract

Abstract. Values representing grain size distributions of stream reaches are essential for estimating sediment transport at the reach scale. Various modeling frameworks exist that attempt to simulate reach-scale sediment transport across entire drainage basins to characterize sediment dynamics at a watershed scale. Such frameworks require estimates of grain size at each reach. Because obtaining direct measurements at this scale is impractical and logistically difficult, methods to estimate or extrapolate grain size measurements are needed, however, few currently exist. Here I present an extrapolation algorithm that uses one or more pebble counts to extrapolate full grain size distributions to each reach of a drainage network. In addition to the pebble count measurements, the tool requires a stream network geospatial feature class, attributed with values for reach-averaged slope and some consistent measure of relative flow magnitude (or a proxy for flow). I tested the tool in a set of sub-watersheds in the Bitterroot River basin of western Montana, US, with varying valley morphologies, and compared predictions to measurements at 16 sites. When using multiple measurements for calibration, mean absolute percent error averaged 5.8 % of the measured grain sizes in the phi scale. When using a single measurement for calibration, error averaged 8.4 %.

Earth Surface DynamicsVol. 13(6)
Utah State University (US), University of Montana (US)
Openalex Percentile: Top 60%
Hydrology and Sediment Transport Processes
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.