skip to main content


Title: How do climate change experiments alter plot‐scale climate?
Abstract

To understand and forecast biological responses to climate change, scientists frequently use field experiments that alter temperature and precipitation. Climate manipulations can manifest in complex ways, however, challenging interpretations of biological responses. We reviewed publications to compile a database of daily plot‐scale climate data from 15 active‐warming experiments. We find that the common practices of analysing treatments as mean or categorical changes (e.g. warmed vs. unwarmed) masks important variation in treatment effects over space and time. Our synthesis showed that measured mean warming, in plots with the same target warming within a study, differed by up to 1.6 C (63% of target), on average, across six studies with blocked designs. Variation was high across sites and designs: for example, plots differed by 1.1 C (47% of target) on average, for infrared studies with feedback control (n = 3) vs. by 2.2 C (80% of target) on average for infrared with constant wattage designs (n = 2). Warming treatments produce non‐temperature effects as well, such as soil drying. The combination of these direct and indirect effects is complex and can have important biological consequences. With a case study of plant phenology across five experiments in our database, we show how accounting for drier soils with warming tripled the estimated sensitivity of budburst to temperature. We provide recommendations for future analyses, experimental design, and data sharing to improve our mechanistic understanding from climate change experiments, and thus their utility to accurately forecast species’ responses.

 
more » « less
Award ID(s):
1832210
PAR ID:
10460128
Author(s) / Creator(s):
 ;  ;  ;  ;  ;  ;  ;  ;  ;  ;
Publisher / Repository:
Wiley-Blackwell
Date Published:
Journal Name:
Ecology Letters
Volume:
22
Issue:
4
ISSN:
1461-023X
Page Range / eLocation ID:
p. 748-763
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    In 1990 Bender, Canfield, and McKay gave an asymptotic formula for the number of connected graphs onwith m edges, wheneverand. We give an asymptotic formula for the numberof connected r‐uniform hypergraphs onwith m edges, wheneveris fixed andwith, that is, the average degree tends to infinity. This complements recent results of Behrisch, Coja‐Oghlan, and Kang (the case) and the present authors (the case, ie, “nullity” or “excess”o(n)). The proof is based on probabilistic methods, and in particular on a bivariate local limit theorem for the number of vertices and edges in the largest component of a certain random hypergraph. The arguments are much simpler than in the sparse case; in particular, we can use “smoothing” techniques to directly prove the local limit theorem, without needing to first prove a central limit theorem.

     
    more » « less
  2. Abstract

    We prove that a WLD subspace of the spaceconsisting of all bounded, countably supported functions on a set Γ embeds isomorphically intoif and only if it does not contain isometric copies of. Moreover, a subspace ofis constructed that has an unconditional basis, does not embed into, and whose every weakly compact subset is separable (in particular, it cannot contain any isomorphic copies of).

     
    more » « less
  3. Abstract

    In this paper, we are interested in the following question: given an arbitrary Steiner triple systemonvertices and any 3‐uniform hypertreeonvertices, is it necessary thatcontainsas a subgraph provided? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive.

     
    more » « less
  4. Abstract

    IfGis a graph andis a set of subgraphs ofG, then an edge‐coloring ofGis called‐polychromatic if every graph fromgets all colors present inG. The‐polychromatic number ofG, denoted, is the largest number of colors such thatGhas an‐polychromatic coloring. In this article,is determined exactly whenGis a complete graph andis the family of all 1‐factors. In additionis found up to an additive constant term whenGis a complete graph andis the family of all 2‐factors, or the family of all Hamiltonian cycles.

     
    more » « less
  5. Abstract

    A graphGis said to be 2‐divisible if for all (nonempty) induced subgraphsHofG,can be partitioned into two setssuch thatand. (Heredenotes the clique number ofG, the number of vertices in a largest clique ofG). A graphGis said to be perfectly divisible if for all induced subgraphsHofG,can be partitioned into two setssuch thatis perfect and. We prove that if a graph is‐free, then it is 2‐divisible. We also prove that if a graph is bull‐free and either odd‐hole‐free orP5‐free, then it is perfectly divisible.

     
    more » « less