---
_id: '7905'
abstract:
- lang: eng
  text: We investigate a sheaf-theoretic interpretation of stratification learning
    from geometric and topological perspectives. Our main result is the construction
    of stratification learning algorithms framed in terms of a sheaf on a partially
    ordered set with the Alexandroff topology. We prove that the resulting decomposition
    is the unique minimal stratification for which the strata are homogeneous and
    the given sheaf is constructible. In particular, when we choose to work with the
    local homology sheaf, our algorithm gives an alternative to the local homology
    transfer algorithm given in Bendich et al. (Proceedings of the 23rd Annual ACM-SIAM
    Symposium on Discrete Algorithms, pp. 1355–1370, ACM, New York, 2012), and the
    cohomology stratification algorithm given in Nanda (Found. Comput. Math. 20(2),
    195–222, 2020). Additionally, we give examples of stratifications based on the
    geometric techniques of Breiding et al. (Rev. Mat. Complut. 31(3), 545–593, 2018),
    illustrating how the sheaf-theoretic approach can be used to study stratifications
    from both topological and geometric perspectives. This approach also points toward
    future applications of sheaf theory in the study of topological data analysis
    by illustrating the utility of the language of sheaf theory in generalizing existing
    algorithms.
acknowledgement: Open access funding provided by Institute of Science and Technology
  (IST Austria). This work was partially supported by NSF IIS-1513616 and NSF ABI-1661375.
  The authors would like to thank the anonymous referees for their insightful comments.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Adam
  full_name: Brown, Adam
  id: 70B7FDF6-608D-11E9-9333-8535E6697425
  last_name: Brown
- first_name: Bei
  full_name: Wang, Bei
  last_name: Wang
citation:
  ama: Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and
    topological perspectives. <i>Discrete and Computational Geometry</i>. 2021;65:1166-1198.
    doi:<a href="https://doi.org/10.1007/s00454-020-00206-y">10.1007/s00454-020-00206-y</a>
  apa: Brown, A., &#38; Wang, B. (2021). Sheaf-theoretic stratification learning from
    geometric and topological perspectives. <i>Discrete and Computational Geometry</i>.
    Springer Nature. <a href="https://doi.org/10.1007/s00454-020-00206-y">https://doi.org/10.1007/s00454-020-00206-y</a>
  chicago: Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from
    Geometric and Topological Perspectives.” <i>Discrete and Computational Geometry</i>.
    Springer Nature, 2021. <a href="https://doi.org/10.1007/s00454-020-00206-y">https://doi.org/10.1007/s00454-020-00206-y</a>.
  ieee: A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric
    and topological perspectives,” <i>Discrete and Computational Geometry</i>, vol.
    65. Springer Nature, pp. 1166–1198, 2021.
  ista: Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric
    and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.
  mla: Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric
    and Topological Perspectives.” <i>Discrete and Computational Geometry</i>, vol.
    65, Springer Nature, 2021, pp. 1166–98, doi:<a href="https://doi.org/10.1007/s00454-020-00206-y">10.1007/s00454-020-00206-y</a>.
  short: A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.
date_created: 2020-05-30T10:26:04Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2024-03-07T15:01:58Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00206-y
external_id:
  arxiv:
  - '1712.07734'
  isi:
  - '000536324700001'
file:
- access_level: open_access
  checksum: 487a84ea5841b75f04f66d7ebd71b67e
  content_type: application/pdf
  creator: dernst
  date_created: 2020-11-25T09:06:41Z
  date_updated: 2020-11-25T09:06:41Z
  file_id: '8803'
  file_name: 2020_DiscreteCompGeometry_Brown.pdf
  file_size: 1013730
  relation: main_file
  success: 1
file_date_updated: 2020-11-25T09:06:41Z
has_accepted_license: '1'
intvolume: '        65'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1166-1198
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
publication: Discrete and Computational Geometry
publication_identifier:
  eissn:
  - 1432-0444
  issn:
  - 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sheaf-theoretic stratification learning from geometric and topological perspectives
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2021'
...
---
_id: '7925'
abstract:
- lang: eng
  text: In this paper, we introduce a relaxed CQ method with alternated inertial step
    for solving split feasibility problems. We give convergence of the sequence generated
    by our method under some suitable assumptions. Some numerical implementations
    from sparse signal and image deblurring are reported to show the efficiency of
    our method.
acknowledgement: Open access funding provided by Institute of Science and Technology
  (IST Austria). The authors are grateful to the referees for their insightful comments
  which have improved the earlier version of the manuscript greatly. The first author
  has received funding from the European Research Council (ERC) under the European
  Union’s Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yekini
  full_name: Shehu, Yekini
  id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
  last_name: Shehu
  orcid: 0000-0001-9224-7139
- first_name: Aviv
  full_name: Gibali, Aviv
  last_name: Gibali
citation:
  ama: Shehu Y, Gibali A. New inertial relaxed method for solving split feasibilities.
    <i>Optimization Letters</i>. 2021;15:2109-2126. doi:<a href="https://doi.org/10.1007/s11590-020-01603-1">10.1007/s11590-020-01603-1</a>
  apa: Shehu, Y., &#38; Gibali, A. (2021). New inertial relaxed method for solving
    split feasibilities. <i>Optimization Letters</i>. Springer Nature. <a href="https://doi.org/10.1007/s11590-020-01603-1">https://doi.org/10.1007/s11590-020-01603-1</a>
  chicago: Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving
    Split Feasibilities.” <i>Optimization Letters</i>. Springer Nature, 2021. <a href="https://doi.org/10.1007/s11590-020-01603-1">https://doi.org/10.1007/s11590-020-01603-1</a>.
  ieee: Y. Shehu and A. Gibali, “New inertial relaxed method for solving split feasibilities,”
    <i>Optimization Letters</i>, vol. 15. Springer Nature, pp. 2109–2126, 2021.
  ista: Shehu Y, Gibali A. 2021. New inertial relaxed method for solving split feasibilities.
    Optimization Letters. 15, 2109–2126.
  mla: Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split
    Feasibilities.” <i>Optimization Letters</i>, vol. 15, Springer Nature, 2021, pp.
    2109–26, doi:<a href="https://doi.org/10.1007/s11590-020-01603-1">10.1007/s11590-020-01603-1</a>.
  short: Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126.
date_created: 2020-06-04T11:28:33Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2024-03-07T15:00:43Z
day: '01'
ddc:
- '510'
department:
- _id: VlKo
doi: 10.1007/s11590-020-01603-1
ec_funded: 1
external_id:
  isi:
  - '000537342300001'
file:
- access_level: open_access
  checksum: 63c5f31cd04626152a19f97a2476281b
  content_type: application/pdf
  creator: kschuh
  date_created: 2024-03-07T14:58:51Z
  date_updated: 2024-03-07T14:58:51Z
  file_id: '15089'
  file_name: 2021_OptimizationLetters_Shehu.pdf
  file_size: 2148882
  relation: main_file
  success: 1
file_date_updated: 2024-03-07T14:58:51Z
has_accepted_license: '1'
intvolume: '        15'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 2109-2126
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
publication: Optimization Letters
publication_identifier:
  eissn:
  - 1862-4480
  issn:
  - 1862-4472
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: New inertial relaxed method for solving split feasibilities
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2021'
...
---
_id: '7939'
abstract:
- lang: eng
  text: "We design fast deterministic algorithms for distance computation in the Congested
    Clique model. Our key contributions include:\r\n    A (2+ϵ)-approximation for
    all-pairs shortest paths in O(log2n/ϵ) rounds on unweighted undirected graphs.
    With a small additional additive factor, this also applies for weighted graphs.
    This is the first sub-polynomial constant-factor approximation for APSP in this
    model.\r\n    A (1+ϵ)-approximation for multi-source shortest paths from O(n−−√)
    sources in O(log2n/ϵ) rounds on weighted undirected graphs. This is the first
    sub-polynomial algorithm obtaining this approximation for a set of sources of
    polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained
    via improved algorithms for sparse matrix multiplication, which we leverage to
    construct efficient hopsets and shortest paths. Furthermore, our techniques extend
    to additional distance problems for which we improve upon the state-of-the-art,
    including diameter approximation, and an exact single-source shortest paths algorithm
    for weighted undirected graphs in O~(n1/6) rounds. "
acknowledgement: Open access funding provided by Institute of Science and Technology
  (IST Austria). We thank Mohsen Ghaffari, Michael Elkin and Merav Parter for fruitful
  discussions. This project has received funding from the European Union’s Horizon
  2020 Research And Innovation Program under Grant Agreement No. 755839.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Keren
  full_name: Censor-Hillel, Keren
  last_name: Censor-Hillel
- first_name: Michal
  full_name: Dory, Michal
  last_name: Dory
- first_name: Janne
  full_name: Korhonen, Janne
  id: C5402D42-15BC-11E9-A202-CA2BE6697425
  last_name: Korhonen
- first_name: Dean
  full_name: Leitersdorf, Dean
  last_name: Leitersdorf
citation:
  ama: Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest
    paths in the congested clique. <i>Distributed Computing</i>. 2021;34:463-487.
    doi:<a href="https://doi.org/10.1007/s00446-020-00380-5">10.1007/s00446-020-00380-5</a>
  apa: Censor-Hillel, K., Dory, M., Korhonen, J., &#38; Leitersdorf, D. (2021). Fast
    approximate shortest paths in the congested clique. <i>Distributed Computing</i>.
    Springer Nature. <a href="https://doi.org/10.1007/s00446-020-00380-5">https://doi.org/10.1007/s00446-020-00380-5</a>
  chicago: Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf.
    “Fast Approximate Shortest Paths in the Congested Clique.” <i>Distributed Computing</i>.
    Springer Nature, 2021. <a href="https://doi.org/10.1007/s00446-020-00380-5">https://doi.org/10.1007/s00446-020-00380-5</a>.
  ieee: K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate
    shortest paths in the congested clique,” <i>Distributed Computing</i>, vol. 34.
    Springer Nature, pp. 463–487, 2021.
  ista: Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate
    shortest paths in the congested clique. Distributed Computing. 34, 463–487.
  mla: Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested
    Clique.” <i>Distributed Computing</i>, vol. 34, Springer Nature, 2021, pp. 463–87,
    doi:<a href="https://doi.org/10.1007/s00446-020-00380-5">10.1007/s00446-020-00380-5</a>.
  short: K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing
    34 (2021) 463–487.
date_created: 2020-06-07T22:00:54Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2024-03-07T14:43:39Z
day: '01'
department:
- _id: DaAl
doi: 10.1007/s00446-020-00380-5
external_id:
  arxiv:
  - '1903.05956'
  isi:
  - '000556444600001'
