[{"OA_type":"closed access","date_published":"2016-07-01T00:00:00Z","fulldoi":"https://doi.org/10.1016/j.advwatres.2016.03.019","article_type":"original","keyword":["Soil moisture","Spatial heterogeneity","Hydrological response","Geomorphic response","Non-uniqueness","Hydraulic connectivity"],"date_updated":"2026-08-06T07:50:36Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"This study advances mechanistic interpretation of predictability challenges in hydro-geomorphology related to the role of soil moisture spatial variability. Using model formulations describing the physics of overland flow, variably saturated subsurface flow, and erosion and sediment transport, this study explores (1) why a basin with the same mean soil moisture can exhibit distinctly different spatial moisture distributions, (2) whether these varying distributions lead to non-unique hydro-geomorphic responses, and (3) what controls non-uniqueness in relation to the response type. Two sets of numerical experiments are carried out with two physically-based models, HYDRUS and tRIBS+VEGGIE+FEaST, and their outputs are analyzed with respect to pre-storm moisture state. The results demonstrate that distinct spatial moisture distributions for the same mean wetness arise because near-surface soil moisture dynamics exhibit different degrees of coupling with deeper-soil moisture and the process of subsurface drainage. The consequences of such variations are different depending on the type of hydrological response. Specifically, if the predominant runoff response is of infiltration excess type, the degree of non-uniqueness is related to the spatial distribution of near-surface moisture. If runoff is governed by subsurface stormflow, the extent of deep moisture contributing area and its “readiness to drain” determine the response characteristics. Because the processes of erosion and sediment transport superimpose additional controls over factors governing runoff generation and overland flow, non-uniqueness of the geomorphic response can be highly dampened or enhanced. The explanation is sediment composed by multi-size particles can alternate states of mobilization or surface shielding and the transient behavior is inherently intertwined with the availability of mobile particles. We conclude that complex nonlinear dynamics of hydro-geomorphic processes are inherent expressions of physical interactions. As complete knowledge of watershed properties, states, or forcings will always present the ultimate, if ever resolvable, challenge, deterministic predictability will remain handicapped. Coupling of uncertainty quantification methods and space-time physics-based approaches will need to evolve to facilitate mechanistic interpretations and informed practical applications.","lang":"eng"}],"intvolume":"        92","_id":"22510","status":"public","oa_version":"None","day":"01","das_tickbox":"1","citation":{"chicago":"Kim, Jongho, M. Chase Dwelle, Stephanie K. Kampf, Simone Fatichi, and Valeriy Y. Ivanov. “On the Non-Uniqueness of the Hydro-Geomorphic Responses in a Zero-Order Catchment with Respect to Soil Moisture.” <i>Advances in Water Resources</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.advwatres.2016.03.019\">https://doi.org/10.1016/j.advwatres.2016.03.019</a>.","short":"J. Kim, M.C. Dwelle, S.K. Kampf, S. Fatichi, V.Y. Ivanov, Advances in Water Resources 92 (2016) 73–89.","mla":"Kim, Jongho, et al. “On the Non-Uniqueness of the Hydro-Geomorphic Responses in a Zero-Order Catchment with Respect to Soil Moisture.” <i>Advances in Water Resources</i>, vol. 92, Elsevier, 2016, pp. 73–89, doi:<a href=\"https://doi.org/10.1016/j.advwatres.2016.03.019\">10.1016/j.advwatres.2016.03.019</a>.","ista":"Kim J, Dwelle MC, Kampf SK, Fatichi S, Ivanov VY. 2016. On the non-uniqueness of the hydro-geomorphic responses in a zero-order catchment with respect to soil moisture. Advances in Water Resources. 92, 73–89.","ama":"Kim J, Dwelle MC, Kampf SK, Fatichi S, Ivanov VY. On the non-uniqueness of the hydro-geomorphic responses in a zero-order catchment with respect to soil moisture. <i>Advances in Water Resources</i>. 2016;92:73-89. doi:<a href=\"https://doi.org/10.1016/j.advwatres.2016.03.019\">10.1016/j.advwatres.2016.03.019</a>","apa":"Kim, J., Dwelle, M. C., Kampf, S. K., Fatichi, S., &#38; Ivanov, V. Y. (2016). On the non-uniqueness of the hydro-geomorphic responses in a zero-order catchment with respect to soil moisture. <i>Advances in Water Resources</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.advwatres.2016.03.019\">https://doi.org/10.1016/j.advwatres.2016.03.019</a>","ieee":"J. Kim, M. C. Dwelle, S. K. Kampf, S. Fatichi, and V. Y. Ivanov, “On the non-uniqueness of the hydro-geomorphic responses in a zero-order catchment with respect to soil moisture,” <i>Advances in Water Resources</i>, vol. 92. Elsevier, pp. 73–89, 2016."},"year":"2016","publisher":"Elsevier","publication_identifier":{"issn":["0309-1708"]},"title":"On the non-uniqueness of the hydro-geomorphic responses in a zero-order catchment with respect to soil moisture","doi":"10.1016/j.advwatres.2016.03.019","type":"journal_article","extern":"1","scopus_import":"1","publication":"Advances in Water Resources","author":[{"first_name":"Jongho","full_name":"Kim, Jongho","last_name":"Kim"},{"full_name":"Dwelle, M. Chase","last_name":"Dwelle","first_name":"M. Chase"},{"last_name":"Kampf","full_name":"Kampf, Stephanie K.","first_name":"Stephanie K."},{"full_name":"Fatichi, Simone","last_name":"Fatichi","id":"cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6","first_name":"Simone"},{"first_name":"Valeriy Y.","full_name":"Ivanov, Valeriy Y.","last_name":"Ivanov"}],"date_created":"2026-07-27T12:30:24Z","article_processing_charge":"No","quality_controlled":"1","page":"73-89","language":[{"iso":"eng"}],"volume":92,"publication_status":"published","month":"07"},{"quality_controlled":"1","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"11928"}]},"date_created":"2022-07-28T06:50:51Z","article_processing_charge":"No","month":"01","volume":20,"language":[{"iso":"eng"}],"publication_status":"published","page":"31-60","extern":"1","doi":"10.1007/pl00009186","type":"journal_article","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"title":"Average-case analysis of dynamic graph algorithms","author":[{"last_name":"Alberts","full_name":"Alberts, D.","first_name":"D."},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"publication":"Algorithmica","scopus_import":"1","intvolume":"        20","acknowledgement":"The authors would like to thank Emo Welzl for helpful discussions.","year":"1998","citation":{"chicago":"Alberts, D., and Monika Henzinger. “Average-Case Analysis of Dynamic Graph Algorithms.” <i>Algorithmica</i>. Springer Nature, 1998. <a href=\"https://doi.org/10.1007/pl00009186\">https://doi.org/10.1007/pl00009186</a>.","short":"D. Alberts, M. Henzinger, Algorithmica 20 (1998) 31–60.","mla":"Alberts, D., and Monika Henzinger. “Average-Case Analysis of Dynamic Graph Algorithms.” <i>Algorithmica</i>, vol. 20, Springer Nature, 1998, pp. 31–60, doi:<a href=\"https://doi.org/10.1007/pl00009186\">10.1007/pl00009186</a>.","ista":"Alberts D, Henzinger M. 1998. Average-case analysis of dynamic graph algorithms. Algorithmica. 20, 31–60.","ama":"Alberts D, Henzinger M. Average-case analysis of dynamic graph algorithms. <i>Algorithmica</i>. 1998;20:31-60. doi:<a href=\"https://doi.org/10.1007/pl00009186\">10.1007/pl00009186</a>","apa":"Alberts, D., &#38; Henzinger, M. (1998). Average-case analysis of dynamic graph algorithms. <i>Algorithmica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/pl00009186\">https://doi.org/10.1007/pl00009186</a>","ieee":"D. Alberts and M. Henzinger, “Average-case analysis of dynamic graph algorithms,” <i>Algorithmica</i>, vol. 20. Springer Nature, pp. 31–60, 1998."},"publisher":"Springer Nature","day":"01","oa_version":"None","_id":"11680","status":"public","article_type":"original","fulldoi":"https://doi.org/10.1007/pl00009186","keyword":["Dynamic graph algorithm","Average-case analysis","Minimum spanning forest","Connectivity","Bipartiteness","Maximum matching."],"date_published":"1998-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"We present a model for edge updates with restricted randomness in dynamic graph algorithms and a general technique for analyzing the expected running time of an update operation. This model is able to capture the average case in many applications, since (1) it allows restrictions on the set of edges which can be used for insertions and (2) the type (insertion or deletion) of each update operation is arbitrary, i.e., not random. We use our technique to analyze existing and new dynamic algorithms for the following problems: maximum cardinality matching, minimum spanning forest, connectivity, 2-edge connectivity, k -edge connectivity, k -vertex connectivity, and bipartiteness. Given a random graph G with m 0 edges and n vertices and a sequence of l update operations such that the graph contains m i edges after operation i , the expected time for performing the updates for any l is O(llogn+∑li=1n/m−−√i) in the case of minimum spanning forests, connectivity, 2-edge connectivity, and bipartiteness. The expected time per update operation is O(n) in the case of maximum matching. We also give improved bounds for k -edge and k -vertex connectivity. Additionally we give an insertions-only algorithm for maximum cardinality matching with worst-case O(n) amortized time per insertion."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-11-06T12:26:40Z"},{"article_processing_charge":"No","date_created":"2022-07-28T06:58:36Z","quality_controlled":"1","page":"351-362","publication_status":"published","language":[{"iso":"eng"}],"volume":22,"month":"11","title":"Lower bounds for fully dynamic connectivity problems in graphs","publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"type":"journal_article","doi":"10.1007/pl00009228","extern":"1","scopus_import":"1","publication":"Algorithmica","author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"M. L.","last_name":"Fredman","full_name":"Fredman, M. L."}],"issue":"3","intvolume":"        22","_id":"11681","status":"public","oa_version":"None","day":"01","publisher":"Springer Nature","acknowledgement":".","citation":{"ista":"Henzinger M, Fredman ML. 1998. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica. 22(3), 351–362.","ama":"Henzinger M, Fredman ML. Lower bounds for fully dynamic connectivity problems in graphs. <i>Algorithmica</i>. 1998;22(3):351-362. doi:<a href=\"https://doi.org/10.1007/pl00009228\">10.1007/pl00009228</a>","apa":"Henzinger, M., &#38; Fredman, M. L. (1998). Lower bounds for fully dynamic connectivity problems in graphs. <i>Algorithmica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/pl00009228\">https://doi.org/10.1007/pl00009228</a>","ieee":"M. Henzinger and M. L. Fredman, “Lower bounds for fully dynamic connectivity problems in graphs,” <i>Algorithmica</i>, vol. 22, no. 3. Springer Nature, pp. 351–362, 1998.","chicago":"Henzinger, Monika, and M. L. Fredman. “Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.” <i>Algorithmica</i>. Springer Nature, 1998. <a href=\"https://doi.org/10.1007/pl00009228\">https://doi.org/10.1007/pl00009228</a>.","mla":"Henzinger, Monika, and M. L. Fredman. “Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.” <i>Algorithmica</i>, vol. 22, no. 3, Springer Nature, 1998, pp. 351–62, doi:<a href=\"https://doi.org/10.1007/pl00009228\">10.1007/pl00009228</a>.","short":"M. Henzinger, M.L. Fredman, Algorithmica 22 (1998) 351–362."},"year":"1998","date_published":"1998-11-01T00:00:00Z","keyword":["Dynamic planarity testing","Dynamic connectivity testing","Lower bounds","Cell probe model"],"article_type":"original","fulldoi":"https://doi.org/10.1007/pl00009228","date_updated":"2024-11-06T12:08:20Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We prove lower bounds on the complexity of maintaining fully dynamic k -edge or k -vertex connectivity in plane graphs and in (k-1) -vertex connected graphs. We show an amortized lower bound of Ω (log n / {k (log log n} + log b)) per edge insertion, deletion, or query operation in the cell probe model, where b is the word size of the machine and n is the number of vertices in G . We also show an amortized lower bound of Ω (log n /(log log n + log b)) per operation for fully dynamic planarity testing in embedded graphs. These are the first lower bounds for fully dynamic connectivity problems."}]}]