---
_id: '14042'
abstract:
- lang: eng
  text: 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.
acknowledgement: "M. Bulíček and J. Málek acknowledge the support of the project No.
  20-11027X financed by the Czech Science foundation (GAČR). M. Bulíček and J. Málek
  are members of the Nečas Center for Mathematical Modelling.\r\nOpen access publishing
  supported by the National Technical Library in Prague."
article_number: '72'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Miroslav
  full_name: Bulíček, Miroslav
  last_name: Bulíček
- first_name: Josef
  full_name: Málek, Josef
  last_name: Málek
- first_name: Erika
  full_name: Maringová, Erika
  id: dbabca31-66eb-11eb-963a-fb9c22c880b4
  last_name: Maringová
citation:
  ama: Bulíček M, Málek J, Maringová E. On unsteady internal flows of incompressible
    fluids characterized by implicit constitutive equations in the bulk and on the
    boundary. <i>Journal of Mathematical Fluid Mechanics</i>. 2023;25(3). doi:<a href="https://doi.org/10.1007/s00021-023-00803-w">10.1007/s00021-023-00803-w</a>
  apa: Bulíček, M., Málek, J., &#38; Maringová, E. (2023). On unsteady internal flows
    of incompressible fluids characterized by implicit constitutive equations in the
    bulk and on the boundary. <i>Journal of Mathematical Fluid Mechanics</i>. Springer
    Nature. <a href="https://doi.org/10.1007/s00021-023-00803-w">https://doi.org/10.1007/s00021-023-00803-w</a>
  chicago: Bulíček, Miroslav, Josef Málek, and Erika Maringová. “On Unsteady Internal
    Flows of Incompressible Fluids Characterized by Implicit Constitutive Equations
    in the Bulk and on the Boundary.” <i>Journal of Mathematical Fluid Mechanics</i>.
    Springer Nature, 2023. <a href="https://doi.org/10.1007/s00021-023-00803-w">https://doi.org/10.1007/s00021-023-00803-w</a>.
  ieee: M. Bulíček, J. Málek, and E. Maringová, “On unsteady internal flows of incompressible
    fluids characterized by implicit constitutive equations in the bulk and on the
    boundary,” <i>Journal of Mathematical Fluid Mechanics</i>, vol. 25, no. 3. Springer
    Nature, 2023.
  ista: Bulíček M, Málek J, Maringová E. 2023. On unsteady internal flows of incompressible
    fluids characterized by implicit constitutive equations in the bulk and on the
    boundary. Journal of Mathematical Fluid Mechanics. 25(3), 72.
  mla: Bulíček, Miroslav, et al. “On Unsteady Internal Flows of Incompressible Fluids
    Characterized by Implicit Constitutive Equations in the Bulk and on the Boundary.”
    <i>Journal of Mathematical Fluid Mechanics</i>, vol. 25, no. 3, 72, Springer Nature,
    2023, doi:<a href="https://doi.org/10.1007/s00021-023-00803-w">10.1007/s00021-023-00803-w</a>.
  short: M. Bulíček, J. Málek, E. Maringová, Journal of Mathematical Fluid Mechanics
    25 (2023).
date_created: 2023-08-13T22:01:13Z
date_published: 2023-08-01T00:00:00Z
date_updated: 2026-08-18T07:47:38Z
day: '01'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1007/s00021-023-00803-w
external_id:
  arxiv:
  - '2301.12834'
  isi:
  - '001040354900001'
file:
- access_level: open_access
  checksum: c549cd8f0dd02ed60477a05ca045f481
  content_type: application/pdf
  creator: dernst
  date_created: 2023-08-14T07:24:17Z
  date_updated: 2023-08-14T07:24:17Z
  file_id: '14046'
  file_name: 2023_JourMathFluidMech_Bulicek.pdf
  file_size: 845748
  relation: main_file
  success: 1
file_date_updated: 2023-08-14T07:24:17Z
fulldoi: https://doi.org/10.1007/s00021-023-00803-w
has_accepted_license: '1'
intvolume: '        25'
isi: 1
issue: '3'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: Journal of Mathematical Fluid Mechanics
publication_identifier:
  eissn:
  - 1422-6952
  issn:
  - 1422-6928
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: On unsteady internal flows of incompressible fluids characterized by implicit
  constitutive equations in the bulk and on the boundary
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2023'
...
---
_id: '14466'
abstract:
- lang: eng
  text: 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.
acknowledgement: E.M. acknowledges funding from the ISTplus fellowship programme.
  G.Y. and B.H. acknowledge a grant from the Simons Foundation (662960, BH).
article_number: A21
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Elena
  full_name: Marensi, Elena
  id: 0BE7553A-1004-11EA-B805-18983DDC885E
  last_name: Marensi
  orcid: 0000-0001-7173-4923
- first_name: Gökhan
  full_name: Yalniz, Gökhan
  id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425
  last_name: Yalniz
  orcid: 0000-0002-8490-9312
- first_name: Björn
  full_name: Hof, Björn
  id: 3A374330-F248-11E8-B48F-1D18A9856A87
  last_name: Hof
  orcid: 0000-0003-2057-2754
citation:
  ama: Marensi E, Yalniz G, Hof B. Dynamics and proliferation of turbulent stripes
    in plane-Poiseuille and plane-Couette flows. <i>Journal of Fluid Mechanics</i>.
    2023;974. doi:<a href="https://doi.org/10.1017/jfm.2023.780">10.1017/jfm.2023.780</a>
  apa: Marensi, E., Yalniz, G., &#38; Hof, B. (2023). Dynamics and proliferation of
    turbulent stripes in plane-Poiseuille and plane-Couette flows. <i>Journal of Fluid
    Mechanics</i>. Cambridge University Press. <a href="https://doi.org/10.1017/jfm.2023.780">https://doi.org/10.1017/jfm.2023.780</a>
  chicago: Marensi, Elena, Gökhan Yalniz, and Björn Hof. “Dynamics and Proliferation
    of Turbulent Stripes in Plane-Poiseuille and Plane-Couette Flows.” <i>Journal
    of Fluid Mechanics</i>. Cambridge University Press, 2023. <a href="https://doi.org/10.1017/jfm.2023.780">https://doi.org/10.1017/jfm.2023.780</a>.
  ieee: E. Marensi, G. Yalniz, and B. Hof, “Dynamics and proliferation of turbulent
    stripes in plane-Poiseuille and plane-Couette flows,” <i>Journal of Fluid Mechanics</i>,
    vol. 974. Cambridge University Press, 2023.
  ista: Marensi E, Yalniz G, Hof B. 2023. Dynamics and proliferation of turbulent
    stripes in plane-Poiseuille and plane-Couette flows. Journal of Fluid Mechanics.
    974, A21.
  mla: Marensi, Elena, et al. “Dynamics and Proliferation of Turbulent Stripes in
    Plane-Poiseuille and Plane-Couette Flows.” <i>Journal of Fluid Mechanics</i>,
    vol. 974, A21, Cambridge University Press, 2023, doi:<a href="https://doi.org/10.1017/jfm.2023.780">10.1017/jfm.2023.780</a>.
  short: E. Marensi, G. Yalniz, B. Hof, Journal of Fluid Mechanics 974 (2023).
corr_author: '1'
date_created: 2023-10-30T09:32:28Z
date_published: 2023-11-10T00:00:00Z
date_updated: 2026-09-02T08:16:31Z
day: '10'
ddc:
- '530'
department:
- _id: GradSch
- _id: BjHo
doi: 10.1017/jfm.2023.780
external_id:
  arxiv:
  - '2212.12406'
  isi:
  - '001088363700001'
file:
- access_level: open_access
  checksum: 17c64c1fb0d5f73252364bf98b0b9e1a
  content_type: application/pdf
  creator: dernst
  date_created: 2024-02-15T09:05:21Z
  date_updated: 2024-02-15T09:05:21Z
  file_id: '14996'
  file_name: 2023_JourFluidMechanics_Marensi.pdf
  file_size: 2804641
  relation: main_file
  success: 1
file_date_updated: 2024-02-15T09:05:21Z
fulldoi: https://doi.org/10.1017/jfm.2023.780
has_accepted_license: '1'
intvolume: '       974'
isi: 1
keyword:
- turbulence
- transition to turbulence
- patterns
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 238598C6-32DE-11EA-91FC-C7463DDC885E
  grant_number: '662960'
  name: Revisiting the Turbulence Problem Using Statistical Mechanics
publication: Journal of Fluid Mechanics
publication_identifier:
  eissn:
  - 1469-7645
  issn:
  - 0022-1120
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
  record:
  - id: '19684'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette
  flows
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 974
year: '2023'
...
---
_id: '12105'
abstract:
- lang: eng
  text: 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.
acknowledgement: "E.M. acknowledges funding from the ISTplus fellowship programme.
  G.Y. and B.H. acknowledge\r\na grant from the Simons Foundation (662960, BH)."
article_number: A10
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Elena
  full_name: Marensi, Elena
  id: 0BE7553A-1004-11EA-B805-18983DDC885E
  last_name: Marensi
  orcid: 0000-0001-7173-4923
- first_name: Gökhan
  full_name: Yalniz, Gökhan
  id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425
  last_name: Yalniz
  orcid: 0000-0002-8490-9312
- first_name: Björn
  full_name: Hof, Björn
  id: 3A374330-F248-11E8-B48F-1D18A9856A87
  last_name: Hof
  orcid: 0000-0003-2057-2754
- first_name: Nazmi B
  full_name: Budanur, Nazmi B
  id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
  last_name: Budanur
  orcid: 0000-0003-0423-5010
citation:
  ama: Marensi E, Yalniz G, Hof B, Budanur NB. Symmetry-reduced dynamic mode decomposition
    of near-wall turbulence. <i>Journal of Fluid Mechanics</i>. 2023;954. doi:<a href="https://doi.org/10.1017/jfm.2022.1001">10.1017/jfm.2022.1001</a>
  apa: Marensi, E., Yalniz, G., Hof, B., &#38; Budanur, N. B. (2023). Symmetry-reduced
    dynamic mode decomposition of near-wall turbulence. <i>Journal of Fluid Mechanics</i>.
    Cambridge University Press. <a href="https://doi.org/10.1017/jfm.2022.1001">https://doi.org/10.1017/jfm.2022.1001</a>
  chicago: Marensi, Elena, Gökhan Yalniz, Björn Hof, and Nazmi B Budanur. “Symmetry-Reduced
    Dynamic Mode Decomposition of near-Wall Turbulence.” <i>Journal of Fluid Mechanics</i>.
    Cambridge University Press, 2023. <a href="https://doi.org/10.1017/jfm.2022.1001">https://doi.org/10.1017/jfm.2022.1001</a>.
  ieee: E. Marensi, G. Yalniz, B. Hof, and N. B. Budanur, “Symmetry-reduced dynamic
    mode decomposition of near-wall turbulence,” <i>Journal of Fluid Mechanics</i>,
    vol. 954. Cambridge University Press, 2023.
  ista: Marensi E, Yalniz G, Hof B, Budanur NB. 2023. Symmetry-reduced dynamic mode
    decomposition of near-wall turbulence. Journal of Fluid Mechanics. 954, A10.
  mla: Marensi, Elena, et al. “Symmetry-Reduced Dynamic Mode Decomposition of near-Wall
    Turbulence.” <i>Journal of Fluid Mechanics</i>, vol. 954, A10, Cambridge University
    Press, 2023, doi:<a href="https://doi.org/10.1017/jfm.2022.1001">10.1017/jfm.2022.1001</a>.
  short: E. Marensi, G. Yalniz, B. Hof, N.B. Budanur, Journal of Fluid Mechanics 954
    (2023).
