@inproceedings{13967,
  abstract     = {A classic solution technique for Markov decision processes (MDP) and stochastic games (SG) is value iteration (VI). Due to its good practical performance, this approximative approach is typically preferred over exact techniques, even though no practical bounds on the imprecision of the result could be given until recently. As a consequence, even the most used model checkers could return arbitrarily wrong results. Over the past decade, different works derived stopping criteria, indicating when the precision reaches the desired level, for various settings, in particular MDP with reachability, total reward, and mean payoff, and SG with reachability.In this paper, we provide the first stopping criteria for VI on SG with total reward and mean payoff, yielding the first anytime algorithms in these settings. To this end, we provide the solution in two flavours: First through a reduction to the MDP case and second directly on SG. The former is simpler and automatically utilizes any advances on MDP. The latter allows for more local computations, heading towards better practical efficiency.Our solution unifies the previously mentioned approaches for MDP and SG and their underlying ideas. To achieve this, we isolate objective-specific subroutines as well as identify objective-independent concepts. These structural concepts, while surprisingly simple, form the very essence of the unified solution.},
  author       = {Kretinsky, Jan and Meggendorfer, Tobias and Weininger, Maximilian},
  booktitle    = {38th Annual ACM/IEEE Symposium on Logic in Computer Science},
  isbn         = {9798350335873},
  issn         = {1043-6871},
  location     = {Boston, MA, United States},
  publisher    = {IEEE},
  title        = {{Stopping criteria for value iteration on stochastic games with quantitative objectives}},
  doi          = {10.1109/LICS56636.2023.10175771},
  volume       = {2023},
  year         = {2023},
}

@article{14751,
  abstract     = {We consider zero-error communication over a two-transmitter deterministic adversarial multiple access channel (MAC) governed by an adversary who has access to the transmissions of both senders (hence called omniscient ) and aims to maliciously corrupt the communication. None of the encoders, jammer and decoder is allowed to randomize using private or public randomness. This enforces a combinatorial nature of the problem. Our model covers a large family of channels studied in the literature, including all deterministic discrete memoryless noisy or noiseless MACs. In this work, given an arbitrary two-transmitter deterministic omniscient adversarial MAC, we characterize when the capacity region: 1) has nonempty interior (in particular, is two-dimensional); 2) consists of two line segments (in particular, has empty interior); 3) consists of one line segment (in particular, is one-dimensional); 4) or only contains (0,0) (in particular, is zero-dimensional). This extends a recent result by Wang et al. (201 9) from the point-to-point setting to the multiple access setting. Indeed, our converse arguments build upon their generalized Plotkin bound and involve delicate case analysis. One of the technical challenges is to take care of both “joint confusability” and “marginal confusability”. In particular, the treatment of marginal confusability does not follow from the point-to-point results by Wang et al. Our achievability results follow from random coding with expurgation.},
  author       = {Zhang, Yihan},
  issn         = {1557-9654},
  journal      = {IEEE Transactions on Information Theory},
  keywords     = {Computer Science Applications, Information Systems},
  number       = {7},
  pages        = {4093--4127},
  publisher    = {IEEE},
  title        = {{Zero-error communication over adversarial MACs}},
  doi          = {10.1109/tit.2023.3257239},
  volume       = {69},
  year         = {2023},
}

@article{13269,
  abstract     = {This paper is a collection of results on combinatorial properties of codes for the Z-channel . A Z-channel with error fraction τ takes as input a length- n binary codeword and injects in an adversarial manner up to n τ asymmetric errors, i.e., errors that only zero out bits but do not flip 0’s to 1’s. It is known that the largest ( L - 1)-list-decodable code for the Z-channel with error fraction τ has exponential size (in n ) if τ is less than a critical value that we call the ( L - 1)- list-decoding Plotkin point and has constant size if τ is larger than the threshold. The ( L -1)-list-decoding Plotkin point is known to be L -1/L-1 – L -L/ L-1 , which equals 1/4 for unique-decoding with L -1 = 1. In this paper, we derive various results for the size of the largest codes above and below the list-decoding Plotkin point. In particular, we show that the largest ( L -1)-list-decodable code ε-above the Plotkin point, for any given sufficiently small positive constant ε > 0, has size Θ L (ε -3/2 ) for any L - 1 ≥ 1. We also devise upper and lower bounds on the exponential size of codes below the list-decoding Plotkin point.},
  author       = {Polyanskii, Nikita and Zhang, Yihan},
  issn         = {1557-9654},
  journal      = {IEEE Transactions on Information Theory},
  number       = {10},
  pages        = {6340--6357},
  publisher    = {IEEE},
  title        = {{Codes for the Z-channel}},
  doi          = {10.1109/TIT.2023.3292219},
  volume       = {69},
  year         = {2023},
}

