---
_id: '9394'
abstract:
- lang: eng
text: 'Chromosomal inversions have long been recognized for their role in local
adaptation. By suppressing recombination in heterozygous individuals, they can
maintain coadapted gene complexes and protect them from homogenizing effects of
gene flow. However, to fully understand their importance for local adaptation
we need to know their influence on phenotypes under divergent selection. For this,
the marine snail Littorina saxatilis provides an ideal study system. Divergent
ecotypes adapted to wave action and crab predation occur in close proximity on
intertidal shores with gene flow between them. Here, we used F2 individuals obtained
from crosses between the ecotypes to test for associations between genomic regions
and traits distinguishing the Crab‐/Wave‐adapted ecotypes including size, shape,
shell thickness, and behavior. We show that most of these traits are influenced
by two previously detected inversion regions that are divergent between ecotypes.
We thus gain a better understanding of one important underlying mechanism responsible
for the rapid and repeated formation of ecotypes: divergent selection acting on
inversions. We also found that some inversions contributed to more than one trait
suggesting that they may contain several loci involved in adaptation, consistent
with the hypothesis that suppression of recombination within inversions facilitates
differentiation in the presence of gene flow.'
acknowledgement: 'We are very grateful to Irena Senčić for technical assistance and
to Michelle Kortyna and Sean Holland at the Center for Anchored Phylogenomics for
assistance with data collection. RKB was funded by the Natural Environment Research
Council and by the European Research Council. KJ was funded by the Swedish Research
Councils VR and Formas (Linnaeus Grant: 217‐2008‐1719). JL was funded by a studentship
from the Leverhulme Centre for Advanced Biological Modelling. AMW was funded by
the European Union''s Horizon 2020 research and innovation program under Marie Skłodowska‐Curie
Grant agreement no. 797747. RF was funded by the European Union''s Horizon 2020
research and innovation programme under the Marie Sklodowska‐Curie Grant agreement
No. 706376 and by FEDER Funds through the Operational Competitiveness Factors Program—COMPETE
and by National Funds through FCT—Foundation for Science and Technology within the
scope of the project “Hybrabbid” (PTDC/BIA‐EVL/30628/2017‐ POCI‐01‐0145‐FEDER‐030628).
We are grateful to other members of the Littorina research group for helpful discussions.
We thank Claire Mérot and an anonymous referee for insightful comments on an earlier
version. '
article_processing_charge: No
article_type: original
author:
- first_name: Eva L.
full_name: Koch, Eva L.
last_name: Koch
- first_name: Hernán E.
full_name: Morales, Hernán E.
last_name: Morales
- first_name: Jenny
full_name: Larsson, Jenny
last_name: Larsson
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Alan R.
full_name: Lemmon, Alan R.
last_name: Lemmon
- first_name: E. Moriarty
full_name: Lemmon, E. Moriarty
last_name: Lemmon
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: Koch EL, Morales HE, Larsson J, et al. Genetic variation for adaptive traits
is associated with polymorphic inversions in Littorina saxatilis. Evolution
Letters. 2021;5(3):196-213. doi:10.1002/evl3.227
apa: Koch, E. L., Morales, H. E., Larsson, J., Westram, A. M., Faria, R., Lemmon,
A. R., … Butlin, R. K. (2021). Genetic variation for adaptive traits is associated
with polymorphic inversions in Littorina saxatilis. Evolution Letters.
Wiley. https://doi.org/10.1002/evl3.227
chicago: Koch, Eva L., Hernán E. Morales, Jenny Larsson, Anja M Westram, Rui Faria,
Alan R. Lemmon, E. Moriarty Lemmon, Kerstin Johannesson, and Roger K. Butlin.
“Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions
in Littorina Saxatilis.” Evolution Letters. Wiley, 2021. https://doi.org/10.1002/evl3.227.
ieee: E. L. Koch et al., “Genetic variation for adaptive traits is associated
with polymorphic inversions in Littorina saxatilis,” Evolution Letters,
vol. 5, no. 3. Wiley, pp. 196–213, 2021.
ista: Koch EL, Morales HE, Larsson J, Westram AM, Faria R, Lemmon AR, Lemmon EM,
Johannesson K, Butlin RK. 2021. Genetic variation for adaptive traits is associated
with polymorphic inversions in Littorina saxatilis. Evolution Letters. 5(3), 196–213.
mla: Koch, Eva L., et al. “Genetic Variation for Adaptive Traits Is Associated with
Polymorphic Inversions in Littorina Saxatilis.” Evolution Letters, vol.
5, no. 3, Wiley, 2021, pp. 196–213, doi:10.1002/evl3.227.
short: E.L. Koch, H.E. Morales, J. Larsson, A.M. Westram, R. Faria, A.R. Lemmon,
E.M. Lemmon, K. Johannesson, R.K. Butlin, Evolution Letters 5 (2021) 196–213.
date_created: 2021-05-16T22:01:47Z
date_published: 2021-05-07T00:00:00Z
date_updated: 2026-04-07T14:01:29Z
day: '07'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1002/evl3.227
ec_funded: 1
external_id:
isi:
- '000647846200001'
file:
- access_level: open_access
checksum: 023b1608e311f0fda30593ba3d0a4e0b
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-15T08:26:02Z
date_updated: 2021-10-15T08:26:02Z
file_id: '10142'
file_name: 2021_EvolutionLetters_Koch.pdf
file_size: 3021108
relation: main_file
success: 1
file_date_updated: 2021-10-15T08:26:02Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
issue: '3'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 196-213
project:
- _id: 265B41B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '797747'
name: Theoretical and empirical approaches to understanding Parallel Adaptation
publication: Evolution Letters
publication_identifier:
eissn:
- 2056-3744
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '12987'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Genetic variation for adaptive traits is associated with polymorphic inversions
in Littorina saxatilis
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: 5
year: '2021'
...
---
OA_place: publisher
_id: '12987'
abstract:
- lang: eng
text: Chromosomal inversion polymorphisms, segments of chromosomes that are flipped
in orientation and occur in reversed order in some individuals, have long been
recognized to play an important role in local adaptation. They can reduce recombination
in heterozygous individuals and thus help to maintain sets of locally adapted
alleles. In a wide range of organisms, populations adapted to different habitats
differ in frequency of inversion arrangements. However, getting a full understanding
of the importance of inversions for adaptation requires confirmation of their
influence on traits under divergent selection. Here, we studied a marine snail,
Littorina saxatilis, that has evolved ecotypes adapted to wave exposure or crab
predation. These two types occur in close proximity on different parts of the
shore. Gene flow between them exists in contact zones. However, they exhibit strong
phenotypic divergence in several traits under habitat-specific selection, including
size, shape and behaviour. We used crosses between these ecotypes to identify
genomic regions that explain variation in these traits by using QTL analysis and
variance partitioning across linkage groups. We could show that previously detected
inversion regions contribute to adaptive divergence. Some inversions influenced
multiple traits suggesting that they contain sets of locally adaptive alleles.
Our study also identified regions without known inversions that are important
for phenotypic divergence. Thus, we provide a more complete overview of the importance
of inversions in relation to the remaining genome.
article_processing_charge: No
author:
- first_name: Eva
full_name: Koch, Eva
last_name: Koch
- first_name: Hernán E.
full_name: Morales, Hernán E.
last_name: Morales
- first_name: Jenny
full_name: Larsson, Jenny
last_name: Larsson
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Alan R.
full_name: Lemmon, Alan R.
last_name: Lemmon
- first_name: E. Moriarty
full_name: Lemmon, E. Moriarty
last_name: Lemmon
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: 'Koch E, Morales HE, Larsson J, et al. Data from: Genetic variation for adaptive
traits is associated with polymorphic inversions in Littorina saxatilis. 2021.
doi:10.5061/DRYAD.ZGMSBCCB4'
apa: 'Koch, E., Morales, H. E., Larsson, J., Westram, A. M., Faria, R., Lemmon,
A. R., … Butlin, R. K. (2021). Data from: Genetic variation for adaptive traits
is associated with polymorphic inversions in Littorina saxatilis. Dryad. https://doi.org/10.5061/DRYAD.ZGMSBCCB4'
chicago: 'Koch, Eva, Hernán E. Morales, Jenny Larsson, Anja M Westram, Rui Faria,
Alan R. Lemmon, E. Moriarty Lemmon, Kerstin Johannesson, and Roger K. Butlin.
“Data from: Genetic Variation for Adaptive Traits Is Associated with Polymorphic
Inversions in Littorina Saxatilis.” Dryad, 2021. https://doi.org/10.5061/DRYAD.ZGMSBCCB4.'
ieee: 'E. Koch et al., “Data from: Genetic variation for adaptive traits
is associated with polymorphic inversions in Littorina saxatilis.” Dryad, 2021.'
ista: 'Koch E, Morales HE, Larsson J, Westram AM, Faria R, Lemmon AR, Lemmon EM,
Johannesson K, Butlin RK. 2021. Data from: Genetic variation for adaptive traits
is associated with polymorphic inversions in Littorina saxatilis, Dryad, 10.5061/DRYAD.ZGMSBCCB4.'
mla: 'Koch, Eva, et al. Data from: Genetic Variation for Adaptive Traits Is Associated
with Polymorphic Inversions in Littorina Saxatilis. Dryad, 2021, doi:10.5061/DRYAD.ZGMSBCCB4.'
short: E. Koch, H.E. Morales, J. Larsson, A.M. Westram, R. Faria, A.R. Lemmon, E.M.
Lemmon, K. Johannesson, R.K. Butlin, (2021).
date_created: 2023-05-16T12:34:09Z
date_published: 2021-04-10T00:00:00Z
date_updated: 2026-04-07T14:01:30Z
day: '10'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.5061/DRYAD.ZGMSBCCB4
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.zgmsbccb4
month: '04'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '9394'
relation: used_in_publication
status: public
status: public
title: 'Data from: Genetic variation for adaptive traits is associated with polymorphic
inversions in Littorina saxatilis'
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2021'
...
---
_id: '9350'
abstract:
- lang: eng
text: Intercellular adhesion is the key to multicellularity, and its malfunction
plays an important role in various developmental and disease-related processes.
Although it has been intensively studied by both biologists and physicists, a
commonly accepted definition of cell-cell adhesion is still being debated. Cell-cell
adhesion has been described at the molecular scale as a function of adhesion receptors
controlling binding affinity, at the cellular scale as resistance to detachment
forces or modulation of surface tension, and at the tissue scale as a regulator
of cellular rearrangements and morphogenesis. In this review, we aim to summarize
and discuss recent advances in the molecular, cellular, and theoretical description
of cell-cell adhesion, ranging from biomimetic models to the complexity of cells
and tissues in an organismal context. In particular, we will focus on cadherin-mediated
cell-cell adhesion and the role of adhesion signaling and mechanosensation therein,
two processes central for understanding the biological and physical basis of cell-cell
adhesion.
acknowledgement: T.S. acknowledges funding by the research program “The Active Matter
Physics of Collective Metastasis,” which is financed by the Dutch Research Council
(NWO).
article_processing_charge: No
article_type: original
author:
- first_name: Feyza N
full_name: Arslan, Feyza N
id: 49DA7910-F248-11E8-B48F-1D18A9856A87
last_name: Arslan
orcid: 0000-0001-5809-9566
- first_name: Julia
full_name: Eckert, Julia
last_name: Eckert
- first_name: Thomas
full_name: Schmidt, Thomas
last_name: Schmidt
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: 'Arslan FN, Eckert J, Schmidt T, Heisenberg C-PJ. Holding it together: when
cadherin meets cadherin. Biophysical Journal. 2021;120:4182-4192. doi:10.1016/j.bpj.2021.03.025'
apa: 'Arslan, F. N., Eckert, J., Schmidt, T., & Heisenberg, C.-P. J. (2021).
Holding it together: when cadherin meets cadherin. Biophysical Journal.
Biophysical Society. https://doi.org/10.1016/j.bpj.2021.03.025'
chicago: 'Arslan, Feyza N, Julia Eckert, Thomas Schmidt, and Carl-Philipp J Heisenberg.
“Holding It Together: When Cadherin Meets Cadherin.” Biophysical Journal.
Biophysical Society, 2021. https://doi.org/10.1016/j.bpj.2021.03.025.'
ieee: 'F. N. Arslan, J. Eckert, T. Schmidt, and C.-P. J. Heisenberg, “Holding it
together: when cadherin meets cadherin,” Biophysical Journal, vol. 120.
Biophysical Society, pp. 4182–4192, 2021.'
ista: 'Arslan FN, Eckert J, Schmidt T, Heisenberg C-PJ. 2021. Holding it together:
when cadherin meets cadherin. Biophysical Journal. 120, 4182–4192.'
mla: 'Arslan, Feyza N., et al. “Holding It Together: When Cadherin Meets Cadherin.”
Biophysical Journal, vol. 120, Biophysical Society, 2021, pp. 4182–92,
doi:10.1016/j.bpj.2021.03.025.'
short: F.N. Arslan, J. Eckert, T. Schmidt, C.-P.J. Heisenberg, Biophysical Journal
120 (2021) 4182–4192.
corr_author: '1'
date_created: 2021-04-25T22:01:30Z
date_published: 2021-10-05T00:00:00Z
date_updated: 2026-04-07T14:13:19Z
day: '05'
department:
- _id: CaHe
doi: 10.1016/j.bpj.2021.03.025
external_id:
isi:
- '000704646900006'
pmid:
- '33794149'
intvolume: ' 120'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://scholarlypublications.universiteitleiden.nl/access/item%3A3251048/view
month: '10'
oa: 1
oa_version: Published Version
page: 4182-4192
pmid: 1
publication: Biophysical Journal
publication_identifier:
eissn:
- 1542-0086
issn:
- 0006-3495
publication_status: published
publisher: Biophysical Society
quality_controlled: '1'
related_material:
record:
- id: '12368'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Holding it together: when cadherin meets cadherin'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 120
year: '2021'
...
---
_id: '12077'
abstract:
- lang: eng
text: "We compare the Manin-type conjecture for Campana points recently formulated\r\nby
Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado with an alternative\r\nprediction
of Browning and Van Valckenborgh in the special case of the orbifold\r\n$(\\mathbb{P}^1,D)$,
where $D =\\frac{1}{2}[0]+\\frac{1}{2}[1]+\\frac{1}{2}[\\infty]$. We find that
the two predicted leading constants do not agree, and we discuss whether thin
sets\r\ncould explain this discrepancy. Motivated by this, we provide a counterexample\r\nto
the Manin-type conjecture for Campana points, by considering orbifolds\r\ncorresponding
to squareful values of binary quadratic forms."
acknowledgement: The author would like to thank Damaris Schindler and Florian Wilsch
for their helpful comments on the heights and Tamagawa measures used in Section
3, together with Marta Pieropan, Sho Tanimoto and Sam Streeter for providing valuable
feedback on an earlier version of this paper, and Tim Browning for many useful comments
and discussions during the development of this work. The author is also grateful
to the anonymous referee for providing many valuable comments and suggestions that
improved the quality of the paper.
article_number: '2104.14946'
article_processing_charge: No
arxiv: 1
author:
- first_name: Alec L
full_name: Shute, Alec L
id: 440EB050-F248-11E8-B48F-1D18A9856A87
last_name: Shute
orcid: 0000-0002-1812-2810
citation:
ama: Shute AL. On the leading constant in the Manin-type conjecture for Campana
points. arXiv. doi:10.48550/arXiv.2104.14946
apa: Shute, A. L. (n.d.). On the leading constant in the Manin-type conjecture for
Campana points. arXiv. https://doi.org/10.48550/arXiv.2104.14946
chicago: Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for
Campana Points.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2104.14946.
ieee: A. L. Shute, “On the leading constant in the Manin-type conjecture for Campana
points,” arXiv. .
ista: Shute AL. On the leading constant in the Manin-type conjecture for Campana
points. arXiv, 2104.14946.
mla: Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana
Points.” ArXiv, 2104.14946, doi:10.48550/arXiv.2104.14946.
short: A.L. Shute, ArXiv (n.d.).
corr_author: '1'
date_created: 2022-09-09T10:43:17Z
date_published: 2021-04-30T00:00:00Z
date_updated: 2026-04-07T14:13:35Z
day: '30'
department:
- _id: TiBr
doi: 10.48550/arXiv.2104.14946
external_id:
arxiv:
- '2104.14946'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2104.14946
month: '04'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '17058'
relation: later_version
status: public
- id: '12072'
relation: dissertation_contains
status: public
status: public
title: On the leading constant in the Manin-type conjecture for Campana points
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '12076'
abstract:
- lang: eng
text: We find an asymptotic formula for the number of primitive vectors $(z_1,\ldots,z_4)\in
(\mathbb{Z}_{\neq 0})^4$ such that $z_1,\ldots, z_4$ are all squareful and bounded
by $B$, and $z_1+\cdots + z_4 = 0$. Our result agrees in the power of $B$ and
$\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and V\'{a}rilly-Alvarado.
article_number: '2104.06966'
article_processing_charge: No
arxiv: 1
author:
- first_name: Alec L
full_name: Shute, Alec L
id: 440EB050-F248-11E8-B48F-1D18A9856A87
last_name: Shute
orcid: 0000-0002-1812-2810
citation:
ama: Shute AL. Sums of four squareful numbers. arXiv. doi:10.48550/arXiv.2104.06966
apa: Shute, A. L. (n.d.). Sums of four squareful numbers. arXiv. https://doi.org/10.48550/arXiv.2104.06966
chicago: Shute, Alec L. “Sums of Four Squareful Numbers.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2104.06966.
ieee: A. L. Shute, “Sums of four squareful numbers,” arXiv. .
ista: Shute AL. Sums of four squareful numbers. arXiv, 2104.06966.
mla: Shute, Alec L. “Sums of Four Squareful Numbers.” ArXiv, 2104.06966,
doi:10.48550/arXiv.2104.06966.
short: A.L. Shute, ArXiv (n.d.).
corr_author: '1'
date_created: 2022-09-09T10:42:51Z
date_published: 2021-04-15T00:00:00Z
date_updated: 2026-04-07T14:13:35Z
day: '15'
department:
- _id: TiBr
doi: 10.48550/arXiv.2104.06966
external_id:
arxiv:
- '2104.06966'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2104.06966
month: '04'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '12072'
relation: dissertation_contains
status: public
status: public
title: Sums of four squareful numbers
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10803'
abstract:
- lang: eng
text: Given the abundance of applications of ranking in recent years, addressing
fairness concerns around automated ranking systems becomes necessary for increasing
the trust among end-users. Previous work on fair ranking has mostly focused on
application-specific fairness notions, often tailored to online advertising, and
it rarely considers learning as part of the process. In this work, we show how
to transfer numerous fairness notions from binary classification to a learning
to rank setting. Our formalism allows us to design methods for incorporating fairness
objectives with provable generalization guarantees. An extensive experimental
evaluation shows that our method can improve ranking fairness substantially with
no or only little loss of model quality.
article_number: '2102.05996'
article_processing_charge: No
arxiv: 1
author:
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
orcid: 0009-0009-5204-7621
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0002-4561-241X
citation:
ama: Konstantinov NH, Lampert C. Fairness through regularization for learning to
rank. arXiv. doi:10.48550/arXiv.2102.05996
apa: Konstantinov, N. H., & Lampert, C. (n.d.). Fairness through regularization
for learning to rank. arXiv. https://doi.org/10.48550/arXiv.2102.05996
chicago: Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization
for Learning to Rank.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2102.05996.
ieee: N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning
to rank,” arXiv. .
ista: Konstantinov NH, Lampert C. Fairness through regularization for learning to
rank. arXiv, 2102.05996.
mla: Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization
for Learning to Rank.” ArXiv, 2102.05996, doi:10.48550/arXiv.2102.05996.
short: N.H. Konstantinov, C. Lampert, ArXiv (n.d.).
corr_author: '1'
date_created: 2022-02-28T14:13:59Z
date_published: 2021-06-07T00:00:00Z
date_updated: 2026-04-07T14:19:48Z
day: '07'
department:
- _id: ChLa
doi: 10.48550/arXiv.2102.05996
external_id:
arxiv:
- '2102.05996'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2102.05996
month: '06'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '10799'
relation: dissertation_contains
status: public
status: public
title: Fairness through regularization for learning to rank
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10762'
abstract:
- lang: eng
text: Methods inspired from machine learning have recently attracted great interest
in the computational study of quantum many-particle systems. So far, however,
it has proven challenging to deal with microscopic models in which the total number
of particles is not conserved. To address this issue, we propose a new variant
of neural network states, which we term neural coherent states. Taking the Fröhlich
impurity model as a case study, we show that neural coherent states can learn
the ground state of non-additive systems very well. In particular, we observe
substantial improvement over the standard coherent state estimates in the most
challenging intermediate coupling regime. Our approach is generic and does not
assume specific details of the system, suggesting wide applications.
acknowledgement: "We acknowledge fruitful discussions with Giacomo Bighin, Giammarco
Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages
of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy
of Sciences and has received funding from the EU Horizon 2020 programme under the
Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support
by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This
work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy
research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences,
FOM and STW."
article_processing_charge: No
arxiv: 1
author:
- first_name: Wojciech
full_name: Rzadkowski, Wojciech
id: 48C55298-F248-11E8-B48F-1D18A9856A87
last_name: Rzadkowski
orcid: 0000-0002-1106-4419
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Johan H.
full_name: Mentink, Johan H.
last_name: Mentink
citation:
ama: Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for
non-additive systems. arXiv. doi:10.48550/arXiv.2105.15193
apa: Rzadkowski, W., Lemeshko, M., & Mentink, J. H. (n.d.). Artificial neural
network states for non-additive systems. arXiv. https://doi.org/10.48550/arXiv.2105.15193
chicago: Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial
Neural Network States for Non-Additive Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2105.15193.
ieee: W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network
states for non-additive systems,” arXiv. .
ista: Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for
non-additive systems. arXiv, 10.48550/arXiv.2105.15193.
mla: Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive
Systems.” ArXiv, doi:10.48550/arXiv.2105.15193.
short: W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).
corr_author: '1'
date_created: 2022-02-17T11:18:57Z
date_published: 2021-05-31T00:00:00Z
date_updated: 2026-04-07T14:20:12Z
day: '31'
department:
- _id: MiLe
doi: 10.48550/arXiv.2105.15193
ec_funded: 1
external_id:
arxiv:
- '2105.15193'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2105.15193
month: '05'
oa: 1
oa_version: Preprint
page: '2105.15193'
project:
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: arXiv
publication_status: draft
related_material:
record:
- id: '10759'
relation: dissertation_contains
status: public
status: public
title: Artificial neural network states for non-additive systems
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10665'
abstract:
- lang: eng
text: "Formal verification of neural networks is an active topic of research, and
recent advances have significantly increased the size of the networks that verification
tools can handle. However, most methods are designed for verification of an idealized
model of the actual network which works over real arithmetic and ignores rounding
imprecisions. This idealization is in stark contrast to network quantization,
which is a technique that trades numerical precision for computational efficiency
and is, therefore, often applied in practice. Neglecting rounding errors of such
low-bit quantized neural networks has been shown to lead to wrong conclusions
about the network’s correctness. Thus, the desired approach for verifying quantized
neural networks would be one that takes these rounding errors\r\ninto account.
In this paper, we show that verifying the bitexact implementation of quantized
neural networks with bitvector specifications is PSPACE-hard, even though verifying
idealized real-valued networks and satisfiability of bit-vector specifications
alone are each in NP. Furthermore, we explore several practical heuristics toward
closing the complexity gap between idealized and bit-exact verification. In particular,
we propose three techniques for making SMT-based verification of quantized neural
networks more scalable. Our experiments demonstrate that our proposed methods
allow a speedup of up to three orders of magnitude over existing approaches."
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt),
and the European Union’s Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n"
alternative_title:
- Technical Tracks
article_processing_charge: No
arxiv: 1
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural
networks. In: Proceedings of the AAAI Conference on Artificial Intelligence.
Vol 35. AAAI Press; 2021:3787-3795.'
apa: 'Henzinger, T. A., Lechner, M., & Zikelic, D. (2021). Scalable verification
of quantized neural networks. In Proceedings of the AAAI Conference on Artificial
Intelligence (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.'
chicago: Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification
of Quantized Neural Networks.” In Proceedings of the AAAI Conference on Artificial
Intelligence, 35:3787–95. AAAI Press, 2021.
ieee: T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized
neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence,
Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.
ista: 'Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized
neural networks. Proceedings of the AAAI Conference on Artificial Intelligence.
AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks,
vol. 35, 3787–3795.'
mla: Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.”
Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35,
no. 5A, AAAI Press, 2021, pp. 3787–95.
short: T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference
on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
corr_author: '1'
date_created: 2022-01-25T15:15:02Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2026-04-07T14:21:58Z
day: '28'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
ec_funded: 1
external_id:
arxiv:
- '2012.08185'
file:
- access_level: open_access
checksum: 2bc8155b2526a70fba5b7301bc89dbd1
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:41:16Z
date_updated: 2022-01-26T07:41:16Z
file_id: '10684'
file_name: 16496-Article Text-19990-1-2-20210518 (1).pdf
file_size: 137235
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:41:16Z
has_accepted_license: '1'
intvolume: ' 35'
issue: 5A
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/16496
month: '05'
oa: 1
oa_version: Published Version
page: 3787-3795
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- 978-1-57735-866-4
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Scalable verification of quantized neural networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10667'
abstract:
- lang: eng
text: Bayesian neural networks (BNNs) place distributions over the weights of a
neural network to model uncertainty in the data and the network's prediction.
We consider the problem of verifying safety when running a Bayesian neural network
policy in a feedback loop with infinite time horizon systems. Compared to the
existing sampling-based approaches, which are inapplicable to the infinite time
horizon setting, we train a separate deterministic neural network that serves
as an infinite time horizon safety certificate. In particular, we show that the
certificate network guarantees the safety of the system over a subset of the BNN
weight posterior's support. Our method first computes a safe weight set and then
alters the BNN's weight posterior to reject samples outside this set. Moreover,
we show how to extend our approach to a safe-exploration reinforcement learning
setting, in order to avoid unsafe trajectories during the training of the policy.
We evaluate our approach on a series of reinforcement learning benchmarks, including
non-Lyapunovian safety specifications.
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and
the European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie Grant Agreement No. 665385.
alternative_title:
- ' Advances in Neural Information Processing Systems'
article_processing_charge: No
arxiv: 1
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ðorđe
full_name: Žikelić, Ðorđe
last_name: Žikelić
- 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: 'Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety
of Bayesian neural networks. In: 35th Conference on Neural Information Processing
Systems. ; 2021. doi:10.48550/arXiv.2111.03165'
apa: Lechner, M., Žikelić, Ð., Chatterjee, K., & Henzinger, T. A. (2021). Infinite
time horizon safety of Bayesian neural networks. In 35th Conference on Neural
Information Processing Systems. Virtual. https://doi.org/10.48550/arXiv.2111.03165
chicago: Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger.
“Infinite Time Horizon Safety of Bayesian Neural Networks.” In 35th Conference
on Neural Information Processing Systems, 2021. https://doi.org/10.48550/arXiv.2111.03165.
ieee: M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time
horizon safety of Bayesian neural networks,” in 35th Conference on Neural Information
Processing Systems, Virtual, 2021.
ista: 'Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon
safety of Bayesian neural networks. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, .'
mla: Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.”
35th Conference on Neural Information Processing Systems, 2021, doi:10.48550/arXiv.2111.03165.
short: M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference
on Neural Information Processing Systems, 2021.
conference:
end_date: 2021-12-10
location: Virtual
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
corr_author: '1'
date_created: 2022-01-25T15:45:58Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2026-04-07T14:21:58Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
- _id: KrCh
doi: 10.48550/arXiv.2111.03165
ec_funded: 1
external_id:
arxiv:
- '2111.03165'
file:
- access_level: open_access
checksum: 0fc0f852525c10dda9cc9ffea07fb4e4
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:39:59Z
date_updated: 2022-01-26T07:39:59Z
file_id: '10682'
file_name: infinite_time_horizon_safety_o.pdf
file_size: 452492
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:39:59Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: 35th Conference on Neural Information Processing Systems
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
status: public
title: Infinite time horizon safety of Bayesian neural networks
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
OA_place: repository
OA_type: green
_id: '10666'
abstract:
- lang: eng
text: Adversarial training is an effective method to train deep learning models
that are resilient to norm-bounded perturbations, with the cost of nominal performance
drop. While adversarial training appears to enhance the robustness and safety
of a deep model deployed in open-world decision-critical applications, counterintuitively,
it induces undesired behaviors in robot learning settings. In this paper, we show
theoretically and experimentally that neural controllers obtained via adversarial
training are subjected to three types of defects, namely transient, systematic,
and conditional errors. We first generalize adversarial training to a safety-domain
optimization scheme allowing for more generic specifications. We then prove that
such a learning process tends to cause certain error profiles. We support our
theoretical results by a thorough experimental safety analysis in a robot-learning
task. Our results suggest that adversarial training is not yet ready for robot
learning.
acknowledgement: M.L. and T.A.H. are supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by
Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).
article_processing_charge: No
arxiv: 1
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- 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: 'Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is
not ready for robot learning. In: 2021 IEEE International Conference on Robotics
and Automation. ICRA. ; 2021:4140-4147. doi:10.1109/ICRA48506.2021.9561036'
apa: Lechner, M., Hasani, R., Grosu, R., Rus, D., & Henzinger, T. A. (2021).
Adversarial training is not ready for robot learning. In 2021 IEEE International
Conference on Robotics and Automation (pp. 4140–4147). Xi’an, China. https://doi.org/10.1109/ICRA48506.2021.9561036
chicago: Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger.
“Adversarial Training Is Not Ready for Robot Learning.” In 2021 IEEE International
Conference on Robotics and Automation, 4140–47. ICRA, 2021. https://doi.org/10.1109/ICRA48506.2021.9561036.
ieee: M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial
training is not ready for robot learning,” in 2021 IEEE International Conference
on Robotics and Automation, Xi’an, China, 2021, pp. 4140–4147.
ista: 'Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training
is not ready for robot learning. 2021 IEEE International Conference on Robotics
and Automation. ICRA: International Conference on Robotics and AutomationICRA,
4140–4147.'
mla: Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.”
2021 IEEE International Conference on Robotics and Automation, 2021, pp.
4140–47, doi:10.1109/ICRA48506.2021.9561036.
short: M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International
Conference on Robotics and Automation, 2021, pp. 4140–4147.
conference:
end_date: 2021-06-05
location: Xi'an, China
name: 'ICRA: International Conference on Robotics and Automation'
start_date: 2021-05-30
date_created: 2022-01-25T15:44:54Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2026-04-07T14:21:58Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1109/ICRA48506.2021.9561036
external_id:
arxiv:
- '2103.08187'
isi:
- '000765738803040'
has_accepted_license: '1'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2103.08187
month: '06'
oa: 1
oa_version: Preprint
page: 4140-4147
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: 2021 IEEE International Conference on Robotics and Automation
publication_identifier:
eisbn:
- 978-1-7281-9077-8
eissn:
- 2577-087X
isbn:
- 978-1-7281-9078-5
issn:
- 1050-4729
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
scopus_import: '1'
series_title: ICRA
status: public
title: Adversarial training is not ready for robot learning
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
OA_place: publisher
_id: '9022'
abstract:
- lang: eng
text: "In the first part of the thesis we consider Hermitian random matrices. Firstly,
we consider sample covariance matrices XX∗ with X having independent identically
distributed (i.i.d.) centred entries. We prove a Central Limit Theorem for differences
of linear statistics of XX∗ and its minor after removing the first column of X.
Secondly, we consider Wigner-type matrices and prove that the eigenvalue statistics
near cusp singularities of the limiting density of states are universal and that
they form a Pearcey process. Since the limiting eigenvalue distribution admits
only square root (edge) and cubic root (cusp) singularities, this concludes the
third and last remaining case of the Wigner-Dyson-Mehta universality conjecture.
The main technical ingredients are an optimal local law at the cusp, and the proof
of the fast relaxation to equilibrium of the Dyson Brownian motion in the cusp
regime.\r\nIn the second part we consider non-Hermitian matrices X with centred
i.i.d. entries. We normalise the entries of X to have variance N −1. It is well
known that the empirical eigenvalue density converges to the uniform distribution
on the unit disk (circular law). In the first project, we prove universality of
the local eigenvalue statistics close to the edge of the spectrum. This is the
non-Hermitian analogue of the TracyWidom universality at the Hermitian edge. Technically
we analyse the evolution of the spectral distribution of X along the Ornstein-Uhlenbeck
flow for very long time\r\n(up to t = +∞). In the second project, we consider
linear statistics of eigenvalues for macroscopic test functions f in the Sobolev
space H2+ϵ and prove their convergence to the projection of the Gaussian Free
Field on the unit disk. We prove this result for non-Hermitian matrices with real
or complex entries. The main technical ingredients are: (i) local law for products
of two resolvents at different spectral parameters, (ii) analysis of correlated
Dyson Brownian motions.\r\nIn the third and final part we discuss the mathematically
rigorous application of supersymmetric techniques (SUSY ) to give a lower tail
estimate of the lowest singular value of X − z, with z ∈ C. More precisely, we
use superbosonisation formula to give an integral representation of the resolvent
of (X − z)(X − z)∗ which reduces to two and three contour integrals in the complex
and real case, respectively. The rigorous analysis of these integrals is quite
challenging since simple saddle point analysis cannot be applied (the main contribution
comes from a non-trivial manifold). Our result\r\nimproves classical smoothing
inequalities in the regime |z| ≈ 1; this result is essential to prove edge universality
for i.i.d. non-Hermitian matrices."
acknowledgement: I gratefully acknowledge the financial support from the European
Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No. 665385 and my advisor’s ERC Advanced Grant No. 338804.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
citation:
ama: Cipolloni G. Fluctuations in the spectrum of random matrices. 2021. doi:10.15479/AT:ISTA:9022
apa: Cipolloni, G. (2021). Fluctuations in the spectrum of random matrices.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9022
chicago: Cipolloni, Giorgio. “Fluctuations in the Spectrum of Random Matrices.”
Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9022.
ieee: G. Cipolloni, “Fluctuations in the spectrum of random matrices,” Institute
of Science and Technology Austria, 2021.
ista: Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute
of Science and Technology Austria.
mla: Cipolloni, Giorgio. Fluctuations in the Spectrum of Random Matrices.
Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9022.
short: G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute
of Science and Technology Austria, 2021.
corr_author: '1'
date_created: 2021-01-21T18:16:54Z
date_published: 2021-01-25T00:00:00Z
date_updated: 2026-04-08T06:59:33Z
day: '25'
ddc:
- '510'
degree_awarded: PhD
department:
- _id: GradSch
- _id: LaEr
doi: 10.15479/AT:ISTA:9022
ec_funded: 1
file:
- access_level: open_access
checksum: 5a93658a5f19478372523ee232887e2b
content_type: application/pdf
creator: gcipollo
date_created: 2021-01-25T14:19:03Z
date_updated: 2021-01-25T14:19:03Z
file_id: '9043'
file_name: thesis.pdf
file_size: 4127796
relation: main_file
success: 1
- access_level: closed
checksum: e8270eddfe6a988e92a53c88d1d19b8c
content_type: application/zip
creator: gcipollo
date_created: 2021-01-25T14:19:10Z
date_updated: 2021-01-25T14:19:10Z
file_id: '9044'
file_name: Thesis_files.zip
file_size: 12775206
relation: source_file
file_date_updated: 2021-01-25T14:19:10Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '380'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
title: Fluctuations in the spectrum of random matrices
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2021'
...
---
OA_place: publisher
_id: '10422'
abstract:
- lang: eng
text: Those who aim to devise new materials with desirable properties usually examine
present methods first. However, they will find out that some approaches can exist
only conceptually without high chances to become practically useful. It seems
that a numerical technique called automatic differentiation together with increasing
supply of computational accelerators will soon shift many methods of the material
design from the category ”unimaginable” to the category ”expensive but possible”.
Approach we suggest is not an exception. Our overall goal is to have an efficient
and generalizable approach allowing to solve inverse design problems. In this
thesis we scratch its surface. We consider jammed systems of identical particles.
And ask ourselves how the shape of those particles (or the parameters codifying
it) may affect mechanical properties of the system. An indispensable part of reaching
the answer is an appropriate particle parametrization. We come up with a simple,
yet generalizable and purposeful scheme for it. Using our generalizable shape
parameterization, we simulate the formation of a solid composed of pentagonal-like
particles and measure anisotropy in the resulting elastic response. Through automatic
differentiation techniques, we directly connect the shape parameters with the
elastic response. Interestingly, for our system we find that less isotropic particles
lead to a more isotropic elastic response. Together with other results known about
our method it seems that it can be successfully generalized for different inverse
design problems.
alternative_title:
- ISTA Master's Thesis
article_processing_charge: No
author:
- first_name: Anton
full_name: Piankov, Anton
id: 865E3C26-AA8C-11E9-A409-C4C4E5697425
last_name: Piankov
citation:
ama: Piankov A. Towards designer materials using customizable particle shape. 2021.
doi:10.15479/at:ista:10422
apa: Piankov, A. (2021). Towards designer materials using customizable particle
shape. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10422
chicago: Piankov, Anton. “Towards Designer Materials Using Customizable Particle
Shape.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10422.
ieee: A. Piankov, “Towards designer materials using customizable particle shape,”
Institute of Science and Technology Austria, 2021.
ista: Piankov A. 2021. Towards designer materials using customizable particle shape.
Institute of Science and Technology Austria.
mla: Piankov, Anton. Towards Designer Materials Using Customizable Particle Shape.
Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10422.
short: A. Piankov, Towards Designer Materials Using Customizable Particle Shape,
Institute of Science and Technology Austria, 2021.
corr_author: '1'
date_created: 2021-12-07T10:48:06Z
date_published: 2021-12-07T00:00:00Z
date_updated: 2026-04-08T06:58:55Z
day: '07'
ddc:
- '530'
degree_awarded: MS
department:
- _id: GradSch
- _id: CaGo
doi: 10.15479/at:ista:10422
file:
- access_level: closed
checksum: 114e8f4b2c002c6c352416c12de2c695
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-12-07T11:13:52Z
date_updated: 2022-03-10T12:10:25Z
file_id: '10424'
file_name: Thesis.zip
file_size: 394018
relation: source_file
- access_level: closed
checksum: cd15ae991ced352a9959815f794e657c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cchlebak
date_created: 2021-12-07T11:14:01Z
date_updated: 2022-03-10T12:10:25Z
file_id: '10425'
file_name: Preliminary_pages_Piankov.docx
file_size: 47638
relation: source_file
- access_level: open_access
checksum: e6899c798b75ba42fab9822bce309050
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-07T11:20:35Z
date_updated: 2021-12-07T11:20:35Z
file_id: '10426'
file_name: 2021_Piankov_combined.pdf
file_size: 484965
relation: main_file
success: 1
file_date_updated: 2022-03-10T12:10:25Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication_identifier:
issn:
- 2791-4585
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
title: Towards designer materials using customizable particle shape
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2021'
...
---
OA_place: publisher
_id: '10030'
abstract:
- lang: eng
text: "This PhD thesis is primarily focused on the study of discrete transport problems,
introduced for the first time in the seminal works of Maas [Maa11] and Mielke
[Mie11] on finite state Markov chains and reaction-diffusion equations, respectively.
More in detail, my research focuses on the study of transport costs on graphs,
in particular the convergence and the stability of such problems in the discrete-to-continuum
limit. This thesis also includes some results concerning\r\nnon-commutative optimal
transport. The first chapter of this thesis consists of a general introduction
to the optimal transport problems, both in the discrete, the continuous, and the
non-commutative setting. Chapters 2 and 3 present the content of two works, obtained
in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have
been able to show the convergence of discrete transport costs on periodic graphs
to suitable continuous ones, which can be described by means of a homogenisation
result. We first focus on the particular case of quadratic costs on the real line
and then extending the result to more general costs in arbitrary dimension. Our
results are the first complete characterisation of limits of transport costs on
periodic graphs in arbitrary dimension which do not rely on any additional symmetry.
In Chapter 4 we turn our attention to one of the intriguing connection between
evolution equations and optimal transport, represented by the theory of gradient
flows. We show that discrete gradient flow structures associated to a finite volume
approximation of a certain class of diffusive equations (Fokker–Planck) is stable
in the limit of vanishing meshes, reproving the convergence of the scheme via
the method of evolutionary Γ-convergence and exploiting a more variational point
of view on the problem. This is based on a collaboration with Dominik Forkert
and Jan Maas. Chapter 5 represents a change of perspective, moving away from the
discrete world and reaching the non-commutative one. As in the discrete case,
we discuss how classical tools coming from the commutative optimal transport can
be translated into the setting of density matrices. In particular, in this final
chapter we present a non-commutative version of the Schrödinger problem (or entropic
regularised optimal transport problem) and discuss existence and characterisation
of minimisers, a duality result, and present a non-commutative version of the
well-known Sinkhorn algorithm to compute the above mentioned optimisers. This
is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally,
Appendix A and B contain some additional material and discussions, with particular
attention to Harnack inequalities and the regularity of flows on discrete spaces."
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: The author gratefully acknowledges support by the Austrian Science
Fund (FWF), grants No W1245.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
citation:
ama: Portinale L. Discrete-to-continuum limits of transport problems and gradient
flows in the space of measures. 2021. doi:10.15479/at:ista:10030
apa: Portinale, L. (2021). Discrete-to-continuum limits of transport problems
and gradient flows in the space of measures. Institute of Science and Technology
Austria. https://doi.org/10.15479/at:ista:10030
chicago: Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems
and Gradient Flows in the Space of Measures.” Institute of Science and Technology
Austria, 2021. https://doi.org/10.15479/at:ista:10030.
ieee: L. Portinale, “Discrete-to-continuum limits of transport problems and gradient
flows in the space of measures,” Institute of Science and Technology Austria,
2021.
ista: Portinale L. 2021. Discrete-to-continuum limits of transport problems and
gradient flows in the space of measures. Institute of Science and Technology Austria.
mla: Portinale, Lorenzo. Discrete-to-Continuum Limits of Transport Problems and
Gradient Flows in the Space of Measures. Institute of Science and Technology
Austria, 2021, doi:10.15479/at:ista:10030.
short: L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient
Flows in the Space of Measures, Institute of Science and Technology Austria, 2021.
corr_author: '1'
date_created: 2021-09-21T09:14:15Z
date_published: 2021-09-22T00:00:00Z
date_updated: 2026-04-08T07:00:04Z
day: '22'
ddc:
- '515'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JaMa
doi: 10.15479/at:ista:10030
file:
- access_level: closed
checksum: 8cd60dcb8762e8f21867e21e8001e183
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-09-21T09:17:34Z
date_updated: 2022-03-10T12:14:42Z
file_id: '10032'
file_name: tex_and_pictures.zip
file_size: 3876668
relation: source_file
- access_level: open_access
checksum: 9789e9d967c853c1503ec7f307170279
content_type: application/pdf
creator: cchlebak
date_created: 2021-09-27T11:14:31Z
date_updated: 2021-09-27T11:14:31Z
file_id: '10047'
file_name: thesis_portinale_Final (1).pdf
file_size: 2532673
relation: main_file
file_date_updated: 2022-03-10T12:14:42Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 260788DE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1245
name: Dissipation and dispersion in nonlinear partial differential equations
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9792'
relation: part_of_dissertation
status: public
- id: '10022'
relation: part_of_dissertation
status: public
- id: '7573'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
title: Discrete-to-continuum limits of transport problems and gradient flows in the
space of measures
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: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2021'
...
---
OA_place: publisher
_id: '9733'
abstract:
- lang: eng
text: This thesis is the result of the research carried out by the author during
his PhD at IST Austria between 2017 and 2021. It mainly focuses on the Fröhlich
polaron model, specifically to its regime of strong coupling. This model, which
is rigorously introduced and discussed in the introduction, has been of great
interest in condensed matter physics and field theory for more than eighty years.
It is used to describe an electron interacting with the atoms of a solid material
(the strength of this interaction is modeled by the presence of a coupling constant
α in the Hamiltonian of the system). The particular regime examined here, which
is mathematically described by considering the limit α →∞, displays many interesting
features related to the emergence of classical behavior, which allows for a simplified
effective description of the system under analysis. The properties, the range
of validity and a quantitative analysis of the precision of such classical approximations
are the main object of the present work. We specify our investigation to the study
of the ground state energy of the system, its dynamics and its effective mass.
For each of these problems, we provide in the introduction an overview of the
previously known results and a detailed account of the original contributions
by the author.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Dario
full_name: Feliciangeli, Dario
id: 41A639AA-F248-11E8-B48F-1D18A9856A87
last_name: Feliciangeli
orcid: 0000-0003-0754-8530
citation:
ama: Feliciangeli D. The polaron at strong coupling. 2021. doi:10.15479/at:ista:9733
apa: Feliciangeli, D. (2021). The polaron at strong coupling. Institute of
Science and Technology Austria. https://doi.org/10.15479/at:ista:9733
chicago: Feliciangeli, Dario. “The Polaron at Strong Coupling.” Institute of Science
and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9733.
ieee: D. Feliciangeli, “The polaron at strong coupling,” Institute of Science and
Technology Austria, 2021.
ista: Feliciangeli D. 2021. The polaron at strong coupling. Institute of Science
and Technology Austria.
mla: Feliciangeli, Dario. The Polaron at Strong Coupling. Institute of Science
and Technology Austria, 2021, doi:10.15479/at:ista:9733.
short: D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and
Technology Austria, 2021.
corr_author: '1'
date_created: 2021-07-27T15:48:30Z
date_published: 2021-08-20T00:00:00Z
date_updated: 2026-04-08T06:59:50Z
day: '20'
ddc:
- '515'
- '519'
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: RoSe
- _id: JaMa
doi: 10.15479/at:ista:9733
ec_funded: 1
file:
- access_level: open_access
checksum: e88bb8ca43948abe060eb2d2fa719881
content_type: application/pdf
creator: dfelicia
date_created: 2021-08-19T14:03:48Z
date_updated: 2021-09-06T09:28:56Z
file_id: '9944'
file_name: Thesis_FeliciangeliA.pdf
file_size: 1958710
relation: main_file
- access_level: closed
checksum: 72810843abee83705853505b3f8348aa
content_type: application/octet-stream
creator: dfelicia
date_created: 2021-08-19T14:06:35Z
date_updated: 2022-03-10T12:13:57Z
file_id: '9945'
file_name: thesis.7z
file_size: 3771669
relation: source_file
file_date_updated: 2022-03-10T12:13:57Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '180'
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9787'
relation: part_of_dissertation
status: public
- id: '9792'
relation: part_of_dissertation
status: public
- id: '9791'
relation: part_of_dissertation
status: public
- id: '9781'
relation: part_of_dissertation
status: public
- id: '9225'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
title: The polaron at strong coupling
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: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2021'
...
---
_id: '9225'
abstract:
- lang: eng
text: "The Landau–Pekar equations describe the dynamics of a strongly coupled polaron.\r\nHere,
we provide a class of initial data for which the associated effective Hamiltonian\r\nhas
a uniform spectral gap for all times. For such initial data, this allows us to
extend the\r\nresults on the adiabatic theorem for the Landau–Pekar equations
and their derivation\r\nfrom the Fröhlich model obtained in previous works to
larger times."
acknowledgement: Funding from the European Union’s Horizon 2020 research and innovation
programme under the ERC Grant Agreement No 694227 (D.F. and R.S.) and under the
Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged.
Open Access funding provided by Institute of Science and Technology (IST Austria)
article_number: '19'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Dario
full_name: Feliciangeli, Dario
id: 41A639AA-F248-11E8-B48F-1D18A9856A87
last_name: Feliciangeli
orcid: 0000-0003-0754-8530
- first_name: Simone Anna Elvira
full_name: Rademacher, Simone Anna Elvira
id: 856966FE-A408-11E9-977E-802DE6697425
last_name: Rademacher
orcid: 0000-0001-5059-4466
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Feliciangeli D, Rademacher SAE, Seiringer R. Persistence of the spectral gap
for the Landau–Pekar equations. Letters in Mathematical Physics. 2021;111.
doi:10.1007/s11005-020-01350-5
apa: Feliciangeli, D., Rademacher, S. A. E., & Seiringer, R. (2021). Persistence
of the spectral gap for the Landau–Pekar equations. Letters in Mathematical
Physics. Springer Nature. https://doi.org/10.1007/s11005-020-01350-5
chicago: Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer.
“Persistence of the Spectral Gap for the Landau–Pekar Equations.” Letters in
Mathematical Physics. Springer Nature, 2021. https://doi.org/10.1007/s11005-020-01350-5.
ieee: D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “Persistence of the
spectral gap for the Landau–Pekar equations,” Letters in Mathematical Physics,
vol. 111. Springer Nature, 2021.
ista: Feliciangeli D, Rademacher SAE, Seiringer R. 2021. Persistence of the spectral
gap for the Landau–Pekar equations. Letters in Mathematical Physics. 111, 19.
mla: Feliciangeli, Dario, et al. “Persistence of the Spectral Gap for the Landau–Pekar
Equations.” Letters in Mathematical Physics, vol. 111, 19, Springer Nature,
2021, doi:10.1007/s11005-020-01350-5.
short: D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, Letters in Mathematical
Physics 111 (2021).
date_created: 2021-03-07T23:01:25Z
date_published: 2021-02-11T00:00:00Z
date_updated: 2026-04-08T06:59:49Z
day: '11'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s11005-020-01350-5
ec_funded: 1
external_id:
isi:
- '000617195700001'
file:
- access_level: open_access
checksum: ffbfe1aad623bce7ff529c207e343b53
content_type: application/pdf
creator: dernst
date_created: 2021-03-09T11:44:34Z
date_updated: 2021-03-09T11:44:34Z
file_id: '9232'
file_name: 2021_LettersMathPhysics_Feliciangeli.pdf
file_size: 391205
relation: main_file
success: 1
file_date_updated: 2021-03-09T11:44:34Z
has_accepted_license: '1'
intvolume: ' 111'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Letters in Mathematical Physics
publication_identifier:
eissn:
- 1573-0530
issn:
- 0377-9017
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '9733'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Persistence of the spectral gap for the Landau–Pekar equations
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 111
year: '2021'
...
---
_id: '9792'
abstract:
- lang: eng
text: 'This paper establishes new connections between many-body quantum systems,
One-body Reduced Density Matrices Functional Theory (1RDMFT) and Optimal Transport
(OT), by interpreting the problem of computing the ground-state energy of a finite
dimensional composite quantum system at positive temperature as a non-commutative
entropy regularized Optimal Transport problem. We develop a new approach to fully
characterize the dual-primal solutions in such non-commutative setting. The mathematical
formalism is particularly relevant in quantum chemistry: numerical realizations
of the many-electron ground state energy can be computed via a non-commutative
version of Sinkhorn algorithm. Our approach allows to prove convergence and robustness
of this algorithm, which, to our best knowledge, were unknown even in the two
marginal case. Our methods are based on careful a priori estimates in the dual
problem, which we believe to be of independent interest. Finally, the above results
are extended in 1RDMFT setting, where bosonic or fermionic symmetry conditions
are enforced on the problem.'
acknowledgement: 'This work started when A.G. was visiting the Erwin Schrödinger Institute
and then continued when D.F. and L.P visited the Theoretical Chemistry Department
of the Vrije Universiteit Amsterdam. The authors thanks the hospitality of both
places and, especially, P. Gori-Giorgi and K. Giesbertz for fruitful discussions
and literature suggestions in the early state of the project. Finally, the authors
also thanks J. Maas and R. Seiringer for their feedback and useful comments to a
first draft of the article. L.P. acknowledges support by the Austrian Science Fund
(FWF), grants No W1245 and NoF65. D.F acknowledges support by the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreements No 716117 and No 694227). A.G. acknowledges funding by the European
Research Council under H2020/MSCA-IF “OTmeetsDFT” [grant ID: 795942].'
article_number: '2106.11217'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dario
full_name: Feliciangeli, Dario
id: 41A639AA-F248-11E8-B48F-1D18A9856A87
last_name: Feliciangeli
orcid: 0000-0003-0754-8530
- first_name: Augusto
full_name: Gerolin, Augusto
last_name: Gerolin
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
citation:
ama: Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal
transport approach to quantum composite systems at positive temperature. arXiv.
doi:10.48550/arXiv.2106.11217
apa: Feliciangeli, D., Gerolin, A., & Portinale, L. (n.d.). A non-commutative
entropic optimal transport approach to quantum composite systems at positive temperature.
arXiv. https://doi.org/10.48550/arXiv.2106.11217
chicago: Feliciangeli, Dario, Augusto Gerolin, and Lorenzo Portinale. “A Non-Commutative
Entropic Optimal Transport Approach to Quantum Composite Systems at Positive Temperature.”
ArXiv, n.d. https://doi.org/10.48550/arXiv.2106.11217.
ieee: D. Feliciangeli, A. Gerolin, and L. Portinale, “A non-commutative entropic
optimal transport approach to quantum composite systems at positive temperature,”
arXiv. .
ista: Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal
transport approach to quantum composite systems at positive temperature. arXiv,
2106.11217.
mla: Feliciangeli, Dario, et al. “A Non-Commutative Entropic Optimal Transport Approach
to Quantum Composite Systems at Positive Temperature.” ArXiv, 2106.11217,
doi:10.48550/arXiv.2106.11217.
short: D. Feliciangeli, A. Gerolin, L. Portinale, ArXiv (n.d.).
date_created: 2021-08-06T09:07:12Z
date_published: 2021-07-21T00:00:00Z
date_updated: 2026-04-08T07:00:03Z
day: '21'
ddc:
- '510'
department:
- _id: RoSe
- _id: JaMa
doi: 10.48550/arXiv.2106.11217
ec_funded: 1
external_id:
arxiv:
- '2106.11217'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2106.11217
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _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
publication: arXiv
publication_status: draft
related_material:
record:
- id: '12911'
relation: later_version
status: public
- id: '9733'
relation: dissertation_contains
status: public
- id: '10030'
relation: dissertation_contains
status: public
status: public
title: A non-commutative entropic optimal transport approach to quantum composite
systems at positive temperature
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: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9787'
abstract:
- lang: eng
text: We investigate the Fröhlich polaron model on a three-dimensional torus, and
give a proof of the second-order quantum corrections to its ground-state energy
in the strong-coupling limit. Compared to previous work in the confined case,
the translational symmetry (and its breaking in the Pekar approximation) makes
the analysis substantially more challenging.
acknowledgement: "Funding from the European Union’s Horizon 2020 research and innovation
programme under the ERC grant agreement No 694227 is gratefully acknowledged. We
would also like to thank Rupert Frank for many helpful discussions, especially related
to the Gross coordinate transformation defined in Def. 4.1.\r\n"
article_number: '2101.12566'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dario
full_name: Feliciangeli, Dario
id: 41A639AA-F248-11E8-B48F-1D18A9856A87
last_name: Feliciangeli
orcid: 0000-0003-0754-8530
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum
corrections to the Pekar asymptotics. arXiv. doi:10.48550/arXiv.2101.12566'
apa: 'Feliciangeli, D., & Seiringer, R. (n.d.). The strongly coupled polaron
on the torus: Quantum corrections to the Pekar asymptotics. arXiv. https://doi.org/10.48550/arXiv.2101.12566'
chicago: 'Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron
on the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, n.d.
https://doi.org/10.48550/arXiv.2101.12566.'
ieee: 'D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus:
Quantum corrections to the Pekar asymptotics,” arXiv. .'
ista: 'Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum
corrections to the Pekar asymptotics. arXiv, 2101.12566.'
mla: 'Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on
the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, 2101.12566,
doi:10.48550/arXiv.2101.12566.'
short: D. Feliciangeli, R. Seiringer, ArXiv (n.d.).
corr_author: '1'
date_created: 2021-08-06T08:25:57Z
date_published: 2021-02-01T00:00:00Z
date_updated: 2026-04-08T06:59:49Z
day: '01'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.48550/arXiv.2101.12566
ec_funded: 1
external_id:
arxiv:
- '2101.12566'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2101.12566
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: arXiv
publication_status: draft
related_material:
record:
- id: '10224'
relation: later_version
status: public
- id: '9733'
relation: dissertation_contains
status: public
status: public
title: 'The strongly coupled polaron on the torus: Quantum corrections to the Pekar
asymptotics'
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: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
OA_place: repository
_id: '9791'
abstract:
- lang: eng
text: We provide a definition of the effective mass for the classical polaron described
by the Landau-Pekar equations. It is based on a novel variational principle, minimizing
the energy functional over states with given (initial) velocity. The resulting
formula for the polaron's effective mass agrees with the prediction by Landau
and Pekar.
acknowledgement: We thank Herbert Spohn for helpful comments. Funding from the European
Union’s Horizon 2020 research and innovation programme under the ERC grant agreement
No. 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement
No. 754411 (S.R.) is gratefully acknowledged..
article_number: '2107.03720 '
article_processing_charge: No
arxiv: 1
author:
- first_name: Dario
full_name: Feliciangeli, Dario
id: 41A639AA-F248-11E8-B48F-1D18A9856A87
last_name: Feliciangeli
orcid: 0000-0003-0754-8530
- first_name: Simone Anna Elvira
full_name: Rademacher, Simone Anna Elvira
id: 856966FE-A408-11E9-977E-802DE6697425
last_name: Rademacher
orcid: 0000-0001-5059-4466
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for
the Landau-Pekar equations. arXiv. doi:10.48550/arXiv.2107.03720
apa: Feliciangeli, D., Rademacher, S. A. E., & Seiringer, R. (n.d.). The effective
mass problem for the Landau-Pekar equations. arXiv. https://doi.org/10.48550/arXiv.2107.03720
chicago: Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer.
“The Effective Mass Problem for the Landau-Pekar Equations.” ArXiv, n.d.
https://doi.org/10.48550/arXiv.2107.03720.
ieee: D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “The effective mass
problem for the Landau-Pekar equations,” arXiv. .
ista: Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for
the Landau-Pekar equations. arXiv, 2107.03720.
mla: Feliciangeli, Dario, et al. “The Effective Mass Problem for the Landau-Pekar
Equations.” ArXiv, 2107.03720, doi:10.48550/arXiv.2107.03720.
short: D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, ArXiv (n.d.).
corr_author: '1'
date_created: 2021-08-06T08:49:45Z
date_published: 2021-07-08T00:00:00Z
date_updated: 2026-04-08T06:59:49Z
day: '08'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.48550/arXiv.2107.03720
ec_funded: 1
external_id:
arxiv:
- '2107.03720'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2107.03720
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: arXiv
publication_status: draft
related_material:
record:
- id: '10755'
relation: later_version
status: public
- id: '9733'
relation: dissertation_contains
status: public
status: public
title: The effective mass problem for the Landau-Pekar equations
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9987'
abstract:
- lang: eng
text: 'Stateless model checking (SMC) is one of the standard approaches to the verification
of concurrent programs. As scheduling non-determinism creates exponentially large
spaces of thread interleavings, SMC attempts to partition this space into equivalence
classes and explore only a few representatives from each class. The efficiency
of this approach depends on two factors: (a) the coarseness of the partitioning,
and (b) the time to generate representatives in each class. For this reason, the
search for coarse partitionings that are efficiently explorable is an active research
challenge. In this work we present RVF-SMC , a new SMC algorithm that uses a
novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are
deemed equivalent if they agree on the value obtained in each read event, and
read events induce consistent causal orderings between them. The RVF partitioning
is provably coarser than recent approaches based on Mazurkiewicz and “reads-from”
partitionings. Our experimental evaluation reveals that RVF is quite often a very
effective equivalence, as the underlying partitioning is exponentially coarser
than other approaches. Moreover, RVF-SMC generates representatives very efficiently,
as the reduction in the partitioning is often met with significant speed-ups in
the model checking task.'
acknowledgement: The research was partially funded by the ERC CoG 863818 (ForM-SMArt)
and the Vienna Science and Technology Fund (WWTF) through project ICT15-003.
alternative_title:
- LNCS
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Pratyush
full_name: Agarwal, Pratyush
last_name: Agarwal
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Shreya
full_name: Pathak, Shreya
last_name: Pathak
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model
checking under a reads-value-from equivalence. In: 33rd International Conference
on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366.
doi:10.1007/978-3-030-81685-8_16'
apa: 'Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V.
(2021). Stateless model checking under a reads-value-from equivalence. In 33rd
International Conference on Computer-Aided Verification (Vol. 12759, pp.
341–366). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-81685-8_16'
chicago: Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis,
and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.”
In 33rd International Conference on Computer-Aided Verification , 12759:341–66.
Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16.
ieee: P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless
model checking under a reads-value-from equivalence,” in 33rd International
Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp.
341–366.
ista: 'Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. 2021. Stateless
model checking under a reads-value-from equivalence. 33rd International Conference
on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol.
12759, 341–366.'
mla: Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from
Equivalence.” 33rd International Conference on Computer-Aided Verification
, vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.
short: P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd
International Conference on Computer-Aided Verification , Springer Nature, 2021,
pp. 341–366.
conference:
end_date: 2021-07-23
location: Virtual
name: 'CAV: Computer Aided Verification '
start_date: 2021-07-20
corr_author: '1'
date_created: 2021-09-05T22:01:24Z
date_published: 2021-07-15T00:00:00Z
date_updated: 2026-04-08T07:00:30Z
day: '15'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-030-81685-8_16
ec_funded: 1
external_id:
arxiv:
- '2105.06424'
isi:
- '000698732400016'
file:
- access_level: open_access
checksum: 4b346e5fbaa8b9bdf107819c7b2aadee
content_type: application/pdf
creator: dernst
date_created: 2022-05-13T07:00:20Z
date_updated: 2022-05-13T07:00:20Z
file_id: '11368'
file_name: 2021_LNCS_Agarwal.pdf
file_size: 1516756
relation: main_file
success: 1
file_date_updated: 2022-05-13T07:00:20Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 341-366
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: '33rd International Conference on Computer-Aided Verification '
publication_identifier:
eisbn:
- 978-3-030-81685-8
eissn:
- 1611-3349
isbn:
- 978-3-030-81684-1
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Stateless model checking under a reads-value-from equivalence
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: '12759 '
year: '2021'
...
---
OA_place: publisher
_id: '10199'
abstract:
- lang: eng
text: The design and verification of concurrent systems remains an open challenge
due to the non-determinism that arises from the inter-process communication. In
particular, concurrent programs are notoriously difficult both to be written correctly
and to be analyzed formally, as complex thread interaction has to be accounted
for. The difficulties are further exacerbated when concurrent programs get executed
on modern-day hardware, which contains various buffering and caching mechanisms
for efficiency reasons. This causes further subtle non-determinism, which can
often produce very unintuitive behavior of the concurrent programs. Model checking
is at the forefront of tackling the verification problem, where the task is to
decide, given as input a concurrent system and a desired property, whether the
system satisfies the property. The inherent state-space explosion problem in model
checking of concurrent systems causes naïve explicit methods not to scale, thus
more inventive methods are required. One such method is stateless model checking
(SMC), which explores in memory-efficient manner the program executions rather
than the states of the program. State-of-the-art SMC is typically coupled with
partial order reduction (POR) techniques, which argue that certain executions
provably produce identical system behavior, thus limiting the amount of executions
one needs to explore in order to cover all possible behaviors. Another method
to tackle the state-space explosion is symbolic model checking, where the considered
techniques operate on a succinct implicit representation of the input system rather
than explicitly accessing the system. In this thesis we present new techniques
for verification of concurrent systems. We present several novel POR methods for
SMC of concurrent programs under various models of semantics, some of which account
for write-buffering mechanisms. Additionally, we present novel algorithms for
symbolic model checking of finite-state concurrent systems, where the desired
property of the systems is to ensure a formally defined notion of fairness.
acknowledged_ssus:
- _id: SSU
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199
apa: Toman, V. (2021). Improved verification techniques for concurrent systems.
Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199
chicago: Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.”
Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199.
ieee: V. Toman, “Improved verification techniques for concurrent systems,” Institute
of Science and Technology Austria, 2021.
ista: Toman V. 2021. Improved verification techniques for concurrent systems. Institute
of Science and Technology Austria.
mla: Toman, Viktor. Improved Verification Techniques for Concurrent Systems.
Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.
short: V. Toman, Improved Verification Techniques for Concurrent Systems, Institute
of Science and Technology Austria, 2021.
corr_author: '1'
date_created: 2021-10-29T20:09:01Z
date_published: 2021-10-31T00:00:00Z
date_updated: 2026-04-08T07:00:31Z
day: '31'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrCh
doi: 10.15479/at:ista:10199
ec_funded: 1
file:
- access_level: open_access
checksum: 4f412a1ee60952221b499a4b1268df35
content_type: application/pdf
creator: vtoman
date_created: 2021-11-08T14:12:22Z
date_updated: 2021-11-08T14:12:22Z
file_id: '10225'
file_name: toman_th_final.pdf
file_size: 2915234
relation: main_file
- access_level: closed
checksum: 9584943f99127be2dd2963f6784c37d4
content_type: application/zip
creator: vtoman
date_created: 2021-11-08T14:12:46Z
date_updated: 2021-11-09T09:00:50Z
file_id: '10226'
file_name: toman_thesis.zip
file_size: 8616056
relation: source_file
file_date_updated: 2021-11-09T09:00:50Z
has_accepted_license: '1'
keyword:
- concurrency
- verification
- model checking
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '166'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9987'
relation: part_of_dissertation
status: public
- id: '10191'
relation: part_of_dissertation
status: public
- id: '141'
relation: part_of_dissertation
status: public
- id: '10190'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: Improved verification techniques for concurrent systems
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2021'
...