corr_author: '1'
date_created: 2023-01-08T23:00:53Z
date_published: 2023-01-10T00:00:00Z
date_updated: 2026-09-02T08:16:31Z
day: '10'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1017/jfm.2022.1001
external_id:
  arxiv:
  - '2101.07516'
  isi:
  - '000903336600001'
file:
- access_level: open_access
  checksum: 9224f987caefe5dd85a70814d3cce65c
  content_type: application/pdf
  creator: dernst
  date_created: 2023-02-02T12:34:54Z
  date_updated: 2023-02-02T12:34:54Z
  file_id: '12489'
  file_name: 2023_JourFluidMechanics_Marensi.pdf
  file_size: 1931647
  relation: main_file
  success: 1
file_date_updated: 2023-02-02T12:34:54Z
fulldoi: https://doi.org/10.1017/jfm.2022.1001
has_accepted_license: '1'
intvolume: '       954'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 238598C6-32DE-11EA-91FC-C7463DDC885E
  grant_number: '662960'
  name: Revisiting the Turbulence Problem Using Statistical Mechanics
publication: Journal of Fluid Mechanics
publication_identifier:
  eissn:
  - 1469-7645
  issn:
  - 0022-1120
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
  record:
  - id: '19684'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Symmetry-reduced dynamic mode decomposition of near-wall turbulence
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 954
year: '2023'
...
---
_id: '13274'
abstract:
- lang: eng
  text: 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.
acknowledgement: We thank Baofang Song as well as the developers of Channelflow for
  sharing their numerical codes, and Mukund Vasudevan and Holger Kantz for fruitful
  discussions. This work was supported by a grant from the Simons Foundation (662960,
  B. H.).
article_number: '034002'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Chaitanya S
  full_name: Paranjape, Chaitanya S
  id: 3D85B7C4-F248-11E8-B48F-1D18A9856A87
  last_name: Paranjape
- first_name: Gökhan
  full_name: Yalniz, Gökhan
  id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425
  last_name: Yalniz
  orcid: 0000-0002-8490-9312
- first_name: Yohann
  full_name: Duguet, Yohann
  last_name: Duguet
- first_name: Nazmi B
  full_name: Budanur, Nazmi B
  id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
  last_name: Budanur
  orcid: 0000-0003-0423-5010
- first_name: Björn
  full_name: Hof, Björn
  id: 3A374330-F248-11E8-B48F-1D18A9856A87
  last_name: Hof
  orcid: 0000-0003-2057-2754
citation:
  ama: Paranjape CS, Yalniz G, Duguet Y, Budanur NB, Hof B. Direct path from turbulence
    to time-periodic solutions. <i>Physical Review Letters</i>. 2023;131(3). doi:<a
    href="https://doi.org/10.1103/physrevlett.131.034002">10.1103/physrevlett.131.034002</a>
  apa: Paranjape, C. S., Yalniz, G., Duguet, Y., Budanur, N. B., &#38; Hof, B. (2023).
    Direct path from turbulence to time-periodic solutions. <i>Physical Review Letters</i>.
    American Physical Society. <a href="https://doi.org/10.1103/physrevlett.131.034002">https://doi.org/10.1103/physrevlett.131.034002</a>
  chicago: Paranjape, Chaitanya S, Gökhan Yalniz, Yohann Duguet, Nazmi B Budanur,
    and Björn Hof. “Direct Path from Turbulence to Time-Periodic Solutions.” <i>Physical
    Review Letters</i>. American Physical Society, 2023. <a href="https://doi.org/10.1103/physrevlett.131.034002">https://doi.org/10.1103/physrevlett.131.034002</a>.
  ieee: C. S. Paranjape, G. Yalniz, Y. Duguet, N. B. Budanur, and B. Hof, “Direct
    path from turbulence to time-periodic solutions,” <i>Physical Review Letters</i>,
    vol. 131, no. 3. American Physical Society, 2023.
  ista: Paranjape CS, Yalniz G, Duguet Y, Budanur NB, Hof B. 2023. Direct path from
    turbulence to time-periodic solutions. Physical Review Letters. 131(3), 034002.
  mla: Paranjape, Chaitanya S., et al. “Direct Path from Turbulence to Time-Periodic
    Solutions.” <i>Physical Review Letters</i>, vol. 131, no. 3, 034002, American
    Physical Society, 2023, doi:<a href="https://doi.org/10.1103/physrevlett.131.034002">10.1103/physrevlett.131.034002</a>.
  short: C.S. Paranjape, G. Yalniz, Y. Duguet, N.B. Budanur, B. Hof, Physical Review
    Letters 131 (2023).
corr_author: '1'
date_created: 2023-07-24T09:43:59Z
date_published: 2023-07-21T00:00:00Z
date_updated: 2026-09-02T08:16:31Z
day: '21'
department:
- _id: GradSch
- _id: BjHo
doi: 10.1103/physrevlett.131.034002
external_id:
  arxiv:
  - '2306.05098'
  isi:
  - '001052929900004'
  pmid:
  - '37540883'
fulldoi: https://doi.org/10.1103/physrevlett.131.034002
intvolume: '       131'
isi: 1
issue: '3'
keyword:
- General Physics and Astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2306.05098
month: '07'
oa: 1
oa_version: Preprint
pmid: 1
project:
- _id: 238598C6-32DE-11EA-91FC-C7463DDC885E
  grant_number: '662960'
  name: Revisiting the Turbulence Problem Using Statistical Mechanics
publication: Physical Review Letters
publication_identifier:
  eissn:
  - 1079-7114
  issn:
  - 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
  record:
  - id: '19684'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Direct path from turbulence to time-periodic solutions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 131
year: '2023'
...
---
_id: '12421'
abstract:
- lang: eng
  text: 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.
acknowledgement: 'We apologize for not being able to mention and cite additional excellent
  work that would have fit the scope of this review, due to space restraints. We thank
  Jesse Hansen for comments on the manuscript. We acknowledge support from the Austrian
  Science Fund (FWF): P33367 and the Institute of Science and Technology Austria.'
article_processing_charge: No
article_type: original
author:
- first_name: Florian
  full_name: Fäßler, Florian
  id: 404F5528-F248-11E8-B48F-1D18A9856A87
  last_name: Fäßler
  orcid: 0000-0001-7149-769X
- first_name: Manjunath
  full_name: Javoor, Manjunath
  id: 305ab18b-dc7d-11ea-9b2f-b58195228ea2
  last_name: Javoor
  orcid: 0000-0003-2311-2112
- first_name: Florian KM
  full_name: Schur, Florian KM
  id: 48AD8942-F248-11E8-B48F-1D18A9856A87
  last_name: Schur
  orcid: 0000-0003-4790-8078
citation:
  ama: Fäßler F, Javoor M, Schur FK. Deciphering the molecular mechanisms of actin
    cytoskeleton regulation in cell migration using cryo-EM. <i>Biochemical Society
    Transactions</i>. 2023;51(1):87-99. doi:<a href="https://doi.org/10.1042/bst20220221">10.1042/bst20220221</a>
  apa: Fäßler, F., Javoor, M., &#38; Schur, F. K. (2023). Deciphering the molecular
    mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM. <i>Biochemical
    Society Transactions</i>. Portland Press. <a href="https://doi.org/10.1042/bst20220221">https://doi.org/10.1042/bst20220221</a>
  chicago: Fäßler, Florian, Manjunath Javoor, and Florian KM Schur. “Deciphering the
    Molecular Mechanisms of Actin Cytoskeleton Regulation in Cell Migration Using
    Cryo-EM.” <i>Biochemical Society Transactions</i>. Portland Press, 2023. <a href="https://doi.org/10.1042/bst20220221">https://doi.org/10.1042/bst20220221</a>.
  ieee: F. Fäßler, M. Javoor, and F. K. Schur, “Deciphering the molecular mechanisms
    of actin cytoskeleton regulation in cell migration using cryo-EM,” <i>Biochemical
    Society Transactions</i>, vol. 51, no. 1. Portland Press, pp. 87–99, 2023.
  ista: Fäßler F, Javoor M, Schur FK. 2023. Deciphering the molecular mechanisms of
    actin cytoskeleton regulation in cell migration using cryo-EM. Biochemical Society
    Transactions. 51(1), 87–99.
  mla: Fäßler, Florian, et al. “Deciphering the Molecular Mechanisms of Actin Cytoskeleton
    Regulation in Cell Migration Using Cryo-EM.” <i>Biochemical Society Transactions</i>,
    vol. 51, no. 1, Portland Press, 2023, pp. 87–99, doi:<a href="https://doi.org/10.1042/bst20220221">10.1042/bst20220221</a>.
  short: F. Fäßler, M. Javoor, F.K. Schur, Biochemical Society Transactions 51 (2023)
    87–99.
corr_author: '1'
date_created: 2023-01-27T10:08:19Z
date_published: 2023-02-01T00:00:00Z
date_updated: 2026-09-03T09:36:24Z
day: '01'
ddc:
- '570'
department:
- _id: FlSc
doi: 10.1042/bst20220221
external_id:
  isi:
  - '000926043100001'
  pmid:
  - '36695514'
file:
- access_level: open_access
  checksum: 4e7069845e3dad22bb44fb71ec624c60
  content_type: application/pdf
  creator: dernst
  date_created: 2023-03-16T07:58:16Z
  date_updated: 2023-03-16T07:58:16Z
  file_id: '12728'
  file_name: 2023_BioChemicalSocietyTransactions_Faessler.pdf
  file_size: 10045006
  relation: main_file
  success: 1
file_date_updated: 2023-03-16T07:58:16Z
fulldoi: https://doi.org/10.1042/bst20220221
has_accepted_license: '1'
intvolume: '        51'
isi: 1
issue: '1'
keyword:
- Biochemistry
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 87-99
pmid: 1
project:
- _id: 9B954C5C-BA93-11EA-9121-9846C619BF3A
  grant_number: P33367
  name: Structure and isoform diversity of the Arp2/3 complex
publication: Biochemical Society Transactions
publication_identifier:
  eissn:
  - 1470-8752
  issn:
  - 0300-5127
publication_status: published
publisher: Portland Press
quality_controlled: '1'
related_material:
  record:
  - id: '22744'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell
  migration using cryo-EM
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2023'
...
---
_id: '14692'
abstract:
- lang: eng
  text: "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.\r\nIn 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.\r\nThe 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."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Benedikt
  full_name: Auerbach, Benedikt
  id: D33D2B18-E445-11E9-ABB7-15F4E5697425
  last_name: Auerbach
  orcid: 0000-0002-7553-6606
- first_name: Charlotte
  full_name: Hoffmann, Charlotte
  id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
  last_name: Hoffmann
  orcid: 0000-0003-2027-5549
- first_name: Guillermo
  full_name: Pascual Perez, Guillermo
  id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
  last_name: Pascual Perez
  orcid: 0000-0001-8630-415X