@article{22534,
  abstract     = {Tree planting is a prevalent strategy to mitigate urban heat. Tree cooling efficiency(TCE), defined as the temperature reduction for a 1% tree cover increase, plays animportant role in urban climate as it regulates the capacity of trees to alter the sur-face energy and water budget. However, the spatial variation and more importantly,temporal heterogeneity of TCE in global cities are not fully explored. Here, we usedLandsat-based tree cover and land surface temperature (LST) to compare TCEs at areference air temperature and tree cover level across 806 global cities and to exploretheir potential drivers with a boosted regression tree (BRT) machine learning model.From the results, we found that TCE is spatially regulated by not only leaf area index(LAI) but climate variables and anthropogenic factors especially city albedo, withouta specific variable dominating the others. However, such spatial difference is attenu-ated by the decrease of TCE with tree cover, most pronounced in midlatitude cities.During the period 2000–2015, more than 90% of analyzed cities showed an increas-ing trend in TCE, which is likely explained by a combined result of the increase in LAI,intensified solar radiation due to decreased aerosol content, increase in urban vaporpressure deficit (VPD) and decrease of city albedo. Concurrently, significant urbanafforestation occurred across many cities showing a global city-scale mean tree coverincrease of 5.3 ± 3.8% from 2000 to 2015. Over the growing season, such increasescombined with an increasing TCE were estimated to on average yield a midday sur-face cooling of 1.5 ± 1.3°C in tree-covered urban areas. These results are offeringnew insights into the use of urban afforestation as an adaptation to global warmingand urban planners may leverage them to provide more cooling benefits if trees areprimarily planted for this purpose.},
  author       = {Zhao, Jiacheng and Zhao, Xiang and Wu, Donghai and Meili, Naika and Fatichi, Simone},
  issn         = {1365-2486},
  journal      = {Global Change Biology},
  keywords     = {Climate change, Remote sensing, Tree cooling efficiency, Tree cover, Urban afforestation},
  number       = {11},
  pages        = {3085--3097},
  publisher    = {Wiley},
  title        = {{Satellite‐based evidence highlights a considerable increase of urban tree cooling benefits from 2000 to 2015}},
  doi          = {10.1111/gcb.16667},
  volume       = {29},
  year         = {2023},
}

@article{22561,
  abstract     = {Urban tree planting is an effective strategy to reduce temperature locally and eventually mitigate Urban Heat
Island. Although its cooling effects have been widely reported, understanding of coupling effects of street
morphologies and tree characteristics on thermal environment is insufficient, especially in high-density cities. A
parametric study is conducted to investigate effects of leaf area index (LAI = 1.0,2.0,3.0,4.0,5.0,6.0) and tree
crown radius (rtree = 2.0,3.4,4.4,5.0 m) on thermal environment inside streets with various aspect ratios (street
height/width, H/W = 1.0–5.0). A mechanistic urban canopy model Urban Tethys-Chloris (UT&C) is selected and
integrated with a new semi-empirical wind parameterization based on drag coefficients and frontal area densities
of buildings and trees. Modified UT&C is validated by a unique and controllable scaled outdoor experiment. The
research outputs can be summarized as follows: (1) Calculated air temperature (Ta), wind speed (V), and thermal
comfort indices (Mean Radiant Temperature (Tmrt) and Universal Thermal Climate Index (UTCI)) are in good
agreement with results from scaled outdoor experiments, while slight overestimation of relative humidity (RH)
occurs in tree cases; (2) Increasing LAI and rtree both bring stronger cooling effects by up to 20.2 ◦C (Tmrt) and
4.0 ◦C (UTCI); (3) Narrower streets weaken trees’ cooling effects and increasing LAI and rtree could be less
efficient for higher H/W than lower H/W; (4) LAI = 4.0 and rtree = 5.0 m are optimal for wide streets (H/W =
1.0–3.0) to provide maximum UTCI cooling (about 4.0 ◦C), while LAI = 4.0 and rtree = 3.4 m are suggested for
narrow streets (H/W = 3.0–5.0). Our study provides useful information on evidence-based urban tree selection
strategies for urban planning and design. },
  author       = {Chen, Taihan and Meili, Naika and Fatichi, Simone and Hang, Jian and Tan, Puay Yok and Yuan, Chao},
  issn         = {1873-684X},
  journal      = {Building and Environment},
  keywords     = {Urban canopy model, Scaled outdoor experiment, Street aspect ratio, Urban vegetation, Pedestrian thermal comfort},
  publisher    = {Elsevier},
  title        = {{Effects of tree plantings with varying street aspect ratios on the thermal environment using a mechanistic urban canopy model}},
  doi          = {10.1016/j.buildenv.2023.111006},
  volume       = {246},
  year         = {2023},
}