intvolume: '        34'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1007/s00446-020-00380-5
month: '12'
oa: 1
oa_version: Published Version
page: 463-487
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
publication: Distributed Computing
publication_identifier:
  eissn:
  - 1432-0452
  issn:
  - 0178-2770
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '6933'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Fast approximate shortest paths in the congested clique
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '7941'
abstract:
- lang: eng
  text: Expansion microscopy is a recently developed super-resolution imaging technique,
    which provides an alternative to optics-based methods such as deterministic approaches
    (e.g. STED) or stochastic approaches (e.g. PALM/STORM). The idea behind expansion
    microscopy is to embed the biological sample in a swellable gel, and then to expand
    it isotropically, thereby increasing the distance between the fluorophores. This
    approach breaks the diffraction barrier by simply separating the emission point-spread-functions
    of the fluorophores. The resolution attainable in expansion microscopy is thus
    directly dependent on the separation that can be achieved, i.e. on the expansion
    factor. The original implementation of the technique achieved an expansion factor
    of fourfold, for a resolution of 70–80 nm. The subsequently developed X10 method
    achieves an expansion factor of 10-fold, for a resolution of 25–30 nm. This technique
    can be implemented with minimal technical requirements on any standard fluorescence
    microscope, and is more easily applied for multi-color imaging than either deterministic
    or stochastic super-resolution approaches. This renders X10 expansion microscopy
    a highly promising tool for new biological discoveries, as discussed here, and
    as demonstrated by several recent applications.
article_processing_charge: No
author:
- first_name: Sven M
  full_name: Truckenbrodt, Sven M
  id: 45812BD4-F248-11E8-B48F-1D18A9856A87
  last_name: Truckenbrodt
- first_name: Silvio O.
  full_name: Rizzoli, Silvio O.
  last_name: Rizzoli
citation:
  ama: 'Truckenbrodt SM, Rizzoli SO. Simple multi-color super-resolution by X10 microscopy.
    In: <i>Methods in Cell Biology</i>. Vol 161. Elsevier; 2021:33-56. doi:<a href="https://doi.org/10.1016/bs.mcb.2020.04.016">10.1016/bs.mcb.2020.04.016</a>'
  apa: Truckenbrodt, S. M., &#38; Rizzoli, S. O. (2021). Simple multi-color super-resolution
    by X10 microscopy. In <i>Methods in Cell Biology</i> (Vol. 161, pp. 33–56). Elsevier.
    <a href="https://doi.org/10.1016/bs.mcb.2020.04.016">https://doi.org/10.1016/bs.mcb.2020.04.016</a>
  chicago: Truckenbrodt, Sven M, and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution
    by X10 Microscopy.” In <i>Methods in Cell Biology</i>, 161:33–56. Elsevier, 2021.
    <a href="https://doi.org/10.1016/bs.mcb.2020.04.016">https://doi.org/10.1016/bs.mcb.2020.04.016</a>.
  ieee: S. M. Truckenbrodt and S. O. Rizzoli, “Simple multi-color super-resolution
    by X10 microscopy,” in <i>Methods in Cell Biology</i>, vol. 161, Elsevier, 2021,
    pp. 33–56.
  ista: 'Truckenbrodt SM, Rizzoli SO. 2021.Simple multi-color super-resolution by
    X10 microscopy. In: Methods in Cell Biology. vol. 161, 33–56.'
  mla: Truckenbrodt, Sven M., and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution
    by X10 Microscopy.” <i>Methods in Cell Biology</i>, vol. 161, Elsevier, 2021,
    pp. 33–56, doi:<a href="https://doi.org/10.1016/bs.mcb.2020.04.016">10.1016/bs.mcb.2020.04.016</a>.
  short: S.M. Truckenbrodt, S.O. Rizzoli, in:, Methods in Cell Biology, Elsevier,
    2021, pp. 33–56.
date_created: 2020-06-07T22:00:55Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2021-03-11T08:49:08Z
day: '01'
department:
- _id: JoDa
doi: 10.1016/bs.mcb.2020.04.016
external_id:
  pmid:
  - '33478696'
intvolume: '       161'
language:
- iso: eng
month: '01'
oa_version: None
page: 33-56
pmid: 1
publication: Methods in Cell Biology
publication_identifier:
  isbn:
  - 978012820807-6
  issn:
  - 0091-679X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Simple multi-color super-resolution by X10 microscopy
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 161
year: '2021'
...
---
_id: '8196'
abstract:
- lang: eng
  text: This paper aims to obtain a strong convergence result for a Douglas–Rachford
    splitting method with inertial extrapolation step for finding a zero of the sum
    of two set-valued maximal monotone operators without any further assumption of
    uniform monotonicity on any of the involved maximal monotone operators. Furthermore,
    our proposed method is easy to implement and the inertial factor in our proposed
    method is a natural choice. Our method of proof is of independent interest. Finally,
    some numerical implementations are given to confirm the theoretical analysis.
acknowledgement: Open access funding provided by Institute of Science and Technology
  (IST Austria). The project of Yekini Shehu has received funding from the European
  Research Council (ERC) under the European Union’s Seventh Framework Program (FP7—2007–2013)
  (Grant Agreement No. 616160). The authors are grateful to the anonymous referees
  and the handling Editor for their comments and suggestions which have improved the
  earlier version of the manuscript greatly.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yekini
  full_name: Shehu, Yekini
  id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
  last_name: Shehu
  orcid: 0000-0001-9224-7139
- first_name: Qiao-Li
  full_name: Dong, Qiao-Li
  last_name: Dong
- first_name: Lu-Lu
  full_name: Liu, Lu-Lu
  last_name: Liu
- first_name: Jen-Chih
  full_name: Yao, Jen-Chih
  last_name: Yao
citation:
  ama: Shehu Y, Dong Q-L, Liu L-L, Yao J-C. New strong convergence method for the
    sum of two maximal monotone operators. <i>Optimization and Engineering</i>. 2021;22:2627-2653.
    doi:<a href="https://doi.org/10.1007/s11081-020-09544-5">10.1007/s11081-020-09544-5</a>
  apa: Shehu, Y., Dong, Q.-L., Liu, L.-L., &#38; Yao, J.-C. (2021). New strong convergence
    method for the sum of two maximal monotone operators. <i>Optimization and Engineering</i>.
    Springer Nature. <a href="https://doi.org/10.1007/s11081-020-09544-5">https://doi.org/10.1007/s11081-020-09544-5</a>
  chicago: Shehu, Yekini, Qiao-Li Dong, Lu-Lu Liu, and Jen-Chih Yao. “New Strong Convergence
    Method for the Sum of Two Maximal Monotone Operators.” <i>Optimization and Engineering</i>.
    Springer Nature, 2021. <a href="https://doi.org/10.1007/s11081-020-09544-5">https://doi.org/10.1007/s11081-020-09544-5</a>.
  ieee: Y. Shehu, Q.-L. Dong, L.-L. Liu, and J.-C. Yao, “New strong convergence method
    for the sum of two maximal monotone operators,” <i>Optimization and Engineering</i>,
    vol. 22. Springer Nature, pp. 2627–2653, 2021.
  ista: Shehu Y, Dong Q-L, Liu L-L, Yao J-C. 2021. New strong convergence method for
    the sum of two maximal monotone operators. Optimization and Engineering. 22, 2627–2653.
  mla: Shehu, Yekini, et al. “New Strong Convergence Method for the Sum of Two Maximal
    Monotone Operators.” <i>Optimization and Engineering</i>, vol. 22, Springer Nature,
    2021, pp. 2627–53, doi:<a href="https://doi.org/10.1007/s11081-020-09544-5">10.1007/s11081-020-09544-5</a>.
  short: Y. Shehu, Q.-L. Dong, L.-L. Liu, J.-C. Yao, Optimization and Engineering
    22 (2021) 2627–2653.
date_created: 2020-08-03T14:29:57Z
date_published: 2021-02-25T00:00:00Z
date_updated: 2024-03-07T14:39:29Z
day: '25'
ddc:
- '510'
department:
- _id: VlKo
doi: 10.1007/s11081-020-09544-5
ec_funded: 1
external_id:
  isi:
  - '000559345400001'
file:
- access_level: open_access
  content_type: application/pdf
  creator: dernst
  date_created: 2020-08-03T15:24:39Z
  date_updated: 2020-08-03T15:24:39Z
  file_id: '8197'
  file_name: 2020_OptimizationEngineering_Shehu.pdf
  file_size: 2137860
  relation: main_file
  success: 1
file_date_updated: 2020-08-03T15:24:39Z
has_accepted_license: '1'
intvolume: '        22'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 2627-2653
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Optimization and Engineering
publication_identifier:
  eissn:
  - 1573-2924
  issn:
  - 1389-4420
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: New strong convergence method for the sum of two maximal monotone operators
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2021'
...
---
_id: '14800'
abstract:
- lang: eng
  text: 'Research on two-dimensional (2D) materials has been explosively increasing
    in last seventeen years in varying subjects including condensed matter physics,
    electronic engineering, materials science, and chemistry since the mechanical
    exfoliation of graphene in 2004. Starting from graphene, 2D materials now have
    become a big family with numerous members and diverse categories. The unique structural
    features and physicochemical properties of 2D materials make them one class of
    the most appealing candidates for a wide range of potential applications. In particular,
    we have seen some major breakthroughs made in the field of 2D materials in last
    five years not only in developing novel synthetic methods and exploring new structures/properties
    but also in identifying innovative applications and pushing forward commercialisation.
    In this review, we provide a critical summary on the recent progress made in the
    field of 2D materials with a particular focus on last five years. After a brief
    background introduction, we first discuss the major synthetic methods for 2D materials,
    including the mechanical exfoliation, liquid exfoliation, vapor phase deposition,
    and wet-chemical synthesis as well as phase engineering of 2D materials belonging
    to the field of phase engineering of nanomaterials (PEN). We then introduce the
    superconducting/optical/magnetic properties and chirality of 2D materials along
    with newly emerging magic angle 2D superlattices. Following that, the promising
    applications of 2D materials in electronics, optoelectronics, catalysis, energy
    storage, solar cells, biomedicine, sensors, environments, etc. are described sequentially.
    Thereafter, we present the theoretic calculations and simulations of 2D materials.
    Finally, after concluding the current progress, we provide some personal discussions
    on the existing challenges and future outlooks in this rapidly developing field. '
article_number: '2108017'
article_processing_charge: No
article_type: review
author:
- first_name: Cheng
  full_name: Chang, Cheng
  id: 9E331C2E-9F27-11E9-AE48-5033E6697425
  last_name: Chang
  orcid: 0000-0002-9515-4277
- first_name: Wei
  full_name: Chen, Wei
  last_name: Chen
- first_name: Ye
  full_name: Chen, Ye
  last_name: Chen
- first_name: Yonghua
  full_name: Chen, Yonghua
  last_name: Chen
- first_name: Yu
  full_name: Chen, Yu
  last_name: Chen
- first_name: Feng
  full_name: Ding, Feng
  last_name: Ding
- first_name: Chunhai
  full_name: Fan, Chunhai
  last_name: Fan
- first_name: Hong Jin
  full_name: Fan, Hong Jin
  last_name: Fan
- first_name: Zhanxi
  full_name: Fan, Zhanxi
  last_name: Fan
- first_name: Cheng
  full_name: Gong, Cheng
  last_name: Gong
- first_name: Yongji
  full_name: Gong, Yongji
  last_name: Gong
- first_name: Qiyuan
  full_name: He, Qiyuan
  last_name: He
- first_name: Xun
  full_name: Hong, Xun
  last_name: Hong
