Abstract

SummarySoil types or map units are considered to be taxonomically adjacent if they differ in only one criterion, defined by an arbitrary threshold value. By treating soil types as nodes of a graph and taxonomic adjacency as the graph edges connecting nodes, algebraic graph theory can be used to produce a measurement of the uncertainty in a soil map associated with arbitrary classification boundaries between soil types. The largest eigenvalue of the adjacency matrix of a graph, the spectral radius, is an indication of network complexity. A larger spectral radius indicates a more complex network, and a greater degree of uncertainty or potential error associated with taxonomic adjacency. Benchmark values of spectral radius for cases of no taxonomic adjacency, including a single pair of adjacent soils, a chain or cycle‐type graph structure and a fully connected graph, are established so that taxonomic adjacency indices based on the spectral radius can be established. Examples are shown from two contrasting USA soil landscapes in the Ouachita Mountains, Arkansas, and the coastal plain of North Carolina, using both US Soil Taxonomy and the world reference base. The taxonomic adjacency indices are also useful in assessing soil richness and pedodiversity, with smaller values indicating a greater likelihood that identified soils represent distinct entities.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.