@article{22554,
  abstract     = {Investigating modifications in the hydrological cycle is essential to understand the impacts of climate change on ecosystems. This study assesses the change in the velocity of the water cycle over land at the global scale, whereas previous studies have mostly focused on changes in the atmospheric water cycle. The hydrological acceleration is quantified by a decrease in average residence time (RT) of water in the first meter of soil. The soil water RT is shown to be sensitive to the soil texture and seasonality of hydroclimatic variables. Despite substantial local variability, most of the RTs are in the range of 50–300 days. The global mean soil water RT declined at a rate of −2.30 and −0.36 days decade−1 (−1.6 to 1.0 days decade−1 the range of nine models) from 2001 to 2020 as measured by reanalysis and CMIP6 simulations for the historical scenario, respectively, which corresponds to −6.8 and −1.1 days °C−1 when expressed per degree of global warming over land. This acceleration is projected to continue at a rate of −1.35 days decade−1 (−3.4 to 0.0 days decade−1 the range of nine models) or −2.2 days °C−1 during the period 2015–2100 under the most extreme emission scenario: SSP 585. Changes in precipitation dominantly drive the acceleration of the terrestrial water cycle compared to changes in evapotranspiration. Rising temperatures and increasing carbon dioxide have opposite effects on the speed of the terrestrial water cycle with compensatory roles keeping RT relatively unchanged in the absence of PR trends.},
  author       = {Wang, Y. and Meili, N. and Fatichi, Simone},
  issn         = {1944-7973},
  journal      = {Water Resources Research},
  number       = {8},
  publisher    = {American Geophysical Union},
  title        = {{Evidence and controls of the acceleration of the hydrological cycle over land}},
  doi          = {10.1029/2022wr033970},
  volume       = {59},
  year         = {2023},
}

@inproceedings{13221,
  abstract     = {The safety-liveness dichotomy is a fundamental concept in formal languages which plays a key role in verification. Recently, this dichotomy has been lifted to quantitative properties, which are arbitrary functions from infinite words to partially-ordered domains. We look into harnessing the dichotomy for the specific classes of quantitative properties expressed by quantitative automata. These automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totallyordered domain of real numbers. In this automata-theoretic setting, we establish a connection between quantitative safety and topological continuity and provide an alternative characterization of quantitative safety and liveness in terms of their boolean counterparts. For all common value functions, we show how the safety closure of a quantitative automaton can be constructed in PTime, and we provide PSpace-complete checks of whether a given quantitative automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata, for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf, and LimSup automata, we give PTime decompositions into safe and live automata. These decompositions enable the separation of techniques for safety and liveness verification for quantitative specifications.},
  author       = {Boker, Udi and Henzinger, Thomas A and Mazzocchi, Nicolas Adrien and Sarac, Naci E},
  booktitle    = {34th International Conference on Concurrency Theory},
  isbn         = {9783959772990},
  issn         = {1868-8969},
  location     = {Antwerp, Belgium},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Safety and liveness of quantitative automata}},
  doi          = {10.4230/LIPIcs.CONCUR.2023.17},
  volume       = {279},
  year         = {2023},
}