citation:
  ama: 'Auerbach B, Hoffmann C, Pascual Perez G. Generic-group lower bounds via reductions
    between geometric-search problems: With and without preprocessing. In: <i>21st
    International Conference on Theory of Cryptography</i>. Vol 14371. Springer Nature;
    2023:301-330. doi:<a href="https://doi.org/10.1007/978-3-031-48621-0_11">10.1007/978-3-031-48621-0_11</a>'
  apa: 'Auerbach, B., Hoffmann, C., &#38; Pascual Perez, G. (2023). Generic-group
    lower bounds via reductions between geometric-search problems: With and without
    preprocessing. In <i>21st International Conference on Theory of Cryptography</i>
    (Vol. 14371, pp. 301–330). Springer Nature. <a href="https://doi.org/10.1007/978-3-031-48621-0_11">https://doi.org/10.1007/978-3-031-48621-0_11</a>'
  chicago: 'Auerbach, Benedikt, Charlotte Hoffmann, and Guillermo Pascual Perez. “Generic-Group
    Lower Bounds via Reductions between Geometric-Search Problems: With and without
    Preprocessing.” In <i>21st International Conference on Theory of Cryptography</i>,
    14371:301–30. Springer Nature, 2023. <a href="https://doi.org/10.1007/978-3-031-48621-0_11">https://doi.org/10.1007/978-3-031-48621-0_11</a>.'
  ieee: 'B. Auerbach, C. Hoffmann, and G. Pascual Perez, “Generic-group lower bounds
    via reductions between geometric-search problems: With and without preprocessing,”
    in <i>21st International Conference on Theory of Cryptography</i>, 2023, vol.
    14371, pp. 301–330.'
  ista: 'Auerbach B, Hoffmann C, Pascual Perez G. 2023. Generic-group lower bounds
    via reductions between geometric-search problems: With and without preprocessing.
    21st International Conference on Theory of Cryptography. , LNCS, vol. 14371, 301–330.'
  mla: 'Auerbach, Benedikt, et al. “Generic-Group Lower Bounds via Reductions between
    Geometric-Search Problems: With and without Preprocessing.” <i>21st International
    Conference on Theory of Cryptography</i>, vol. 14371, Springer Nature, 2023, pp.
    301–30, doi:<a href="https://doi.org/10.1007/978-3-031-48621-0_11">10.1007/978-3-031-48621-0_11</a>.'
  short: B. Auerbach, C. Hoffmann, G. Pascual Perez, in:, 21st International Conference
    on Theory of Cryptography, Springer Nature, 2023, pp. 301–330.
corr_author: '1'
date_created: 2023-12-17T23:00:54Z
date_published: 2023-11-27T00:00:00Z
date_updated: 2026-09-07T11:37:53Z
day: '27'
department:
- _id: KrPi
doi: 10.1007/978-3-031-48621-0_11
external_id:
  isi:
  - '001160724400011'
fulldoi: https://doi.org/10.1007/978-3-031-48621-0_11
intvolume: '     14371'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2023/808
month: '11'
oa: 1
oa_version: Preprint
page: 301-330
publication: 21st International Conference on Theory of Cryptography
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783031486203'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Generic-group lower bounds via reductions between geometric-search problems:
  With and without preprocessing'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14371
year: '2023'
...
---
_id: '14691'
abstract:
- lang: eng
  text: "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].\r\nThe 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.\r\nIn 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.\r\nWe 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.\r\nOur
    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."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Benedikt
  full_name: Auerbach, Benedikt
  id: D33D2B18-E445-11E9-ABB7-15F4E5697425
  last_name: Auerbach
  orcid: 0000-0002-7553-6606
- first_name: Miguel
  full_name: Cueto Noval, Miguel
  id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
  last_name: Cueto Noval
  orcid: 0000-0002-2505-4246
- first_name: Guillermo
  full_name: Pascual Perez, Guillermo
  id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
  last_name: Pascual Perez
  orcid: 0000-0001-8630-415X
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
citation:
  ama: 'Auerbach B, Cueto Noval M, Pascual Perez G, Pietrzak KZ. On the cost of post-compromise
    security in concurrent Continuous Group-Key Agreement. In: <i>21st International
    Conference on Theory of Cryptography</i>. Vol 14371. Springer Nature; 2023:271-300.
    doi:<a href="https://doi.org/10.1007/978-3-031-48621-0_10">10.1007/978-3-031-48621-0_10</a>'
  apa: 'Auerbach, B., Cueto Noval, M., Pascual Perez, G., &#38; Pietrzak, K. Z. (2023).
    On the cost of post-compromise security in concurrent Continuous Group-Key Agreement.
    In <i>21st International Conference on Theory of Cryptography</i> (Vol. 14371,
    pp. 271–300). Taipei, Taiwan: Springer Nature. <a href="https://doi.org/10.1007/978-3-031-48621-0_10">https://doi.org/10.1007/978-3-031-48621-0_10</a>'
  chicago: Auerbach, Benedikt, Miguel Cueto Noval, Guillermo Pascual Perez, and Krzysztof
    Z Pietrzak. “On the Cost of Post-Compromise Security in Concurrent Continuous
    Group-Key Agreement.” In <i>21st International Conference on Theory of Cryptography</i>,
    14371:271–300. Springer Nature, 2023. <a href="https://doi.org/10.1007/978-3-031-48621-0_10">https://doi.org/10.1007/978-3-031-48621-0_10</a>.
  ieee: B. Auerbach, M. Cueto Noval, G. Pascual Perez, and K. Z. Pietrzak, “On the cost
    of post-compromise security in concurrent Continuous Group-Key Agreement,” in
    <i>21st International Conference on Theory of Cryptography</i>, Taipei, Taiwan,
    2023, vol. 14371, pp. 271–300.
  ista: 'Auerbach B, Cueto Noval M, Pascual Perez G, Pietrzak KZ. 2023. On the cost
    of post-compromise security in concurrent Continuous Group-Key Agreement. 21st
    International Conference on Theory of Cryptography. TCC: Theory of Cryptography,
    LNCS, vol. 14371, 271–300.'
  mla: Auerbach, Benedikt, et al. “On the Cost of Post-Compromise Security in Concurrent
    Continuous Group-Key Agreement.” <i>21st International Conference on Theory of
    Cryptography</i>, vol. 14371, Springer Nature, 2023, pp. 271–300, doi:<a href="https://doi.org/10.1007/978-3-031-48621-0_10">10.1007/978-3-031-48621-0_10</a>.
  short: B. Auerbach, M. Cueto Noval, G. Pascual Perez, K.Z. Pietrzak, in:, 21st International
    Conference on Theory of Cryptography, Springer Nature, 2023, pp. 271–300.
conference:
  end_date: 2023-12-02
  location: Taipei, Taiwan
  name: 'TCC: Theory of Cryptography'
  start_date: 2023-11-29
corr_author: '1'
date_created: 2023-12-17T23:00:53Z
date_published: 2023-11-27T00:00:00Z
date_updated: 2026-09-07T11:37:56Z
day: '27'
department:
- _id: KrPi
doi: 10.1007/978-3-031-48621-0_10
external_id:
  isi:
  - '001160724400010'
fulldoi: https://doi.org/10.1007/978-3-031-48621-0_10
intvolume: '     14371'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2023/1123
month: '11'
oa: 1
oa_version: Preprint
page: 271-300
publication: 21st International Conference on Theory of Cryptography
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783031486203'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '22664'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: On the cost of post-compromise security in concurrent Continuous Group-Key
  Agreement
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14371
year: '2023'
...
---
_id: '12787'
abstract:
- lang: eng
  text: "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 μ\r\n 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."
acknowledgement: J.S. and K.C. acknowledge support from the ERC CoG 863818 (ForM-SMArt)
article_number: '20220685'
article_processing_charge: No
article_type: original
author:
- first_name: Jakub
  full_name: Svoboda, Jakub
  id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
  last_name: Svoboda
  orcid: 0000-0002-1419-3267
- first_name: Josef
  full_name: Tkadlec, Josef
  id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
  last_name: Tkadlec
  orcid: 0000-0002-1097-9684
- first_name: Kamran
  full_name: Kaveh, Kamran
  last_name: Kaveh
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
citation:
  ama: 'Svoboda J, Tkadlec J, Kaveh K, Chatterjee K. Coexistence times in the Moran
    process with environmental heterogeneity. <i>Proceedings of the Royal Society
    A: Mathematical, Physical and Engineering Sciences</i>. 2023;479(2271). doi:<a
    href="https://doi.org/10.1098/rspa.2022.0685">10.1098/rspa.2022.0685</a>'
  apa: 'Svoboda, J., Tkadlec, J., Kaveh, K., &#38; Chatterjee, K. (2023). Coexistence
    times in the Moran process with environmental heterogeneity. <i>Proceedings of
    the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. The
    Royal Society. <a href="https://doi.org/10.1098/rspa.2022.0685">https://doi.org/10.1098/rspa.2022.0685</a>'
  chicago: 'Svoboda, Jakub, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee.
    “Coexistence Times in the Moran Process with Environmental Heterogeneity.” <i>Proceedings
    of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. The
    Royal Society, 2023. <a href="https://doi.org/10.1098/rspa.2022.0685">https://doi.org/10.1098/rspa.2022.0685</a>.'
  ieee: 'J. Svoboda, J. Tkadlec, K. Kaveh, and K. Chatterjee, “Coexistence times in
    the Moran process with environmental heterogeneity,” <i>Proceedings of the Royal
    Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 479, no.
    2271. The Royal Society, 2023.'
  ista: 'Svoboda J, Tkadlec J, Kaveh K, Chatterjee K. 2023. Coexistence times in the
    Moran process with environmental heterogeneity. Proceedings of the Royal Society
    A: Mathematical, Physical and Engineering Sciences. 479(2271), 20220685.'
  mla: 'Svoboda, Jakub, et al. “Coexistence Times in the Moran Process with Environmental
    Heterogeneity.” <i>Proceedings of the Royal Society A: Mathematical, Physical
    and Engineering Sciences</i>, vol. 479, no. 2271, 20220685, The Royal Society,
    2023, doi:<a href="https://doi.org/10.1098/rspa.2022.0685">10.1098/rspa.2022.0685</a>.'
  short: 'J. Svoboda, J. Tkadlec, K. Kaveh, K. Chatterjee, Proceedings of the Royal
    Society A: Mathematical, Physical and Engineering Sciences 479 (2023).'
date_created: 2023-04-02T22:01:09Z
date_published: 2023-03-29T00:00:00Z
date_updated: 2026-09-16T06:59:32Z
day: '29'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1098/rspa.2022.0685
ec_funded: 1
external_id:
  isi:
  - '000957125500002'
file:
- access_level: open_access
  checksum: 13953d349fbefcb5d21ccc6b303297eb
  content_type: application/pdf
  creator: dernst
  date_created: 2023-04-03T06:25:29Z
  date_updated: 2023-04-03T06:25:29Z
  file_id: '12796'
  file_name: 2023_ProceedingsRoyalSocietyA_Svoboda.pdf
  file_size: 827784
  relation: main_file
  success: 1
file_date_updated: 2023-04-03T06:25:29Z
fulldoi: https://doi.org/10.1098/rspa.2022.0685
has_accepted_license: '1'
intvolume: '       479'
isi: 1
issue: '2271'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
  call_identifier: H2020
  grant_number: '863818'
  name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 'Proceedings of the Royal Society A: Mathematical, Physical and Engineering
  Sciences'