- first_name: Sheng
  full_name: Hu, Sheng
  last_name: Hu
- first_name: Weida
  full_name: Hu, Weida
  last_name: Hu
- first_name: Wei
  full_name: Huang, Wei
  last_name: Huang
- first_name: Yuan
  full_name: Huang, Yuan
  last_name: Huang
- first_name: Wei
  full_name: Ji, Wei
  last_name: Ji
- first_name: Dehui
  full_name: Li, Dehui
  last_name: Li
- first_name: Lain Jong
  full_name: Li, Lain Jong
  last_name: Li
- first_name: Qiang
  full_name: Li, Qiang
  last_name: Li
- first_name: Li
  full_name: Lin, Li
  last_name: Lin
- first_name: Chongyi
  full_name: Ling, Chongyi
  last_name: Ling
- first_name: Minghua
  full_name: Liu, Minghua
  last_name: Liu
- first_name: 'Nan'
  full_name: Liu, Nan
  last_name: Liu
- first_name: Zhuang
  full_name: Liu, Zhuang
  last_name: Liu
- first_name: Kian Ping
  full_name: Loh, Kian Ping
  last_name: Loh
- first_name: Jianmin
  full_name: Ma, Jianmin
  last_name: Ma
- first_name: Feng
  full_name: Miao, Feng
  last_name: Miao
- first_name: Hailin
  full_name: Peng, Hailin
  last_name: Peng
- first_name: Mingfei
  full_name: Shao, Mingfei
  last_name: Shao
- first_name: Li
  full_name: Song, Li
  last_name: Song
- first_name: Shao
  full_name: Su, Shao
  last_name: Su
- first_name: Shuo
  full_name: Sun, Shuo
  last_name: Sun
- first_name: Chaoliang
  full_name: Tan, Chaoliang
  last_name: Tan
- first_name: Zhiyong
  full_name: Tang, Zhiyong
  last_name: Tang
- first_name: Dingsheng
  full_name: Wang, Dingsheng
  last_name: Wang
- first_name: Huan
  full_name: Wang, Huan
  last_name: Wang
- first_name: Jinlan
  full_name: Wang, Jinlan
  last_name: Wang
- first_name: Xin
  full_name: Wang, Xin
  last_name: Wang
- first_name: Xinran
  full_name: Wang, Xinran
  last_name: Wang
- first_name: Andrew T.S.
  full_name: Wee, Andrew T.S.
  last_name: Wee
- first_name: Zhongming
  full_name: Wei, Zhongming
  last_name: Wei
- first_name: Yuen
  full_name: Wu, Yuen
  last_name: Wu
- first_name: Zhong Shuai
  full_name: Wu, Zhong Shuai
  last_name: Wu
- first_name: Jie
  full_name: Xiong, Jie
  last_name: Xiong
- first_name: Qihua
  full_name: Xiong, Qihua
  last_name: Xiong
- first_name: Weigao
  full_name: Xu, Weigao
  last_name: Xu
- first_name: Peng
  full_name: Yin, Peng
  last_name: Yin
- first_name: Haibo
  full_name: Zeng, Haibo
  last_name: Zeng
- first_name: Zhiyuan
  full_name: Zeng, Zhiyuan
  last_name: Zeng
- first_name: Tianyou
  full_name: Zhai, Tianyou
  last_name: Zhai
- first_name: Han
  full_name: Zhang, Han
  last_name: Zhang
- first_name: Hui
  full_name: Zhang, Hui
  last_name: Zhang
- first_name: Qichun
  full_name: Zhang, Qichun
  last_name: Zhang
- first_name: Tierui
  full_name: Zhang, Tierui
  last_name: Zhang
- first_name: Xiang
  full_name: Zhang, Xiang
  last_name: Zhang
- first_name: Li Dong
  full_name: Zhao, Li Dong
  last_name: Zhao
- first_name: Meiting
  full_name: Zhao, Meiting
  last_name: Zhao
- first_name: Weijie
  full_name: Zhao, Weijie
  last_name: Zhao
- first_name: Yunxuan
  full_name: Zhao, Yunxuan
  last_name: Zhao
- first_name: Kai Ge
  full_name: Zhou, Kai Ge
  last_name: Zhou
- first_name: Xing
  full_name: Zhou, Xing
  last_name: Zhou
- first_name: Yu
  full_name: Zhou, Yu
  last_name: Zhou
- first_name: Hongwei
  full_name: Zhu, Hongwei
  last_name: Zhu
- first_name: Hua
  full_name: Zhang, Hua
  last_name: Zhang
- first_name: Zhongfan
  full_name: Liu, Zhongfan
  last_name: Liu
citation:
  ama: Chang C, Chen W, Chen Y, et al. Recent progress on two-dimensional materials.
    <i>Acta Physico-Chimica Sinica</i>. 2021;37(12). doi:<a href="https://doi.org/10.3866/PKU.WHXB202108017">10.3866/PKU.WHXB202108017</a>
  apa: Chang, C., Chen, W., Chen, Y., Chen, Y., Chen, Y., Ding, F., … Liu, Z. (2021).
    Recent progress on two-dimensional materials. <i>Acta Physico-Chimica Sinica</i>.
    Peking University. <a href="https://doi.org/10.3866/PKU.WHXB202108017">https://doi.org/10.3866/PKU.WHXB202108017</a>
  chicago: Chang, Cheng, Wei Chen, Ye Chen, Yonghua Chen, Yu Chen, Feng Ding, Chunhai
    Fan, et al. “Recent Progress on Two-Dimensional Materials.” <i>Acta Physico-Chimica
    Sinica</i>. Peking University, 2021. <a href="https://doi.org/10.3866/PKU.WHXB202108017">https://doi.org/10.3866/PKU.WHXB202108017</a>.
  ieee: C. Chang <i>et al.</i>, “Recent progress on two-dimensional materials,” <i>Acta
    Physico-Chimica Sinica</i>, vol. 37, no. 12. Peking University, 2021.
  ista: Chang C, Chen W, Chen Y, Chen Y, Chen Y, Ding F, Fan C, Fan HJ, Fan Z, Gong
    C, Gong Y, He Q, Hong X, Hu S, Hu W, Huang W, Huang Y, Ji W, Li D, Li LJ, Li Q,
    Lin L, Ling C, Liu M, Liu N, Liu Z, Loh KP, Ma J, Miao F, Peng H, Shao M, Song
    L, Su S, Sun S, Tan C, Tang Z, Wang D, Wang H, Wang J, Wang X, Wang X, Wee ATS,
    Wei Z, Wu Y, Wu ZS, Xiong J, Xiong Q, Xu W, Yin P, Zeng H, Zeng Z, Zhai T, Zhang
    H, Zhang H, Zhang Q, Zhang T, Zhang X, Zhao LD, Zhao M, Zhao W, Zhao Y, Zhou KG,
    Zhou X, Zhou Y, Zhu H, Zhang H, Liu Z. 2021. Recent progress on two-dimensional
    materials. Acta Physico-Chimica Sinica. 37(12), 2108017.
  mla: Chang, Cheng, et al. “Recent Progress on Two-Dimensional Materials.” <i>Acta
    Physico-Chimica Sinica</i>, vol. 37, no. 12, 2108017, Peking University, 2021,
    doi:<a href="https://doi.org/10.3866/PKU.WHXB202108017">10.3866/PKU.WHXB202108017</a>.
  short: C. Chang, W. Chen, Y. Chen, Y. Chen, Y. Chen, F. Ding, C. Fan, H.J. Fan,
    Z. Fan, C. Gong, Y. Gong, Q. He, X. Hong, S. Hu, W. Hu, W. Huang, Y. Huang, W.
    Ji, D. Li, L.J. Li, Q. Li, L. Lin, C. Ling, M. Liu, N. Liu, Z. Liu, K.P. Loh,
    J. Ma, F. Miao, H. Peng, M. Shao, L. Song, S. Su, S. Sun, C. Tan, Z. Tang, D.
    Wang, H. Wang, J. Wang, X. Wang, X. Wang, A.T.S. Wee, Z. Wei, Y. Wu, Z.S. Wu,
    J. Xiong, Q. Xiong, W. Xu, P. Yin, H. Zeng, Z. Zeng, T. Zhai, H. Zhang, H. Zhang,
    Q. Zhang, T. Zhang, X. Zhang, L.D. Zhao, M. Zhao, W. Zhao, Y. Zhao, K.G. Zhou,
    X. Zhou, Y. Zhou, H. Zhu, H. Zhang, Z. Liu, Acta Physico-Chimica Sinica 37 (2021).
date_created: 2024-01-14T23:00:58Z
date_published: 2021-10-13T00:00:00Z
date_updated: 2024-01-17T11:29:33Z
day: '13'
department:
- _id: MaIb
doi: 10.3866/PKU.WHXB202108017
intvolume: '        37'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.3866/PKU.WHXB202108017
month: '10'
oa: 1
oa_version: Submitted Version
publication: Acta Physico-Chimica Sinica
publication_identifier:
  issn:
  - 1001-4861
publication_status: published
publisher: Peking University
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recent progress on two-dimensional materials
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2021'
...
---
_id: '14889'
abstract:
- lang: eng
  text: We consider the Fröhlich Hamiltonian with large coupling constant α. For initial
    data of Pekar product form with coherent phonon field and with the electron minimizing
    the corresponding energy, we provide a norm approximation of the evolution, valid
    up to times of order α2. The approximation is given in terms of a Pekar product
    state, evolved through the Landau-Pekar equations, corrected by a Bogoliubov dynamics
    taking quantum fluctuations into account. This allows us to show that the Landau-Pekar
    equations approximately describe the evolution of the electron- and one-phonon
    reduced density matrices under the Fröhlich dynamics up to times of order α2.
acknowledgement: "Financial support by the European Union’s Horizon 2020 research
  and innovation programme\r\nunder the Marie Skłodowska-Curie grant agreement No.
  754411 (S.R.) and the European\r\nResearch Council under grant agreement No. 694227
  (N.L. and R.S.), as well as by the SNSF\r\nEccellenza project PCEFP2 181153 (N.L.),
  the NCCR SwissMAP (N.L. and B.S.) and by the\r\nDeutsche Forschungsgemeinschaft
  (DFG) through the Research Training Group 1838: Spectral\r\nTheory and Dynamics
  of Quantum Systems (D.M.) is gratefully acknowledged. B.S. gratefully\r\nacknowledges
  financial support from the Swiss National Science Foundation through the Grant\r\n“Dynamical
  and energetic properties of Bose-Einstein condensates” and from the European\r\nResearch
  Council through the ERC-AdG CLaQS (grant agreement No 834782). D.M. thanks\r\nMarcel
  Griesemer for helpful discussions."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nikolai K
  full_name: Leopold, Nikolai K
  id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
  last_name: Leopold
  orcid: 0000-0002-0495-6822
- first_name: David Johannes
  full_name: Mitrouskas, David Johannes
  id: cbddacee-2b11-11eb-a02e-a2e14d04e52d
  last_name: Mitrouskas
- first_name: Simone Anna Elvira
  full_name: Rademacher, Simone Anna Elvira
  id: 856966FE-A408-11E9-977E-802DE6697425
  last_name: Rademacher
  orcid: 0000-0001-5059-4466