@article{13965,
  abstract     = {Many modes and mechanisms of epigenetic inheritance have been elucidated in eukaryotes. Most of them are relatively short-term, generally not exceeding one or a few organismal generations. However, emerging evidence indicates that one mechanism, cytosine DNA methylation, can mediate epigenetic inheritance over much longer timescales, which are mostly or completely inaccessible in the laboratory. Here we discuss the evidence for, and mechanisms and implications of, such long-term epigenetic inheritance. We argue that compelling evidence supports the long-term epigenetic inheritance of gene body methylation, at least in the model angiosperm Arabidopsis thaliana, and that variation in such methylation can therefore serve as an epigenetic basis for phenotypic variation in natural populations.},
  author       = {Hollwey, Elizabeth and Briffa, Amy and Howard, Martin and Zilberman, Daniel},
  issn         = {1879-0380},
  journal      = {Current Opinion in Genetics & Development},
  number       = {8},
  publisher    = {Elsevier},
  title        = {{Concepts, mechanisms and implications of long-term epigenetic inheritance}},
  doi          = {10.1016/j.gde.2023.102087},
  volume       = {81},
  year         = {2023},
}

@article{14774,
  abstract     = {Morphogen gradients impart positional information to cells in a homogenous tissue field. Fgf8a, a highly conserved growth factor, has been proposed to act as a morphogen during zebrafish gastrulation. However, technical limitations have so far prevented direct visualization of the endogenous Fgf8a gradient and confirmation of its morphogenic activity. Here, we monitor Fgf8a propagation in the developing neural plate using a CRISPR/Cas9-mediated EGFP knock-in at the endogenous fgf8a locus. By combining sensitive imaging with single-molecule fluorescence correlation spectroscopy, we demonstrate that Fgf8a, which is produced at the embryonic margin, propagates by diffusion through the extracellular space and forms a graded distribution towards the animal pole. Overlaying the Fgf8a gradient curve with expression profiles of its downstream targets determines the precise input-output relationship of Fgf8a-mediated patterning. Manipulation of the extracellular Fgf8a levels alters the signaling outcome, thus establishing Fgf8a as a bona fide morphogen during zebrafish gastrulation. Furthermore, by hindering Fgf8a diffusion, we demonstrate that extracellular diffusion of the protein from the source is crucial for it to achieve its morphogenic potential.},
  author       = {Harish, Rohit K and Gupta, Mansi and Zöller, Daniela and Hartmann, Hella and Gheisari, Ali and Machate, Anja and Hans, Stefan and Brand, Michael},
  issn         = {1477-9129},
  journal      = {Development},
  keywords     = {Developmental Biology, Molecular Biology},
  number       = {19},
  publisher    = {Company of Biologists},
  title        = {{Real-time monitoring of an endogenous Fgf8a gradient attests to its role as a morphogen during zebrafish gastrulation}},
  doi          = {10.1242/dev.201559},
  volume       = {150},
  year         = {2023},
}

@inbook{22530,
  abstract     = {Water Use Efficiency (WUE) expresses the trade-off between carbon assimilation (or subsequent carbon storage) and water release, two concurrent gas fluxes essential for plant functioning. Here, we review metrics that have been introduced to quantify WUE across spatial and temporal scales and corresponding observational methods. The physiological and environmental dependencies of WUE for crops and unmanaged ecosystems are discussed with a quantitative examination of observed and simulated WUE values. A constrained range of WUE across ecosystems and climates is highlighted. However, WUE increased considerably in the past century in response to growing atmospheric CO2 concentration and it will likely continue along the same trajectory in the near future.},
  author       = {Fatichi, Simone and Paschalis, Athanasios and Bonetti, Sara and Manoli, Gabriele and Pappas, Christoforos},
  booktitle    = {Encyclopedia of Soils in the Environment},
  editor       = {Goss, Michael J. and Oliver, Margaret},
  isbn         = {9780323951333},
  pages        = {527--542},
  publisher    = {Elsevier},
  title        = {{Water use efficiency: A review of spatial and temporal variability}},
  doi          = {10.1016/b978-0-12-822974-3.00166-x},
  volume       = {5},
  year         = {2023},
}

