@misc{TarasovaMerzKissetal.2019,
  author    = {Tarasova, Larisa and Merz, Ralf and Kiss, Andrea and Basso, Stefano and Bl{\"o}chl, G{\"u}nter and Merz, Bruno and Viglione, Alberto and Pl{\"o}tner, Stefan and Guse, Bj{\"o}rn and Schumann, Andreas and Fischer, Svenja and Ahrens, Bodo and Anwar, Faizan and B{\´a}rdossy, Andr{\´a}s and B{\"u}hler, Philipp and Haberlandt, Uwe and Kreibich, Heidi and Krug, Amelie and Lun, David and M{\"u}ller-Thomy, Hannes and Pidoto, Ross and Primo, Cristina and Seidel, Jochen and Vorogushyn, Sergiy and Wietzke, Luzie},
  title     = {Causative classification of river flood events},
  series = {Wiley Interdisciplinary Reviews : Water},
  volume    = {6},
  journal   = {Wiley Interdisciplinary Reviews : Water},
  number    = {4},
  publisher = {Wiley},
  address   = {Hoboken},
  issn      = {2049-1948},
  doi       = {10.1002/wat2.1353},
  pages     = {23},
  year      = {2019},
  abstract  = {A wide variety of processes controls the time of occurrence, duration, extent, and severity of river floods. Classifying flood events by their causative processes may assist in enhancing the accuracy of local and regional flood frequency estimates and support the detection and interpretation of any changes in flood occurrence and magnitudes. This paper provides a critical review of existing causative classifications of instrumental and preinstrumental series of flood events, discusses their validity and applications, and identifies opportunities for moving toward more comprehensive approaches. So far no unified definition of causative mechanisms of flood events exists. Existing frameworks for classification of instrumental and preinstrumental series of flood events adopt different perspectives: hydroclimatic (large-scale circulation patterns and atmospheric state at the time of the event), hydrological (catchment scale precipitation patterns and antecedent catchment state), and hydrograph-based (indirectly considering generating mechanisms through their effects on hydrograph characteristics). All of these approaches intend to capture the flood generating mechanisms and are useful for characterizing the flood processes at various spatial and temporal scales. However, uncertainty analyses with respect to indicators, classification methods, and data to assess the robustness of the classification are rarely performed which limits the transferability across different geographic regions. It is argued that more rigorous testing is needed. There are opportunities for extending classification methods to include indicators of space-time dynamics of rainfall, antecedent wetness, and routing effects, which will make the classification schemes even more useful for understanding and estimating floods. This article is categorized under: Science of Water > Water Extremes Science of Water > Hydrological Processes Science of Water > Methods},
  language  = {en}
}
@article{GoebelLagodzinskiSeidel2021,
  author    = {G{\"o}bel, Andreas and Lagodzinski, Gregor J. A. and Seidel, Karen},
  title     = {Counting homomorphisms to trees modulo a prime},
  series = {ACM transactions on computation theory : TOCT / Association for Computing Machinery},
  volume    = {13},
  journal   = {ACM transactions on computation theory : TOCT / Association for Computing Machinery},
  number    = {3},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {1942-3454},
  doi       = {10.1145/3460958},
  pages     = {1 -- 33},
  year      = {2021},
  abstract  = {Many important graph-theoretic notions can be encoded as counting graph homomorphism problems, such as partition functions in statistical physics, in particular independent sets and colourings. In this article, we study the complexity of \#(p) HOMSTOH, the problem of counting graph homomorphisms from an input graph to a graph H modulo a prime number p. Dyer and Greenhill proved a dichotomy stating that the tractability of non-modular counting graph homomorphisms depends on the structure of the target graph. Many intractable cases in non-modular counting become tractable in modular counting due to the common phenomenon of cancellation. In subsequent studies on counting modulo 2, however, the influence of the structure of H on the tractability was shown to persist, which yields similar dichotomies. <br /> Our main result states that for every tree H and every prime p the problem \#pHOMSTOH is either polynomial time computable or \#P-p-complete. This relates to the conjecture of Faben and Jerrum stating that this dichotomy holds for every graph H when counting modulo 2. In contrast to previous results on modular counting, the tractable cases of \#pHOMSTOH are essentially the same for all values of the modulo when H is a tree. To prove this result, we study the structural properties of a homomorphism. As an important interim result, our study yields a dichotomy for the problem of counting weighted independent sets in a bipartite graph modulo some prime p. These results are the first suggesting that such dichotomies hold not only for the modulo 2 case but also for the modular counting functions of all primes p.},
  language  = {en}
}