---
_id: '11733'
abstract:
- lang: eng
text: Genetically informed, deep-phenotyped biobanks are an important research resource
and it is imperative that the most powerful, versatile, and efficient analysis
approaches are used. Here, we apply our recently developed Bayesian grouped mixture
of regressions model (GMRM) in the UK and Estonian Biobanks and obtain the highest
genomic prediction accuracy reported to date across 21 heritable traits. When
compared to other approaches, GMRM accuracy was greater than annotation prediction
models run in the LDAK or LDPred-funct software by 15% (SE 7%) and 14% (SE 2%),
respectively, and was 18% (SE 3%) greater than a baseline BayesR model without
single-nucleotide polymorphism (SNP) markers grouped into minor allele frequency–linkage
disequilibrium (MAF-LD) annotation categories. For height, the prediction accuracy
R2 was 47% in a UK Biobank holdout sample, which was 76% of the estimated h2SNP.
We then extend our GMRM prediction model to provide mixed-linear model association
(MLMA) SNP marker estimates for genome-wide association (GWAS) discovery, which
increased the independent loci detected to 16,162 in unrelated UK Biobank individuals,
compared to 10,550 from BoltLMM and 10,095 from Regenie, a 62 and 65% increase,
respectively. The average χ2 value of the leading markers increased by 15.24 (SE
0.41) for every 1% increase in prediction accuracy gained over a baseline BayesR
model across the traits. Thus, we show that modeling genetic associations accounting
for MAF and LD differences among SNP markers, and incorporating prior knowledge
of genomic function, is important for both genomic prediction and discovery in
large-scale individual-level studies.
acknowledgement: This project was funded by Swiss National Science Foundation Eccellenza
Grant PCEGP3-181181(toM.R.R.) and by core funding from the Institute of Science
and Technology Austria. P.M.V. acknowledges funding from the Australian National
Health and Medical Research Council (1113400) and the Australian Research Council
(FL180100072). K.L. and R.M. were supported by the Estonian Research Council Grant
PRG687. Estonian Biobank computations were performed in the High-Performance Computing
Centre, University of Tartu.
article_number: e2121279119
article_processing_charge: No
article_type: original
author:
- first_name: Etienne J.
full_name: Orliac, Etienne J.
last_name: Orliac
- first_name: Daniel
full_name: Trejo Banos, Daniel
last_name: Trejo Banos
- first_name: Sven E.
full_name: Ojavee, Sven E.
last_name: Ojavee
- first_name: Kristi
full_name: Läll, Kristi
last_name: Läll
- first_name: Reedik
full_name: Mägi, Reedik
last_name: Mägi
- first_name: Peter M.
full_name: Visscher, Peter M.
last_name: Visscher
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
citation:
ama: Orliac EJ, Trejo Banos D, Ojavee SE, et al. Improving GWAS discovery and genomic
prediction accuracy in biobank data. Proceedings of the National Academy of
Sciences of the United States of America. 2022;119(31). doi:10.1073/pnas.2121279119
apa: Orliac, E. J., Trejo Banos, D., Ojavee, S. E., Läll, K., Mägi, R., Visscher,
P. M., & Robinson, M. R. (2022). Improving GWAS discovery and genomic prediction
accuracy in biobank data. Proceedings of the National Academy of Sciences of
the United States of America. Proceedings of the National Academy of Sciences.
https://doi.org/10.1073/pnas.2121279119
chicago: Orliac, Etienne J., Daniel Trejo Banos, Sven E. Ojavee, Kristi Läll, Reedik
Mägi, Peter M. Visscher, and Matthew Richard Robinson. “Improving GWAS Discovery
and Genomic Prediction Accuracy in Biobank Data.” Proceedings of the National
Academy of Sciences of the United States of America. Proceedings of the National
Academy of Sciences, 2022. https://doi.org/10.1073/pnas.2121279119.
ieee: E. J. Orliac et al., “Improving GWAS discovery and genomic prediction
accuracy in biobank data,” Proceedings of the National Academy of Sciences
of the United States of America, vol. 119, no. 31. Proceedings of the National
Academy of Sciences, 2022.
ista: Orliac EJ, Trejo Banos D, Ojavee SE, Läll K, Mägi R, Visscher PM, Robinson
MR. 2022. Improving GWAS discovery and genomic prediction accuracy in biobank
data. Proceedings of the National Academy of Sciences of the United States of
America. 119(31), e2121279119.
mla: Orliac, Etienne J., et al. “Improving GWAS Discovery and Genomic Prediction
Accuracy in Biobank Data.” Proceedings of the National Academy of Sciences
of the United States of America, vol. 119, no. 31, e2121279119, Proceedings
of the National Academy of Sciences, 2022, doi:10.1073/pnas.2121279119.
short: E.J. Orliac, D. Trejo Banos, S.E. Ojavee, K. Läll, R. Mägi, P.M. Visscher,
M.R. Robinson, Proceedings of the National Academy of Sciences of the United States
of America 119 (2022).
date_created: 2022-08-07T22:01:56Z
date_published: 2022-07-29T00:00:00Z
date_updated: 2023-08-03T12:40:38Z
day: '29'
ddc:
- '570'
department:
- _id: MaRo
doi: 10.1073/pnas.2121279119
external_id:
isi:
- '000881496900003'
file:
- access_level: open_access
checksum: b5d2024e19fbad6f85a5e384e44d0f3b
content_type: application/pdf
creator: dernst
date_created: 2022-08-08T07:31:19Z
date_updated: 2022-08-08T07:31:19Z
file_id: '11745'
file_name: 2022_PNAS_Orliac.pdf
file_size: 1001164
relation: main_file
success: 1
file_date_updated: 2022-08-08T07:31:19Z
has_accepted_license: '1'
intvolume: ' 119'
isi: 1
issue: '31'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '07'
oa: 1
oa_version: Published Version
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
eissn:
- 1091-6490
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
related_material:
record:
- id: '13064'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Improving GWAS discovery and genomic prediction accuracy in biobank data
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: 119
year: '2022'
...
---
_id: '11734'
abstract:
- lang: eng
text: Mineral nutrition is one of the key environmental factors determining plant
development and growth. Nitrate is the major form of macronutrient nitrogen that
plants take up from the soil. Fluctuating availability or deficiency of this element
severely limits plant growth and negatively affects crop production in the agricultural
system. To cope with the heterogeneity of nitrate distribution in soil, plants
evolved a complex regulatory mechanism that allows rapid adjustment of physiological
and developmental processes to the status of this nutrient. The root, as a major
exploitation organ that controls the uptake of nitrate to the plant body, acts
as a regulatory hub that, according to nitrate availability, coordinates the growth
and development of other plant organs. Here, we identified a regulatory framework,
where cytokinin response factors (CRFs) play a central role as a molecular readout
of the nitrate status in roots to guide shoot adaptive developmental response.
We show that nitrate-driven activation of NLP7, a master regulator of nitrate
response in plants, fine tunes biosynthesis of cytokinin in roots and its translocation
to shoots where it enhances expression of CRFs. CRFs, through direct transcriptional
regulation of PIN auxin transporters, promote the flow of auxin and thereby stimulate
the development of shoot organs.
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
acknowledgement: "We acknowledge Hana Semeradova, Juan Carlos Montesinos, Nicola Cavallari,
Marc¸al Gallem\x03ı, Kaori Tabata, Andrej Hurn\x03y, and Sascha Waidmann for sharing
materials; and Marina Borges Osorio for critical reading of the manuscript. Work
in the E. Benkova laboratory was supported by the Austrian Science Fund (FWF01_I1774S)
to K.O., R.A., and E. Benkova. We acknowledge the Bioimaging Facility and Life Science
Facilities of the Institute of Science\r\nand Technology Austria. We give sincere
thanks to Hana Martınkova and Petra Amakorova for their help with cytokinin analyses.
This work was funded by the Czech Science Foundation (Project No. 19-00973S)."
article_number: e2122460119
article_processing_charge: No
article_type: original
author:
- first_name: Rashed
full_name: Abualia, Rashed
id: 4827E134-F248-11E8-B48F-1D18A9856A87
last_name: Abualia
orcid: 0000-0002-9357-9415
- first_name: Krisztina
full_name: Ötvös, Krisztina
id: 29B901B0-F248-11E8-B48F-1D18A9856A87
last_name: Ötvös
orcid: 0000-0002-5503-4983
- first_name: Ondřej
full_name: Novák, Ondřej
last_name: Novák
- first_name: Eleonore
full_name: Bouguyon, Eleonore
last_name: Bouguyon
- first_name: Kevin
full_name: Domanegg, Kevin
id: a24c7829-16e8-11ed-8527-c4d36ffb7539
last_name: Domanegg
orcid: 0000-0002-1215-4264
- first_name: Anne
full_name: Krapp, Anne
last_name: Krapp
- first_name: Philip
full_name: Nacry, Philip
last_name: Nacry
- first_name: Alain
full_name: Gojon, Alain
last_name: Gojon
- first_name: Benoit
full_name: Lacombe, Benoit
last_name: Lacombe
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Abualia R, Ötvös K, Novák O, et al. Molecular framework integrating nitrate
sensing in root and auxin-guided shoot adaptive responses. Proceedings of the
National Academy of Sciences of the United States of America. 2022;119(31).
doi:10.1073/pnas.2122460119
apa: Abualia, R., Ötvös, K., Novák, O., Bouguyon, E., Domanegg, K., Krapp, A., …
Benková, E. (2022). Molecular framework integrating nitrate sensing in root and
auxin-guided shoot adaptive responses. Proceedings of the National Academy
of Sciences of the United States of America. Proceedings of the National Academy
of Sciences. https://doi.org/10.1073/pnas.2122460119
chicago: Abualia, Rashed, Krisztina Ötvös, Ondřej Novák, Eleonore Bouguyon, Kevin
Domanegg, Anne Krapp, Philip Nacry, Alain Gojon, Benoit Lacombe, and Eva Benková.
“Molecular Framework Integrating Nitrate Sensing in Root and Auxin-Guided Shoot
Adaptive Responses.” Proceedings of the National Academy of Sciences of the
United States of America. Proceedings of the National Academy of Sciences,
2022. https://doi.org/10.1073/pnas.2122460119.
ieee: R. Abualia et al., “Molecular framework integrating nitrate sensing
in root and auxin-guided shoot adaptive responses,” Proceedings of the National
Academy of Sciences of the United States of America, vol. 119, no. 31. Proceedings
of the National Academy of Sciences, 2022.
ista: Abualia R, Ötvös K, Novák O, Bouguyon E, Domanegg K, Krapp A, Nacry P, Gojon
A, Lacombe B, Benková E. 2022. Molecular framework integrating nitrate sensing
in root and auxin-guided shoot adaptive responses. Proceedings of the National
Academy of Sciences of the United States of America. 119(31), e2122460119.
mla: Abualia, Rashed, et al. “Molecular Framework Integrating Nitrate Sensing in
Root and Auxin-Guided Shoot Adaptive Responses.” Proceedings of the National
Academy of Sciences of the United States of America, vol. 119, no. 31, e2122460119,
Proceedings of the National Academy of Sciences, 2022, doi:10.1073/pnas.2122460119.
short: R. Abualia, K. Ötvös, O. Novák, E. Bouguyon, K. Domanegg, A. Krapp, P. Nacry,
A. Gojon, B. Lacombe, E. Benková, Proceedings of the National Academy of Sciences
of the United States of America 119 (2022).
date_created: 2022-08-07T22:01:57Z
date_published: 2022-07-25T00:00:00Z
date_updated: 2023-08-03T12:39:29Z
day: '25'
ddc:
- '570'
department:
- _id: EvBe
doi: 10.1073/pnas.2122460119
external_id:
isi:
- '000881496900007'
pmid:
- '35878040'
file:
- access_level: open_access
checksum: 6e97dedc281247fc3fe238a209f14af0
content_type: application/pdf
creator: dernst
date_created: 2022-08-08T07:09:58Z
date_updated: 2022-08-08T07:09:58Z
file_id: '11744'
file_name: 2022_PNAS_Abualia.pdf
file_size: 3092330
relation: main_file
success: 1
file_date_updated: 2022-08-08T07:09:58Z
has_accepted_license: '1'
intvolume: ' 119'
isi: 1
issue: '31'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 2542D156-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I 1774-B16
name: Hormone cross-talk drives nutrient dependent plant development
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
eissn:
- 1091-6490
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecular framework integrating nitrate sensing in root and auxin-guided shoot
adaptive responses
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: 119
year: '2022'
...
---
_id: '11735'
abstract:
- lang: eng
text: "Interlocking puzzles are intriguing geometric games where the puzzle pieces
are held together based on their geometric arrangement, preventing the puzzle
from falling apart. High-level-of-difficulty, or simply high-level, interlocking
puzzles are a subclass of interlocking puzzles that require multiple moves to
take out the first subassembly from the puzzle. Solving a high-level interlocking
puzzle is a challenging task since one has to explore many different configurations
of the puzzle pieces until reaching a configuration where the first subassembly
can be taken out. Designing a high-level interlocking puzzle with a user-specified
level of difficulty is even harder since the puzzle pieces have to be interlocking
in all the configurations before the first subassembly is taken out.\r\n\r\nIn
this paper, we present a computational approach to design high-level interlocking
puzzles. The core idea is to represent all possible configurations of an interlocking
puzzle as well as transitions among these configurations using a rooted, undirected
graph called a disassembly graph and leverage this graph to find a disassembly
plan that requires a minimal number of moves to take out the first subassembly
from the puzzle. At the design stage, our algorithm iteratively constructs the
geometry of each puzzle piece to expand the disassembly graph incrementally, aiming
to achieve a user-specified level of difficulty. We show that our approach allows
efficient generation of high-level interlocking puzzles of various shape complexities,
including new solutions not attainable by state-of-the-art approaches."
acknowledgement: "We thank the reviewers for the valuable comments, David Gontier
for sharing the source code of the baseline design approach, Christian Hafner for
proofreading the paper, Keenan Crane for the 3D model of Cow, and Thingiverse for
the 3D models of Moai and Owl. This work was supported by the SUTD Start-up Research
Grant (Number: SRG ISTD 2019 148), the Swiss National Science Foundation (NCCR Digital
Fabrication Agreement #51NF40-141853), and\r\nthe European Research Council (ERC)
under the European Union’s Horizon 2020 research and innovation programme (Grant
Agreement No 715767 – MATERIALIZABLE)."
article_number: '150'
article_processing_charge: No
article_type: original
author:
- first_name: Rulin
full_name: Chen, Rulin
last_name: Chen
- first_name: Ziqi
full_name: Wang, Ziqi
last_name: Wang
- first_name: Peng
full_name: Song, Peng
last_name: Song
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: Chen R, Wang Z, Song P, Bickel B. Computational design of high-level interlocking
puzzles. ACM Transactions on Graphics. 2022;41(4). doi:10.1145/3528223.3530071
apa: Chen, R., Wang, Z., Song, P., & Bickel, B. (2022). Computational design
of high-level interlocking puzzles. ACM Transactions on Graphics. Association
for Computing Machinery. https://doi.org/10.1145/3528223.3530071
chicago: Chen, Rulin, Ziqi Wang, Peng Song, and Bernd Bickel. “Computational Design
of High-Level Interlocking Puzzles.” ACM Transactions on Graphics. Association
for Computing Machinery, 2022. https://doi.org/10.1145/3528223.3530071.
ieee: R. Chen, Z. Wang, P. Song, and B. Bickel, “Computational design of high-level
interlocking puzzles,” ACM Transactions on Graphics, vol. 41, no. 4. Association
for Computing Machinery, 2022.
ista: Chen R, Wang Z, Song P, Bickel B. 2022. Computational design of high-level
interlocking puzzles. ACM Transactions on Graphics. 41(4), 150.
mla: Chen, Rulin, et al. “Computational Design of High-Level Interlocking Puzzles.”
ACM Transactions on Graphics, vol. 41, no. 4, 150, Association for Computing
Machinery, 2022, doi:10.1145/3528223.3530071.
short: R. Chen, Z. Wang, P. Song, B. Bickel, ACM Transactions on Graphics 41 (2022).
date_created: 2022-08-07T22:01:57Z
date_published: 2022-07-22T00:00:00Z
date_updated: 2023-08-03T13:21:22Z
day: '22'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1145/3528223.3530071
ec_funded: 1
external_id:
isi:
- '000830989200018'
file:
- access_level: open_access
checksum: 0b51651be45b1b33f2072bd5d2686c69
content_type: application/pdf
creator: bbickel
date_created: 2022-08-28T07:56:19Z
date_updated: 2022-08-28T07:56:19Z
file_id: '11992'
file_name: Chen-2022-High-LevelPuzzle_authorVersion.pdf
file_size: 16896871
relation: main_file
success: 1
file_date_updated: 2022-08-28T07:56:19Z
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
link:
- description: News on ISTA website
relation: press_release
url: https://ista.ac.at/en/news/unlocking-interlocking-riddles/
scopus_import: '1'
status: public
title: Computational design of high-level interlocking puzzles
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2022'
...
---
_id: '11736'
abstract:
- lang: eng
text: "This paper introduces a methodology for inverse-modeling of yarn-level mechanics
of cloth, based on the mechanical response of fabrics in the real world. We compiled
a database from physical tests of several different knitted fabrics used in the
textile industry. These data span different types of complex knit patterns, yarn
compositions, and fabric finishes, and the results demonstrate diverse physical
properties like stiffness, nonlinearity, and anisotropy.\r\n\r\nWe then develop
a system for approximating these mechanical responses with yarn-level cloth simulation.
To do so, we introduce an efficient pipeline for converting between fabric-level
data and yarn-level simulation, including a novel swatch-level approximation for
speeding up computation, and some small-but-necessary extensions to yarn-level
models used in computer graphics. The dataset used for this paper can be found
at http://mslab.es/projects/YarnLevelFabrics."
acknowledged_ssus:
- _id: ScienComp
acknowledgement: We wish to thank the anonymous reviewers for their helpful comments.
To develop this project, we were helped by many people both at Under Armour (Clay
Dean, Randall Harward, Kyle Blakely, Craig Simile, Michael Seiz, Brooke Malone,
Brittainy McFarland, Emilie Phan, Lindsey Kern, Courtney Oswald, Haley Barkley,
Bob Chin, Adam Bayer, Connie Kwok, Marielle Newman, Nick Pence, Allison Hicks, Allison
White, Candace Rubenstein, Jeremy Stangland, Fred Fagergren, Michael Mazzoleni,
Nathaniel Berry, Manuel Frank) and SEDDI (Gabriel Cirio, Alejandro Rodríguez, Sofía
Dominguez, Alicia Nicas, Elena Garcés, Daniel Rodríguez, David Pascual, Manuel Godoy,
Sergio Suja, Sergio Ruiz, Roberto Condori, Alberto Martín, Graham Sullivan). We
also thank the members of the Visual Computing Group at IST Austria and the Multimodal
Simulation Lab at URJC for their feedback. This research was supported by the Scientific
Service Units (SSU) of IST Austria through resources provided by Scientific Computing,
and it was funded in part by the European Research Council (ERC Consolidator Grant
772738 TouchDesign).
article_number: '65'
article_processing_charge: No
article_type: original
author:
- first_name: Georg
full_name: Sperl, Georg
id: 4DD40360-F248-11E8-B48F-1D18A9856A87
last_name: Sperl
- first_name: Rosa M.
full_name: Sánchez-Banderas, Rosa M.
last_name: Sánchez-Banderas
- first_name: Manwen
full_name: Li, Manwen
last_name: Li
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Miguel A.
full_name: Otaduy, Miguel A.
last_name: Otaduy
citation:
ama: Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. Estimation of yarn-level
simulation models for production fabrics. ACM Transactions on Graphics.
2022;41(4). doi:10.1145/3528223.3530167
apa: Sperl, G., Sánchez-Banderas, R. M., Li, M., Wojtan, C., & Otaduy, M. A.
(2022). Estimation of yarn-level simulation models for production fabrics. ACM
Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3528223.3530167
chicago: Sperl, Georg, Rosa M. Sánchez-Banderas, Manwen Li, Chris Wojtan, and Miguel
A. Otaduy. “Estimation of Yarn-Level Simulation Models for Production Fabrics.”
ACM Transactions on Graphics. Association for Computing Machinery, 2022.
https://doi.org/10.1145/3528223.3530167.
ieee: G. Sperl, R. M. Sánchez-Banderas, M. Li, C. Wojtan, and M. A. Otaduy, “Estimation
of yarn-level simulation models for production fabrics,” ACM Transactions on
Graphics, vol. 41, no. 4. Association for Computing Machinery, 2022.
ista: Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. 2022. Estimation
of yarn-level simulation models for production fabrics. ACM Transactions on Graphics.
41(4), 65.
mla: Sperl, Georg, et al. “Estimation of Yarn-Level Simulation Models for Production
Fabrics.” ACM Transactions on Graphics, vol. 41, no. 4, 65, Association
for Computing Machinery, 2022, doi:10.1145/3528223.3530167.
short: G. Sperl, R.M. Sánchez-Banderas, M. Li, C. Wojtan, M.A. Otaduy, ACM Transactions
on Graphics 41 (2022).
date_created: 2022-08-07T22:01:58Z
date_published: 2022-07-22T00:00:00Z
date_updated: 2023-08-03T12:38:30Z
day: '22'
department:
- _id: ChWo
doi: 10.1145/3528223.3530167
external_id:
isi:
- '000830989200114'
intvolume: ' 41'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3528223.3530167
month: '07'
oa: 1
oa_version: Published Version
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
link:
- description: News on the ISTA website
relation: press_release
url: https://ista.ac.at/en/news/digital-yarn-real-socks/
record:
- id: '12358'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Estimation of yarn-level simulation models for production fabrics
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2022'
...
---
_id: '11737'
abstract:
- lang: eng
text: Spin-orbit coupling in thin HgTe quantum wells results in a relativistic-like
electron band structure, making it a versatile solid state platform to observe
and control nontrivial electrodynamic phenomena. Here we report an observation
of universal terahertz (THz) transparency determined by fine-structure constant
α≈1/137 in 6.5-nm-thick HgTe layer, close to the critical thickness separating
phases with topologically different electronic band structure. Using THz spectroscopy
in a magnetic field we obtain direct evidence of asymmetric spin splitting of
the Dirac cone. This particle-hole asymmetry facilitates optical control of edge
spin currents in the quantum wells.
acknowledgement: This work was supported by the Austrian Science Funds (W 1243, I
3456-N27, I 5539-N).
article_number: '045302'
article_processing_charge: No
article_type: original
author:
- first_name: Uladzislau
full_name: Dziom, Uladzislau
id: 6A9A37C2-8C5C-11E9-AE53-F2FDE5697425
last_name: Dziom
orcid: 0000-0002-1648-0999
- first_name: A.
full_name: Shuvaev, A.
last_name: Shuvaev
- first_name: J.
full_name: Gospodarič, J.
last_name: Gospodarič
- first_name: E. G.
full_name: Novik, E. G.
last_name: Novik
- first_name: A. A.
full_name: Dobretsova, A. A.
last_name: Dobretsova
- first_name: N. N.
full_name: Mikhailov, N. N.
last_name: Mikhailov
- first_name: Z. D.
full_name: Kvon, Z. D.
last_name: Kvon
- first_name: Zhanybek
full_name: Alpichshev, Zhanybek
id: 45E67A2A-F248-11E8-B48F-1D18A9856A87
last_name: Alpichshev
orcid: 0000-0002-7183-5203
- first_name: A.
full_name: Pimenov, A.
last_name: Pimenov
citation:
ama: Dziom U, Shuvaev A, Gospodarič J, et al. Universal transparency and asymmetric
spin splitting near the Dirac point in HgTe quantum wells. Physical Review
B. 2022;106(4). doi:10.1103/PhysRevB.106.045302
apa: Dziom, U., Shuvaev, A., Gospodarič, J., Novik, E. G., Dobretsova, A. A., Mikhailov,
N. N., … Pimenov, A. (2022). Universal transparency and asymmetric spin splitting
near the Dirac point in HgTe quantum wells. Physical Review B. American
Physical Society. https://doi.org/10.1103/PhysRevB.106.045302
chicago: Dziom, Uladzislau, A. Shuvaev, J. Gospodarič, E. G. Novik, A. A. Dobretsova,
N. N. Mikhailov, Z. D. Kvon, Zhanybek Alpichshev, and A. Pimenov. “Universal Transparency
and Asymmetric Spin Splitting near the Dirac Point in HgTe Quantum Wells.” Physical
Review B. American Physical Society, 2022. https://doi.org/10.1103/PhysRevB.106.045302.
ieee: U. Dziom et al., “Universal transparency and asymmetric spin splitting
near the Dirac point in HgTe quantum wells,” Physical Review B, vol. 106,
no. 4. American Physical Society, 2022.
ista: Dziom U, Shuvaev A, Gospodarič J, Novik EG, Dobretsova AA, Mikhailov NN, Kvon
ZD, Alpichshev Z, Pimenov A. 2022. Universal transparency and asymmetric spin
splitting near the Dirac point in HgTe quantum wells. Physical Review B. 106(4),
045302.
mla: Dziom, Uladzislau, et al. “Universal Transparency and Asymmetric Spin Splitting
near the Dirac Point in HgTe Quantum Wells.” Physical Review B, vol. 106,
no. 4, 045302, American Physical Society, 2022, doi:10.1103/PhysRevB.106.045302.
short: U. Dziom, A. Shuvaev, J. Gospodarič, E.G. Novik, A.A. Dobretsova, N.N. Mikhailov,
Z.D. Kvon, Z. Alpichshev, A. Pimenov, Physical Review B 106 (2022).
date_created: 2022-08-07T22:01:58Z
date_published: 2022-07-15T00:00:00Z
date_updated: 2023-08-03T12:38:57Z
day: '15'
ddc:
- '530'
department:
- _id: ZhAl
doi: 10.1103/PhysRevB.106.045302
external_id:
isi:
- '000834349200010'
file:
- access_level: open_access
checksum: 115aff9e0cde2f806cb26953d7262791
content_type: application/pdf
creator: dernst
date_created: 2022-08-08T06:58:22Z
date_updated: 2022-08-08T06:58:22Z
file_id: '11743'
file_name: 2022_PhysRevB_Dziom.pdf
file_size: 774455
relation: main_file
success: 1
file_date_updated: 2022-08-08T06:58:22Z
has_accepted_license: '1'
intvolume: ' 106'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Universal transparency and asymmetric spin splitting near the Dirac point in
HgTe quantum wells
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 106
year: '2022'
...
---
_id: '11739'
abstract:
- lang: eng
text: We consider finite-volume approximations of Fokker--Planck equations on bounded
convex domains in $\mathbb{R}^d$ and study the corresponding gradient flow structures.
We reprove the convergence of the discrete to continuous Fokker--Planck equation
via the method of evolutionary $\Gamma$-convergence, i.e., we pass to the limit
at the level of the gradient flow structures, generalizing the one-dimensional
result obtained by Disser and Liero. The proof is of variational nature and relies
on a Mosco convergence result for functionals in the discrete-to-continuum limit
that is of independent interest. Our results apply to arbitrary regular meshes,
even though the associated discrete transport distances may fail to converge to
the Wasserstein distance in this generality.
acknowledgement: This work was supported by the European Research Council (ERC) under
the European Union's Horizon 2020 Research and Innovation Programme grant 716117
and by the AustrianScience Fund (FWF) through grants F65 and W1245.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Dominik L
full_name: Forkert, Dominik L
id: 35C79D68-F248-11E8-B48F-1D18A9856A87
last_name: Forkert
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
citation:
ama: Forkert DL, Maas J, Portinale L. Evolutionary $\Gamma$-convergence of entropic
gradient flow structures for Fokker-Planck equations in multiple dimensions. SIAM
Journal on Mathematical Analysis. 2022;54(4):4297-4333. doi:10.1137/21M1410968
apa: Forkert, D. L., Maas, J., & Portinale, L. (2022). Evolutionary $\Gamma$-convergence
of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions.
SIAM Journal on Mathematical Analysis. Society for Industrial and Applied
Mathematics. https://doi.org/10.1137/21M1410968
chicago: Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary $\Gamma$-Convergence
of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.”
SIAM Journal on Mathematical Analysis. Society for Industrial and Applied
Mathematics, 2022. https://doi.org/10.1137/21M1410968.
ieee: D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary $\Gamma$-convergence
of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,”
SIAM Journal on Mathematical Analysis, vol. 54, no. 4. Society for Industrial
and Applied Mathematics, pp. 4297–4333, 2022.
ista: Forkert DL, Maas J, Portinale L. 2022. Evolutionary $\Gamma$-convergence of
entropic gradient flow structures for Fokker-Planck equations in multiple dimensions.
SIAM Journal on Mathematical Analysis. 54(4), 4297–4333.
mla: Forkert, Dominik L., et al. “Evolutionary $\Gamma$-Convergence of Entropic
Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.”
SIAM Journal on Mathematical Analysis, vol. 54, no. 4, Society for Industrial
and Applied Mathematics, 2022, pp. 4297–333, doi:10.1137/21M1410968.
short: D.L. Forkert, J. Maas, L. Portinale, SIAM Journal on Mathematical Analysis
54 (2022) 4297–4333.
date_created: 2022-08-07T22:01:59Z
date_published: 2022-07-18T00:00:00Z
date_updated: 2023-08-03T12:37:21Z
day: '18'
department:
- _id: JaMa
doi: 10.1137/21M1410968
ec_funded: 1
external_id:
arxiv:
- '2008.10962'
isi:
- '000889274600001'
intvolume: ' 54'
isi: 1
issue: '4'
keyword:
- Fokker--Planck equation
- gradient flow
- evolutionary $\Gamma$-convergence
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2008.10962'
month: '07'
oa: 1
oa_version: Preprint
page: 4297-4333
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
- _id: 260788DE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
name: Dissipation and Dispersion in Nonlinear Partial Differential Equations
publication: SIAM Journal on Mathematical Analysis
publication_identifier:
eissn:
- 1095-7154
issn:
- 0036-1410
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '10022'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Evolutionary $\Gamma$-convergence of entropic gradient flow structures for
Fokker-Planck equations in multiple dimensions
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 54
year: '2022'
...
---
_id: '11740'
abstract:
- lang: eng
text: "We consider a generalised model of a random simplicial complex, which arises
from a random hypergraph. Our model is generated by taking the downward-closure
of a non-uniform binomial random hypergraph, in which for each k, each set of
k+1 vertices forms an edge with some probability pk independently. As a special
case, this contains an extensively studied model of a (uniform) random simplicial
complex, introduced by Meshulam and Wallach [Random Structures & Algorithms 34
(2009), no. 3, pp. 408–417].\r\nWe consider a higher-dimensional notion of connectedness
on this new model according to the vanishing of cohomology groups over an arbitrary
abelian group R. We prove that this notion of connectedness displays a phase transition
and determine the threshold. We also prove a hitting time result for a natural
process interpretation, in which simplices and their downward-closure are added
one by one. In addition, we determine the asymptotic behaviour of cohomology groups
inside the critical window around the time of the phase transition."
acknowledgement: 'Supported by Austrian Science Fund (FWF): I3747, W1230.'
article_number: P3.27
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Oliver
full_name: Cooley, Oliver
id: 43f4ddd0-a46b-11ec-8df6-ef3703bd721d
last_name: Cooley
- first_name: Nicola
full_name: Del Giudice, Nicola
last_name: Del Giudice
- first_name: Mihyun
full_name: Kang, Mihyun
last_name: Kang
- first_name: Philipp
full_name: Sprüssel, Philipp
last_name: Sprüssel
citation:
ama: Cooley O, Del Giudice N, Kang M, Sprüssel P. Phase transition in cohomology
groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics.
2022;29(3). doi:10.37236/10607
apa: Cooley, O., Del Giudice, N., Kang, M., & Sprüssel, P. (2022). Phase transition
in cohomology groups of non-uniform random simplicial complexes. Electronic
Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/10607
chicago: Cooley, Oliver, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel.
“Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.”
Electronic Journal of Combinatorics. Electronic Journal of Combinatorics,
2022. https://doi.org/10.37236/10607.
ieee: O. Cooley, N. Del Giudice, M. Kang, and P. Sprüssel, “Phase transition in
cohomology groups of non-uniform random simplicial complexes,” Electronic Journal
of Combinatorics, vol. 29, no. 3. Electronic Journal of Combinatorics, 2022.
ista: Cooley O, Del Giudice N, Kang M, Sprüssel P. 2022. Phase transition in cohomology
groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics.
29(3), P3.27.
mla: Cooley, Oliver, et al. “Phase Transition in Cohomology Groups of Non-Uniform
Random Simplicial Complexes.” Electronic Journal of Combinatorics, vol.
29, no. 3, P3.27, Electronic Journal of Combinatorics, 2022, doi:10.37236/10607.
short: O. Cooley, N. Del Giudice, M. Kang, P. Sprüssel, Electronic Journal of Combinatorics
29 (2022).
date_created: 2022-08-07T22:01:59Z
date_published: 2022-07-29T00:00:00Z
date_updated: 2023-08-03T12:37:54Z
day: '29'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.37236/10607
external_id:
arxiv:
- '2005.07103'
isi:
- '000836200300001'
file:
- access_level: open_access
checksum: 057c676dcee70236aa234d4ce6138c69
content_type: application/pdf
creator: dernst
date_created: 2022-08-08T06:28:52Z
date_updated: 2022-08-08T06:28:52Z
file_id: '11742'
file_name: 2022_ElecJournCombinatorics_Cooley.pdf
file_size: 1768663
relation: main_file
success: 1
file_date_updated: 2022-08-08T06:28:52Z
has_accepted_license: '1'
intvolume: ' 29'
isi: 1
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '07'
oa: 1
oa_version: Published Version
publication: Electronic Journal of Combinatorics
publication_identifier:
eissn:
- 1077-8926
publication_status: published
publisher: Electronic Journal of Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Phase transition in cohomology groups of non-uniform random simplicial complexes
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 29
year: '2022'
...
---
_id: '11775'
abstract:
- lang: eng
text: 'Quantitative monitoring can be universal and approximate: For every finite
sequence of observations, the specification provides a value and the monitor outputs
a best-effort approximation of it. The quality of the approximation may depend
on the resources that are available to the monitor. By taking to the limit the
sequences of specification values and monitor outputs, we obtain precision-resource
trade-offs also for limit monitoring. This paper provides a formal framework for
studying such trade-offs using an abstract interpretation for monitors: For each
natural number n, the aggregate semantics of a monitor at time n is an equivalence
relation over all sequences of at most n observations so that two equivalent sequences
are indistinguishable to the monitor and thus mapped to the same output. This
abstract interpretation of quantitative monitors allows us to measure the number
of equivalence classes (or “resource use”) that is necessary for a certain precision
up to a certain time, or at any time. Our framework offers several insights. For
example, we identify a family of specifications for which any resource-optimal
exact limit monitor is independent of any error permitted over finite traces.
Moreover, we present a specification for which any resource-optimal approximate
limit monitor does not minimize its resource use at any time. '
acknowledgement: We thank the anonymous reviewers for their helpful comments. This
work was supported in part by the ERC-2020-AdG 101020093.
alternative_title:
- LNCS
article_processing_charge: Yes
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Nicolas Adrien
full_name: Mazzocchi, Nicolas Adrien
id: b26baa86-3308-11ec-87b0-8990f34baa85
last_name: Mazzocchi
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Henzinger TA, Mazzocchi NA, Sarac NE. Abstract monitors for quantitative specifications.
In: 22nd International Conference on Runtime Verification. Vol 13498. Springer
Nature; 2022:200-220. doi:10.1007/978-3-031-17196-3_11'
apa: 'Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2022). Abstract monitors
for quantitative specifications. In 22nd International Conference on Runtime
Verification (Vol. 13498, pp. 200–220). Tbilisi, Georgia: Springer Nature.
https://doi.org/10.1007/978-3-031-17196-3_11'
chicago: Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Abstract
Monitors for Quantitative Specifications.” In 22nd International Conference
on Runtime Verification, 13498:200–220. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-17196-3_11.
ieee: T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Abstract monitors for
quantitative specifications,” in 22nd International Conference on Runtime Verification,
Tbilisi, Georgia, 2022, vol. 13498, pp. 200–220.
ista: 'Henzinger TA, Mazzocchi NA, Sarac NE. 2022. Abstract monitors for quantitative
specifications. 22nd International Conference on Runtime Verification. RV: Runtime
Verification, LNCS, vol. 13498, 200–220.'
mla: Henzinger, Thomas A., et al. “Abstract Monitors for Quantitative Specifications.”
22nd International Conference on Runtime Verification, vol. 13498, Springer
Nature, 2022, pp. 200–20, doi:10.1007/978-3-031-17196-3_11.
short: T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 22nd International Conference
on Runtime Verification, Springer Nature, 2022, pp. 200–220.
conference:
end_date: 2022-09-30
location: Tbilisi, Georgia
name: 'RV: Runtime Verification'
start_date: 2022-09-28
date_created: 2022-08-08T17:09:09Z
date_published: 2022-09-23T00:00:00Z
date_updated: 2023-08-03T13:38:46Z
day: '23'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1007/978-3-031-17196-3_11
ec_funded: 1
external_id:
isi:
- '000866539700011'
file:
- access_level: open_access
checksum: 05c7dcfbb9053a98f46441fb2eccb213
content_type: application/pdf
creator: dernst
date_created: 2023-01-20T07:34:50Z
date_updated: 2023-01-20T07:34:50Z
file_id: '12317'
file_name: 2022_LNCS_RV_Henzinger.pdf
file_size: 477110
relation: main_file
success: 1
file_date_updated: 2023-01-20T07:34:50Z
has_accepted_license: '1'
intvolume: ' 13498'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 200-220
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 22nd International Conference on Runtime Verification
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Abstract monitors for quantitative specifications
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13498
year: '2022'
...
---
_id: '11777'
abstract:
- lang: eng
text: "In this dissertation we study coboundary expansion of simplicial complex
with a view of giving geometric applications.\r\nOur main novel tool is an equivariant
version of Gromov's celebrated Topological Overlap Theorem. The equivariant topological
overlap theorem leads to various geometric applications including a quantitative
non-embeddability result for sufficiently thick buildings (which partially resolves
a conjecture of Tancer and Vorwerk) and an improved lower bound on the pair-crossing
number of (bounded degree) expander graphs. Additionally, we will give new proofs
for several known lower bounds for geometric problems such as the number of Tverberg
partitions or the crossing number of complete bipartite graphs.\r\nFor the aforementioned
applications one is naturally lead to study expansion properties of joins of simplicial
complexes. In the presence of a special certificate for expansion (as it is the
case, e.g., for spherical buildings), the join of two expanders is an expander.
On the flip-side, we report quite some evidence that coboundary expansion exhibits
very non-product-like behaviour under taking joins. For instance, we exhibit infinite
families of graphs $(G_n)_{n\\in \\mathbb{N}}$ and $(H_n)_{n\\in\\mathbb{N}}$
whose join $G_n*H_n$ has expansion of lower order than the product of the expansion
constant of the graphs. Moreover, we show an upper bound of $(d+1)/2^d$ on the
normalized coboundary expansion constants for the complete multipartite complex
$[n]^{*(d+1)}$ (under a mild divisibility condition on $n$).\r\nVia the probabilistic
method the latter result extends to an upper bound of $(d+1)/2^d+\\varepsilon$
on the coboundary expansion constant of the spherical building associated with
$\\mathrm{PGL}_{d+2}(\\mathbb{F}_q)$ for any $\\varepsilon>0$ and sufficiently
large $q=q(\\varepsilon)$. This disproves a conjecture of Lubotzky, Meshulam and
Mozes -- in a rather strong sense.\r\nBy improving on existing lower bounds we
make further progress towards closing the gap between the known lower and upper
bounds on the coboundary expansion constants of $[n]^{*(d+1)}$. The best improvements
we achieve using computer-aided proofs and flag algebras. The exact value even
for the complete $3$-partite $2$-dimensional complex $[n]^{*3}$ remains unknown
but we are happy to conjecture a precise value for every $n$. %Moreover, we show
that a previously shown lower bound on the expansion constant of the spherical
building associated with $\\mathrm{PGL}_{2}(\\mathbb{F}_q)$ is not tight.\r\nIn
a loosely structured, last chapter of this thesis we collect further smaller observations
related to expansion. We point out a link between discrete Morse theory and a
technique for showing coboundary expansion, elaborate a bit on the hardness of
computing coboundary expansion constants, propose a new criterion for coboundary
expansion (in a very dense setting) and give one way of making the folklore result
that expansion of links is a necessary condition for a simplicial complex to be
an expander precise."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Pascal
full_name: Wild, Pascal
id: 4C20D868-F248-11E8-B48F-1D18A9856A87
last_name: Wild
citation:
ama: Wild P. High-dimensional expansion and crossing numbers of simplicial complexes.
2022. doi:10.15479/at:ista:11777
apa: Wild, P. (2022). High-dimensional expansion and crossing numbers of simplicial
complexes. Institute of Science and Technology. https://doi.org/10.15479/at:ista:11777
chicago: Wild, Pascal. “High-Dimensional Expansion and Crossing Numbers of Simplicial
Complexes.” Institute of Science and Technology, 2022. https://doi.org/10.15479/at:ista:11777.
ieee: P. Wild, “High-dimensional expansion and crossing numbers of simplicial complexes,”
Institute of Science and Technology, 2022.
ista: Wild P. 2022. High-dimensional expansion and crossing numbers of simplicial
complexes. Institute of Science and Technology.
mla: Wild, Pascal. High-Dimensional Expansion and Crossing Numbers of Simplicial
Complexes. Institute of Science and Technology, 2022, doi:10.15479/at:ista:11777.
short: P. Wild, High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes,
Institute of Science and Technology, 2022.
date_created: 2022-08-10T15:51:19Z
date_published: 2022-08-11T00:00:00Z
date_updated: 2023-06-22T09:56:36Z
day: '11'
ddc:
- '500'
- '516'
- '514'
degree_awarded: PhD
department:
- _id: GradSch
- _id: UlWa
doi: 10.15479/at:ista:11777
ec_funded: 1
file:
- access_level: open_access
checksum: f5f3af1fb7c8a24b71ddc88ad7f7c5b4
content_type: text/x-python
creator: pwild
date_created: 2022-08-10T15:34:04Z
date_updated: 2022-08-10T15:34:04Z
description: Code for computer-assisted proofs in Section 8.4.7 in Thesis
file_id: '11780'
file_name: flags.py
file_size: 16828
relation: supplementary_material
- access_level: open_access
checksum: 1f7c12dfe3bdaa9b147e4fbc3d34e3d5
content_type: text/x-c++src
creator: pwild
date_created: 2022-08-10T15:34:10Z
date_updated: 2022-08-10T15:34:10Z
description: Code for proof of Lemma 8.20 in Thesis
file_id: '11781'
file_name: lowerbound.cpp
file_size: 12226
relation: supplementary_material
- access_level: open_access
checksum: 4cf81455c49e5dec3b9b2e3980137eeb
content_type: text/x-python
creator: pwild
date_created: 2022-08-10T15:34:17Z
date_updated: 2022-08-10T15:34:17Z
description: Code for proof of Proposition 7.9 in Thesis
file_id: '11782'
file_name: upperbound.py
file_size: 3240
relation: supplementary_material
- access_level: open_access
checksum: 4e96575b10cbe4e0d0db2045b2847774
content_type: application/pdf
creator: pwild
date_created: 2022-08-11T16:08:33Z
date_updated: 2022-08-11T16:08:33Z
file_id: '11809'
file_name: finalthesisPascalWildPDFA.pdf
file_size: 5086282
relation: main_file
title: High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes
- access_level: closed
checksum: 92d94842a1fb6dca5808448137573b2e
content_type: application/zip
creator: pwild
date_created: 2022-08-11T16:09:19Z
date_updated: 2022-08-11T16:09:19Z
file_id: '11810'
file_name: ThesisSubmission.zip
file_size: 18150068
relation: source_file
file_date_updated: 2022-08-11T16:09:19Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '170'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_identifier:
isbn:
- 978-3-99078-021-3
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology
status: public
supervisor:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
title: High-dimensional expansion and crossing numbers of simplicial complexes
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2022'
...
---
_id: '11783'
abstract:
- lang: eng
text: We consider a gas of N bosons with interactions in the mean-field scaling
regime. We review the proof of an asymptotic expansion of its low-energy spectrum,
eigenstates, and dynamics, which provides corrections to Bogoliubov theory to
all orders in 1/ N. This is based on joint works with Petrat, Pickl, Seiringer,
and Soffer. In addition, we derive a full asymptotic expansion of the ground state
one-body reduced density matrix.
acknowledgement: "The author thanks Nataˇsa Pavlovic, Sören Petrat, Peter Pickl, Robert
Seiringer, and Avy Soffer for the collaboration on Refs. 1, 2 and 21. Funding from
the European Union’s Horizon 2020 Research and Innovation Programme under Marie
Skℓodowska-Curie Grant Agreement\r\nNo. 754411 is gratefully acknowledged."
article_number: '061102'
article_processing_charge: Yes (via OA deal)
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
citation:
ama: Bossmann L. Low-energy spectrum and dynamics of the weakly interacting Bose
gas. Journal of Mathematical Physics. 2022;63(6). doi:10.1063/5.0089983
apa: Bossmann, L. (2022). Low-energy spectrum and dynamics of the weakly interacting
Bose gas. Journal of Mathematical Physics. AIP Publishing. https://doi.org/10.1063/5.0089983
chicago: Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting
Bose Gas.” Journal of Mathematical Physics. AIP Publishing, 2022. https://doi.org/10.1063/5.0089983.
ieee: L. Bossmann, “Low-energy spectrum and dynamics of the weakly interacting Bose
gas,” Journal of Mathematical Physics, vol. 63, no. 6. AIP Publishing,
2022.
ista: Bossmann L. 2022. Low-energy spectrum and dynamics of the weakly interacting
Bose gas. Journal of Mathematical Physics. 63(6), 061102.
mla: Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting
Bose Gas.” Journal of Mathematical Physics, vol. 63, no. 6, 061102, AIP
Publishing, 2022, doi:10.1063/5.0089983.
short: L. Bossmann, Journal of Mathematical Physics 63 (2022).
date_created: 2022-08-11T06:37:52Z
date_published: 2022-06-10T00:00:00Z
date_updated: 2023-08-03T12:46:28Z
day: '10'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1063/5.0089983
ec_funded: 1
external_id:
arxiv:
- '2203.00730'
isi:
- '000809648100002'
file:
- access_level: open_access
checksum: d0d32c338c1896680174be88c70968fa
content_type: application/pdf
creator: dernst
date_created: 2022-08-11T07:03:02Z
date_updated: 2022-08-11T07:03:02Z
file_id: '11784'
file_name: 2022_JourMathPhysics_Bossmann.pdf
file_size: 5957888
relation: main_file
success: 1
file_date_updated: 2022-08-11T07:03:02Z
has_accepted_license: '1'
intvolume: ' 63'
isi: 1
issue: '6'
keyword:
- Mathematical Physics
- Statistical and Nonlinear Physics
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Journal of Mathematical Physics
publication_identifier:
eissn:
- 1089-7658
issn:
- 0022-2488
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Low-energy spectrum and dynamics of the weakly interacting Bose gas
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 63
year: '2022'
...
---
_id: '7791'
abstract:
- lang: eng
text: Extending a result of Milena Radnovic and Serge Tabachnikov, we establish
conditionsfor two different non-symmetric norms to define the same billiard reflection
law.
acknowledgement: AA was supported by European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818
Alpha). RK was supported by the Federal professorship program Grant 1.456.2016/1.4
and the Russian Foundation for Basic Research Grants 18-01-00036 and 19-01-00169.
Open access funding provided by Institute of Science and Technology (IST Austria).
The authors thank Alexey Balitskiy, Milena Radnović, and Serge Tabachnikov for useful
discussions.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: Akopyan A, Karasev R. When different norms lead to same billiard trajectories?
European Journal of Mathematics. 2022;8(4):1309-1312. doi:10.1007/s40879-020-00405-0
apa: Akopyan, A., & Karasev, R. (2022). When different norms lead to same billiard
trajectories? European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-020-00405-0
chicago: Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same
Billiard Trajectories?” European Journal of Mathematics. Springer Nature,
2022. https://doi.org/10.1007/s40879-020-00405-0.
ieee: A. Akopyan and R. Karasev, “When different norms lead to same billiard trajectories?,”
European Journal of Mathematics, vol. 8, no. 4. Springer Nature, pp. 1309–1312,
2022.
ista: Akopyan A, Karasev R. 2022. When different norms lead to same billiard trajectories?
European Journal of Mathematics. 8(4), 1309–1312.
mla: Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same Billiard
Trajectories?” European Journal of Mathematics, vol. 8, no. 4, Springer
Nature, 2022, pp. 1309–12, doi:10.1007/s40879-020-00405-0.
short: A. Akopyan, R. Karasev, European Journal of Mathematics 8 (2022) 1309–1312.
date_created: 2020-05-03T22:00:48Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2024-02-22T15:58:42Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s40879-020-00405-0
ec_funded: 1
external_id:
arxiv:
- '1912.12685'
file:
- access_level: open_access
checksum: f53e71fd03744075adcd0b8fc1b8423d
content_type: application/pdf
creator: dernst
date_created: 2020-05-04T10:33:42Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7796'
file_name: 2020_EuropMathematics_Akopyan.pdf
file_size: 263926
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 1309 - 1312
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: European Journal of Mathematics
publication_identifier:
eissn:
- 2199-6768
issn:
- 2199-675X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: When different norms lead to same billiard trajectories?
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: 8
year: '2022'
...
---
_id: '8125'
abstract:
- lang: eng
text: Context, such as behavioral state, is known to modulate memory formation and
retrieval, but is usually ignored in associative memory models. Here, we propose
several types of contextual modulation for associative memory networks that greatly
increase their performance. In these networks, context inactivates specific neurons
and connections, which modulates the effective connectivity of the network. Memories
are stored only by the active components, thereby reducing interference from memories
acquired in other contexts. Such networks exhibit several beneficial characteristics,
including enhanced memory capacity, high robustness to noise, increased robustness
to memory overloading, and better memory retention during continual learning.
Furthermore, memories can be biased to have different relative strengths, or even
gated on or off, according to contextual cues, providing a candidate model for
cognitive control of memory and efficient memory search. An external context-encoding
network can dynamically switch the memory network to a desired state, which we
liken to experimentally observed contextual signals in prefrontal cortex and hippocampus.
Overall, our work illustrates the benefits of organizing memory around context,
and provides an important link between behavioral studies of memory and mechanistic
details of neural circuits.SIGNIFICANCEMemory
is context dependent — both encoding and recall vary in effectiveness and speed
depending on factors like location and brain state during a task. We apply this
idea to a simple computational model of associative memory through contextual
gating of neurons and synaptic connections. Intriguingly, this results in several
advantages, including vastly enhanced memory capacity, better robustness, and
flexible memory gating. Our model helps to explain (i) how gating and inhibition
contribute to memory processes, (ii) how memory access dynamically changes over
time, and (iii) how context representations, such as those observed in hippocampus
and prefrontal cortex, may interact with and control memory processes.
article_processing_charge: No
author:
- first_name: William F.
full_name: Podlaski, William F.
last_name: Podlaski
orcid: 0000-0001-6619-7502
- first_name: Everton J.
full_name: Agnes, Everton J.
last_name: Agnes
orcid: 0000-0001-7184-7311
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
citation:
ama: Podlaski WF, Agnes EJ, Vogels TP. High capacity and dynamic accessibility in
associative memory networks with context-dependent neuronal and synaptic gating.
bioRxiv. 2022. doi:10.1101/2020.01.08.898528
apa: Podlaski, W. F., Agnes, E. J., & Vogels, T. P. (2022). High capacity and
dynamic accessibility in associative memory networks with context-dependent neuronal
and synaptic gating. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.01.08.898528
chicago: Podlaski, William F., Everton J. Agnes, and Tim P Vogels. “High Capacity
and Dynamic Accessibility in Associative Memory Networks with Context-Dependent
Neuronal and Synaptic Gating.” BioRxiv. Cold Spring Harbor Laboratory,
2022. https://doi.org/10.1101/2020.01.08.898528.
ieee: W. F. Podlaski, E. J. Agnes, and T. P. Vogels, “High capacity and dynamic
accessibility in associative memory networks with context-dependent neuronal and
synaptic gating,” bioRxiv. Cold Spring Harbor Laboratory, 2022.
ista: Podlaski WF, Agnes EJ, Vogels TP. 2022. High capacity and dynamic accessibility
in associative memory networks with context-dependent neuronal and synaptic gating.
bioRxiv, 10.1101/2020.01.08.898528.
mla: Podlaski, William F., et al. “High Capacity and Dynamic Accessibility in Associative
Memory Networks with Context-Dependent Neuronal and Synaptic Gating.” BioRxiv,
Cold Spring Harbor Laboratory, 2022, doi:10.1101/2020.01.08.898528.
short: W.F. Podlaski, E.J. Agnes, T.P. Vogels, BioRxiv (2022).
date_created: 2020-07-16T12:24:28Z
date_published: 2022-12-21T00:00:00Z
date_updated: 2024-03-06T12:03:59Z
day: '21'
department:
- _id: TiVo
doi: 10.1101/2020.01.08.898528
language:
- iso: eng
locked: '1'
main_file_link:
- open_access: '1'
url: 'https://doi.org/10.1101/2020.01.08.898528 '
month: '12'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: published
publisher: Cold Spring Harbor Laboratory
status: public
title: High capacity and dynamic accessibility in associative memory networks with
context-dependent neuronal and synaptic gating
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '7577'
abstract:
- lang: eng
text: Weak convergence of inertial iterative method for solving variational inequalities
is the focus of this paper. The cost function is assumed to be non-Lipschitz and
monotone. We propose a projection-type method with inertial terms and give weak
convergence analysis under appropriate conditions. Some test results are performed
and compared with relevant methods in the literature to show the efficiency and
advantages given by our proposed methods.
acknowledgement: The project of 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: No
article_type: original
arxiv: 1
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Olaniyi S.
full_name: Iyiola, Olaniyi S.
last_name: Iyiola
citation:
ama: Shehu Y, Iyiola OS. Weak convergence for variational inequalities with inertial-type
method. Applicable Analysis. 2022;101(1):192-216. doi:10.1080/00036811.2020.1736287
apa: Shehu, Y., & Iyiola, O. S. (2022). Weak convergence for variational inequalities
with inertial-type method. Applicable Analysis. Taylor & Francis. https://doi.org/10.1080/00036811.2020.1736287
chicago: Shehu, Yekini, and Olaniyi S. Iyiola. “Weak Convergence for Variational
Inequalities with Inertial-Type Method.” Applicable Analysis. Taylor &
Francis, 2022. https://doi.org/10.1080/00036811.2020.1736287.
ieee: Y. Shehu and O. S. Iyiola, “Weak convergence for variational inequalities
with inertial-type method,” Applicable Analysis, vol. 101, no. 1. Taylor
& Francis, pp. 192–216, 2022.
ista: Shehu Y, Iyiola OS. 2022. Weak convergence for variational inequalities with
inertial-type method. Applicable Analysis. 101(1), 192–216.
mla: Shehu, Yekini, and Olaniyi S. Iyiola. “Weak Convergence for Variational Inequalities
with Inertial-Type Method.” Applicable Analysis, vol. 101, no. 1, Taylor
& Francis, 2022, pp. 192–216, doi:10.1080/00036811.2020.1736287.
short: Y. Shehu, O.S. Iyiola, Applicable Analysis 101 (2022) 192–216.
date_created: 2020-03-09T07:06:52Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2024-03-05T14:01:52Z
day: '01'
ddc:
- '510'
- '515'
- '518'
department:
- _id: VlKo
doi: 10.1080/00036811.2020.1736287
ec_funded: 1
external_id:
arxiv:
- '2101.08057'
isi:
- '000518364100001'
file:
- access_level: open_access
checksum: 869efe8cb09505dfa6012f67d20db63d
content_type: application/pdf
creator: dernst
date_created: 2020-10-12T10:42:54Z
date_updated: 2021-03-16T23:30:06Z
embargo: 2021-03-15
file_id: '8648'
file_name: 2020_ApplicAnalysis_Shehu.pdf
file_size: 4282586
relation: main_file
file_date_updated: 2021-03-16T23:30:06Z
has_accepted_license: '1'
intvolume: ' 101'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 192-216
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Applicable Analysis
publication_identifier:
eissn:
- 1563-504X
issn:
- 0003-6811
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Weak convergence for variational inequalities with inertial-type method
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 101
year: '2022'
...
---
_id: '14355'
abstract:
- lang: eng
text: 'Purpose: The mediator (MED) multisubunit-complex modulates the activity of
the transcriptional machinery, and genetic defects in different MED subunits (17,
20, 27) have been implicated in neurologic diseases. In this study, we identified
a recurrent homozygous variant in MED11 (c.325C>T; p.Arg109Ter) in 7 affected
individuals from 5 unrelated families. Methods: To investigate the genetic cause
of the disease, exome or genome sequencing were performed in 5 unrelated families
identified via different research networks and Matchmaker Exchange. Deep clinical
and brain imaging evaluations were performed by clinical pediatric neurologists
and neuroradiologists. The functional effect of the candidate variant on both
MED11 RNA and protein was assessed using reverse transcriptase polymerase chain
reaction and western blotting using fibroblast cell lines derived from 1 affected
individual and controls and through computational approaches. Knockouts in zebrafish
were generated using clustered regularly interspaced short palindromic repeats/Cas9.
Results: The disease was characterized by microcephaly, profound neurodevelopmental
impairment, exaggerated startle response, myoclonic seizures, progressive widespread
neurodegeneration, and premature death. Functional studies on patient-derived
fibroblasts did not show a loss of protein function but rather disruption of the
C-terminal of MED11, likely impairing binding to other MED subunits. A zebrafish
knockout model recapitulates key clinical phenotypes. Conclusion: Loss of the
C-terminal of MED subunit 11 may affect its binding efficiency to other MED subunits,
thus implicating the MED-complex stability in brain development and neurodegeneration.
(C) 2022 The Authors. Published by Elsevier Inc. on behalf of American College
of Medical Genetics and Genomics.'
article_processing_charge: No
article_type: original
author:
- first_name: Elisa
full_name: Cali, Elisa
last_name: Cali
- first_name: Sheng-Jia
full_name: Lin, Sheng-Jia
last_name: Lin
- first_name: Clarissa
full_name: Rocca, Clarissa
last_name: Rocca
- first_name: Yavuz
full_name: Sahin, Yavuz
last_name: Sahin
- first_name: Aisha
full_name: Al Shamsi, Aisha
last_name: Al Shamsi
- first_name: Salima
full_name: El Chehadeh, Salima
last_name: El Chehadeh
- first_name: Myriam
full_name: Chaabouni, Myriam
last_name: Chaabouni
- first_name: Kshitij
full_name: Mankad, Kshitij
last_name: Mankad
- first_name: Evangelia
full_name: Galanaki, Evangelia
last_name: Galanaki
- first_name: Stephanie
full_name: Efthymiou, Stephanie
last_name: Efthymiou
- first_name: Sniya
full_name: Sudhakar, Sniya
last_name: Sudhakar
- first_name: Alkyoni
full_name: Athanasiou-Fragkouli, Alkyoni
last_name: Athanasiou-Fragkouli
- first_name: Tamer
full_name: Celik, Tamer
last_name: Celik
- first_name: Nejat
full_name: Narli, Nejat
last_name: Narli
- first_name: Sebastiano
full_name: Bianca, Sebastiano
last_name: Bianca
- first_name: David
full_name: Murphy, David
last_name: Murphy
- first_name: Francisco Martins De Carvalho
full_name: Moreira, Francisco Martins De Carvalho
last_name: Moreira
- first_name: Andrea
full_name: Accogli, Andrea
last_name: Accogli
- first_name: Cassidy
full_name: Petree, Cassidy
last_name: Petree
- first_name: Kevin
full_name: Huang, Kevin
id: 3b3d2888-1ff6-11ee-9fa6-8f209ca91fe3
last_name: Huang
orcid: 0000-0002-2512-7812
- first_name: Kamel
full_name: Monastiri, Kamel
last_name: Monastiri
- first_name: Masoud
full_name: Edizadeh, Masoud
last_name: Edizadeh
- first_name: Rosaria
full_name: Nardello, Rosaria
last_name: Nardello
- first_name: Marzia
full_name: Ognibene, Marzia
last_name: Ognibene
- first_name: Patrizia
full_name: De Marco, Patrizia
last_name: De Marco
- first_name: Martino
full_name: Ruggieri, Martino
last_name: Ruggieri
- first_name: Federico
full_name: Zara, Federico
last_name: Zara
- first_name: Pasquale
full_name: Striano, Pasquale
last_name: Striano
- first_name: Yavuz
full_name: Sahin, Yavuz
last_name: Sahin
- first_name: Lihadh
full_name: Al-Gazali, Lihadh
last_name: Al-Gazali
- first_name: Marie Therese Abi
full_name: Warde, Marie Therese Abi
last_name: Warde
- first_name: Benedicte
full_name: Gerard, Benedicte
last_name: Gerard
- first_name: Giovanni
full_name: Zifarelli, Giovanni
last_name: Zifarelli
- first_name: Christian
full_name: Beetz, Christian
last_name: Beetz
- first_name: Sara
full_name: Fortuna, Sara
last_name: Fortuna
- first_name: Miguel
full_name: Soler, Miguel
last_name: Soler
- first_name: Enza Maria
full_name: Valente, Enza Maria
last_name: Valente
- first_name: Gaurav
full_name: Varshney, Gaurav
last_name: Varshney
- first_name: Reza
full_name: Maroofian, Reza
last_name: Maroofian
- first_name: Vincenzo
full_name: Salpietro, Vincenzo
last_name: Salpietro
- first_name: Henry
full_name: Houlden, Henry
last_name: Houlden
- first_name: SYNaPS Study
full_name: Grp, SYNaPS Study
last_name: Grp
citation:
ama: Cali E, Lin S-J, Rocca C, et al. A homozygous MED11 C-terminal variant causes
a lethal neurodegenerative disease. Genetics in Medicine. 2022;24(10):2194-2203.
doi:10.1016/j.gim.2022.07.013
apa: Cali, E., Lin, S.-J., Rocca, C., Sahin, Y., Al Shamsi, A., El Chehadeh, S.,
… Grp, Syn. S. (2022). A homozygous MED11 C-terminal variant causes a lethal neurodegenerative
disease. Genetics in Medicine. Elsevier. https://doi.org/10.1016/j.gim.2022.07.013
chicago: Cali, Elisa, Sheng-Jia Lin, Clarissa Rocca, Yavuz Sahin, Aisha Al Shamsi,
Salima El Chehadeh, Myriam Chaabouni, et al. “A Homozygous MED11 C-Terminal Variant
Causes a Lethal Neurodegenerative Disease.” Genetics in Medicine. Elsevier,
2022. https://doi.org/10.1016/j.gim.2022.07.013.
ieee: E. Cali et al., “A homozygous MED11 C-terminal variant causes a lethal
neurodegenerative disease,” Genetics in Medicine, vol. 24, no. 10. Elsevier,
pp. 2194–2203, 2022.
ista: Cali E, Lin S-J, Rocca C, Sahin Y, Al Shamsi A, El Chehadeh S, Chaabouni M,
Mankad K, Galanaki E, Efthymiou S, Sudhakar S, Athanasiou-Fragkouli A, Celik T,
Narli N, Bianca S, Murphy D, Moreira FMDC, Accogli A, Petree C, Huang K, Monastiri
K, Edizadeh M, Nardello R, Ognibene M, De Marco P, Ruggieri M, Zara F, Striano
P, Sahin Y, Al-Gazali L, Warde MTA, Gerard B, Zifarelli G, Beetz C, Fortuna S,
Soler M, Valente EM, Varshney G, Maroofian R, Salpietro V, Houlden H, Grp SynS.
2022. A homozygous MED11 C-terminal variant causes a lethal neurodegenerative
disease. Genetics in Medicine. 24(10), 2194–2203.
mla: Cali, Elisa, et al. “A Homozygous MED11 C-Terminal Variant Causes a Lethal
Neurodegenerative Disease.” Genetics in Medicine, vol. 24, no. 10, Elsevier,
2022, pp. 2194–203, doi:10.1016/j.gim.2022.07.013.
short: E. Cali, S.-J. Lin, C. Rocca, Y. Sahin, A. Al Shamsi, S. El Chehadeh, M.
Chaabouni, K. Mankad, E. Galanaki, S. Efthymiou, S. Sudhakar, A. Athanasiou-Fragkouli,
T. Celik, N. Narli, S. Bianca, D. Murphy, F.M.D.C. Moreira, A. Accogli, C. Petree,
K. Huang, K. Monastiri, M. Edizadeh, R. Nardello, M. Ognibene, P. De Marco, M.
Ruggieri, F. Zara, P. Striano, Y. Sahin, L. Al-Gazali, M.T.A. Warde, B. Gerard,
G. Zifarelli, C. Beetz, S. Fortuna, M. Soler, E.M. Valente, G. Varshney, R. Maroofian,
V. Salpietro, H. Houlden, Syn.S. Grp, Genetics in Medicine 24 (2022) 2194–2203.
date_created: 2023-09-20T20:57:18Z
date_published: 2022-10-01T00:00:00Z
date_updated: 2023-09-25T08:57:07Z
day: '01'
ddc:
- '570'
department:
- _id: GradSch
doi: 10.1016/j.gim.2022.07.013
extern: '1'
file:
- access_level: open_access
checksum: 8117175a89129eb5022d81ffe7625f9f
content_type: application/pdf
creator: dernst
date_created: 2023-09-25T08:56:06Z
date_updated: 2023-09-25T08:56:06Z
file_id: '14371'
file_name: 2022_GeneticsMedicine_Calin.pdf
file_size: 1434037
relation: main_file
success: 1
file_date_updated: 2023-09-25T08:56:06Z
has_accepted_license: '1'
intvolume: ' 24'
issue: '10'
keyword:
- Human mediator complex
- MED11
- MEDopathies
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 2194-2203
publication: Genetics in Medicine
publication_identifier:
issn:
- 1098-3600
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: A homozygous MED11 C-terminal variant causes a lethal neurodegenerative disease
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2022'
...
---
_id: '14381'
abstract:
- lang: eng
text: Expander graphs (sparse but highly connected graphs) have, since their inception,
been the source of deep links between Mathematics and Computer Science as well
as applications to other areas. In recent years, a fascinating theory of high-dimensional
expanders has begun to emerge, which is still in a formative stage but has nonetheless
already lead to a number of striking results. Unlike for graphs, in higher dimensions
there is a rich array of non-equivalent notions of expansion (coboundary expansion,
cosystolic expansion, topological expansion, spectral expansion, etc.), with differents
strengths and applications. In this talk, we will survey this landscape of high-dimensional
expansion, with a focus on two main results. First, we will present Gromov’s Topological
Overlap Theorem, which asserts that coboundary expansion (a quantitative version
of vanishing mod 2 cohomology) implies topological expansion (roughly, the property
that for every map from a simplicial complex to a manifold of the same dimension,
the images of a positive fraction of the simplices have a point in common). Second,
we will outline a construction of bounded degree 2-dimensional topological expanders,
due to Kaufman, Kazhdan, and Lubotzky.
article_processing_charge: No
article_type: original
author:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Wagner U. High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky,
and others). Bulletin de la Societe Mathematique de France. 2022;438:281-294.
doi:10.24033/ast.1188
apa: Wagner, U. (2022). High-dimensional expanders (after Gromov, Kaufman, Kazhdan,
Lubotzky, and others). Bulletin de La Societe Mathematique de France. Societe
Mathematique de France. https://doi.org/10.24033/ast.1188
chicago: Wagner, Uli. “High-Dimensional Expanders (after Gromov, Kaufman, Kazhdan,
Lubotzky, and Others).” Bulletin de La Societe Mathematique de France.
Societe Mathematique de France, 2022. https://doi.org/10.24033/ast.1188.
ieee: U. Wagner, “High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky,
and others),” Bulletin de la Societe Mathematique de France, vol. 438.
Societe Mathematique de France, pp. 281–294, 2022.
ista: Wagner U. 2022. High-dimensional expanders (after Gromov, Kaufman, Kazhdan,
Lubotzky, and others). Bulletin de la Societe Mathematique de France. 438, 281–294.
mla: Wagner, Uli. “High-Dimensional Expanders (after Gromov, Kaufman, Kazhdan, Lubotzky,
and Others).” Bulletin de La Societe Mathematique de France, vol. 438,
Societe Mathematique de France, 2022, pp. 281–94, doi:10.24033/ast.1188.
short: U. Wagner, Bulletin de La Societe Mathematique de France 438 (2022) 281–294.
date_created: 2023-10-01T22:01:14Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2023-10-03T08:04:03Z
day: '01'
department:
- _id: UlWa
doi: 10.24033/ast.1188
intvolume: ' 438'
language:
- iso: eng
month: '01'
oa_version: None
page: 281-294
publication: Bulletin de la Societe Mathematique de France
publication_identifier:
eissn:
- 2102-622X
issn:
- 0037-9484
publication_status: published
publisher: Societe Mathematique de France
quality_controlled: '1'
scopus_import: '1'
status: public
title: High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 438
year: '2022'
...
---
_id: '14437'
abstract:
- lang: eng
text: Future LEDs could be based on lead halide perovskites. A breakthrough in preparing
device-compatible solids composed of nanoscale perovskite crystals overcomes a
long-standing hurdle in making blue perovskite LEDs.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Hendrik
full_name: Utzat, Hendrik
last_name: Utzat
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: Utzat H, Ibáñez M. Molecular engineering enables bright blue LEDs. Nature.
2022;612(7941):638-639. doi:10.1038/d41586-022-04447-0
apa: Utzat, H., & Ibáñez, M. (2022). Molecular engineering enables bright blue
LEDs. Nature. Springer Nature. https://doi.org/10.1038/d41586-022-04447-0
chicago: Utzat, Hendrik, and Maria Ibáñez. “Molecular Engineering Enables Bright
Blue LEDs.” Nature. Springer Nature, 2022. https://doi.org/10.1038/d41586-022-04447-0.
ieee: H. Utzat and M. Ibáñez, “Molecular engineering enables bright blue LEDs,”
Nature, vol. 612, no. 7941. Springer Nature, pp. 638–639, 2022.
ista: Utzat H, Ibáñez M. 2022. Molecular engineering enables bright blue LEDs. Nature.
612(7941), 638–639.
mla: Utzat, Hendrik, and Maria Ibáñez. “Molecular Engineering Enables Bright Blue
LEDs.” Nature, vol. 612, no. 7941, Springer Nature, 2022, pp. 638–39, doi:10.1038/d41586-022-04447-0.
short: H. Utzat, M. Ibáñez, Nature 612 (2022) 638–639.
date_created: 2023-10-17T11:14:43Z
date_published: 2022-12-21T00:00:00Z
date_updated: 2023-10-18T06:26:30Z
day: '21'
department:
- _id: MaIb
doi: 10.1038/d41586-022-04447-0
external_id:
pmid:
- '36543947'
intvolume: ' 612'
issue: '7941'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '12'
oa_version: None
page: 638-639
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Molecular engineering enables bright blue LEDs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 612
year: '2022'
...
---
_id: '14520'
abstract:
- lang: eng
text: 'This dataset comprises all data shown in the figures of the submitted article
"Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor
surface losses" at arxiv.org/abs/2206.14104. Additional raw data are available
from the corresponding author on reasonable request.'
article_processing_charge: No
author:
- first_name: Martin
full_name: Zemlicka, Martin
id: 2DCF8DE6-F248-11E8-B48F-1D18A9856A87
last_name: Zemlicka
- first_name: Elena
full_name: Redchenko, Elena
id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87
last_name: Redchenko
- first_name: Matilda
full_name: Peruzzo, Matilda
id: 3F920B30-F248-11E8-B48F-1D18A9856A87
last_name: Peruzzo
orcid: 0000-0002-3415-4628
- first_name: Farid
full_name: Hassani, Farid
id: 2AED110C-F248-11E8-B48F-1D18A9856A87
last_name: Hassani
orcid: 0000-0001-6937-5773
- first_name: Andrea
full_name: Trioni, Andrea
id: 42F71B44-F248-11E8-B48F-1D18A9856A87
last_name: Trioni
- first_name: Shabir
full_name: Barzanjeh, Shabir
id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87
last_name: Barzanjeh
orcid: 0000-0003-0415-1423
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: 'Zemlicka M, Redchenko E, Peruzzo M, et al. Compact vacuum gap transmon qubits:
Selective and sensitive probes for superconductor surface losses. 2022. doi:10.5281/ZENODO.8408897'
apa: 'Zemlicka, M., Redchenko, E., Peruzzo, M., Hassani, F., Trioni, A., Barzanjeh,
S., & Fink, J. M. (2022). Compact vacuum gap transmon qubits: Selective and
sensitive probes for superconductor surface losses. Zenodo. https://doi.org/10.5281/ZENODO.8408897'
chicago: 'Zemlicka, Martin, Elena Redchenko, Matilda Peruzzo, Farid Hassani, Andrea
Trioni, Shabir Barzanjeh, and Johannes M Fink. “Compact Vacuum Gap Transmon Qubits:
Selective and Sensitive Probes for Superconductor Surface Losses.” Zenodo, 2022.
https://doi.org/10.5281/ZENODO.8408897.'
ieee: 'M. Zemlicka et al., “Compact vacuum gap transmon qubits: Selective
and sensitive probes for superconductor surface losses.” Zenodo, 2022.'
ista: 'Zemlicka M, Redchenko E, Peruzzo M, Hassani F, Trioni A, Barzanjeh S, Fink
JM. 2022. Compact vacuum gap transmon qubits: Selective and sensitive probes for
superconductor surface losses, Zenodo, 10.5281/ZENODO.8408897.'
mla: 'Zemlicka, Martin, et al. Compact Vacuum Gap Transmon Qubits: Selective
and Sensitive Probes for Superconductor Surface Losses. Zenodo, 2022, doi:10.5281/ZENODO.8408897.'
short: M. Zemlicka, E. Redchenko, M. Peruzzo, F. Hassani, A. Trioni, S. Barzanjeh,
J.M. Fink, (2022).
date_created: 2023-11-13T08:09:10Z
date_published: 2022-06-28T00:00:00Z
date_updated: 2024-09-10T12:23:57Z
day: '28'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.5281/ZENODO.8408897
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/ZENODO.8408897
month: '06'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '14517'
relation: used_in_publication
status: public
status: public
title: 'Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor
surface losses'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '14597'
abstract:
- lang: eng
text: "Phase-field models such as the Allen-Cahn equation may give rise to the formation
and evolution of geometric shapes, a phenomenon that may be analyzed rigorously
in suitable scaling regimes. In its sharp-interface limit, the vectorial Allen-Cahn
equation with a potential with N≥3 distinct minima has been conjectured to describe
the evolution of branched interfaces by multiphase mean curvature flow.\r\nIn
the present work, we give a rigorous proof for this statement in two and three
ambient dimensions and for a suitable class of potentials: As long as a strong
solution to multiphase mean curvature flow exists, solutions to the vectorial
Allen-Cahn equation with well-prepared initial data converge towards multiphase
mean curvature flow in the limit of vanishing interface width parameter ε↘0. We
even establish the rate of convergence O(ε1/2).\r\nOur approach is based on the
gradient flow structure of the Allen-Cahn equation and its limiting motion: Building
on the recent concept of \"gradient flow calibrations\" for multiphase mean curvature
flow, we introduce a notion of relative entropy for the vectorial Allen-Cahn equation
with multi-well potential. This enables us to overcome the limitations of other
approaches, e.g. avoiding the need for a stability analysis of the Allen-Cahn
operator or additional convergence hypotheses for the energy at positive times."
article_processing_charge: No
arxiv: 1
author:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Alice
full_name: Marveggio, Alice
id: 25647992-AA84-11E9-9D75-8427E6697425
last_name: Marveggio
citation:
ama: Fischer JL, Marveggio A. Quantitative convergence of the vectorial Allen-Cahn
equation towards multiphase mean curvature flow. arXiv. doi:10.48550/ARXIV.2203.17143
apa: Fischer, J. L., & Marveggio, A. (n.d.). Quantitative convergence of the
vectorial Allen-Cahn equation towards multiphase mean curvature flow. arXiv.
https://doi.org/10.48550/ARXIV.2203.17143
chicago: Fischer, Julian L, and Alice Marveggio. “Quantitative Convergence of the
Vectorial Allen-Cahn Equation towards Multiphase Mean Curvature Flow.” ArXiv,
n.d. https://doi.org/10.48550/ARXIV.2203.17143.
ieee: J. L. Fischer and A. Marveggio, “Quantitative convergence of the vectorial
Allen-Cahn equation towards multiphase mean curvature flow,” arXiv. .
ista: Fischer JL, Marveggio A. Quantitative convergence of the vectorial Allen-Cahn
equation towards multiphase mean curvature flow. arXiv, 10.48550/ARXIV.2203.17143.
mla: Fischer, Julian L., and Alice Marveggio. “Quantitative Convergence of the Vectorial
Allen-Cahn Equation towards Multiphase Mean Curvature Flow.” ArXiv, doi:10.48550/ARXIV.2203.17143.
short: J.L. Fischer, A. Marveggio, ArXiv (n.d.).
date_created: 2023-11-23T09:30:02Z
date_published: 2022-03-31T00:00:00Z
date_updated: 2023-11-30T13:25:02Z
day: '31'
department:
- _id: JuFi
doi: 10.48550/ARXIV.2203.17143
ec_funded: 1
external_id:
arxiv:
- '2203.17143'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2203.17143
month: '03'
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
related_material:
record:
- id: '14587'
relation: dissertation_contains
status: public
status: public
title: Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase
mean curvature flow
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2022'
...
---
_id: '14600'
abstract:
- lang: eng
text: We study the problem of learning controllers for discrete-time non-linear
stochastic dynamical systems with formal reach-avoid guarantees. This work presents
the first method for providing formal reach-avoid guarantees, which combine and
generalize stability and safety guarantees, with a tolerable probability threshold
$p\in[0,1]$ over the infinite time horizon. Our method leverages advances in machine
learning literature and it represents formal certificates as neural networks.
In particular, we learn a certificate in the form of a reach-avoid supermartingale
(RASM), a novel notion that we introduce in this work. Our RASMs provide reachability
and avoidance guarantees by imposing constraints on what can be viewed as a stochastic
extension of level sets of Lyapunov functions for deterministic systems. Our approach
solves several important problems -- it can be used to learn a control policy
from scratch, to verify a reach-avoid specification for a fixed control policy,
or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification.
We validate our approach on $3$ stochastic non-linear reinforcement learning tasks.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies
for stochastic systems with reach-avoid guarantees. arXiv. doi:10.48550/ARXIV.2210.05308
apa: Zikelic, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (n.d.). Learning
control policies for stochastic systems with reach-avoid guarantees. arXiv.
https://doi.org/10.48550/ARXIV.2210.05308
chicago: Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee.
“Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”
ArXiv, n.d. https://doi.org/10.48550/ARXIV.2210.05308.
ieee: D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control
policies for stochastic systems with reach-avoid guarantees,” arXiv. .
ista: Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies
for stochastic systems with reach-avoid guarantees. arXiv, 10.48550/ARXIV.2210.05308.
mla: Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with
Reach-Avoid Guarantees.” ArXiv, doi:10.48550/ARXIV.2210.05308.
short: D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).
date_created: 2023-11-24T13:10:09Z
date_published: 2022-11-29T00:00:00Z
date_updated: 2025-07-14T09:10:02Z
day: '29'
department:
- _id: KrCh
- _id: ToHe
doi: 10.48550/ARXIV.2210.05308
ec_funded: 1
external_id:
arxiv:
- '2210.05308'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-sa/4.0/
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2210.05308
month: '11'
oa: 1
oa_version: Preprint
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '14539'
relation: dissertation_contains
status: public
- id: '14830'
relation: later_version
status: public
status: public
title: Learning control policies for stochastic systems with reach-avoid guarantees
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-SA (4.0)
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2022'
...
---
_id: '14601'
abstract:
- lang: eng
text: "In this work, we address the problem of learning provably stable neural\r\nnetwork
policies for stochastic control systems. While recent work has\r\ndemonstrated
the feasibility of certifying given policies using martingale\r\ntheory, the problem
of how to learn such policies is little explored. Here, we\r\nstudy the effectiveness
of jointly learning a policy together with a martingale\r\ncertificate that proves
its stability using a single learning algorithm. We\r\nobserve that the joint
optimization problem becomes easily stuck in local\r\nminima when starting from
a randomly initialized policy. Our results suggest\r\nthat some form of pre-training
of the policy is required for the joint\r\noptimization to repair and verify the
policy successfully."
article_processing_charge: No
arxiv: 1
author:
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies
in stochastic control systems. arXiv. doi:10.48550/arXiv.2205.11991
apa: Zikelic, D., Lechner, M., Chatterjee, K., & Henzinger, T. A. (n.d.). Learning
stabilizing policies in stochastic control systems. arXiv. https://doi.org/10.48550/arXiv.2205.11991
chicago: Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger.
“Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, n.d.
https://doi.org/10.48550/arXiv.2205.11991.
ieee: D. Zikelic, M. Lechner, K. Chatterjee, and T. A. Henzinger, “Learning stabilizing
policies in stochastic control systems,” arXiv. .
ista: Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies
in stochastic control systems. arXiv, 10.48550/arXiv.2205.11991.
mla: Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control
Systems.” ArXiv, doi:10.48550/arXiv.2205.11991.
short: D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.).
date_created: 2023-11-24T13:22:30Z
date_published: 2022-05-24T00:00:00Z
date_updated: 2025-07-14T09:10:00Z
day: '24'
department:
- _id: KrCh
- _id: ToHe
doi: 10.48550/arXiv.2205.11991
ec_funded: 1
external_id:
arxiv:
- '2205.11991'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2205.11991
month: '05'
oa: 1
oa_version: Preprint
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '14539'
relation: dissertation_contains
status: public
status: public
title: Learning stabilizing policies in stochastic control systems
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2022'
...