- first_name: Benjamin
  full_name: Schlein, Benjamin
  last_name: Schlein
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Leopold NK, Mitrouskas DJ, Rademacher SAE, Schlein B, Seiringer R. Landau–Pekar
    equations and quantum fluctuations for the dynamics of a strongly coupled polaron.
    <i>Pure and Applied Analysis</i>. 2021;3(4):653-676. doi:<a href="https://doi.org/10.2140/paa.2021.3.653">10.2140/paa.2021.3.653</a>
  apa: Leopold, N. K., Mitrouskas, D. J., Rademacher, S. A. E., Schlein, B., &#38;
    Seiringer, R. (2021). Landau–Pekar equations and quantum fluctuations for the
    dynamics of a strongly coupled polaron. <i>Pure and Applied Analysis</i>. Mathematical
    Sciences Publishers. <a href="https://doi.org/10.2140/paa.2021.3.653">https://doi.org/10.2140/paa.2021.3.653</a>
  chicago: Leopold, Nikolai K, David Johannes Mitrouskas, Simone Anna Elvira Rademacher,
    Benjamin Schlein, and Robert Seiringer. “Landau–Pekar Equations and Quantum Fluctuations
    for the Dynamics of a Strongly Coupled Polaron.” <i>Pure and Applied Analysis</i>.
    Mathematical Sciences Publishers, 2021. <a href="https://doi.org/10.2140/paa.2021.3.653">https://doi.org/10.2140/paa.2021.3.653</a>.
  ieee: N. K. Leopold, D. J. Mitrouskas, S. A. E. Rademacher, B. Schlein, and R. Seiringer,
    “Landau–Pekar equations and quantum fluctuations for the dynamics of a strongly
    coupled polaron,” <i>Pure and Applied Analysis</i>, vol. 3, no. 4. Mathematical
    Sciences Publishers, pp. 653–676, 2021.
  ista: Leopold NK, Mitrouskas DJ, Rademacher SAE, Schlein B, Seiringer R. 2021. Landau–Pekar
    equations and quantum fluctuations for the dynamics of a strongly coupled polaron.
    Pure and Applied Analysis. 3(4), 653–676.
  mla: Leopold, Nikolai K., et al. “Landau–Pekar Equations and Quantum Fluctuations
    for the Dynamics of a Strongly Coupled Polaron.” <i>Pure and Applied Analysis</i>,
    vol. 3, no. 4, Mathematical Sciences Publishers, 2021, pp. 653–76, doi:<a href="https://doi.org/10.2140/paa.2021.3.653">10.2140/paa.2021.3.653</a>.
  short: N.K. Leopold, D.J. Mitrouskas, S.A.E. Rademacher, B. Schlein, R. Seiringer,
    Pure and Applied Analysis 3 (2021) 653–676.
date_created: 2024-01-28T23:01:43Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2024-02-05T10:02:45Z
day: '01'
department:
- _id: RoSe
doi: 10.2140/paa.2021.3.653
ec_funded: 1
external_id:
  arxiv:
  - '2005.02098'
intvolume: '         3'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2005.02098
month: '10'
oa: 1
oa_version: Preprint
page: 653-676
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '694227'
  name: Analysis of quantum many-body systems
publication: Pure and Applied Analysis
publication_identifier:
  eissn:
  - 2578-5885
  issn:
  - 2578-5893
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Landau–Pekar equations and quantum fluctuations for the dynamics of a strongly
  coupled polaron
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2021'
...
---
_id: '14890'
abstract:
- lang: eng
  text: We consider a system of N interacting bosons in the mean-field scaling regime
    and construct corrections to the Bogoliubov dynamics that approximate the true
    N-body dynamics in norm to arbitrary precision. The N-independent corrections
    are given in terms of the solutions of the Bogoliubov and Hartree equations and
    satisfy a generalized form of Wick's theorem. We determine the n-point correlation
    functions of the excitations around the condensate, as well as the reduced densities
    of the N-body system, to arbitrary accuracy, given only the knowledge of the two-point
    functions of a quasi-free state and the solution of the Hartree equation. In this
    way, the complex problem of computing all n-point correlation functions for an
    interacting N-body system is essentially reduced to the problem of solving the
    Hartree equation and the PDEs for the Bogoliubov two-point functions.