@article{14657,
  abstract     = {Natural selection is usually studied between mutants that differ in reproductive rate, but are subject to the same population structure. Here we explore how natural selection acts on mutants that have the same reproductive rate, but different population structures. In our framework, population structure is given by a graph that specifies where offspring can disperse. The invading mutant disperses offspring on a different graph than the resident wild-type. We find that more densely connected dispersal graphs tend to increase the invader’s fixation probability, but the exact relationship between structure and fixation probability is subtle. We present three main results. First, we prove that if both invader and resident are on complete dispersal graphs, then removing a single edge in the invader’s dispersal graph reduces its fixation probability. Second, we show that for certain island models higher invader’s connectivity increases its fixation probability, but the magnitude of the effect depends on the exact layout of the connections. Third, we show that for lattices the effect of different connectivity is comparable to that of different fitness: for large population size, the invader’s fixation probability is either constant or exponentially small, depending on whether it is more or less connected than the resident.},
  author       = {Tkadlec, Josef and Kaveh, Kamran and Chatterjee, Krishnendu and Nowak, Martin A.},
  issn         = {1742-5662},
  journal      = {Journal of the Royal Society Interface},
  number       = {208},
  publisher    = {Royal Society},
  title        = {{Evolutionary dynamics of mutants that modify population structure}},
  doi          = {10.1098/rsif.2023.0355},
  volume       = {20},
  year         = {2023},
}

@article{14036,
  abstract     = {Magic-angle spinning (MAS) nuclear magnetic resonance (NMR) is establishing itself as a powerful method for the characterization of protein dynamics at the atomic scale. We discuss here how R1ρ MAS relaxation dispersion NMR can explore microsecond-to-millisecond motions. Progress in instrumentation, isotope labeling, and pulse sequence design has paved the way for quantitative analyses of even rare structural fluctuations. In addition to isotropic chemical-shift fluctuations exploited in solution-state NMR relaxation dispersion experiments, MAS NMR has a wider arsenal of observables, allowing to see motions even if the exchanging states do not differ in their chemical shifts. We demonstrate the potential of the technique for probing motions in challenging large enzymes, membrane proteins, and protein assemblies.},
  author       = {Napoli, Federico and Becker, Lea Marie and Schanda, Paul},
  issn         = {1879-033X},
  journal      = {Current Opinion in Structural Biology},
  number       = {10},
  publisher    = {Elsevier},
  title        = {{Protein dynamics detected by magic-angle spinning relaxation dispersion NMR}},
  doi          = {10.1016/j.sbi.2023.102660},
  volume       = {82},
  year         = {2023},
}

@article{14042,
  abstract     = {Long-time and large-data existence of weak solutions for initial- and boundary-value problems concerning three-dimensional flows of incompressible fluids is nowadays available not only for Navier–Stokes fluids but also for various fluid models where the relation between the Cauchy stress tensor and the symmetric part of the velocity gradient is nonlinear. The majority of such studies however concerns models where such a dependence is explicit (the stress is a function of the velocity gradient), which makes the class of studied models unduly restrictive. The same concerns boundary conditions, or more precisely the slipping mechanisms on the boundary, where the no-slip is still the most preferred condition considered in the literature. Our main objective is to develop a robust mathematical theory for unsteady internal flows of implicitly constituted incompressible fluids with implicit relations between the tangential projections of the velocity and the normal traction on the boundary. The theory covers numerous rheological models used in chemistry, biorheology, polymer and food industry as well as in geomechanics. It also includes, as special cases, nonlinear slip as well as stick–slip boundary conditions. Unlike earlier studies, the conditions characterizing admissible classes of constitutive equations are expressed by means of tools of elementary calculus. In addition, a fully constructive proof (approximation scheme) is incorporated. Finally, we focus on the question of uniqueness of such weak solutions.},
  author       = {Bulíček, Miroslav and Málek, Josef and Maringová, Erika},
  issn         = {1422-6952},
  journal      = {Journal of Mathematical Fluid Mechanics},
  number       = {3},
  publisher    = {Springer Nature},
  title        = {{On unsteady internal flows of incompressible fluids characterized by implicit constitutive equations in the bulk and on the boundary}},
  doi          = {10.1007/s00021-023-00803-w},
  volume       = {25},
  year         = {2023},
}