publication_identifier:
  eissn:
  - 1471-2946
  issn:
  - 1364-5021
publication_status: published
publisher: The Royal Society
quality_controlled: '1'
related_material:
  link:
  - relation: research_data
    url: https://doi.org/10.6084/m9.figshare.21261771.v1
  record:
  - id: '20138'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Coexistence times in the Moran process with environmental heterogeneity
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 479
year: '2023'
...
---
OA_place: publisher
OA_type: gold
_id: '14954'
abstract:
- lang: eng
  text: "When domain knowledge is limited and experimentation is restricted by ethical,\r\nfinancial,
    or time constraints, practitioners turn to observational causal discovery\r\nmethods
    to recover the causal structure, exploiting the statistical properties of their\r\ndata.
    Because causal discovery without further assumptions is an ill-posed problem,\r\neach
    algorithm comes with its own set of usually untestable assumptions, some\r\nof
    which are hard to meet in real datasets. Motivated by these considerations, this\r\npaper
    extensively benchmarks the empirical performance of recent causal discovery\r\nmethods
    on observational iid data generated under different background conditions,\r\nallowing
    for violations of the critical assumptions required by each selected approach.
    Our experimental findings show that score matching-based methods demonstrate surprising
    performance in the false positive and false negative rate of the\r\ninferred graph
    in these challenging scenarios, and we provide theoretical insights\r\ninto their
    performance. This work is also the first effort to benchmark the stability of\r\ncausal
    discovery algorithms with respect to the values of their hyperparameters. Finally,
    we hope this paper will set a new standard for the evaluation of causal discovery
    methods and can serve as an accessible entry point for practitioners interested\r\nin
    the field, highlighting the empirical implications of different algorithm choices."
acknowledgement: "We thank Kun Zhang and Carl-Johann Simon-Gabriel for the insightful
  discussions. This work\r\nhas been supported by AFOSR, grant n. FA8655-20-1-7035.
  FM is supported by Programma\r\nOperativo Nazionale ricerca e innovazione 2014-2020.
  FM partially contributed to this work during an internship at Amazon Web Services
  with FL. FL partially contributed while at AWS."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
  full_name: Montagna, Francesco
  last_name: Montagna
- first_name: Atalanti A.
  full_name: Mastakouri, Atalanti A.
  last_name: Mastakouri
- first_name: Elias
  full_name: Eulig, Elias
  last_name: Eulig
- first_name: Nicoletta
  full_name: Noceti, Nicoletta
  last_name: Noceti
- first_name: Lorenzo
  full_name: Rosasco, Lorenzo
  last_name: Rosasco
- first_name: Dominik
  full_name: Janzing, Dominik
  last_name: Janzing
- first_name: Bryon
  full_name: Aragam, Bryon
  last_name: Aragam
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
citation:
  ama: 'Montagna F, Mastakouri AA, Eulig E, et al. Assumption violations in causal
    discovery and the robustness of score matching. In: <i>37th Conference on Neural
    Information Processing Systems</i>. Vol 36. Neural Information Processing Systems
    Foundation; 2023. doi:<a href="https://doi.org/10.52202/075280-2050">10.52202/075280-2050</a>'
  apa: 'Montagna, F., Mastakouri, A. A., Eulig, E., Noceti, N., Rosasco, L., Janzing,
    D., … Locatello, F. (2023). Assumption violations in causal discovery and the
    robustness of score matching. In <i>37th Conference on Neural Information Processing
    Systems</i> (Vol. 36). New Orleans, LA, United States: Neural Information Processing
    Systems Foundation. <a href="https://doi.org/10.52202/075280-2050">https://doi.org/10.52202/075280-2050</a>'
  chicago: Montagna, Francesco, Atalanti A. Mastakouri, Elias Eulig, Nicoletta Noceti,
    Lorenzo Rosasco, Dominik Janzing, Bryon Aragam, and Francesco Locatello. “Assumption
    Violations in Causal Discovery and the Robustness of Score Matching.” In <i>37th
    Conference on Neural Information Processing Systems</i>, Vol. 36. Neural Information
    Processing Systems Foundation, 2023. <a href="https://doi.org/10.52202/075280-2050">https://doi.org/10.52202/075280-2050</a>.
  ieee: F. Montagna <i>et al.</i>, “Assumption violations in causal discovery and
    the robustness of score matching,” in <i>37th Conference on Neural Information
    Processing Systems</i>, New Orleans, LA, United States, 2023, vol. 36.
  ista: 'Montagna F, Mastakouri AA, Eulig E, Noceti N, Rosasco L, Janzing D, Aragam
    B, Locatello F. 2023. Assumption violations in causal discovery and the robustness
    of score matching. 37th Conference on Neural Information Processing Systems. NeurIPS:
    Neural Information Processing Systems, Advances in Neural Information Processing
    Systems, vol. 36.'
  mla: Montagna, Francesco, et al. “Assumption Violations in Causal Discovery and
    the Robustness of Score Matching.” <i>37th Conference on Neural Information Processing
    Systems</i>, vol. 36, Neural Information Processing Systems Foundation, 2023,
    doi:<a href="https://doi.org/10.52202/075280-2050">10.52202/075280-2050</a>.
  short: F. Montagna, A.A. Mastakouri, E. Eulig, N. Noceti, L. Rosasco, D. Janzing,
    B. Aragam, F. Locatello, in:, 37th Conference on Neural Information Processing
    Systems, Neural Information Processing Systems Foundation, 2023.
conference:
  end_date: 2023-12-16
  location: New Orleans, LA, United States
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2023-12-12
das_tickbox: '0'
date_created: 2024-02-07T15:11:56Z
date_published: 2023-12-20T00:00:00Z
date_updated: 2026-09-17T12:59:55Z
day: '20'
ddc:
- '000'
department:
- _id: FrLo
doi: 10.52202/075280-2050
external_id:
  arxiv:
  - '2310.13387'
file:
- access_level: open_access
  checksum: 71d38402b4edef4c084b39f3e2f04526
  content_type: application/pdf
  creator: dernst
  date_created: 2026-08-13T07:49:38Z
  date_updated: 2026-08-13T07:49:38Z
  file_id: '22701'
  file_name: 2023_Neurips_Montagna.pdf
  file_size: 7640984
  relation: main_file
  success: 1
file_date_updated: 2026-08-13T07:49:38Z
fulldoi: https://doi.org/10.52202/075280-2050
has_accepted_license: '1'
intvolume: '        36'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: 37th Conference on Neural Information Processing Systems
publication_identifier:
  eissn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
researchdata_availability: no
status: public
supplementarymaterial: yes
title: Assumption violations in causal discovery and the robustness of score matching
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2023'
...
---
_id: '15023'
abstract:
- lang: eng
  text: Reinforcement learning has shown promising results in learning neural network
    policies for complicated control tasks. However, the lack of formal guarantees
    about the behavior of such policies remains an impediment to their deployment.
    We propose a novel method for learning a composition of neural network policies
    in stochastic environments, along with a formal certificate which guarantees that
    a specification over the policy's behavior is satisfied with the desired probability.
    Unlike prior work on verifiable RL, our approach leverages the compositional nature
    of logical specifications provided in SpectRL, to learn over graphs of probabilistic
    reach-avoid specifications. The formal guarantees are provided by learning neural
    network policies together with reach-avoid supermartingales (RASM) for the graph’s
    sub-tasks and then composing them into a global policy. We also derive a tighter
    lower bound compared to previous work on the probability of reach-avoidance implied
    by a RASM, which is required to find a compositional policy with an acceptable
    probabilistic threshold for complex tasks with multiple edge policies. We implement
    a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment.
acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS)
  and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt)."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Dorde
  full_name: Zikelic, Dorde
  id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
  last_name: Zikelic
  orcid: 0000-0002-4681-1699
- first_name: Mathias
  full_name: Lechner, Mathias
  id: 3DC22916-F248-11E8-B48F-1D18A9856A87
  last_name: Lechner
- first_name: Abhinav
  full_name: Verma, Abhinav
  id: a235593c-d7fa-11eb-a0c5-b22ca3c66ee6
  last_name: Verma
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
citation:
  ama: 'Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy
    learning in stochastic control systems with formal guarantees. In: <i>37th Conference
    on Neural Information Processing Systems</i>. Neural Information Processing Systems
    Foundation; 2023.'
  apa: 'Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &#38; Henzinger, T. A.
    (2023). Compositional policy learning in stochastic control systems with formal
    guarantees. In <i>37th Conference on Neural Information Processing Systems</i>.
    New Orleans, LA, United States: Neural Information Processing Systems Foundation.'
  chicago: Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee,
    and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems
    with Formal Guarantees.” In <i>37th Conference on Neural Information Processing
    Systems</i>. Neural Information Processing Systems Foundation, 2023.
  ieee: D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional
    policy learning in stochastic control systems with formal guarantees,” in <i>37th
    Conference on Neural Information Processing Systems</i>, New Orleans, LA, United
    States, 2023.
  ista: 'Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional
    policy learning in stochastic control systems with formal guarantees. 37th Conference
    on Neural Information Processing Systems. NeurIPS: Neural Information Processing
    Systems, Advances in Neural Information Processing Systems, .'
  mla: Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control
    Systems with Formal Guarantees.” <i>37th Conference on Neural Information Processing
    Systems</i>, Neural Information Processing Systems Foundation, 2023.
  short: D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th
    Conference on Neural Information Processing Systems, Neural Information Processing
    Systems Foundation, 2023.
conference:
  end_date: 2023-12-16
  location: New Orleans, LA, United States
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2023-12-10
corr_author: '1'
das_tickbox: '1'
date_created: 2024-02-25T09:23:24Z
date_published: 2023-12-15T00:00:00Z
date_updated: 2026-09-17T12:59:12Z
day: '15'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
ec_funded: 1
external_id:
  arxiv:
  - '2312.01456'
file:
- access_level: open_access
  checksum: 739c6d72506b778302d4e708723bf12c
  content_type: application/pdf
  creator: dernst
  date_created: 2024-07-22T11:45:17Z
  date_updated: 2024-07-22T11:45:17Z
  file_id: '17309'
  file_name: 2023_NeurIPS_Zikelic.pdf
  file_size: 562008
  relation: main_file
  success: 1
file_date_updated: 2024-07-22T11:45:17Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
  call_identifier: H2020
  grant_number: '863818'
  name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publication: 37th Conference on Neural Information Processing Systems
publication_identifier:
  eissn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
status: public
title: Compositional policy learning in stochastic control systems with formal guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
OA_place: publisher
OA_type: gold
_id: '14953'
abstract:
- lang: eng
  text: "This paper provides statistical sample complexity bounds for score-matching
    and\r\nits applications in causal discovery. We demonstrate that accurate estimation
    of the\r\nscore function is achievable by training a standard deep ReLU neural
    network using\r\nstochastic gradient descent. We establish bounds on the error
    rate of recovering\r\ncausal relationships using the score-matching-based causal
    discovery method of\r\nRolland et al. [2022], assuming a sufficiently good estimation
    of the score function.\r\nFinally, we analyze the upper bound of score-matching
    estimation within the scorebased generative modeling, which has been applied for
    causal discovery but is also\r\nof independent interest within the domain of generative
    models.y"