acknowledgement: "We are grateful for the hospitality of Central China Normal University
  (CCNU),\r\nwhere parts of this work were done, and thank Phan Th`anh Nam, Simone\r\nRademacher,
  Robert Seiringer and Stefan Teufel for helpful discussions. L.B. gratefully acknowledges
  the support by the German Research Foundation (DFG) within the Research\r\nTraining
  Group 1838 “Spectral Theory and Dynamics of Quantum Systems”, and the funding\r\nfrom
  the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk
  lodowska-Curie Grant Agreement No. 754411."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Lea
  full_name: Bossmann, Lea
  id: A2E3BCBE-5FCC-11E9-AA4B-76F3E5697425
  last_name: Bossmann
  orcid: 0000-0002-6854-1343
- first_name: Sören P
  full_name: Petrat, Sören P
  id: 40AC02DC-F248-11E8-B48F-1D18A9856A87
  last_name: Petrat
  orcid: 0000-0002-9166-5889
- first_name: Peter
  full_name: Pickl, Peter
  last_name: Pickl
- first_name: Avy
  full_name: Soffer, Avy
  last_name: Soffer
citation:
  ama: Bossmann L, Petrat SP, Pickl P, Soffer A. Beyond Bogoliubov dynamics. <i>Pure
    and Applied Analysis</i>. 2021;3(4):677-726. doi:<a href="https://doi.org/10.2140/paa.2021.3.677">10.2140/paa.2021.3.677</a>
  apa: Bossmann, L., Petrat, S. P., Pickl, P., &#38; Soffer, A. (2021). Beyond Bogoliubov
    dynamics. <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers.
    <a href="https://doi.org/10.2140/paa.2021.3.677">https://doi.org/10.2140/paa.2021.3.677</a>
  chicago: Bossmann, Lea, Sören P Petrat, Peter Pickl, and Avy Soffer. “Beyond Bogoliubov
    Dynamics.” <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers,
    2021. <a href="https://doi.org/10.2140/paa.2021.3.677">https://doi.org/10.2140/paa.2021.3.677</a>.
  ieee: L. Bossmann, S. P. Petrat, P. Pickl, and A. Soffer, “Beyond Bogoliubov dynamics,”
    <i>Pure and Applied Analysis</i>, vol. 3, no. 4. Mathematical Sciences Publishers,
    pp. 677–726, 2021.
  ista: Bossmann L, Petrat SP, Pickl P, Soffer A. 2021. Beyond Bogoliubov dynamics.
    Pure and Applied Analysis. 3(4), 677–726.
  mla: Bossmann, Lea, et al. “Beyond Bogoliubov Dynamics.” <i>Pure and Applied Analysis</i>,
    vol. 3, no. 4, Mathematical Sciences Publishers, 2021, pp. 677–726, doi:<a href="https://doi.org/10.2140/paa.2021.3.677">10.2140/paa.2021.3.677</a>.
  short: L. Bossmann, S.P. Petrat, P. Pickl, A. Soffer, Pure and Applied Analysis
    3 (2021) 677–726.
date_created: 2024-01-28T23:01:43Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2024-02-05T09:26:31Z
day: '01'
department:
- _id: RoSe
doi: 10.2140/paa.2021.3.677
ec_funded: 1
external_id:
  arxiv:
  - '1912.11004'
intvolume: '         3'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1912.11004
month: '10'
oa: 1
oa_version: Preprint
page: 677-726
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: Pure and Applied Analysis
publication_identifier:
  eissn:
  - 2578-5885
  issn:
  - 2578-5893
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Beyond Bogoliubov dynamics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2021'
...
---
_id: '14984'
abstract:
- lang: eng
  text: Hybrid zones are narrow geographic regions where different populations, races
    or interbreeding species meet and mate, producing mixed ‘hybrid’ offspring. They
    are relatively common and can be found in a diverse range of organisms and environments.
    The study of hybrid zones has played an important role in our understanding of
    the origin of species, with hybrid zones having been described as ‘natural laboratories’.
    This is because they allow us to study,in situ, the conditions and evolutionary
    forces that enable divergent taxa to remain distinct despite some ongoing gene
    exchange between them.
article_processing_charge: No
author:
- first_name: Sean
  full_name: Stankowski, Sean
  id: 43161670-5719-11EA-8025-FABC3DDC885E
  last_name: Stankowski
- first_name: Daria
  full_name: Shipilina, Daria
  id: 428A94B0-F248-11E8-B48F-1D18A9856A87
  last_name: Shipilina
  orcid: 0000-0002-1145-9226
- first_name: Anja M
  full_name: Westram, Anja M
  id: 3C147470-F248-11E8-B48F-1D18A9856A87
  last_name: Westram
  orcid: 0000-0003-1050-4969
citation:
  ama: 'Stankowski S, Shipilina D, Westram AM. Hybrid Zones. In: <i>Encyclopedia of
    Life Sciences</i>. Vol 2. eLS. Wiley; 2021. doi:<a href="https://doi.org/10.1002/9780470015902.a0029355">10.1002/9780470015902.a0029355</a>'
  apa: Stankowski, S., Shipilina, D., &#38; Westram, A. M. (2021). Hybrid Zones. In
    <i>Encyclopedia of Life Sciences</i> (Vol. 2). Wiley. <a href="https://doi.org/10.1002/9780470015902.a0029355">https://doi.org/10.1002/9780470015902.a0029355</a>
  chicago: Stankowski, Sean, Daria Shipilina, and Anja M Westram. “Hybrid Zones.”
    In <i>Encyclopedia of Life Sciences</i>, Vol. 2. ELS. Wiley, 2021. <a href="https://doi.org/10.1002/9780470015902.a0029355">https://doi.org/10.1002/9780470015902.a0029355</a>.
  ieee: S. Stankowski, D. Shipilina, and A. M. Westram, “Hybrid Zones,” in <i>Encyclopedia
    of Life Sciences</i>, vol. 2, Wiley, 2021.
  ista: 'Stankowski S, Shipilina D, Westram AM. 2021.Hybrid Zones. In: Encyclopedia
    of Life Sciences. vol. 2.'
  mla: Stankowski, Sean, et al. “Hybrid Zones.” <i>Encyclopedia of Life Sciences</i>,
    vol. 2, Wiley, 2021, doi:<a href="https://doi.org/10.1002/9780470015902.a0029355">10.1002/9780470015902.a0029355</a>.
  short: S. Stankowski, D. Shipilina, A.M. Westram, in:, Encyclopedia of Life Sciences,
    Wiley, 2021.
date_created: 2024-02-14T12:05:50Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2024-02-19T09:54:18Z
day: '28'
department:
- _id: NiBa
doi: 10.1002/9780470015902.a0029355
intvolume: '         2'
language:
- iso: eng
month: '05'
oa_version: None
publication: Encyclopedia of Life Sciences
publication_identifier:
  eisbn:
  - '9780470015902'
  isbn:
  - '9780470016176'
publication_status: published
publisher: Wiley
quality_controlled: '1'
series_title: eLS
status: public
title: Hybrid Zones
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2021'
...
---
_id: '14987'
abstract:
- lang: eng
  text: "The goal of zero-shot learning is to construct a classifier that can identify
    object classes for which no training examples are available. When training data
    for some of the object classes is available but not for others, the name generalized
    zero-shot learning is commonly used.\r\nIn a wider sense, the phrase zero-shot
    is also used to describe other machine learning-based approaches that require
    no training data from the problem of interest, such as zero-shot action recognition
    or zero-shot machine translation."
article_processing_charge: No
author:
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: 'Lampert C. Zero-Shot Learning. In: Ikeuchi K, ed. <i>Computer Vision</i>.
    2nd ed. Cham: Springer; 2021:1395-1397. doi:<a href="https://doi.org/10.1007/978-3-030-63416-2_874">10.1007/978-3-030-63416-2_874</a>'
  apa: 'Lampert, C. (2021). Zero-Shot Learning. In K. Ikeuchi (Ed.), <i>Computer Vision</i>
    (2nd ed., pp. 1395–1397). Cham: Springer. <a href="https://doi.org/10.1007/978-3-030-63416-2_874">https://doi.org/10.1007/978-3-030-63416-2_874</a>'
  chicago: 'Lampert, Christoph. “Zero-Shot Learning.” In <i>Computer Vision</i>, edited
    by Katsushi Ikeuchi, 2nd ed., 1395–97. Cham: Springer, 2021. <a href="https://doi.org/10.1007/978-3-030-63416-2_874">https://doi.org/10.1007/978-3-030-63416-2_874</a>.'
  ieee: 'C. Lampert, “Zero-Shot Learning,” in <i>Computer Vision</i>, 2nd ed., K.
    Ikeuchi, Ed. Cham: Springer, 2021, pp. 1395–1397.'
  ista: 'Lampert C. 2021.Zero-Shot Learning. In: Computer Vision. , 1395–1397.'
  mla: Lampert, Christoph. “Zero-Shot Learning.” <i>Computer Vision</i>, edited by
    Katsushi Ikeuchi, 2nd ed., Springer, 2021, pp. 1395–97, doi:<a href="https://doi.org/10.1007/978-3-030-63416-2_874">10.1007/978-3-030-63416-2_874</a>.
  short: C. Lampert, in:, K. Ikeuchi (Ed.), Computer Vision, 2nd ed., Springer, Cham,
    2021, pp. 1395–1397.
date_created: 2024-02-14T14:05:32Z
date_published: 2021-10-13T00:00:00Z
date_updated: 2024-02-19T10:59:04Z
day: '13'
department:
- _id: ChLa
doi: 10.1007/978-3-030-63416-2_874
edition: '2'
editor:
- first_name: Katsushi
  full_name: Ikeuchi, Katsushi
  last_name: Ikeuchi
language:
- iso: eng
month: '10'
oa_version: None
page: 1395-1397
place: Cham
publication: Computer Vision
publication_identifier:
  eisbn:
  - '9783030634162'
  isbn:
  - '9783030634155'
publication_status: published
publisher: Springer
quality_controlled: '1'
status: public
title: Zero-Shot Learning
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '14988'
abstract:
- lang: eng
  text: Raw data generated from the publication - The TPLATE complex mediates membrane
    bending during plant clathrin-mediated endocytosis by Johnson et al., 2021 In
    PNAS
article_processing_charge: No
author:
- first_name: Alexander J
  full_name: Johnson, Alexander J
  id: 46A62C3A-F248-11E8-B48F-1D18A9856A87
  last_name: Johnson
  orcid: 0000-0002-2739-8843
citation:
  ama: Johnson AJ. Raw data from Johnson et al, PNAS, 2021. 2021. doi:<a href="https://doi.org/10.5281/ZENODO.5747100">10.5281/ZENODO.5747100</a>
  apa: Johnson, A. J. (2021). Raw data from Johnson et al, PNAS, 2021. Zenodo. <a
    href="https://doi.org/10.5281/ZENODO.5747100">https://doi.org/10.5281/ZENODO.5747100</a>
  chicago: Johnson, Alexander J. “Raw Data from Johnson et Al, PNAS, 2021.” Zenodo,
    2021. <a href="https://doi.org/10.5281/ZENODO.5747100">https://doi.org/10.5281/ZENODO.5747100</a>.
  ieee: A. J. Johnson, “Raw data from Johnson et al, PNAS, 2021.” Zenodo, 2021.
  ista: Johnson AJ. 2021. Raw data from Johnson et al, PNAS, 2021, Zenodo, <a href="https://doi.org/10.5281/ZENODO.5747100">10.5281/ZENODO.5747100</a>.
  mla: Johnson, Alexander J. <i>Raw Data from Johnson et Al, PNAS, 2021</i>. Zenodo,
    2021, doi:<a href="https://doi.org/10.5281/ZENODO.5747100">10.5281/ZENODO.5747100</a>.
  short: A.J. Johnson, (2021).
date_created: 2024-02-14T14:13:48Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2024-02-19T11:06:09Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.5281/ZENODO.5747100
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/zenodo.5747100
month: '12'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
  record:
  - id: '9887'
    relation: used_in_publication
    status: public
status: public
title: Raw data from Johnson et al, PNAS, 2021
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '15013'
abstract:
- lang: eng
  text: We consider random n×n matrices X with independent and centered entries and
    a general variance profile. We show that the spectral radius of X converges with
    very high probability to the square root of the spectral radius of the variance
    matrix of X when n tends to infinity. We also establish the optimal rate of convergence,
    that is a new result even for general i.i.d. matrices beyond the explicitly solvable
    Gaussian cases. The main ingredient is the proof of the local inhomogeneous circular
    law [arXiv:1612.07776] at the spectral edge.
acknowledgement: Partially supported by ERC Starting Grant RandMat No. 715539 and
  the SwissMap grant of Swiss National Science Foundation. Partially supported by
  ERC Advanced Grant RanMat No. 338804. Partially supported by the Hausdorff Center
  for Mathematics in Bonn.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Johannes
  full_name: Alt, Johannes
  id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
  last_name: Alt
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
- first_name: Torben H
  full_name: Krüger, Torben H
  id: 3020C786-F248-11E8-B48F-1D18A9856A87
  last_name: Krüger
  orcid: 0000-0002-4821-3297
citation:
  ama: Alt J, Erdös L, Krüger TH. Spectral radius of random matrices with independent
    entries. <i>Probability and Mathematical Physics</i>. 2021;2(2):221-280. doi:<a
    href="https://doi.org/10.2140/pmp.2021.2.221">10.2140/pmp.2021.2.221</a>
  apa: Alt, J., Erdös, L., &#38; Krüger, T. H. (2021). Spectral radius of random matrices
    with independent entries. <i>Probability and Mathematical Physics</i>. Mathematical
    Sciences Publishers. <a href="https://doi.org/10.2140/pmp.2021.2.221">https://doi.org/10.2140/pmp.2021.2.221</a>
  chicago: Alt, Johannes, László Erdös, and Torben H Krüger. “Spectral Radius of Random
    Matrices with Independent Entries.” <i>Probability and Mathematical Physics</i>.
    Mathematical Sciences Publishers, 2021. <a href="https://doi.org/10.2140/pmp.2021.2.221">https://doi.org/10.2140/pmp.2021.2.221</a>.
  ieee: J. Alt, L. Erdös, and T. H. Krüger, “Spectral radius of random matrices with
    independent entries,” <i>Probability and Mathematical Physics</i>, vol. 2, no.
    2. Mathematical Sciences Publishers, pp. 221–280, 2021.
  ista: Alt J, Erdös L, Krüger TH. 2021. Spectral radius of random matrices with independent
    entries. Probability and Mathematical Physics. 2(2), 221–280.
  mla: Alt, Johannes, et al. “Spectral Radius of Random Matrices with Independent
    Entries.” <i>Probability and Mathematical Physics</i>, vol. 2, no. 2, Mathematical
    Sciences Publishers, 2021, pp. 221–80, doi:<a href="https://doi.org/10.2140/pmp.2021.2.221">10.2140/pmp.2021.2.221</a>.
  short: J. Alt, L. Erdös, T.H. Krüger, Probability and Mathematical Physics 2 (2021)
    221–280.
date_created: 2024-02-18T23:01:03Z
date_published: 2021-05-21T00:00:00Z
date_updated: 2024-02-19T08:30:00Z
day: '21'
department:
- _id: LaEr
doi: 10.2140/pmp.2021.2.221
ec_funded: 1
external_id:
  arxiv:
  - '1907.13631'
intvolume: '         2'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1907.13631
month: '05'
oa: 1
oa_version: Preprint
page: 221-280
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '338804'
  name: Random matrices, universality and disordered quantum systems
publication: Probability and Mathematical Physics
publication_identifier:
  eissn:
  - 2690-1005
  issn:
  - 2690-0998
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spectral radius of random matrices with independent entries
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2021'
...
---
_id: '13455'
abstract:
- lang: eng
  text: The majority of massive stars live in binary or multiple systems and will
    interact with a companion during their lifetimes, which helps to explain the observed
    diversity of core-collapse supernovae. Donor stars in binary systems can lose
    most of their hydrogen-rich envelopes through mass transfer. As a result, not
    only are the surface properties affected, but so is the core structure. However,
    most calculations of the core-collapse properties of massive stars rely on single-star
    models. We present a systematic study of the difference between the pre-supernova
    structures of single stars and stars of the same initial mass (11–21 M⊙) that
    have been stripped due to stable post-main-sequence mass transfer at solar metallicity.
    We present the pre-supernova core composition with novel diagrams that give an
    intuitive representation of the isotope distribution. As shown in previous studies,
    at the edge of the carbon-oxygen core, the binary-stripped star models contain
    an extended gradient of carbon, oxygen, and neon. This layer remains until core
    collapse and is more extended in mass for higher initial stellar masses. It originates
    from the receding of the convective helium core during core helium burning in
    binary-stripped stars, which does not occur in single-star models. We find that
    this same evolutionary phase leads to systematic differences in the final density
    and nuclear energy generation profiles. Binary-stripped star models have systematically
    higher total masses of carbon at the moment of core collapse compared to single-star
    models, which likely results in systematically different supernova yields. In
    about half of our models, the silicon-burning and oxygen-rich layers merge after
    core silicon burning. We discuss the implications of our findings for the “explodability”,
    supernova observations, and nucleosynthesis of these stars. Our models are publicly
    available and can be readily used as input for detailed supernova simulations.
article_number: A58
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: E.
  full_name: Laplace, E.
  last_name: Laplace
- first_name: S.
  full_name: Justham, S.
  last_name: Justham
- first_name: M.
  full_name: Renzo, M.
  last_name: Renzo
- first_name: Ylva Louise Linsdotter
  full_name: Götberg, Ylva Louise Linsdotter
  id: d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d
  last_name: Götberg
  orcid: 0000-0002-6960-6911
- first_name: R.
  full_name: Farmer, R.
  last_name: Farmer
- first_name: D.
  full_name: Vartanyan, D.
  last_name: Vartanyan
- first_name: S. E.
  full_name: de Mink, S. E.
  last_name: de Mink
citation:
  ama: 'Laplace E, Justham S, Renzo M, et al. Different to the core: The pre-supernova
    structures of massive single and binary-stripped stars. <i>Astronomy &#38; Astrophysics</i>.
    2021;656. doi:<a href="https://doi.org/10.1051/0004-6361/202140506">10.1051/0004-6361/202140506</a>'
  apa: 'Laplace, E., Justham, S., Renzo, M., Götberg, Y. L. L., Farmer, R., Vartanyan,
    D., &#38; de Mink, S. E. (2021). Different to the core: The pre-supernova structures
    of massive single and binary-stripped stars. <i>Astronomy &#38; Astrophysics</i>.
    EDP Sciences. <a href="https://doi.org/10.1051/0004-6361/202140506">https://doi.org/10.1051/0004-6361/202140506</a>'
  chicago: 'Laplace, E., S. Justham, M. Renzo, Ylva Louise Linsdotter Götberg, R.
    Farmer, D. Vartanyan, and S. E. de Mink. “Different to the Core: The Pre-Supernova
    Structures of Massive Single and Binary-Stripped Stars.” <i>Astronomy &#38; Astrophysics</i>.
    EDP Sciences, 2021. <a href="https://doi.org/10.1051/0004-6361/202140506">https://doi.org/10.1051/0004-6361/202140506</a>.'
  ieee: 'E. Laplace <i>et al.</i>, “Different to the core: The pre-supernova structures
    of massive single and binary-stripped stars,” <i>Astronomy &#38; Astrophysics</i>,
    vol. 656. EDP Sciences, 2021.'
  ista: 'Laplace E, Justham S, Renzo M, Götberg YLL, Farmer R, Vartanyan D, de Mink
    SE. 2021. Different to the core: The pre-supernova structures of massive single
    and binary-stripped stars. Astronomy &#38; Astrophysics. 656, A58.'
  mla: 'Laplace, E., et al. “Different to the Core: The Pre-Supernova Structures of
    Massive Single and Binary-Stripped Stars.” <i>Astronomy &#38; Astrophysics</i>,
    vol. 656, A58, EDP Sciences, 2021, doi:<a href="https://doi.org/10.1051/0004-6361/202140506">10.1051/0004-6361/202140506</a>.'
  short: E. Laplace, S. Justham, M. Renzo, Y.L.L. Götberg, R. Farmer, D. Vartanyan,
    S.E. de Mink, Astronomy &#38; Astrophysics 656 (2021).
date_created: 2023-08-03T10:11:09Z
date_published: 2021-12-02T00:00:00Z
date_updated: 2023-08-21T11:49:15Z
day: '02'
doi: 10.1051/0004-6361/202140506
external_id:
  arxiv:
  - '2102.05036'
intvolume: '       656'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1051/0004-6361/202140506
month: '12'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
  eissn:
  - 1432-0746
  issn:
  - 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Different to the core: The pre-supernova structures of massive single and
  binary-stripped stars'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 656
year: '2021'
...
---
_id: '14278'
abstract:
- lang: eng
  text: 'The Birkhoff conjecture says that the boundary of a strictly convex integrable
    billiard table is necessarily an ellipse. In this article, we consider a stronger
    notion of integrability, namely, integrability close to the boundary, and prove
    a local version of this conjecture: a small perturbation of almost every ellipse
    that preserves integrability near the boundary, is itself an ellipse. We apply
    this result to study local spectral rigidity of ellipses using the connection
    between the wave trace of the Laplacian and the dynamics near the boundary and
    establish rigidity for almost all of them.'
article_number: '2111.12171'
article_processing_charge: No
arxiv: 1
author:
- first_name: Illya
  full_name: Koval, Illya
  id: 2eed1f3b-896a-11ed-bdf8-93c7c4bf159e
  last_name: Koval
citation:
  ama: Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost
    every ellipse. <i>arXiv</i>. doi:<a href="https://doi.org/10.48550/ARXIV.2111.12171">10.48550/ARXIV.2111.12171</a>
  apa: Koval, I. (n.d.). Local strong Birkhoff conjecture and local spectral rigidity
    of almost every ellipse. <i>arXiv</i>. <a href="https://doi.org/10.48550/ARXIV.2111.12171">https://doi.org/10.48550/ARXIV.2111.12171</a>
  chicago: Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity
    of Almost Every Ellipse.” <i>ArXiv</i>, n.d. <a href="https://doi.org/10.48550/ARXIV.2111.12171">https://doi.org/10.48550/ARXIV.2111.12171</a>.
  ieee: I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of
    almost every ellipse,” <i>arXiv</i>. .
  ista: Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost
    every ellipse. arXiv, 2111.12171.
  mla: Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity
    of Almost Every Ellipse.” <i>ArXiv</i>, 2111.12171, doi:<a href="https://doi.org/10.48550/ARXIV.2111.12171">10.48550/ARXIV.2111.12171</a>.
  short: I. Koval, ArXiv (n.d.).
date_created: 2023-09-06T08:35:43Z
date_published: 2021-11-23T00:00:00Z
date_updated: 2023-09-15T06:44:00Z
day: '23'
department:
- _id: GradSch
doi: 10.48550/ARXIV.2111.12171
external_id:
  arxiv:
  - '2111.12171'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2111.12171
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Local strong Birkhoff conjecture and local spectral rigidity of almost every
  ellipse
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10000'
abstract:
- lang: eng
  text: Inhibition or targeted deletion of histone deacetylase 3 (HDAC3) is neuroprotective
    in a variety neurodegenerative conditions, including retinal ganglion cells (RGCs)
    after acute optic nerve damage. Consistent with this, induced HDAC3 expression
    in cultured cells shows selective toxicity to neurons. Despite an established
    role for HDAC3 in neuronal pathology, little is known regarding the mechanism
    of this pathology.
acknowledgement: 'The authors thank Joel Dietz for maintaining the mice used in this
  study, Satoshi Kinoshita and the Translational Research Initiative in Pathology
  Laboratory at the University of Wisconsin-Madison for cutting retinal sections analyzed
  in this study, and Mark Banghart for statistical review of the data analysis. Supported
  by National Eye Institute Grants R01 EY012223 (RWN), R01 EY030123 (RWN), R01 EY029809
  (LWG), R01 EY029809 (LWG) and a Vision Research CORE grant P30 EY016665, NRSA grant
  T32 GM081061, by an unrestricted research grant from Research to Prevent Blindness,
  Inc., and by a University of Wisconsin-Madison Vilas Life Cycle award and the Frederick
  A. Davis Research Chair (RWN). '
article_number: '14'
article_processing_charge: Yes
article_type: original
author:
- first_name: Heather M.
  full_name: Schmitt, Heather M.
  last_name: Schmitt
- first_name: Rachel L.
  full_name: Fehrman, Rachel L.
  last_name: Fehrman
- first_name: Margaret E
  full_name: Maes, Margaret E
  id: 3838F452-F248-11E8-B48F-1D18A9856A87
  last_name: Maes
  orcid: 0000-0001-9642-1085
- first_name: Huan
  full_name: Yang, Huan
  last_name: Yang
- first_name: Lian Wang
  full_name: Guo, Lian Wang
  last_name: Guo
- first_name: Cassandra L.
  full_name: Schlamp, Cassandra L.
  last_name: Schlamp
- first_name: Heather R.
  full_name: Pelzel, Heather R.
  last_name: Pelzel
- first_name: Robert W.
  full_name: Nickells, Robert W.
  last_name: Nickells
citation:
  ama: Schmitt HM, Fehrman RL, Maes ME, et al. Increased susceptibility and intrinsic
    apoptotic signaling in neurons by induced HDAC3 expression. <i>Investigative Ophthalmology
    and Visual Science</i>. 2021;62(10). doi:<a href="https://doi.org/10.1167/IOVS.62.10.14">10.1167/IOVS.62.10.14</a>
  apa: Schmitt, H. M., Fehrman, R. L., Maes, M. E., Yang, H., Guo, L. W., Schlamp,
    C. L., … Nickells, R. W. (2021). Increased susceptibility and intrinsic apoptotic
    signaling in neurons by induced HDAC3 expression. <i>Investigative Ophthalmology
    and Visual Science</i>. Association for Research in Vision and Ophthalmology.
    <a href="https://doi.org/10.1167/IOVS.62.10.14">https://doi.org/10.1167/IOVS.62.10.14</a>
  chicago: Schmitt, Heather M., Rachel L. Fehrman, Margaret E Maes, Huan Yang, Lian
    Wang Guo, Cassandra L. Schlamp, Heather R. Pelzel, and Robert W. Nickells. “Increased
    Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.”
    <i>Investigative Ophthalmology and Visual Science</i>. Association for Research
    in Vision and Ophthalmology, 2021. <a href="https://doi.org/10.1167/IOVS.62.10.14">https://doi.org/10.1167/IOVS.62.10.14</a>.
  ieee: H. M. Schmitt <i>et al.</i>, “Increased susceptibility and intrinsic apoptotic
    signaling in neurons by induced HDAC3 expression,” <i>Investigative Ophthalmology
    and Visual Science</i>, vol. 62, no. 10. Association for Research in Vision and
    Ophthalmology, 2021.
  ista: Schmitt HM, Fehrman RL, Maes ME, Yang H, Guo LW, Schlamp CL, Pelzel HR, Nickells
    RW. 2021. Increased susceptibility and intrinsic apoptotic signaling in neurons
    by induced HDAC3 expression. Investigative Ophthalmology and Visual Science. 62(10),
    14.
  mla: Schmitt, Heather M., et al. “Increased Susceptibility and Intrinsic Apoptotic
    Signaling in Neurons by Induced HDAC3 Expression.” <i>Investigative Ophthalmology
    and Visual Science</i>, vol. 62, no. 10, 14, Association for Research in Vision
    and Ophthalmology, 2021, doi:<a href="https://doi.org/10.1167/IOVS.62.10.14">10.1167/IOVS.62.10.14</a>.
  short: H.M. Schmitt, R.L. Fehrman, M.E. Maes, H. Yang, L.W. Guo, C.L. Schlamp, H.R.
    Pelzel, R.W. Nickells, Investigative Ophthalmology and Visual Science 62 (2021).
date_created: 2021-09-12T22:01:23Z
date_published: 2021-08-16T00:00:00Z
date_updated: 2023-08-14T06:35:17Z
day: '16'
ddc:
- '570'
department:
- _id: SaSi
doi: 10.1167/IOVS.62.10.14
external_id:
  isi:
  - '000695230000014'
  pmid:
  - '34398198'
file:
- access_level: open_access
  checksum: c430967746f653aa1ae84ee617f62b73
  content_type: application/pdf
  creator: dernst
  date_created: 2022-05-13T07:40:15Z
  date_updated: 2022-05-13T07:40:15Z
  file_id: '11369'
  file_name: 2021_IOVS_Schmitt.pdf
  file_size: 19707796
  relation: main_file
  success: 1
file_date_updated: 2022-05-13T07:40:15Z
has_accepted_license: '1'
intvolume: '        62'
isi: 1
issue: '10'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: Investigative Ophthalmology and Visual Science
publication_identifier:
  eissn:
  - 1552-5783
  issn:
  - 0146-0404
publication_status: published
publisher: Association for Research in Vision and Ophthalmology
quality_controlled: '1'
scopus_import: '1'
status: public
title: Increased susceptibility and intrinsic apoptotic signaling in neurons by induced
  HDAC3 expression
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 62
year: '2021'
...
---
_id: '10002'
abstract:
- lang: eng
  text: 'We present a faster symbolic algorithm for the following central problem
    in probabilistic verification: Compute the maximal end-component (MEC) decomposition
    of Markov decision processes (MDPs). This problem generalizes the SCC decomposition
    problem of graphs and closed recurrent sets of Markov chains. The model of symbolic
    algorithms is widely used in formal verification and model-checking, where access
    to the input model is restricted to only symbolic operations (e.g., basic set
    operations and computation of one-step neighborhood). For an input MDP with  n  vertices
    and  m  edges, the classical symbolic algorithm from the 1990s for the MEC decomposition
    requires  O(n2)  symbolic operations and  O(1)  symbolic space. The only other
    symbolic algorithm for the MEC decomposition requires  O(nm−−√)  symbolic operations
    and  O(m−−√)  symbolic space. A main open question is whether the worst-case  O(n2)  bound
    for symbolic operations can be beaten. We present a symbolic algorithm that requires  O˜(n1.5)  symbolic
    operations and  O˜(n−−√)  symbolic space. Moreover, the parametrization of our
    algorithm provides a trade-off between symbolic operations and symbolic space:
    for all  0<ϵ≤1/2  the symbolic algorithm requires  O˜(n2−ϵ)  symbolic operations
    and  O˜(nϵ)  symbolic space ( O˜  hides poly-logarithmic factors). Using our techniques
    we present faster algorithms for computing the almost-sure winning regions of  ω
    -regular objectives for MDPs. We consider the canonical parity objectives for  ω
    -regular objectives, and for parity objectives with  d -priorities we present
    an algorithm that computes the almost-sure winning region with  O˜(n2−ϵ)  symbolic
    operations and  O˜(nϵ)  symbolic space, for all  0<ϵ≤1/2 .'
acknowledgement: The authors are grateful to the anonymous referees for their valuable
  comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF)
  through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF)
  NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For
  M. H. the research leading to these results has received funding from the European
  Research Council under the European Unions Seventh Framework Programme (FP/2007–2013)
  / ERC Grant Agreement no. 340506.
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Wolfgang
  full_name: Dvorak, Wolfgang
  last_name: Dvorak
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Alexander
  full_name: Svozil, Alexander
  last_name: Svozil
citation:
  ama: 'Chatterjee K, Dvorak W, Henzinger MH, Svozil A. Symbolic time and space tradeoffs
    for probabilistic verification. In: <i>Proceedings of the 36th Annual ACM/IEEE
    Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics
    Engineers; 2021:1-13. doi:<a href="https://doi.org/10.1109/LICS52264.2021.9470739">10.1109/LICS52264.2021.9470739</a>'
  apa: 'Chatterjee, K., Dvorak, W., Henzinger, M. H., &#38; Svozil, A. (2021). Symbolic
    time and space tradeoffs for probabilistic verification. In <i>Proceedings of
    the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 1–13).
    Rome, Italy: Institute of Electrical and Electronics Engineers. <a href="https://doi.org/10.1109/LICS52264.2021.9470739">https://doi.org/10.1109/LICS52264.2021.9470739</a>'
  chicago: Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander
    Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In
    <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>,
    1–13. Institute of Electrical and Electronics Engineers, 2021. <a href="https://doi.org/10.1109/LICS52264.2021.9470739">https://doi.org/10.1109/LICS52264.2021.9470739</a>.
  ieee: K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and
    space tradeoffs for probabilistic verification,” in <i>Proceedings of the 36th
    Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Rome, Italy, 2021,
    pp. 1–13.
  ista: 'Chatterjee K, Dvorak W, Henzinger MH, Svozil A. 2021. Symbolic time and space
    tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE
    Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science,
    1–13.'
  mla: Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic
    Verification.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in
    Computer Science</i>, Institute of Electrical and Electronics Engineers, 2021,
    pp. 1–13, doi:<a href="https://doi.org/10.1109/LICS52264.2021.9470739">10.1109/LICS52264.2021.9470739</a>.
  short: K. Chatterjee, W. Dvorak, M.H. Henzinger, A. Svozil, in:, Proceedings of
    the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of
    Electrical and Electronics Engineers, 2021, pp. 1–13.
conference:
  end_date: 2021-07-02
  location: Rome, Italy
  name: 'LICS: Symposium on Logic in Computer Science'
  start_date: 2021-06-29
date_created: 2021-09-12T22:01:24Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2025-07-14T09:10:07Z
day: '07'
department:
- _id: KrCh
doi: 10.1109/LICS52264.2021.9470739
ec_funded: 1
external_id:
  arxiv:
  - '2104.07466'
  isi:
  - '000947350400089'
isi: 1
keyword:
- Computer science
- Computational modeling
- Markov processes
- Probabilistic logic
- Formal verification
- Game Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2104.07466
month: '07'
oa: 1
oa_version: Preprint
page: 1-13
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11407
  name: Game Theory
- _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 36th Annual ACM/IEEE Symposium on Logic in Computer
  Science
publication_identifier:
  eisbn:
  - 978-1-6654-4895-6
  isbn:
  - 978-1-6654-4896-3
  issn:
  - 1043-6871
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic time and space tradeoffs for probabilistic verification
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '10004'
abstract:
- lang: eng
  text: 'Markov chains are the de facto finite-state model for stochastic dynamical
    systems, and Markov decision processes (MDPs) extend Markov chains by incorporating
    non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization
    criterion is the maximal expected total reward where the MDP stops after T steps,
    which can be computed by a simple dynamic programming algorithm. We consider a
    natural generalization of the problem where the stopping times can be chosen according
    to a probability distribution, such that the expected stopping time is T, to optimize
    the expected total reward. Quite surprisingly we establish inter-reducibility
    of the expected stopping-time problem for Markov chains with the Positivity problem
    (which is related to the well-known Skolem problem), for which establishing either
    decidability or undecidability would be a major breakthrough. Given the hardness
    of the exact problem, we consider the approximate version of the problem: we show
    that it can be solved in exponential time for Markov chains and in exponential
    space for MDPs.'
acknowledgement: We are grateful to the anonymous reviewers of LICS 2021 and of a
  previous version of this paper for insightful comments that helped improving the
  presentation. This research was partially supported by the grant ERC CoG 863818
  (ForM-SMArt).
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Laurent
  full_name: Doyen, Laurent
  last_name: Doyen
citation:
  ama: 'Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In:
    <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>.
    Institute of Electrical and Electronics Engineers; 2021:1-13. doi:<a href="https://doi.org/10.1109/LICS52264.2021.9470595">10.1109/LICS52264.2021.9470595</a>'
  apa: 'Chatterjee, K., &#38; Doyen, L. (2021). Stochastic processes with expected
    stopping time. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
    in Computer Science</i> (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics
    Engineers. <a href="https://doi.org/10.1109/LICS52264.2021.9470595">https://doi.org/10.1109/LICS52264.2021.9470595</a>'
  chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected
    Stopping Time.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
    in Computer Science</i>, 1–13. Institute of Electrical and Electronics Engineers,
    2021. <a href="https://doi.org/10.1109/LICS52264.2021.9470595">https://doi.org/10.1109/LICS52264.2021.9470595</a>.
  ieee: K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,”
    in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>,
    Rome, Italy, 2021, pp. 1–13.
  ista: 'Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping
    time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science.
    LICS: Symposium on Logic in Computer Science, 1–13.'
  mla: Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected
    Stopping Time.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
    in Computer Science</i>, Institute of Electrical and Electronics Engineers, 2021,
    pp. 1–13, doi:<a href="https://doi.org/10.1109/LICS52264.2021.9470595">10.1109/LICS52264.2021.9470595</a>.
  short: K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium
    on Logic in Computer Science, Institute of Electrical and Electronics Engineers,
    2021, pp. 1–13.
conference:
  end_date: 2021-07-02
  location: Rome, Italy
  name: 'LICS: Symposium on Logic in Computer Science'
  start_date: 2021-06-29
date_created: 2021-09-12T22:01:25Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2025-07-14T09:10:08Z
day: '07'
department:
- _id: KrCh
doi: 10.1109/LICS52264.2021.9470595
ec_funded: 1
external_id:
  arxiv:
  - '2104.07278'
  isi:
  - '000947350400036'
isi: 1
keyword:
- Computer science
- Heuristic algorithms
- Memory management
- Automata
- Markov processes
- Probability distribution
- Complexity theory
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2104.07278
month: '07'
oa: 1
oa_version: Preprint
page: 1-13
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 36th Annual ACM/IEEE Symposium on Logic in Computer
  Science
publication_identifier:
  eisbn:
  - 978-1-6654-4895-6
  isbn:
  - 978-1-6654-4896-3
  issn:
  - 1043-6871
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stochastic processes with expected stopping time
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '10005'
abstract:
- lang: eng
  text: We study systems of nonlinear partial differential equations of parabolic
    type, in which the elliptic operator is replaced by the first-order divergence
    operator acting on a flux function, which is related to the spatial gradient of
    the unknown through an additional implicit equation. This setting, broad enough
    in terms of applications, significantly expands the paradigm of nonlinear parabolic
    problems. Formulating four conditions concerning the form of the implicit equation,
    we first show that these conditions describe a maximal monotone p-coercive graph.
    We then establish the global-in-time and large-data existence of a (weak) solution
    and its uniqueness. To this end, we adopt and significantly generalize Minty’s
    method of monotone mappings. A unified theory, containing several novel tools,
    is developed in a way to be tractable from the point of view of numerical approximations.
acknowledgement: "M. Bulíček and J. Málek acknowledge the support of the project No.
  18-12719S financed by the Czech\r\nScience foundation (GAČR). E. Maringová acknowledges
  support from Charles University Research program \r\nUNCE/SCI/023, the grant SVV-2020-260583
  by the Ministry of Education, Youth and Sports, Czech Republic\r\nand from the Austrian
  Science Fund (FWF), grants P30000, W1245, and F65. M. Bulíček and J. Málek are\r\nmembers
  of the Nečas Center for Mathematical Modelling.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Miroslav
  full_name: Bulíček, Miroslav
  last_name: Bulíček
- first_name: Erika
  full_name: Maringová, Erika
  id: dbabca31-66eb-11eb-963a-fb9c22c880b4
  last_name: Maringová
- first_name: Josef
  full_name: Málek, Josef
  last_name: Málek
citation:
  ama: Bulíček M, Maringová E, Málek J. On nonlinear problems of parabolic type with
    implicit constitutive equations involving flux. <i>Mathematical Models and Methods
    in Applied Sciences</i>. 2021;31(09). doi:<a href="https://doi.org/10.1142/S0218202521500457">10.1142/S0218202521500457</a>
  apa: Bulíček, M., Maringová, E., &#38; Málek, J. (2021). On nonlinear problems of
    parabolic type with implicit constitutive equations involving flux. <i>Mathematical
    Models and Methods in Applied Sciences</i>. World Scientific. <a href="https://doi.org/10.1142/S0218202521500457">https://doi.org/10.1142/S0218202521500457</a>
  chicago: Bulíček, Miroslav, Erika Maringová, and Josef Málek. “On Nonlinear Problems
    of Parabolic Type with Implicit Constitutive Equations Involving Flux.” <i>Mathematical
    Models and Methods in Applied Sciences</i>. World Scientific, 2021. <a href="https://doi.org/10.1142/S0218202521500457">https://doi.org/10.1142/S0218202521500457</a>.
  ieee: M. Bulíček, E. Maringová, and J. Málek, “On nonlinear problems of parabolic
    type with implicit constitutive equations involving flux,” <i>Mathematical Models
    and Methods in Applied Sciences</i>, vol. 31, no. 09. World Scientific, 2021.
  ista: Bulíček M, Maringová E, Málek J. 2021. On nonlinear problems of parabolic
    type with implicit constitutive equations involving flux. Mathematical Models
    and Methods in Applied Sciences. 31(09).
  mla: Bulíček, Miroslav, et al. “On Nonlinear Problems of Parabolic Type with Implicit
    Constitutive Equations Involving Flux.” <i>Mathematical Models and Methods in
    Applied Sciences</i>, vol. 31, no. 09, World Scientific, 2021, doi:<a href="https://doi.org/10.1142/S0218202521500457">10.1142/S0218202521500457</a>.
  short: M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied
    Sciences 31 (2021).
date_created: 2021-09-12T22:01:25Z
date_published: 2021-08-25T00:00:00Z
date_updated: 2023-09-04T11:43:45Z
day: '25'
department:
- _id: JuFi
doi: 10.1142/S0218202521500457
external_id:
  arxiv:
  - '2009.06917'
  isi:
  - '000722222900004'
intvolume: '        31'
isi: 1
issue: '09'
keyword:
- Nonlinear parabolic systems
- implicit constitutive theory
- weak solutions
- existence
- uniqueness
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2009.06917
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
  grant_number: F6504
  name: Taming Complexity in Partial Differential Systems
publication: Mathematical Models and Methods in Applied Sciences
publication_identifier:
  eissn:
  - 1793-6314
  issn:
  - 0218-2025
publication_status: published
publisher: World Scientific
quality_controlled: '1'
scopus_import: '1'
status: public
title: On nonlinear problems of parabolic type with implicit constitutive equations
  involving flux
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2021'
...
---
_id: '10007'
abstract:
- lang: eng
  text: The present thesis is concerned with the derivation of weak-strong uniqueness
    principles for curvature driven interface evolution problems not satisfying a
    comparison principle. The specific examples being treated are two-phase Navier-Stokes
    flow with surface tension, modeling the evolution of two incompressible, viscous
    and immiscible fluids separated by a sharp interface, and multiphase mean curvature
    flow, which serves as an idealized model for the motion of grain boundaries in
    an annealing polycrystalline material. Our main results - obtained in joint works
    with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation
    of geometric singularities due to topology changes, the weak solution concept
    of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with
    surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial
    Differential Equations 55, 2016) to multiphase mean curvature flow (for networks
    in R^2 or double bubbles in R^3) represents the unique solution to these interface
    evolution problems within the class of classical solutions, respectively. To the
    best of the author's knowledge, for interface evolution problems not admitting
    a geometric comparison principle the derivation of a weak-strong uniqueness principle
    represented an open problem, so that the works contained in the present thesis
    constitute the first positive results in this direction. The key ingredient of
    our approach consists of the introduction of a novel concept of relative entropies
    for a class of curvature driven interface evolution problems, for which the associated
    energy contains an interfacial contribution being proportional to the surface
    area of the evolving (network of) interface(s). The interfacial part of the relative
    entropy gives sufficient control on the interface error between a weak and a classical
    solution, and its time evolution can be computed, at least in principle, for any
    energy dissipating weak solution concept. A resulting stability estimate for the
    relative entropy essentially entails the above mentioned weak-strong uniqueness
    principles. The present thesis contains a detailed introduction to our relative
    entropy approach, which in particular highlights potential applications to other
    problems in curvature driven interface evolution not treated in this thesis.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Sebastian
  full_name: Hensel, Sebastian
  id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
  last_name: Hensel
  orcid: 0000-0001-7252-8072
citation:
  ama: 'Hensel S. Curvature driven interface evolution: Uniqueness properties of weak
    solution concepts. 2021. doi:<a href="https://doi.org/10.15479/at:ista:10007">10.15479/at:ista:10007</a>'
  apa: 'Hensel, S. (2021). <i>Curvature driven interface evolution: Uniqueness properties
    of weak solution concepts</i>. Institute of Science and Technology Austria. <a
    href="https://doi.org/10.15479/at:ista:10007">https://doi.org/10.15479/at:ista:10007</a>'
  chicago: 'Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties
    of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021.
    <a href="https://doi.org/10.15479/at:ista:10007">https://doi.org/10.15479/at:ista:10007</a>.'
  ieee: 'S. Hensel, “Curvature driven interface evolution: Uniqueness properties of
    weak solution concepts,” Institute of Science and Technology Austria, 2021.'
  ista: 'Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties
    of weak solution concepts. Institute of Science and Technology Austria.'
  mla: 'Hensel, Sebastian. <i>Curvature Driven Interface Evolution: Uniqueness Properties
    of Weak Solution Concepts</i>. Institute of Science and Technology Austria, 2021,
    doi:<a href="https://doi.org/10.15479/at:ista:10007">10.15479/at:ista:10007</a>.'
  short: 'S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of
    Weak Solution Concepts, Institute of Science and Technology Austria, 2021.'
date_created: 2021-09-13T11:12:34Z
date_published: 2021-09-14T00:00:00Z
date_updated: 2023-09-07T13:30:45Z
day: '14'
ddc:
- '515'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JuFi
doi: 10.15479/at:ista:10007
ec_funded: 1
file:
- access_level: closed
  checksum: c8475faaf0b680b4971f638f1db16347
  content_type: application/x-zip-compressed
  creator: shensel
  date_created: 2021-09-13T11:03:24Z
  date_updated: 2021-09-15T14:37:30Z
  file_id: '10008'
  file_name: thesis_final_Hensel.zip
  file_size: 15022154
  relation: source_file
- access_level: open_access
  checksum: 1a609937aa5275452822f45f2da17f07
  content_type: application/pdf
  creator: shensel
  date_created: 2021-09-13T14:18:56Z
  date_updated: 2021-09-14T09:52:47Z
  file_id: '10014'
  file_name: thesis_final_Hensel.pdf
  file_size: 6583638
  relation: main_file
file_date_updated: 2021-09-15T14:37:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '300'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
  call_identifier: H2020
  grant_number: '948819'
  name: Bridging Scales in Random Materials
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '10012'
    relation: part_of_dissertation
    status: public
  - id: '10013'
    relation: part_of_dissertation
    status: public
  - id: '7489'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Julian L
  full_name: Fischer, Julian L
  id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
  last_name: Fischer
  orcid: 0000-0002-0479-558X
title: 'Curvature driven interface evolution: Uniqueness properties of weak solution
  concepts'
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10011'
abstract:
- lang: eng
  text: We propose a new weak solution concept for (two-phase) mean curvature flow
    which enjoys both (unconditional) existence and (weak-strong) uniqueness properties.
    These solutions are evolving varifolds, just as in Brakke's formulation, but are
    coupled to the phase volumes by a simple transport equation. First, we show that,
    in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461,
    (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold
    solution in our sense. Second, we prove that any calibrated flow in the sense
    of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean
    curvature flow - is unique in the class of our new varifold solutions. This is
    in sharp contrast to the case of Brakke flows, which a priori may disappear at
    any given time and are therefore fatally non-unique. Finally, we propose an extension
    of the solution concept to the multi-phase case which is at least guaranteed to
    satisfy a weak-strong uniqueness principle.
acknowledgement: This project has received funding from the European Research Council
  (ERC) under the European Union’s Horizon 2020 research and innovation programme
  (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG,
  German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.
  The content of this paper was developed and parts of it were written during a visit
  of the first author to the Hausdorff Center of Mathematics (HCM), University of
  Bonn. The hospitality and the support of HCM are gratefully acknowledged.
article_number: '2109.04233'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sebastian
  full_name: Hensel, Sebastian
  id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
  last_name: Hensel
  orcid: 0000-0001-7252-8072
- first_name: Tim
  full_name: Laux, Tim
  last_name: Laux
citation:
  ama: 'Hensel S, Laux T. A new varifold solution concept for mean curvature flow:
    Convergence of  the Allen-Cahn equation and weak-strong uniqueness. <i>arXiv</i>.
    doi:<a href="https://doi.org/10.48550/arXiv.2109.04233">10.48550/arXiv.2109.04233</a>'
  apa: 'Hensel, S., &#38; Laux, T. (n.d.). A new varifold solution concept for mean
    curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness.
    <i>arXiv</i>. <a href="https://doi.org/10.48550/arXiv.2109.04233">https://doi.org/10.48550/arXiv.2109.04233</a>'
  chicago: 'Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for
    Mean Curvature Flow: Convergence of  the Allen-Cahn Equation and Weak-Strong Uniqueness.”
    <i>ArXiv</i>, n.d. <a href="https://doi.org/10.48550/arXiv.2109.04233">https://doi.org/10.48550/arXiv.2109.04233</a>.'
  ieee: 'S. Hensel and T. Laux, “A new varifold solution concept for mean curvature
    flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness,” <i>arXiv</i>.
    .'
  ista: 'Hensel S, Laux T. A new varifold solution concept for mean curvature flow:
    Convergence of  the Allen-Cahn equation and weak-strong uniqueness. arXiv, 2109.04233.'
  mla: 'Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean
    Curvature Flow: Convergence of  the Allen-Cahn Equation and Weak-Strong Uniqueness.”
    <i>ArXiv</i>, 2109.04233, doi:<a href="https://doi.org/10.48550/arXiv.2109.04233">10.48550/arXiv.2109.04233</a>.'
  short: S. Hensel, T. Laux, ArXiv (n.d.).
date_created: 2021-09-13T12:17:10Z
date_published: 2021-09-09T00:00:00Z
date_updated: 2023-05-03T10:34:38Z
day: '09'
department:
- _id: JuFi
doi: 10.48550/arXiv.2109.04233
ec_funded: 1
external_id:
  arxiv:
  - '2109.04233'
keyword:
- Mean curvature flow
- gradient flows
- varifolds
- weak solutions
- weak-strong uniqueness
- calibrated geometry
- gradient-flow calibrations
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2109.04233
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
  call_identifier: H2020
  grant_number: '948819'
  name: Bridging Scales in Random Materials
publication: arXiv
publication_status: submitted
status: public
title: 'A new varifold solution concept for mean curvature flow: Convergence of  the
  Allen-Cahn equation and weak-strong uniqueness'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