@article{14466,
  abstract     = {The first long-lived turbulent structures observable in planar shear flows take the form of localized stripes, inclined with respect to the mean flow direction. The dynamics of these stripes is central to transition, and recent studies proposed an analogy to directed percolation where the stripes’ proliferation is ultimately responsible for the turbulence becoming sustained. In the present study we focus on the internal stripe dynamics as well as on the eventual stripe expansion, and we compare the underlying mechanisms in pressure- and shear-driven planar flows, respectively, plane-Poiseuille and plane-Couette flow. Despite the similarities of the overall laminar–turbulence patterns, the stripe proliferation processes in the two cases are fundamentally different. Starting from the growth and sustenance of individual stripes, we find that in plane-Couette flow new streaks are created stochastically throughout the stripe whereas in plane-Poiseuille flow streak creation is deterministic and occurs locally at the downstream tip. Because of the up/downstream symmetry, Couette stripes, in contrast to Poiseuille stripes, have two weak and two strong laminar turbulent interfaces. These differences in symmetry as well as in internal growth give rise to two fundamentally different stripe splitting mechanisms. In plane-Poiseuille flow splitting is connected to the elongational growth of the original stripe, and it results from a break-off/shedding of the stripe's tail. In plane-Couette flow splitting follows from a broadening of the original stripe and a division along the stripe into two slimmer stripes.},
  author       = {Marensi, Elena and Yalniz, Gökhan and Hof, Björn},
  issn         = {1469-7645},
  journal      = {Journal of Fluid Mechanics},
  keywords     = {turbulence, transition to turbulence, patterns},
  publisher    = {Cambridge University Press},
  title        = {{Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows}},
  doi          = {10.1017/jfm.2023.780},
  volume       = {974},
  year         = {2023},
}

@article{12105,
  abstract     = {Data-driven dimensionality reduction methods such as proper orthogonal decomposition and dynamic mode decomposition have proven to be useful for exploring complex phenomena within fluid dynamics and beyond. A well-known challenge for these techniques is posed by the continuous symmetries, e.g. translations and rotations, of the system under consideration, as drifts in the data dominate the modal expansions without providing an insight into the dynamics of the problem. In the present study, we address this issue for fluid flows in rectangular channels by formulating a continuous symmetry reduction method that eliminates the translations in the streamwise and spanwise directions simultaneously. We demonstrate our method by computing the symmetry-reduced dynamic mode decomposition (SRDMD) of sliding windows of data obtained from the transitional plane-Couette and turbulent plane-Poiseuille flow simulations. In the former setting, SRDMD captures the dynamics in the vicinity of the invariant solutions with translation symmetries, i.e. travelling waves and relative periodic orbits, whereas in the latter, our calculations reveal episodes of turbulent time evolution that can be approximated by a low-dimensional linear expansion.},
  author       = {Marensi, Elena and Yalniz, Gökhan and Hof, Björn and Budanur, Nazmi B},
  issn         = {1469-7645},
  journal      = {Journal of Fluid Mechanics},
  publisher    = {Cambridge University Press},
  title        = {{Symmetry-reduced dynamic mode decomposition of near-wall turbulence}},
  doi          = {10.1017/jfm.2022.1001},
  volume       = {954},
  year         = {2023},
}

@article{13274,
  abstract     = {Viscous flows through pipes and channels are steady and ordered until, with increasing velocity, the laminar motion catastrophically breaks down and gives way to turbulence. How this apparently discontinuous change from low- to high-dimensional motion can be rationalized within the framework of the Navier-Stokes equations is not well understood. Exploiting geometrical properties of transitional channel flow we trace turbulence to far lower Reynolds numbers (Re) than previously possible and identify the complete path that reversibly links fully turbulent motion to an invariant solution. This precursor of turbulence destabilizes rapidly with Re, and the accompanying explosive increase in attractor dimension effectively marks the transition between deterministic and de facto stochastic dynamics.},
  author       = {Paranjape, Chaitanya S and Yalniz, Gökhan and Duguet, Yohann and Budanur, Nazmi B and Hof, Björn},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  keywords     = {General Physics and Astronomy},
  number       = {3},
  publisher    = {American Physical Society},
  title        = {{Direct path from turbulence to time-periodic solutions}},
  doi          = {10.1103/physrevlett.131.034002},
  volume       = {131},
  year         = {2023},
}

@article{12421,
  abstract     = {The actin cytoskeleton plays a key role in cell migration and cellular morphodynamics in most eukaryotes. The ability of the actin cytoskeleton to assemble and disassemble in a spatiotemporally controlled manner allows it to form higher-order structures, which can generate forces required for a cell to explore and navigate through its environment. It is regulated not only via a complex synergistic and competitive interplay between actin-binding proteins (ABP), but also by filament biochemistry and filament geometry. The lack of structural insights into how geometry and ABPs regulate the actin cytoskeleton limits our understanding of the molecular mechanisms that define actin cytoskeleton remodeling and, in turn, impact emerging cell migration characteristics. With the advent of cryo-electron microscopy (cryo-EM) and advanced computational methods, it is now possible to define these molecular mechanisms involving actin and its interactors at both atomic and ultra-structural levels in vitro and in cellulo. In this review, we will provide an overview of the available cryo-EM methods, applicable to further our understanding of the actin cytoskeleton, specifically in the context of cell migration. We will discuss how these methods have been employed to elucidate ABP- and geometry-defined regulatory mechanisms in initiating, maintaining, and disassembling cellular actin networks in migratory protrusions.},
  author       = {Fäßler, Florian and Javoor, Manjunath and Schur, Florian KM},
  issn         = {1470-8752},
  journal      = {Biochemical Society Transactions},
  keywords     = {Biochemistry},
  number       = {1},
  pages        = {87--99},
  publisher    = {Portland Press},
  title        = {{Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM}},
  doi          = {10.1042/bst20220221},
  volume       = {51},
  year         = {2023},
}

@inproceedings{14692,
  abstract     = {The generic-group model (GGM) aims to capture algorithms working over groups of prime order that only rely on the group operation, but do not exploit any additional structure given by the concrete implementation of the group. In it, it is possible to prove information-theoretic lower bounds on the hardness of problems like the discrete logarithm (DL) or computational Diffie-Hellman (CDH). Thus, since its introduction, it has served as a valuable tool to assess the concrete security provided by cryptographic schemes based on such problems. A work on the related algebraic-group model (AGM) introduced a method, used by many subsequent works, to adapt GGM lower bounds for one problem to another, by means of conceptually simple reductions.
In this work, we propose an alternative approach to extend GGM bounds from one problem to another. Following an idea by Yun [EC15], we show that, in the GGM, the security of a large class of problems can be reduced to that of geometric search-problems. By reducing the security of the resulting geometric-search problems to variants of the search-by-hypersurface problem, for which information theoretic lower bounds exist, we give alternative proofs of several results that used the AGM approach.
The main advantage of our approach is that our reduction from geometric search-problems works, as well, for the GGM with preprocessing (more precisely the bit-fixing GGM introduced by Coretti, Dodis and Guo [Crypto18]). As a consequence, this opens up the possibility of transferring preprocessing GGM bounds from one problem to another, also by means of simple reductions. Concretely, we prove novel preprocessing bounds on the hardness of the d-strong discrete logarithm, the d-strong Diffie-Hellman inversion, and multi-instance CDH problems, as well as a large class of Uber assumptions. Additionally, our approach applies to Shoup’s GGM without additional restrictions on the query behavior of the adversary, while the recent works of Zhang, Zhou, and Katz [AC22] and Zhandry [Crypto22] highlight that this is not the case for the AGM approach.},
  author       = {Auerbach, Benedikt and Hoffmann, Charlotte and Pascual Perez, Guillermo},
  booktitle    = {21st International Conference on Theory of Cryptography},
  isbn         = {9783031486203},
  issn         = {1611-3349},
  pages        = {301--330},
  publisher    = {Springer Nature},
  title        = {{Generic-group lower bounds via reductions between geometric-search problems: With and without preprocessing}},
  doi          = {10.1007/978-3-031-48621-0_11},
  volume       = {14371},
  year         = {2023},
}

@inproceedings{14691,
  abstract     = {Continuous Group-Key Agreement (CGKA) allows a group of users to maintain a shared key. It is the fundamental cryptographic primitive underlying group messaging schemes and related protocols, most notably TreeKEM, the underlying key agreement protocol of the Messaging Layer Security (MLS) protocol, a standard for group messaging by the IETF. CKGA works in an asynchronous setting where parties only occasionally must come online, and their messages are relayed by an untrusted server. The most expensive operation provided by CKGA is that which allows for a user to refresh their key material in order to achieve forward secrecy (old messages are secure when a user is compromised) and post-compromise security (users can heal from compromise). One caveat of early CGKA protocols is that these update operations had to be performed sequentially, with any user wanting to update their key material having had to receive and process all previous updates. Late versions of TreeKEM do allow for concurrent updates at the cost of a communication overhead per update message that is linear in the number of updating parties. This was shown to be indeed necessary when achieving PCS in just two rounds of communication by [Bienstock et al. TCC’20].
The recently proposed protocol CoCoA [Alwen et al. Eurocrypt’22], however, shows that this overhead can be reduced if PCS requirements are relaxed, and only a logarithmic number of rounds is required. The natural question, thus, is whether CoCoA is optimal in this setting.
In this work we answer this question, providing a lower bound on the cost (concretely, the amount of data to be uploaded to the server) for CGKA protocols that heal in an arbitrary k number of rounds, that shows that CoCoA is very close to optimal. Additionally, we extend CoCoA to heal in an arbitrary number of rounds, and propose a modification of it, with a reduced communication cost for certain k.
We prove our bound in a combinatorial setting where the state of the protocol progresses in rounds, and the state of the protocol in each round is captured by a set system, each set specifying a set of users who share a secret key. We show this combinatorial model is equivalent to a symbolic model capturing building blocks including PRFs and public-key encryption, related to the one used by Bienstock et al.
Our lower bound is of order k•n1+1/(k-1)/log(k), where 2≤k≤log(n) is the number of updates per user the protocol requires to heal. This generalizes the n2 bound for k=2 from Bienstock et al.. This bound almost matches the k⋅n1+2/(k-1) or k2⋅n1+1/(k-1) efficiency we get for the variants of the CoCoA protocol also introduced in this paper.},
  author       = {Auerbach, Benedikt and Cueto Noval, Miguel and Pascual Perez, Guillermo and Pietrzak, Krzysztof Z},
  booktitle    = {21st International Conference on Theory of Cryptography},
  isbn         = {9783031486203},
  issn         = {1611-3349},
  location     = {Taipei, Taiwan},
  pages        = {271--300},
  publisher    = {Springer Nature},
  title        = {{On the cost of post-compromise security in concurrent Continuous Group-Key Agreement}},
  doi          = {10.1007/978-3-031-48621-0_10},
  volume       = {14371},
  year         = {2023},
}

@article{12787,
  abstract     = {Populations evolve in spatially heterogeneous environments. While a certain trait might bring a fitness advantage in some patch of the environment, a different trait might be advantageous in another patch. Here, we study the Moran birth–death process with two types of individuals in a population stretched across two patches of size N, each patch favouring one of the two types. We show that the long-term fate of such populations crucially depends on the migration rate μ
 between the patches. To classify the possible fates, we use the distinction between polynomial (short) and exponential (long) timescales. We show that when μ is high then one of the two types fixates on the whole population after a number of steps that is only polynomial in N. By contrast, when μ is low then each type holds majority in the patch where it is favoured for a number of steps that is at least exponential in N. Moreover, we precisely identify the threshold migration rate μ⋆ that separates those two scenarios, thereby exactly delineating the situations that support long-term coexistence of the two types. We also discuss the case of various cycle graphs and we present computer simulations that perfectly match our analytical results.},
  author       = {Svoboda, Jakub and Tkadlec, Josef and Kaveh, Kamran and Chatterjee, Krishnendu},
  issn         = {1471-2946},
  journal      = {Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences},
  number       = {2271},
  publisher    = {The Royal Society},
  title        = {{Coexistence times in the Moran process with environmental heterogeneity}},
  doi          = {10.1098/rspa.2022.0685},
  volume       = {479},
  year         = {2023},
}