acknowledgement: "We are thankful to the reviewers for providing constructive feedback
  and Kun Zhang and Dominik\r\nJanzing for helpful discussion on the special case
  of deterministic children. This work was supported\r\nby Hasler Foundation Program:
  Hasler Responsible AI (project number 21043). This work was\r\nsupported by the
  Swiss National Science Foundation (SNSF) under grant number 200021_205011.\r\nFrancesco
  Locatello did not contribute to this work at Amazon. "
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Zhenyu
  full_name: Zhu, Zhenyu
  last_name: Zhu
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
- first_name: Volkan
  full_name: Cevher, Volkan
  last_name: Cevher
citation:
  ama: 'Zhu Z, Locatello F, Cevher V. Sample complexity bounds for score-matching:
    Causal discovery and generative modeling. In: <i>37th Conference on Neural Information
    Processing Systems</i>. Vol 36. Neural Information Processing Systems Foundation;
    2023:3325-3337. doi:<a href="https://doi.org/10.52202/075280-0147">10.52202/075280-0147</a>'
  apa: 'Zhu, Z., Locatello, F., &#38; Cevher, V. (2023). Sample complexity bounds
    for score-matching: Causal discovery and generative modeling. In <i>37th Conference
    on Neural Information Processing Systems</i> (Vol. 36, pp. 3325–3337). New Orleans,
    LA, United States: Neural Information Processing Systems Foundation. <a href="https://doi.org/10.52202/075280-0147">https://doi.org/10.52202/075280-0147</a>'
  chicago: 'Zhu, Zhenyu, Francesco Locatello, and Volkan Cevher. “Sample Complexity
    Bounds for Score-Matching: Causal Discovery and Generative Modeling.” In <i>37th
    Conference on Neural Information Processing Systems</i>, 36:3325–37. Neural Information
    Processing Systems Foundation, 2023. <a href="https://doi.org/10.52202/075280-0147">https://doi.org/10.52202/075280-0147</a>.'
  ieee: 'Z. Zhu, F. Locatello, and V. Cevher, “Sample complexity bounds for score-matching:
    Causal discovery and generative modeling,” in <i>37th Conference on Neural Information
    Processing Systems</i>, New Orleans, LA, United States, 2023, vol. 36, pp. 3325–3337.'
  ista: 'Zhu Z, Locatello F, Cevher V. 2023. Sample complexity bounds for score-matching:
    Causal discovery and generative modeling. 37th Conference on Neural Information
    Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in
    Neural Information Processing Systems, vol. 36, 3325–3337.'
  mla: 'Zhu, Zhenyu, et al. “Sample Complexity Bounds for Score-Matching: Causal Discovery
    and Generative Modeling.” <i>37th Conference on Neural Information Processing
    Systems</i>, vol. 36, Neural Information Processing Systems Foundation, 2023,
    pp. 3325–37, doi:<a href="https://doi.org/10.52202/075280-0147">10.52202/075280-0147</a>.'
  short: Z. Zhu, F. Locatello, V. Cevher, in:, 37th Conference on Neural Information
    Processing Systems, Neural Information Processing Systems Foundation, 2023, pp.
    3325–3337.
conference:
  end_date: 2023-12-16
  location: New Orleans, LA, United States
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2023-12-12
corr_author: '1'
das_tickbox: '0'
date_created: 2024-02-07T15:11:11Z
date_published: 2023-10-27T00:00:00Z
date_updated: 2026-09-17T12:59:35Z
day: '27'
ddc:
- '000'
department:
- _id: FrLo
doi: 10.52202/075280-0147
external_id:
  arxiv:
  - '2310.18123'
file:
- access_level: open_access
  checksum: 6f10adadefceb3bb50ad0b2637493381
  content_type: application/pdf
  creator: dernst
  date_created: 2026-08-13T07:02:51Z
  date_updated: 2026-08-13T07:02:51Z
  file_id: '22700'
  file_name: 2023_Neurips_Zhu.pdf
  file_size: 305362
  relation: main_file
  success: 1
file_date_updated: 2026-08-13T07:02:51Z
fulldoi: https://doi.org/10.52202/075280-0147
has_accepted_license: '1'
intvolume: '        36'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 3325-3337
publication: 37th Conference on Neural Information Processing Systems
publication_identifier:
  eissn:
  - 1049-5258
  isbn:
  - '9781713899921'
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: 'Sample complexity bounds for score-matching: Causal discovery and generative
  modeling'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2023'
...
---
_id: '13310'
abstract:
- lang: eng
  text: Machine-learned systems are in widespread use for making decisions about humans,
    and it is important that they are fair, i.e., not biased against individuals based
    on sensitive attributes. We present runtime verification of algorithmic fairness
    for systems whose models are unknown, but are assumed to have a Markov chain structure.
    We introduce a specification language that can model many common algorithmic fairness
    properties, such as demographic parity, equal opportunity, and social burden.
    We build monitors that observe a long sequence of events as generated by a given
    system, and output, after each observation, a quantitative estimate of how fair
    or biased the system was on that run until that point in time. The estimate is
    proven to be correct modulo a variable error bound and a given confidence level,
    where the error bound gets tighter as the observed sequence gets longer. Our monitors
    are of two types, and use, respectively, frequentist and Bayesian statistical
    inference techniques. While the frequentist monitors compute estimates that are
    objectively correct with respect to the ground truth, the Bayesian monitors compute
    estimates that are correct subject to a given prior belief about the system’s
    model. Using a prototype implementation, we show how we can monitor if a bank
    is fair in giving loans to applicants from different social backgrounds, and if
    a college is fair in admitting students while maintaining a reasonable financial
    burden on the society. Although they exhibit different theoretical complexities
    in certain cases, in our experiments, both frequentist and Bayesian monitors took
    less than a millisecond to update their verdicts after each observation.
acknowledgement: 'This work is supported by the European Research Council under Grant
  No.: ERC-2020-AdG101020093.'
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
arxiv: 1
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
- first_name: Mahyar
  full_name: Karimi, Mahyar
  id: 6e5417ba-5355-11ee-ae5a-94c2e510b26b
  last_name: Karimi
  orcid: 0009-0005-0820-1696
- first_name: Konstantin
  full_name: Kueffner, Konstantin
  id: 8121a2d0-dc85-11ea-9058-af578f3b4515
  last_name: Kueffner
  orcid: 0000-0001-8974-2542
- first_name: Kaushik
  full_name: Mallik, Kaushik
  id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
  last_name: Mallik
  orcid: 0000-0001-9864-7475
citation:
  ama: 'Henzinger TA, Karimi M, Kueffner K, Mallik K. Monitoring algorithmic fairness.
    In: <i>Computer Aided Verification</i>. Vol 13965. Springer Nature; 2023:358–382.
    doi:<a href="https://doi.org/10.1007/978-3-031-37703-7_17">10.1007/978-3-031-37703-7_17</a>'
  apa: 'Henzinger, T. A., Karimi, M., Kueffner, K., &#38; Mallik, K. (2023). Monitoring
    algorithmic fairness. In <i>Computer Aided Verification</i> (Vol. 13965, pp. 358–382).
    Paris, France: Springer Nature. <a href="https://doi.org/10.1007/978-3-031-37703-7_17">https://doi.org/10.1007/978-3-031-37703-7_17</a>'
  chicago: Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik.
    “Monitoring Algorithmic Fairness.” In <i>Computer Aided Verification</i>, 13965:358–382.
    Springer Nature, 2023. <a href="https://doi.org/10.1007/978-3-031-37703-7_17">https://doi.org/10.1007/978-3-031-37703-7_17</a>.
  ieee: T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Monitoring algorithmic
    fairness,” in <i>Computer Aided Verification</i>, Paris, France, 2023, vol. 13965,
    pp. 358–382.
  ista: 'Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Monitoring algorithmic
    fairness. Computer Aided Verification. CAV: Computer Aided Verification, LNCS,
    vol. 13965, 358–382.'
  mla: Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness.” <i>Computer
    Aided Verification</i>, vol. 13965, Springer Nature, 2023, pp. 358–382, doi:<a
    href="https://doi.org/10.1007/978-3-031-37703-7_17">10.1007/978-3-031-37703-7_17</a>.
  short: T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, Computer Aided Verification,
    Springer Nature, 2023, pp. 358–382.
conference:
  end_date: 2023-07-22
  location: Paris, France
  name: 'CAV: Computer Aided Verification'
  start_date: 2023-07-17
corr_author: '1'
date_created: 2023-07-25T18:32:40Z
date_published: 2023-07-18T00:00:00Z
date_updated: 2026-09-18T07:41:29Z
day: '18'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1007/978-3-031-37703-7_17
ec_funded: 1
external_id:
  arxiv:
  - '2305.15979'
  isi:
  - '001310804800017'
file:
- access_level: open_access
  checksum: ccaf94bf7d658ba012c016e11869b54c
  content_type: application/pdf
  creator: dernst
  date_created: 2023-07-31T08:11:20Z
  date_updated: 2023-07-31T08:11:20Z
  file_id: '13327'
  file_name: 2023_LNCS_CAV_HenzingerT.pdf
  file_size: 647760
  relation: main_file
  success: 1
file_date_updated: 2023-07-31T08:11:20Z
fulldoi: https://doi.org/10.1007/978-3-031-37703-7_17
has_accepted_license: '1'
intvolume: '     13965'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 358–382
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publication: Computer Aided Verification
publication_identifier:
  eisbn:
  - '9783031377037'
  eissn:
  - 1611-3349
  isbn:
  - '9783031377020'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '22808'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Monitoring algorithmic fairness
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13965
year: '2023'
...
---
_id: '13228'
abstract:
- lang: eng
  text: A machine-learned system that is fair in static decision-making tasks may
    have biased societal impacts in the long-run. This may happen when the system
    interacts with humans and feedback patterns emerge, reinforcing old biases in
    the system and creating new biases. While existing works try to identify and mitigate
    long-run biases through smart system design, we introduce techniques for monitoring
    fairness in real time. Our goal is to build and deploy a monitor that will continuously
    observe a long sequence of events generated by the system in the wild, and will
    output, with each event, a verdict on how fair the system is at the current point
    in time. The advantages of monitoring are two-fold. Firstly, fairness is evaluated
    at run-time, which is important because unfair behaviors may not be eliminated
    a priori, at design-time, due to partial knowledge about the system and the environment,
    as well as uncertainties and dynamic changes in the system and the environment,
    such as the unpredictability of human behavior. Secondly, monitors are by design
    oblivious to how the monitored system is constructed, which makes them suitable
    to be used as trusted third-party fairness watchdogs. They function as computationally
    lightweight statistical estimators, and their correctness proofs rely on the rigorous
    analysis of the stochastic process that models the assumptions about the underlying
    dynamics of the system. We show, both in theory and experiments, how monitors
    can warn us (1) if a bank’s credit policy over time has created an unfair distribution
    of credit scores among the population, and (2) if a resource allocator’s allocation
    policy over time has made unfair allocations. Our experiments demonstrate that
    the monitors introduce very low overhead. We believe that runtime monitoring is
    an important and mathematically rigorous new addition to the fairness toolbox.
acknowledgement: 'The authors would like to thank the anonymous reviewers for their
  valuable comments and helpful suggestions. This work is supported by the European
  Research Council under Grant No.: ERC-2020-AdG 101020093.'
article_processing_charge: Yes (via OA deal)
arxiv: 1
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
- first_name: Mahyar
  full_name: Karimi, Mahyar
  id: 6e5417ba-5355-11ee-ae5a-94c2e510b26b
  last_name: Karimi
  orcid: 0009-0005-0820-1696
- first_name: Konstantin
  full_name: Kueffner, Konstantin
  id: 8121a2d0-dc85-11ea-9058-af578f3b4515
  last_name: Kueffner
  orcid: 0000-0001-8974-2542
- first_name: Kaushik
  full_name: Mallik, Kaushik
  id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
  last_name: Mallik
  orcid: 0000-0001-9864-7475
citation:
  ama: 'Henzinger TA, Karimi M, Kueffner K, Mallik K. Runtime monitoring of dynamic
    fairness properties. In: <i>FAccT ’23: Proceedings of the 2023 ACM Conference
    on Fairness, Accountability, and Transparency</i>. Association for Computing Machinery;
    2023:604-614. doi:<a href="https://doi.org/10.1145/3593013.3594028">10.1145/3593013.3594028</a>'
  apa: 'Henzinger, T. A., Karimi, M., Kueffner, K., &#38; Mallik, K. (2023). Runtime
    monitoring of dynamic fairness properties. In <i>FAccT ’23: Proceedings of the
    2023 ACM Conference on Fairness, Accountability, and Transparency</i> (pp. 604–614).
    Chicago, IL, United States: Association for Computing Machinery. <a href="https://doi.org/10.1145/3593013.3594028">https://doi.org/10.1145/3593013.3594028</a>'
  chicago: 'Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik.
    “Runtime Monitoring of Dynamic Fairness Properties.” In <i>FAccT ’23: Proceedings
    of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i>,
    604–14. Association for Computing Machinery, 2023. <a href="https://doi.org/10.1145/3593013.3594028">https://doi.org/10.1145/3593013.3594028</a>.'
  ieee: 'T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Runtime monitoring
    of dynamic fairness properties,” in <i>FAccT ’23: Proceedings of the 2023 ACM
    Conference on Fairness, Accountability, and Transparency</i>, Chicago, IL, United
    States, 2023, pp. 604–614.'
  ista: 'Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Runtime monitoring of
    dynamic fairness properties. FAccT ’23: Proceedings of the 2023 ACM Conference
    on Fairness, Accountability, and Transparency. FAccT: Conference on Fairness,
    Accountability and Transparency, 604–614.'
  mla: 'Henzinger, Thomas A., et al. “Runtime Monitoring of Dynamic Fairness Properties.”
    <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability,
    and Transparency</i>, Association for Computing Machinery, 2023, pp. 604–14, doi:<a
    href="https://doi.org/10.1145/3593013.3594028">10.1145/3593013.3594028</a>.'
  short: 'T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, FAccT ’23: Proceedings
    of the 2023 ACM Conference on Fairness, Accountability, and Transparency, Association
    for Computing Machinery, 2023, pp. 604–614.'
conference:
  end_date: 2023-06-15
  location: Chicago, IL, United States
  name: 'FAccT: Conference on Fairness, Accountability and Transparency'
  start_date: 2023-06-12
corr_author: '1'
date_created: 2023-07-16T22:01:09Z
date_published: 2023-06-12T00:00:00Z
date_updated: 2026-09-18T07:41:29Z
day: '12'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/3593013.3594028
ec_funded: 1
external_id:
  arxiv:
  - '2305.04699'
  isi:
  - '001062819300057'
file:
- access_level: open_access
  checksum: 96c759db9cdf94b81e37871a66a6ff48
  content_type: application/pdf
  creator: dernst
  date_created: 2023-07-18T07:43:10Z
  date_updated: 2023-07-18T07:43:10Z
  file_id: '13245'
  file_name: 2023_ACM_HenzingerT.pdf
  file_size: 4100596
  relation: main_file
  success: 1
file_date_updated: 2023-07-18T07:43:10Z
fulldoi: https://doi.org/10.1145/3593013.3594028
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 604-614
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publication: 'FAccT ''23: Proceedings of the 2023 ACM Conference on Fairness, Accountability,
  and Transparency'
publication_identifier:
  isbn:
  - '9781450372527'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
  record:
  - id: '22808'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Runtime monitoring of dynamic fairness properties
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14454'
abstract:
- lang: eng
  text: As AI and machine-learned software are used increasingly for making decisions
    that affect humans, it is imperative that they remain fair and unbiased in their
    decisions. To complement design-time bias mitigation measures, runtime verification
    techniques have been introduced recently to monitor the algorithmic fairness of
    deployed systems. Previous monitoring techniques assume full observability of
    the states of the (unknown) monitored system. Moreover, they can monitor only
    fairness properties that are specified as arithmetic expressions over the probabilities
    of different events. In this work, we extend fairness monitoring to systems modeled
    as partially observed Markov chains (POMC), and to specifications containing arithmetic
    expressions over the expected values of numerical functions on event sequences.
    The only assumptions we make are that the underlying POMC is aperiodic and starts
    in the stationary distribution, with a bound on its mixing time being known. These
    assumptions enable us to estimate a given property for the entire distribution
    of possible executions of the monitored POMC, by observing only a single execution.
    Our monitors observe a long run of the system and, after each new observation,
    output updated PAC-estimates of how fair or biased the system is. The monitors
    are computationally lightweight and, using a prototype implementation, we demonstrate
    their effectiveness on several real-world examples.
acknowledgement: 'This work is supported by the European Research Council under Grant
  No.: ERC-2020-AdG 101020093.'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
- first_name: Konstantin
  full_name: Kueffner, Konstantin
  id: 8121a2d0-dc85-11ea-9058-af578f3b4515
  last_name: Kueffner
  orcid: 0000-0001-8974-2542
- first_name: Kaushik
  full_name: Mallik, Kaushik
  id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
  last_name: Mallik
  orcid: 0000-0001-9864-7475
citation:
  ama: 'Henzinger TA, Kueffner K, Mallik K. Monitoring algorithmic fairness under
    partial observations. In: <i>23rd International Conference on Runtime Verification</i>.
    Vol 14245. Springer Nature; 2023:291-311. doi:<a href="https://doi.org/10.1007/978-3-031-44267-4_15">10.1007/978-3-031-44267-4_15</a>'
  apa: 'Henzinger, T. A., Kueffner, K., &#38; Mallik, K. (2023). Monitoring algorithmic
    fairness under partial observations. In <i>23rd International Conference on Runtime
    Verification</i> (Vol. 14245, pp. 291–311). Thessaloniki, Greece: Springer Nature.
    <a href="https://doi.org/10.1007/978-3-031-44267-4_15">https://doi.org/10.1007/978-3-031-44267-4_15</a>'
  chicago: Henzinger, Thomas A, Konstantin Kueffner, and Kaushik Mallik. “Monitoring
    Algorithmic Fairness under Partial Observations.” In <i>23rd International Conference
    on Runtime Verification</i>, 14245:291–311. Springer Nature, 2023. <a href="https://doi.org/10.1007/978-3-031-44267-4_15">https://doi.org/10.1007/978-3-031-44267-4_15</a>.
  ieee: T. A. Henzinger, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness
    under partial observations,” in <i>23rd International Conference on Runtime Verification</i>,
    Thessaloniki, Greece, 2023, vol. 14245, pp. 291–311.
  ista: 'Henzinger TA, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness
    under partial observations. 23rd International Conference on Runtime Verification.
    RV: Conference on Runtime Verification, LNCS, vol. 14245, 291–311.'
  mla: Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness under Partial
    Observations.” <i>23rd International Conference on Runtime Verification</i>, vol.
    14245, Springer Nature, 2023, pp. 291–311, doi:<a href="https://doi.org/10.1007/978-3-031-44267-4_15">10.1007/978-3-031-44267-4_15</a>.
  short: T.A. Henzinger, K. Kueffner, K. Mallik, in:, 23rd International Conference
    on Runtime Verification, Springer Nature, 2023, pp. 291–311.
conference:
  end_date: 2023-10-06
  location: Thessaloniki, Greece
  name: 'RV: Conference on Runtime Verification'
  start_date: 2023-10-03
corr_author: '1'
date_created: 2023-10-29T23:01:15Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2026-09-18T07:41:29Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-031-44267-4_15
ec_funded: 1
external_id:
  arxiv:
  - '2308.00341'
fulldoi: https://doi.org/10.1007/978-3-031-44267-4_15
intvolume: '     14245'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2308.00341
month: '10'
oa: 1
oa_version: Preprint
page: 291-311
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publication: 23rd International Conference on Runtime Verification
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783031442667'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '22808'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Monitoring algorithmic fairness under partial observations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14245
year: '2023'
...
---
_id: '12859'
abstract:
- lang: eng
  text: 'Machine learning models are vulnerable to adversarial perturbations, and
    a thought-provoking paper by Bubeck and Sellke has analyzed this phenomenon through
    the lens of over-parameterization: interpolating smoothly the data requires significantly
    more parameters than simply memorizing it. However, this "universal" law provides
    only a necessary condition for robustness, and it is unable to discriminate between
    models. In this paper, we address these gaps by focusing on empirical risk minimization
    in two prototypical settings, namely, random features and the neural tangent kernel
    (NTK). We prove that, for random features, the model is not robust for any degree
    of over-parameterization, even when the necessary condition coming from the universal
    law of robustness is satisfied. In contrast, for even activations, the NTK model
    meets the universal lower bound, and it is robust as soon as the necessary condition
    on over-parameterization is fulfilled. This also addresses a conjecture in prior
    work by Bubeck, Li and Nagaraj. Our analysis decouples the effect of the kernel
    of the model from an "interaction matrix", which describes the interaction with
    the test data and captures the effect of the activation. Our theoretical results
    are corroborated by numerical evidence on both synthetic and standard datasets
    (MNIST, CIFAR-10).'
acknowledgement: "Simone Bombari and Marco Mondelli were partially supported by the
  2019 Lopez-Loreta prize, and\r\nthe authors would like to thank Hamed Hassani for
  helpful discussions.\r\n"
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Simone
  full_name: Bombari, Simone
  id: ca726dda-de17-11ea-bc14-f9da834f63aa
  last_name: Bombari
- first_name: Shayan
  full_name: Kiyani, Shayan
  id: f5a2b424-e339-11ed-8435-ff3b4fe70cf8
  last_name: Kiyani
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
citation:
  ama: 'Bombari S, Kiyani S, Mondelli M. Beyond the universal law of robustness: Sharper
    laws for random features and neural tangent kernels. In: <i>Proceedings of the
    40th International Conference on Machine Learning</i>. Vol 202. ML Research Press;
    2023:2738-2776.'
  apa: 'Bombari, S., Kiyani, S., &#38; Mondelli, M. (2023). Beyond the universal law
    of robustness: Sharper laws for random features and neural tangent kernels. In
    <i>Proceedings of the 40th International Conference on Machine Learning</i> (Vol.
    202, pp. 2738–2776). Honolulu, HI, United States: ML Research Press.'
  chicago: 'Bombari, Simone, Shayan Kiyani, and Marco Mondelli. “Beyond the Universal
    Law of Robustness: Sharper Laws for Random Features and Neural Tangent Kernels.”
    In <i>Proceedings of the 40th International Conference on Machine Learning</i>,
    202:2738–76. ML Research Press, 2023.'
  ieee: 'S. Bombari, S. Kiyani, and M. Mondelli, “Beyond the universal law of robustness:
    Sharper laws for random features and neural tangent kernels,” in <i>Proceedings
    of the 40th International Conference on Machine Learning</i>, Honolulu, HI, United
    States, 2023, vol. 202, pp. 2738–2776.'
  ista: 'Bombari S, Kiyani S, Mondelli M. 2023. Beyond the universal law of robustness:
    Sharper laws for random features and neural tangent kernels. Proceedings of the
    40th International Conference on Machine Learning. ICML: International Conference
    on Machine Learning, PMLR, vol. 202, 2738–2776.'
  mla: 'Bombari, Simone, et al. “Beyond the Universal Law of Robustness: Sharper Laws
    for Random Features and Neural Tangent Kernels.” <i>Proceedings of the 40th International
    Conference on Machine Learning</i>, vol. 202, ML Research Press, 2023, pp. 2738–76.'
  short: S. Bombari, S. Kiyani, M. Mondelli, in:, Proceedings of the 40th International
    Conference on Machine Learning, ML Research Press, 2023, pp. 2738–2776.
conference:
  end_date: 2023-07-29
  location: Honolulu, HI, United States
  name: 'ICML: International Conference on Machine Learning'
  start_date: 2023-07-23
corr_author: '1'
date_created: 2023-04-23T16:11:03Z
date_published: 2023-10-27T00:00:00Z
date_updated: 2026-09-21T13:07:01Z
day: '27'
department:
- _id: GradSch
- _id: MaMo
external_id:
  arxiv:
  - '2302.01629'
intvolume: '       202'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2302.01629
month: '10'
oa: 1
oa_version: Preprint
page: 2738-2776
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
  name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Proceedings of the 40th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
  link:
  - relation: software
    url: https://github.com/simone-bombari/beyond-universal-robustness
  record:
  - id: '22857'
    relation: dissertation_contains
    status: public
status: public
title: 'Beyond the universal law of robustness: Sharper laws for random features and
  neural tangent kernels'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 202
year: '2023'
...
---
OA_place: publisher
OA_type: gold
_id: '15027'
abstract:
- lang: eng
  text: 'This data repository underpins the paper, published in PNAS (doi pending)
    and bioarxiv (doi: https://doi.org/10.1101/2023.07.05.547777).'
article_processing_charge: No
author:
- first_name: Samo
  full_name: Curk, Samo
  id: 031eff0d-d481-11ee-8508-cd12a7a86e5b
  last_name: Curk
  orcid: 0000-0001-6160-9766
citation:
  ama: Curk S. aggregation_data. 2023.
  apa: Curk, S. (2023). aggregation_data. Figshare.
  chicago: Curk, Samo. “Aggregation_data.” Figshare, 2023.
  ieee: S. Curk, “aggregation_data.” Figshare, 2023.
  ista: Curk S. 2023. aggregation_data, Figshare.
  mla: Curk, Samo. <i>Aggregation_data</i>. Figshare, 2023.
  short: S. Curk, (2023).
corr_author: '1'
date_created: 2024-02-26T08:37:57Z
date_published: 2023-12-13T00:00:00Z
date_updated: 2026-09-24T10:27:35Z
day: '13'
ddc:
- '570'
department:
- _id: AnSa
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://figshare.com/s/85798bba4ebc68d822ed
month: '12'
oa: 1
oa_version: Published Version
publisher: Figshare
related_material:
  record:
  - id: '15001'
    relation: used_in_publication
    status: public
status: public
title: aggregation_data
tmp:
  image: /images/cc_0.png
  legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
  name: Creative Commons Public Domain Dedication (CC0 1.0)
  short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '23012'
abstract:
- lang: eng
  text: The onset of turbulence in pipe flow has defied detailed understanding ever
    since Reynolds' first observations revealed the spatially-heterogeneous nature
    of the transition. While recent theoretical studies and experiments in simpler,
    shear-driven flows suggest that the onset of turbulence is a directed percolation
    non-equilibrium phase transition, whether these findings are generic and apply
    also to open or pressure-driven flows is unknown. In pipe flow, the extremely
    long time scales near the transition make direct observations of critical behavior
    virtually impossible. Here, we circumvent these limitations by experimentally
    characterizing all pairwise interactions between localized patches of turbulence
    ("puffs"), and using these interactions as input to renormalization group and
    computer simulations of minimal models that extrapolate to long length and time
    scales. We show that the universality class of the transition is directed percolation,
    from which emerges a jammed phase of puffs above the critical point. The stronger
    interactions in the jamming regime enable us to explicitly measure the turbulent
    fraction and confirm model predictions. Our work shows that directed percolation
    scaling applies beyond simple closed shear flows, and underscores how statistical
    mechanics can lead to profound, quantitative and predictive insights on turbulent
    flows and their phases.
article_processing_charge: No
author:
- first_name: Grégoire
  full_name: Lemoult, Grégoire
  last_name: Lemoult
citation:
  ama: Lemoult G. Directed percolation and puff jamming near the transition to pipe
    turbulence. 2023. doi:<a href="https://doi.org/10.5281/zenodo.10308791">10.5281/zenodo.10308791</a>
  apa: Lemoult, G. (2023). Directed percolation and puff jamming near the transition
    to pipe turbulence. Zenodo. <a href="https://doi.org/10.5281/zenodo.10308791">https://doi.org/10.5281/zenodo.10308791</a>
  chicago: Lemoult, Grégoire. “Directed Percolation and Puff Jamming near the Transition
    to Pipe Turbulence.” Zenodo, 2023. <a href="https://doi.org/10.5281/zenodo.10308791">https://doi.org/10.5281/zenodo.10308791</a>.
  ieee: G. Lemoult, “Directed percolation and puff jamming near the transition to
    pipe turbulence.” Zenodo, 2023.
  ista: Lemoult G. 2023. Directed percolation and puff jamming near the transition
    to pipe turbulence, Zenodo, <a href="https://doi.org/10.5281/zenodo.10308791">10.5281/zenodo.10308791</a>.
  mla: Lemoult, Grégoire. <i>Directed Percolation and Puff Jamming near the Transition
    to Pipe Turbulence</i>. Zenodo, 2023, doi:<a href="https://doi.org/10.5281/zenodo.10308791">10.5281/zenodo.10308791</a>.
  short: G. Lemoult, (2023).
date_created: 2026-10-01T07:47:57Z
date_published: 2023-12-08T00:00:00Z
date_updated: 2026-10-01T07:50:31Z
day: '08'
department:
- _id: BjHo
doi: 10.5281/zenodo.10308791
fulldoi: https://doi.org/10.5281/zenodo.10308791
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/zenodo.10308791
month: '12'
oa: 1
oa_version: None
publisher: Zenodo
related_material:
  record:
  - id: '17128'
    relation: used_in_publication
    status: public
status: public
title: Directed percolation and puff jamming near the transition to pipe turbulence
type: research_data_reference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '22961'
abstract:
- lang: eng
  text: "## Rationale:\r\nDifferentiation trajectories to generate specialized cellular
    features rely on sets of transcription factors (TFs) whose temporal dynamics and
    coexistence underlie morphological and neurochemical divergence among neurons
    and neuroendocrine cells. Even though transcriptional programs were extensively
    studied in the developing nervous system, the coupling of TFs to effector gene
    networks that time and shape the morphogenesis of these polarized cells is less
    known.\r\n\r\n## Results:\r\nHere, we make the curious observation that evolutionarily
    conserved Onecut3, a subordinate in the Onecut TF family known to control fate
    selection in progenitors, is instead expressed in fate-restricted neuroblasts
    in the vertebrate hypothalamus. In particular, a pool of Ascl1-containing progenitors
    in the midgestational mouse hypothalamus gives rise to both GABA and glutamate
    neurons destined to the periventricular and lateral hypothalamus, respectively,
    which uniformly upregulate Onecut3 only when exiting the proliferative zone of
    the 3rd ventricle. By combining single-cell RNA-seq, genetic Onecut3 reporters,
    gain-of-function models in vitro, and loss-of-function analysis in early-developing
    mice and C. elegans, we identify that Onecut3 instructs neuronal differentiation
    and maturation, through a Navigator-2 pathway to modulate neuritogenesis and leading
    process motility.\r\n\r\n\r\n## Conclusion:\r\nOnecut3 executes an unexpected
    function by inducing cytoskeletal modifications of key importance for neuronal
    maturation and network integration during the morphogenesis of many neuronal phenotypes
    in the vertebrate hypothalamus."
article_processing_charge: No
author:
- first_name: Maja
  full_name: Zupancic, Maja
  last_name: Zupancic
- first_name: Erik
  full_name: Keimpema, Erik
  last_name: Keimpema
- first_name: Evgenii
  full_name: Tretiakov, Evgenii
  last_name: Tretiakov
- first_name: Pradeep
  full_name: Bhandari, Pradeep
  last_name: Bhandari
- first_name: Stephanie
  full_name: Eder, Stephanie
  last_name: Eder
- first_name: Itamar
  full_name: Lev, Itamar
  last_name: Lev
- first_name: Wolfgang
  full_name: Härtig, Wolfgang
  last_name: Härtig
- first_name: Manuel
  full_name: Zimmer, Manuel
  last_name: Zimmer
- first_name: Frederic
  full_name: Clotman, Frederic
  last_name: Clotman
- first_name: Tibor
  full_name: Harkany, Tibor
  last_name: Harkany
citation:
  ama: Zupancic M, Keimpema E, Tretiakov E, et al. Glutamate and GABA neurons share
    cascading Onecut3/NAV2-driven differentiation trajectories in the developing hypothalamus.
    2023. doi:<a href="https://doi.org/10.6084/m9.figshare.22680433">10.6084/m9.figshare.22680433</a>
  apa: Zupancic, M., Keimpema, E., Tretiakov, E., Bhandari, P., Eder, S., Lev, I.,
    … Harkany, T. (2023). Glutamate and GABA neurons share cascading Onecut3/NAV2-driven
    differentiation trajectories in the developing hypothalamus. Repository. <a href="https://doi.org/10.6084/m9.figshare.22680433">https://doi.org/10.6084/m9.figshare.22680433</a>
  chicago: Zupancic, Maja, Erik Keimpema, Evgenii Tretiakov, Pradeep Bhandari, Stephanie
    Eder, Itamar Lev, Wolfgang Härtig, Manuel Zimmer, Frederic Clotman, and Tibor
    Harkany. “Glutamate and GABA Neurons Share Cascading Onecut3/NAV2-Driven Differentiation
    Trajectories in the Developing Hypothalamus.” Repository, 2023. <a href="https://doi.org/10.6084/m9.figshare.22680433">https://doi.org/10.6084/m9.figshare.22680433</a>.
  ieee: M. Zupancic <i>et al.</i>, “Glutamate and GABA neurons share cascading Onecut3/NAV2-driven
    differentiation trajectories in the developing hypothalamus.” Repository, 2023.
  ista: Zupancic M, Keimpema E, Tretiakov E, Bhandari P, Eder S, Lev I, Härtig W,
    Zimmer M, Clotman F, Harkany T. 2023. Glutamate and GABA neurons share cascading
    Onecut3/NAV2-driven differentiation trajectories in the developing hypothalamus,
    Repository, <a href="https://doi.org/10.6084/m9.figshare.22680433">10.6084/m9.figshare.22680433</a>.
  mla: Zupancic, Maja, et al. <i>Glutamate and GABA Neurons Share Cascading Onecut3/NAV2-Driven
    Differentiation Trajectories in the Developing Hypothalamus</i>. Repository, 2023,
    doi:<a href="https://doi.org/10.6084/m9.figshare.22680433">10.6084/m9.figshare.22680433</a>.
  short: M. Zupancic, E. Keimpema, E. Tretiakov, P. Bhandari, S. Eder, I. Lev, W.
    Härtig, M. Zimmer, F. Clotman, T. Harkany, (2023).
date_created: 2026-09-17T11:23:46Z
date_published: 2023-04-23T00:00:00Z
date_updated: 2026-10-01T12:17:26Z
day: '23'
ddc:
- '570'
department:
- _id: RySh
doi: 10.6084/m9.figshare.22680433
fulldoi: https://doi.org/10.6084/m9.figshare.22680433
main_file_link:
- open_access: '1'
  url: https://doi.org/10.6084/m9.figshare.22680433
month: '04'
oa: 1
oa_version: None
publisher: Repository
related_material:
  record:
  - id: '18445'
    relation: used_in_publication
    status: public
status: public
title: Glutamate and GABA neurons share cascading Onecut3/NAV2-driven differentiation
  trajectories in the developing hypothalamus
type: research_data_reference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2023'
...
---
_id: '14514'
abstract:
- lang: eng
  text: 'The elastic Leidenfrost effect occurs when a vaporizable soft solid is lowered
    onto a hot surface. Evaporative flow couples to elastic deformation, giving spontaneous
    bouncing or steady-state floating. The effect embodies an unexplored interplay
    between thermodynamics, elasticity, and lubrication: despite being observed, its
    basic theoretical description remains a challenge. Here, we provide a theory of
    elastic Leidenfrost floating. As weight increases, a rigid solid sits closer to
    the hot surface. By contrast, we discover an elasticity-dominated regime where
    the heavier the solid, the higher it floats. This geometry-governed behavior is
    reminiscent of the dynamics of large liquid Leidenfrost drops. We show that this
    elastic regime is characterized by Hertzian behavior of the solid’s underbelly
    and derive how the float height scales with materials parameters. Introducing
    a dimensionless elastic Leidenfrost number, we capture the crossover between rigid
    and Hertzian behavior. Our results provide theoretical underpinning for recent
    experiments, and point to the design of novel soft machines.'
acknowledgement: "We are grateful to Dominic Vella, Jens Eggers, John Kolinski, Joshua
  Dijksman, and Daniel Bonn for insightful discussions. J. B. and A. S. acknowledge
  the support of the Engineering and Physical Sciences Research Council (EPSRC) through
  New Investigator Award No. EP/\r\nT000961/1. A. S. acknowledges the support of Royal
  Society under Grant No. RGS/R2/202135. J. E. S. acknowledges EPSRC Grants No. EP/N016602/1,
  EP/S022848/1, EP/S029966/1, and EP/P031684/1."
article_number: '168201'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Jack
  full_name: Binysh, Jack
  last_name: Binysh
- first_name: Indrajit
  full_name: Chakraborty, Indrajit
  last_name: Chakraborty
- first_name: Mykyta V.
  full_name: Chubynsky, Mykyta V.
  last_name: Chubynsky
- first_name: Vicente L
  full_name: Diaz Melian, Vicente L
  id: b6798902-eea0-11ea-9cbc-a8e14286c631
  last_name: Diaz Melian
- first_name: Scott R
  full_name: Waitukaitis, Scott R
  id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
  last_name: Waitukaitis
  orcid: 0000-0002-2299-3176
- first_name: James E.
  full_name: Sprittles, James E.
  last_name: Sprittles
- first_name: Anton
  full_name: Souslov, Anton
  last_name: Souslov
citation:
  ama: Binysh J, Chakraborty I, Chubynsky MV, et al. Modeling Leidenfrost levitation
    of soft elastic solids. <i>Physical Review Letters</i>. 2023;131(16). doi:<a href="https://doi.org/10.1103/PhysRevLett.131.168201">10.1103/PhysRevLett.131.168201</a>
  apa: Binysh, J., Chakraborty, I., Chubynsky, M. V., Diaz Melian, V. L., Waitukaitis,
    S. R., Sprittles, J. E., &#38; Souslov, A. (2023). Modeling Leidenfrost levitation
    of soft elastic solids. <i>Physical Review Letters</i>. American Physical Society.
    <a href="https://doi.org/10.1103/PhysRevLett.131.168201">https://doi.org/10.1103/PhysRevLett.131.168201</a>
  chicago: Binysh, Jack, Indrajit Chakraborty, Mykyta V. Chubynsky, Vicente L Diaz
    Melian, Scott R Waitukaitis, James E. Sprittles, and Anton Souslov. “Modeling
    Leidenfrost Levitation of Soft Elastic Solids.” <i>Physical Review Letters</i>.
    American Physical Society, 2023. <a href="https://doi.org/10.1103/PhysRevLett.131.168201">https://doi.org/10.1103/PhysRevLett.131.168201</a>.
  ieee: J. Binysh <i>et al.</i>, “Modeling Leidenfrost levitation of soft elastic
    solids,” <i>Physical Review Letters</i>, vol. 131, no. 16. American Physical Society,
    2023.
  ista: Binysh J, Chakraborty I, Chubynsky MV, Diaz Melian VL, Waitukaitis SR, Sprittles
    JE, Souslov A. 2023. Modeling Leidenfrost levitation of soft elastic solids. Physical
    Review Letters. 131(16), 168201.
  mla: Binysh, Jack, et al. “Modeling Leidenfrost Levitation of Soft Elastic Solids.”
    <i>Physical Review Letters</i>, vol. 131, no. 16, 168201, American Physical Society,
    2023, doi:<a href="https://doi.org/10.1103/PhysRevLett.131.168201">10.1103/PhysRevLett.131.168201</a>.
  short: J. Binysh, I. Chakraborty, M.V. Chubynsky, V.L. Diaz Melian, S.R. Waitukaitis,
    J.E. Sprittles, A. Souslov, Physical Review Letters 131 (2023).
date_created: 2023-11-12T23:00:55Z
date_published: 2023-10-20T00:00:00Z
date_updated: 2026-10-02T08:44:47Z
day: '20'
ddc:
- '530'
department:
- _id: ScWa
doi: 10.1103/PhysRevLett.131.168201
external_id:
  isi:
  - '001164388300007'
  pmid:
  - '37925690'
file:
- access_level: open_access
  checksum: 1a419e25b762aadffbcc8eb2e609bd97
  content_type: application/pdf
  creator: dernst
  date_created: 2023-11-13T09:12:58Z
  date_updated: 2023-11-13T09:12:58Z
  file_id: '14524'
  file_name: 2023_PhysRevLetters_Binysh.pdf
  file_size: 724098
  relation: main_file
  success: 1
file_date_updated: 2023-11-13T09:12:58Z
fulldoi: https://doi.org/10.1103/PhysRevLett.131.168201
has_accepted_license: '1'
intvolume: '       131'
isi: 1
issue: '16'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
publication: Physical Review Letters
publication_identifier:
  eissn:
  - 1079-7114
  issn:
  - 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
  record:
  - id: '14523'
    relation: research_data
    status: public
  - id: '23005'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Modeling Leidenfrost levitation of soft elastic solids
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 131
year: '2023'
...
---
_id: '14919'
abstract:
- lang: eng
  text: "GLACIER METEOROLOGICAL DATA SWISS ALPS -2022\r\n"
article_processing_charge: No
author:
- first_name: Thomas
  full_name: Shaw, Thomas
  id: 3caa3f91-1f03-11ee-96ce-e0e553054d6e
  last_name: Shaw
  orcid: 0000-0001-7640-6152
- first_name: Pascal
  full_name: Buri, Pascal
  id: 317987aa-9421-11ee-ac5a-b941b041abba
  last_name: Buri
- first_name: Michael
  full_name: McCarthy, Michael
  last_name: McCarthy
- first_name: Evan
  full_name: Miles, Evan
  last_name: Miles
- first_name: Francesca
  full_name: Pellicciotti, Francesca
  id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
  last_name: Pellicciotti
  orcid: 0000-0002-5554-8087
citation:
  ama: Shaw T, Buri P, McCarthy M, Miles E, Pellicciotti F. Air temperature and near-surface
    meteorology datasets on three Swiss glaciers - Extreme 2022 Summer. 2023. doi:<a
    href="https://doi.org/10.5281/ZENODO.8277285">10.5281/ZENODO.8277285</a>
  apa: Shaw, T., Buri, P., McCarthy, M., Miles, E., &#38; Pellicciotti, F. (2023).
    Air temperature and near-surface meteorology datasets on three Swiss glaciers
    - Extreme 2022 Summer. Zenodo. <a href="https://doi.org/10.5281/ZENODO.8277285">https://doi.org/10.5281/ZENODO.8277285</a>
  chicago: Shaw, Thomas, Pascal Buri, Michael McCarthy, Evan Miles, and Francesca
    Pellicciotti. “Air Temperature and Near-Surface Meteorology Datasets on Three
    Swiss Glaciers - Extreme 2022 Summer.” Zenodo, 2023. <a href="https://doi.org/10.5281/ZENODO.8277285">https://doi.org/10.5281/ZENODO.8277285</a>.
  ieee: T. Shaw, P. Buri, M. McCarthy, E. Miles, and F. Pellicciotti, “Air temperature
    and near-surface meteorology datasets on three Swiss glaciers - Extreme 2022 Summer.”
    Zenodo, 2023.
  ista: Shaw T, Buri P, McCarthy M, Miles E, Pellicciotti F. 2023. Air temperature
    and near-surface meteorology datasets on three Swiss glaciers - Extreme 2022 Summer,
    Zenodo, <a href="https://doi.org/10.5281/ZENODO.8277285">10.5281/ZENODO.8277285</a>.
  mla: Shaw, Thomas, et al. <i>Air Temperature and Near-Surface Meteorology Datasets
    on Three Swiss Glaciers - Extreme 2022 Summer</i>. Zenodo, 2023, doi:<a href="https://doi.org/10.5281/ZENODO.8277285">10.5281/ZENODO.8277285</a>.
  short: T. Shaw, P. Buri, M. McCarthy, E. Miles, F. Pellicciotti, (2023).
corr_author: '1'
date_created: 2024-01-31T12:08:26Z
date_published: 2023-08-23T00:00:00Z
date_updated: 2026-10-02T08:57:44Z
day: '23'
ddc:
- '550'
department:
- _id: FrPe
doi: 10.5281/ZENODO.8277285
fulldoi: https://doi.org/10.5281/ZENODO.8277285
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/ZENODO.8277285
month: '08'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
  record:
  - id: '14885'
    relation: used_in_publication
    status: public
status: public
title: Air temperature and near-surface meteorology datasets on three Swiss glaciers
  - Extreme 2022 Summer
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
