---
_id: '14425'
abstract:
- lang: eng
text: 'Water adsorption and dissociation processes on pristine low-index TiO2 interfaces
are important but poorly understood outside the well-studied anatase (101) and
rutile (110). To understand these, we construct three sets of machine learning
potentials that are simultaneously applicable to various TiO2 surfaces, based
on three density-functional-theory approximations. Here we show the water dissociation
free energies on seven pristine TiO2 surfaces, and predict that anatase (100),
anatase (110), rutile (001), and rutile (011) favor water dissociation, anatase
(101) and rutile (100) have mostly molecular adsorption, while the simulations
of rutile (110) sensitively depend on the slab thickness and molecular adsorption
is preferred with thick slabs. Moreover, using an automated algorithm, we reveal
that these surfaces follow different types of atomistic mechanisms for proton
transfer and water dissociation: one-step, two-step, or both. These mechanisms
can be rationalized based on the arrangements of water molecules on the different
surfaces. Our finding thus demonstrates that the different pristine TiO2 surfaces
react with water in distinct ways, and cannot be represented using just the low-energy
anatase (101) and rutile (110) surfaces.'
acknowledgement: F.S., J.H., and B.C. thank the Swiss National Supercomputing Centre
(CSCS) for the generous allocation of CPU hours via production project s1108 at
the Piz Daint supercomputer. B.C. acknowledges resources provided by the Cambridge
Tier-2 system operated by the University of Cambridge Research Computing Service
funded by EPSRC Tier-2 capital grant EP/P020259/1. J.C. acknowledges the Beijing
Natural Science Foundation for support under grant No. JQ22001. F.S., and J.H. thank
the Swiss Platform for Advanced Scientific Computing (PASC) via the 2021-2024 “Ab
Initio Molecular Dynamics at the Exa-Scale” project. This project has received funding
from the European Union’s Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie grant agreement No 101034413.
article_number: '6131'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Zezhu
full_name: Zeng, Zezhu
id: 54a2c730-803f-11ed-ab7e-95b29d2680e7
last_name: Zeng
- first_name: Felix
full_name: Wodaczek, Felix
id: 8b4b6a9f-32b0-11ee-9fa8-bbe85e26258e
last_name: Wodaczek
orcid: 0009-0000-1457-795X
- first_name: Keyang
full_name: Liu, Keyang
last_name: Liu
- first_name: Frederick
full_name: Stein, Frederick
last_name: Stein
- first_name: Jürg
full_name: Hutter, Jürg
last_name: Hutter
- first_name: Ji
full_name: Chen, Ji
last_name: Chen
- first_name: Bingqing
full_name: Cheng, Bingqing
id: cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9
last_name: Cheng
orcid: 0000-0002-3584-9632
citation:
ama: Zeng Z, Wodaczek F, Liu K, et al. Mechanistic insight on water dissociation
on pristine low-index TiO2 surfaces from machine learning molecular dynamics simulations.
Nature Communications. 2023;14. doi:10.1038/s41467-023-41865-8
apa: Zeng, Z., Wodaczek, F., Liu, K., Stein, F., Hutter, J., Chen, J., & Cheng,
B. (2023). Mechanistic insight on water dissociation on pristine low-index TiO2
surfaces from machine learning molecular dynamics simulations. Nature Communications.
Springer Nature. https://doi.org/10.1038/s41467-023-41865-8
chicago: Zeng, Zezhu, Felix Wodaczek, Keyang Liu, Frederick Stein, Jürg Hutter,
Ji Chen, and Bingqing Cheng. “Mechanistic Insight on Water Dissociation on Pristine
Low-Index TiO2 Surfaces from Machine Learning Molecular Dynamics Simulations.”
Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-41865-8.
ieee: Z. Zeng et al., “Mechanistic insight on water dissociation on pristine
low-index TiO2 surfaces from machine learning molecular dynamics simulations,”
Nature Communications, vol. 14. Springer Nature, 2023.
ista: Zeng Z, Wodaczek F, Liu K, Stein F, Hutter J, Chen J, Cheng B. 2023. Mechanistic
insight on water dissociation on pristine low-index TiO2 surfaces from machine
learning molecular dynamics simulations. Nature Communications. 14, 6131.
mla: Zeng, Zezhu, et al. “Mechanistic Insight on Water Dissociation on Pristine
Low-Index TiO2 Surfaces from Machine Learning Molecular Dynamics Simulations.”
Nature Communications, vol. 14, 6131, Springer Nature, 2023, doi:10.1038/s41467-023-41865-8.
short: Z. Zeng, F. Wodaczek, K. Liu, F. Stein, J. Hutter, J. Chen, B. Cheng, Nature
Communications 14 (2023).
corr_author: '1'
date_created: 2023-10-15T22:01:10Z
date_published: 2023-10-02T00:00:00Z
date_updated: 2025-04-14T07:54:53Z
day: '02'
ddc:
- '540'
- '000'
department:
- _id: BiCh
- _id: GradSch
doi: 10.1038/s41467-023-41865-8
ec_funded: 1
external_id:
arxiv:
- '2303.07433'
isi:
- '001084354900008'
pmid:
- '37783698'
file:
- access_level: open_access
checksum: 7d1dffd36b672ec679f08f70ce79da87
content_type: application/pdf
creator: dernst
date_created: 2023-10-16T07:34:49Z
date_updated: 2023-10-16T07:34:49Z
file_id: '14432'
file_name: 2023_NatureComm_Zeng.pdf
file_size: 3194116
relation: main_file
success: 1
file_date_updated: 2023-10-16T07:34:49Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/BingqingCheng/TiO2-water
scopus_import: '1'
status: public
title: Mechanistic insight on water dissociation on pristine low-index TiO2 surfaces
from machine learning molecular dynamics simulations
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2023'
...
---
_id: '14426'
abstract:
- lang: eng
text: To meet the physiological demands of the body, organs need to establish a
functional tissue architecture and adequate size as the embryo develops to adulthood.
In the liver, uni- and bipotent progenitor differentiation into hepatocytes and
biliary epithelial cells (BECs), and their relative proportions, comprise the
functional architecture. Yet, the contribution of individual liver progenitors
at the organ level to both fates, and their specific proportion, is unresolved.
Combining mathematical modelling with organ-wide, multispectral FRaeppli-NLS lineage
tracing in zebrafish, we demonstrate that a precise BEC-to-hepatocyte ratio is
established (i) fast, (ii) solely by heterogeneous lineage decisions from uni-
and bipotent progenitors, and (iii) independent of subsequent cell type–specific
proliferation. Extending lineage tracing to adulthood determined that embryonic
cells undergo spatially heterogeneous three-dimensional growth associated with
distinct environments. Strikingly, giant clusters comprising almost half a ventral
lobe suggest lobe-specific dominant-like growth behaviours. We show substantial
hepatocyte polyploidy in juveniles representing another hallmark of postembryonic
liver growth. Our findings uncover heterogeneous progenitor contributions to tissue
architecture-defining cell type proportions and postembryonic organ growth as
key mechanisms forming the adult liver.
acknowledgement: "We thank the Ober group for discussion and comments on the manuscript.
We are grateful to\r\nDr. F. Lemaigre for feedback on the manuscript and Dr. T.
Piotrowski for invaluable support.\r\nWe thank the department of experimental medicine
(AEM) in Copenhagen for expert fish\r\ncare. We gratefully acknowledge the DanStem
Imaging Platform (University of Copenhagen)\r\nfor support and assistance in this
work.\r\nThis work is supported by Novo Nordisk Foundation grant NNF17CC0027852
(EAO);\r\nNordisk Foundation grant NNF19OC0058327 (EAO); Novo Nordisk Foundation
grant\r\nNNF17OC0031204 (PRL); https://novonordiskfonden.dk/en/; Danish National\r\nResearch
Foundation grant DNRF116 (EAO and AT); https://dg.dk/en/; John and Birthe Meyer\r\nFoundation
(PRL) and European Research Council (ERC) under the EU Horizon 2020 research and
Innovation Programme Grant Agreement No. 851288 (EH)."
article_number: e3002315
article_processing_charge: No
article_type: original
author:
- first_name: Iris A.
full_name: Unterweger, Iris A.
last_name: Unterweger
- first_name: Julie
full_name: Klepstad, Julie
last_name: Klepstad
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Pia R.
full_name: Lundegaard, Pia R.
last_name: Lundegaard
- first_name: Ala
full_name: Trusina, Ala
last_name: Trusina
- first_name: Elke A.
full_name: Ober, Elke A.
last_name: Ober
citation:
ama: Unterweger IA, Klepstad J, Hannezo EB, Lundegaard PR, Trusina A, Ober EA. Lineage
tracing identifies heterogeneous hepatoblast contribution to cell lineages and
postembryonic organ growth dynamics. PLoS Biology. 2023;21(10). doi:10.1371/journal.pbio.3002315
apa: Unterweger, I. A., Klepstad, J., Hannezo, E. B., Lundegaard, P. R., Trusina,
A., & Ober, E. A. (2023). Lineage tracing identifies heterogeneous hepatoblast
contribution to cell lineages and postembryonic organ growth dynamics. PLoS
Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.3002315
chicago: Unterweger, Iris A., Julie Klepstad, Edouard B Hannezo, Pia R. Lundegaard,
Ala Trusina, and Elke A. Ober. “Lineage Tracing Identifies Heterogeneous Hepatoblast
Contribution to Cell Lineages and Postembryonic Organ Growth Dynamics.” PLoS
Biology. Public Library of Science, 2023. https://doi.org/10.1371/journal.pbio.3002315.
ieee: I. A. Unterweger, J. Klepstad, E. B. Hannezo, P. R. Lundegaard, A. Trusina,
and E. A. Ober, “Lineage tracing identifies heterogeneous hepatoblast contribution
to cell lineages and postembryonic organ growth dynamics,” PLoS Biology,
vol. 21, no. 10. Public Library of Science, 2023.
ista: Unterweger IA, Klepstad J, Hannezo EB, Lundegaard PR, Trusina A, Ober EA.
2023. Lineage tracing identifies heterogeneous hepatoblast contribution to cell
lineages and postembryonic organ growth dynamics. PLoS Biology. 21(10), e3002315.
mla: Unterweger, Iris A., et al. “Lineage Tracing Identifies Heterogeneous Hepatoblast
Contribution to Cell Lineages and Postembryonic Organ Growth Dynamics.” PLoS
Biology, vol. 21, no. 10, e3002315, Public Library of Science, 2023, doi:10.1371/journal.pbio.3002315.
short: I.A. Unterweger, J. Klepstad, E.B. Hannezo, P.R. Lundegaard, A. Trusina,
E.A. Ober, PLoS Biology 21 (2023).
date_created: 2023-10-15T22:01:10Z
date_published: 2023-10-04T00:00:00Z
date_updated: 2025-04-14T07:52:27Z
day: '04'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.1371/journal.pbio.3002315
ec_funded: 1
file:
- access_level: open_access
checksum: 40a2b11b41d70a0e5939f8a52b66e389
content_type: application/pdf
creator: dernst
date_created: 2023-10-16T07:20:49Z
date_updated: 2023-10-16T07:20:49Z
file_id: '14431'
file_name: 2023_PloSBiology_Unterweger.pdf
file_size: 6193110
relation: main_file
success: 1
file_date_updated: 2023-10-16T07:20:49Z
has_accepted_license: '1'
intvolume: ' 21'
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 05943252-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '851288'
name: Design Principles of Branching Morphogenesis
publication: PLoS Biology
publication_identifier:
eissn:
- 1545-7885
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/JulieKlepstad/LiverDevelopment
scopus_import: '1'
status: public
title: Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages
and postembryonic organ growth dynamics
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2023'
...
---
_id: '14427'
abstract:
- lang: eng
text: In the paper, we establish Squash Rigidity Theorem—the dynamical spectral
rigidity for piecewise analytic Bunimovich squash-type stadia whose convex arcs
are homothetic. We also establish Stadium Rigidity Theorem—the dynamical spectral
rigidity for piecewise analytic Bunimovich stadia whose flat boundaries are a
priori fixed. In addition, for smooth Bunimovich squash-type stadia we compute
the Lyapunov exponents along the maximal period two orbit, as well as the value
of the Peierls’ Barrier function from the maximal marked length spectrum associated
to the rotation number 2n/4n+1.
acknowledgement: 'VK acknowledges a partial support by the NSF grant DMS-1402164 and
ERC Grant #885707. Discussions with Martin Leguil and Jacopo De Simoi were very
useful. JC visited the University of Maryland and thanks for the hospitality. Also,
JC was partially supported by the National Key Research and Development Program
of China (No.2022YFA1005802), the NSFC Grant 12001392 and NSF of Jiangsu BK20200850.
H.-K. Zhang is partially supported by the National Science Foundation (DMS-2220211),
as well as Simons Foundation Collaboration Grants for Mathematicians (706383).'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jianyu
full_name: Chen, Jianyu
last_name: Chen
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
- first_name: Hong Kun
full_name: Zhang, Hong Kun
last_name: Zhang
citation:
ama: Chen J, Kaloshin V, Zhang HK. Length spectrum rigidity for piecewise analytic
Bunimovich billiards. Communications in Mathematical Physics. 2023;404:1-50.
doi:10.1007/s00220-023-04837-z
apa: Chen, J., Kaloshin, V., & Zhang, H. K. (2023). Length spectrum rigidity
for piecewise analytic Bunimovich billiards. Communications in Mathematical
Physics. Springer Nature. https://doi.org/10.1007/s00220-023-04837-z
chicago: Chen, Jianyu, Vadim Kaloshin, and Hong Kun Zhang. “Length Spectrum Rigidity
for Piecewise Analytic Bunimovich Billiards.” Communications in Mathematical
Physics. Springer Nature, 2023. https://doi.org/10.1007/s00220-023-04837-z.
ieee: J. Chen, V. Kaloshin, and H. K. Zhang, “Length spectrum rigidity for piecewise
analytic Bunimovich billiards,” Communications in Mathematical Physics,
vol. 404. Springer Nature, pp. 1–50, 2023.
ista: Chen J, Kaloshin V, Zhang HK. 2023. Length spectrum rigidity for piecewise
analytic Bunimovich billiards. Communications in Mathematical Physics. 404, 1–50.
mla: Chen, Jianyu, et al. “Length Spectrum Rigidity for Piecewise Analytic Bunimovich
Billiards.” Communications in Mathematical Physics, vol. 404, Springer
Nature, 2023, pp. 1–50, doi:10.1007/s00220-023-04837-z.
short: J. Chen, V. Kaloshin, H.K. Zhang, Communications in Mathematical Physics
404 (2023) 1–50.
corr_author: '1'
date_created: 2023-10-15T22:01:11Z
date_published: 2023-11-01T00:00:00Z
date_updated: 2025-04-14T07:53:45Z
day: '01'
department:
- _id: VaKa
doi: 10.1007/s00220-023-04837-z
ec_funded: 1
external_id:
arxiv:
- '1902.07330'
isi:
- '001073177200001'
intvolume: ' 404'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.07330
month: '11'
oa: 1
oa_version: Preprint
page: 1-50
project:
- _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A
call_identifier: H2020
grant_number: '885707'
name: Spectral rigidity and integrability for billiards and geodesic flows
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Length spectrum rigidity for piecewise analytic Bunimovich billiards
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 404
year: '2023'
...
---
_id: '14428'
abstract:
- lang: eng
text: "Suppose we have two hash functions h1 and h2, but we trust the security of
only one of them. To mitigate this worry, we wish to build a hash combiner Ch1,h2
which is secure so long as one of the underlying hash functions is. This question
has been well-studied in the regime of collision resistance. In this case, concatenating
the two hash function outputs clearly works. Unfortunately, a long series of works
(Boneh and Boyen, CRYPTO’06; Pietrzak, Eurocrypt’07; Pietrzak, CRYPTO’08) showed
no (noticeably) shorter combiner for collision resistance is possible.\r\nIn this
work, we revisit this pessimistic state of affairs, motivated by the observation
that collision-resistance is insufficient for many interesting applications of
cryptographic hash functions anyway. We argue the right formulation of the “hash
combiner” is to build what we call random oracle (RO) combiners, utilizing stronger
assumptions for stronger constructions.\r\nIndeed, we circumvent the previous
lower bounds for collision resistance by constructing a simple length-preserving
RO combiner C˜h1,h2Z1,Z2(M)=h1(M,Z1)⊕h2(M,Z2),where Z1,Z2\r\n are random salts
of appropriate length. We show that this extra randomness is necessary for RO
combiners, and indeed our construction is somewhat tight with this lower bound.\r\nOn
the negative side, we show that one cannot generically apply the composition theorem
to further replace “monolithic” hash functions h1 and h2 by some simpler indifferentiable
construction (such as the Merkle-Damgård transformation) from smaller components,
such as fixed-length compression functions. Finally, despite this issue, we directly
prove collision resistance of the Merkle-Damgård variant of our combiner, where
h1 and h2 are replaced by iterative Merkle-Damgård hashes applied to a fixed-length
compression function. Thus, we can still subvert the concatenation barrier for
collision-resistance combiners while utilizing practically small fixed-length
components underneath."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Niels
full_name: Ferguson, Niels
last_name: Ferguson
- first_name: Eli
full_name: Goldin, Eli
last_name: Goldin
- first_name: Peter
full_name: Hall, Peter
last_name: Hall
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Dodis Y, Ferguson N, Goldin E, Hall P, Pietrzak KZ. Random oracle combiners:
Breaking the concatenation barrier for collision-resistance. In: 43rd Annual
International Cryptology Conference. Vol 14082. Springer Nature; 2023:514-546.
doi:10.1007/978-3-031-38545-2_17'
apa: 'Dodis, Y., Ferguson, N., Goldin, E., Hall, P., & Pietrzak, K. Z. (2023).
Random oracle combiners: Breaking the concatenation barrier for collision-resistance.
In 43rd Annual International Cryptology Conference (Vol. 14082, pp. 514–546).
Santa Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-38545-2_17'
chicago: 'Dodis, Yevgeniy, Niels Ferguson, Eli Goldin, Peter Hall, and Krzysztof
Z Pietrzak. “Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance.”
In 43rd Annual International Cryptology Conference, 14082:514–46. Springer
Nature, 2023. https://doi.org/10.1007/978-3-031-38545-2_17.'
ieee: 'Y. Dodis, N. Ferguson, E. Goldin, P. Hall, and K. Z. Pietrzak, “Random oracle
combiners: Breaking the concatenation barrier for collision-resistance,” in 43rd
Annual International Cryptology Conference, Santa Barbara, CA, United States,
2023, vol. 14082, pp. 514–546.'
ista: 'Dodis Y, Ferguson N, Goldin E, Hall P, Pietrzak KZ. 2023. Random oracle combiners:
Breaking the concatenation barrier for collision-resistance. 43rd Annual International
Cryptology Conference. CRYPTO: Advances in Cryptology, LNCS, vol. 14082, 514–546.'
mla: 'Dodis, Yevgeniy, et al. “Random Oracle Combiners: Breaking the Concatenation
Barrier for Collision-Resistance.” 43rd Annual International Cryptology Conference,
vol. 14082, Springer Nature, 2023, pp. 514–46, doi:10.1007/978-3-031-38545-2_17.'
short: Y. Dodis, N. Ferguson, E. Goldin, P. Hall, K.Z. Pietrzak, in:, 43rd Annual
International Cryptology Conference, Springer Nature, 2023, pp. 514–546.
conference:
end_date: 2023-08-24
location: Santa Barbara, CA, United States
name: 'CRYPTO: Advances in Cryptology'
start_date: 2023-08-20
corr_author: '1'
date_created: 2023-10-15T22:01:11Z
date_published: 2023-08-09T00:00:00Z
date_updated: 2025-09-09T13:06:18Z
day: '09'
department:
- _id: KrPi
doi: 10.1007/978-3-031-38545-2_17
external_id:
isi:
- '001314616100017'
intvolume: ' 14082'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2023/1041
month: '08'
oa: 1
oa_version: Preprint
page: 514-546
publication: 43rd Annual International Cryptology Conference
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031385445'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Random oracle combiners: Breaking the concatenation barrier for collision-resistance'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14082
year: '2023'
...
---
_id: '14441'
abstract:
- lang: eng
text: We study the Fröhlich polaron model in R3, and establish the subleading term
in the strong coupling asymptotics of its ground state energy, corresponding to
the quantum corrections to the classical energy determined by the Pekar approximation.
acknowledgement: Funding from the European Union’s Horizon 2020 research and innovation
programme under the ERC grant agreement No 694227 is acknowledged. Open access funding
provided by Institute of Science and Technology (IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Morris
full_name: Brooks, Morris
id: B7ECF9FC-AA38-11E9-AC9A-0930E6697425
last_name: Brooks
orcid: 0000-0002-6249-0928
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Brooks M, Seiringer R. The Fröhlich Polaron at strong coupling: Part I - The
quantum correction to the classical energy. Communications in Mathematical
Physics. 2023;404:287-337. doi:10.1007/s00220-023-04841-3'
apa: 'Brooks, M., & Seiringer, R. (2023). The Fröhlich Polaron at strong coupling:
Part I - The quantum correction to the classical energy. Communications in
Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-023-04841-3'
chicago: 'Brooks, Morris, and Robert Seiringer. “The Fröhlich Polaron at Strong
Coupling: Part I - The Quantum Correction to the Classical Energy.” Communications
in Mathematical Physics. Springer Nature, 2023. https://doi.org/10.1007/s00220-023-04841-3.'
ieee: 'M. Brooks and R. Seiringer, “The Fröhlich Polaron at strong coupling: Part
I - The quantum correction to the classical energy,” Communications in Mathematical
Physics, vol. 404. Springer Nature, pp. 287–337, 2023.'
ista: 'Brooks M, Seiringer R. 2023. The Fröhlich Polaron at strong coupling: Part
I - The quantum correction to the classical energy. Communications in Mathematical
Physics. 404, 287–337.'
mla: 'Brooks, Morris, and Robert Seiringer. “The Fröhlich Polaron at Strong Coupling:
Part I - The Quantum Correction to the Classical Energy.” Communications in
Mathematical Physics, vol. 404, Springer Nature, 2023, pp. 287–337, doi:10.1007/s00220-023-04841-3.'
short: M. Brooks, R. Seiringer, Communications in Mathematical Physics 404 (2023)
287–337.
corr_author: '1'
date_created: 2023-10-22T22:01:13Z
date_published: 2023-11-01T00:00:00Z
date_updated: 2025-09-09T13:12:02Z
day: '01'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s00220-023-04841-3
ec_funded: 1
external_id:
arxiv:
- '2207.03156'
isi:
- '001096217400007'
file:
- access_level: open_access
checksum: 1ae49b39247cb6b40ff75997381581b8
content_type: application/pdf
creator: dernst
date_created: 2023-10-31T12:21:39Z
date_updated: 2023-10-31T12:21:39Z
file_id: '14477'
file_name: 2023_CommMathPhysics_Brooks.pdf
file_size: 832375
relation: main_file
success: 1
file_date_updated: 2023-10-31T12:21:39Z
has_accepted_license: '1'
intvolume: ' 404'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 287-337
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The Fröhlich Polaron at strong coupling: Part I - The quantum correction to
the classical energy'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 404
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '14442'
abstract:
- lang: eng
text: In the presence of an obstacle, active particles condensate into a surface
“wetting” layer due to persistent motion. If the obstacle is asymmetric, a rectification
current arises in addition to wetting. Asymmetric geometries are therefore commonly
used to concentrate microorganisms like bacteria and sperms. However, most studies
neglect the fact that biological active matter is diverse, composed of individuals
with distinct self-propulsions. Using simulations, we study a mixture of “fast”
and “slow” active Brownian disks in two dimensions interacting with large half-disk
obstacles. With this prototypical obstacle geometry, we analyze how the stationary
collective behavior depends on the degree of self-propulsion “diversity,” defined
as proportional to the difference between the self-propulsion speeds, while keeping
the average self-propulsion speed fixed. A wetting layer rich in fast particles
arises. The rectification current is amplified by speed diversity due to a superlinear
dependence of rectification on self-propulsion speed, which arises from cooperative
effects. Thus, the total rectification current cannot be obtained from an effective
one-component active fluid with the same average self-propulsion speed, highlighting
the importance of considering diversity in active matter.
acknowledgement: MR-V and RS are supported by Fondecyt Grant No. 1220536 and Millennium
Science Initiative Program NCN19_170D of ANID, Chile. P.d.C. was supported by Scholarships
Nos. 2021/10139-2 and 2022/13872-5 and ICTP-SAIFR Grant No. 2021/14335-0, all granted
by São Paulo Research Foundation (FAPESP), Brazil.
article_number: '95'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Mauricio Nicolas
full_name: Rojas Vega, Mauricio Nicolas
id: 441e7207-f91f-11ec-b67c-9e6fe3d8fd6d
last_name: Rojas Vega
- first_name: Pablo
full_name: De Castro, Pablo
last_name: De Castro
- first_name: Rodrigo
full_name: Soto, Rodrigo
last_name: Soto
citation:
ama: Rojas Vega MN, De Castro P, Soto R. Mixtures of self-propelled particles interacting
with asymmetric obstacles. The European Physical Journal E. 2023;46(10).
doi:10.1140/epje/s10189-023-00354-y
apa: Rojas Vega, M. N., De Castro, P., & Soto, R. (2023). Mixtures of self-propelled
particles interacting with asymmetric obstacles. The European Physical Journal
E. Springer Nature. https://doi.org/10.1140/epje/s10189-023-00354-y
chicago: Rojas Vega, Mauricio Nicolas, Pablo De Castro, and Rodrigo Soto. “Mixtures
of Self-Propelled Particles Interacting with Asymmetric Obstacles.” The European
Physical Journal E. Springer Nature, 2023. https://doi.org/10.1140/epje/s10189-023-00354-y.
ieee: M. N. Rojas Vega, P. De Castro, and R. Soto, “Mixtures of self-propelled particles
interacting with asymmetric obstacles,” The European Physical Journal E,
vol. 46, no. 10. Springer Nature, 2023.
ista: Rojas Vega MN, De Castro P, Soto R. 2023. Mixtures of self-propelled particles
interacting with asymmetric obstacles. The European Physical Journal E. 46(10),
95.
mla: Rojas Vega, Mauricio Nicolas, et al. “Mixtures of Self-Propelled Particles
Interacting with Asymmetric Obstacles.” The European Physical Journal E,
vol. 46, no. 10, 95, Springer Nature, 2023, doi:10.1140/epje/s10189-023-00354-y.
short: M.N. Rojas Vega, P. De Castro, R. Soto, The European Physical Journal E 46
(2023).
corr_author: '1'
date_created: 2023-10-22T22:01:13Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2025-09-09T13:08:14Z
day: '01'
department:
- _id: AnSa
doi: 10.1140/epje/s10189-023-00354-y
external_id:
arxiv:
- '2111.05952'
isi:
- '001187541900001'
pmid:
- '37819444'
intvolume: ' 46'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2111.05952'
month: '10'
oa: 1
oa_version: Preprint
pmid: 1
publication: The European Physical Journal E
publication_identifier:
eissn:
- 1292-895X
issn:
- 1292-8941
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mixtures of self-propelled particles interacting with asymmetric obstacles
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 46
year: '2023'
...
---
_id: '14444'
abstract:
- lang: eng
text: "We prove several results about substructures in Latin squares. First, we
explain how to adapt our recent work on high-girth Steiner triple systems to the
setting of Latin squares, resolving a conjecture of Linial that there exist Latin
squares with arbitrarily high girth. As a consequence, we see that the number
of order- n Latin squares with no intercalate (i.e., no 2×2 Latin subsquare)
is at least (e−9/4n−o(n))n2. Equivalently, P[N=0]≥e−n2/4−o(n2)=e−(1+o(1))EN\r\n
, where N is the number of intercalates in a uniformly random order- n Latin
square. \r\nIn fact, extending recent work of Kwan, Sah, and Sawhney, we resolve
the general large-deviation problem for intercalates in random Latin squares,
up to constant factors in the exponent: for any constant 0<δ≤1 we have P[N≤(1−δ)EN]=exp(−Θ(n2))
and for any constant δ>0 we have P[N≥(1+δ)EN]=exp(−Θ(n4/3logn)). \r\nFinally,
as an application of some new general tools for studying substructures in random
Latin squares, we show that in almost all order- n Latin squares, the number of
cuboctahedra (i.e., the number of pairs of possibly degenerate 2×2 submatrices
with the same arrangement of symbols) is of order n4, which is the minimum possible.
As observed by Gowers and Long, this number can be interpreted as measuring ``how
associative'' the quasigroup associated with the Latin square is."
acknowledgement: Sah and Sawhney were supported by NSF Graduate Research Fellowship
Program DGE-1745302. Sah was supported by the PD Soros Fellowship. Simkin was supported
by the Center of Mathematical Sciences and Applications at Harvard University.
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Ashwin
full_name: Sah, Ashwin
last_name: Sah
- first_name: Mehtaab
full_name: Sawhney, Mehtaab
last_name: Sawhney
- first_name: Michael
full_name: Simkin, Michael
last_name: Simkin
citation:
ama: Kwan MA, Sah A, Sawhney M, Simkin M. Substructures in Latin squares. Israel
Journal of Mathematics. 2023;256(2):363-416. doi:10.1007/s11856-023-2513-9
apa: Kwan, M. A., Sah, A., Sawhney, M., & Simkin, M. (2023). Substructures in
Latin squares. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-023-2513-9
chicago: Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “Substructures
in Latin Squares.” Israel Journal of Mathematics. Springer Nature, 2023.
https://doi.org/10.1007/s11856-023-2513-9.
ieee: M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “Substructures in Latin squares,”
Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 363–416,
2023.
ista: Kwan MA, Sah A, Sawhney M, Simkin M. 2023. Substructures in Latin squares.
Israel Journal of Mathematics. 256(2), 363–416.
mla: Kwan, Matthew Alan, et al. “Substructures in Latin Squares.” Israel Journal
of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 363–416, doi:10.1007/s11856-023-2513-9.
short: M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Israel Journal of Mathematics 256
(2023) 363–416.
date_created: 2023-10-22T22:01:14Z
date_published: 2023-09-01T00:00:00Z
date_updated: 2025-09-09T13:08:47Z
day: '01'
department:
- _id: MaKw
doi: 10.1007/s11856-023-2513-9
external_id:
arxiv:
- '2202.05088'
isi:
- '001081646400001'
intvolume: ' 256'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2202.05088
month: '09'
oa: 1
oa_version: Preprint
page: 363-416
publication: Israel Journal of Mathematics
publication_identifier:
eissn:
- 1565-8511
issn:
- 0021-2172
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Substructures in Latin squares
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 256
year: '2023'
...
---
_id: '14445'
abstract:
- lang: eng
text: "We prove the following quantitative Borsuk–Ulam-type result (an equivariant
analogue of Gromov’s Topological Overlap Theorem): Let X be a free ℤ/2-complex
of dimension d with coboundary expansion at least ηk in dimension 0 ≤ k < d. Then
for every equivariant map F: X →ℤ/2 ℝd, the fraction of d-simplices σ of X with
0 ∈ F (σ) is at least 2−d Π d−1k=0ηk.\r\n\r\nAs an application, we show that for
every sufficiently thick d-dimensional spherical building Y and every map f: Y
→ ℝ2d, we have f(σ) ∩ f(τ) ≠ ∅ for a constant fraction μd > 0 of pairs {σ, τ}
of d-simplices of Y. In particular, such complexes are non-embeddable into ℝ2d,
which proves a conjecture of Tancer and Vorwerk for sufficiently thick spherical
buildings.\r\n\r\nWe complement these results by upper bounds on the coboundary
expansion of two families of simplicial complexes; this indicates some limitations
to the bounds one can obtain by straighforward applications of the quantitative
Borsuk–Ulam theorem. Specifically, we prove\r\n\r\n• an upper bound of (d + 1)/2d
on the normalized (d − 1)-th coboundary expansion constant of complete (d + 1)-partite
d-dimensional complexes (under a mild divisibility assumption on the sizes of
the parts); and\r\n\r\n• an upper bound of (d + 1)/2d + ε on the normalized (d
− 1)-th coboundary expansion of the d-dimensional spherical building associated
with GLd+2(Fq) for any ε > 0 and sufficiently large q. This disproves, in a rather
strong sense, a conjecture of Lubotzky, Meshulam and Mozes."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Pascal
full_name: Wild, Pascal
id: 4C20D868-F248-11E8-B48F-1D18A9856A87
last_name: Wild
citation:
ama: Wagner U, Wild P. Coboundary expansion, equivariant overlap, and crossing numbers
of simplicial complexes. Israel Journal of Mathematics. 2023;256(2):675-717.
doi:10.1007/s11856-023-2521-9
apa: Wagner, U., & Wild, P. (2023). Coboundary expansion, equivariant overlap,
and crossing numbers of simplicial complexes. Israel Journal of Mathematics.
Springer Nature. https://doi.org/10.1007/s11856-023-2521-9
chicago: Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap,
and Crossing Numbers of Simplicial Complexes.” Israel Journal of Mathematics.
Springer Nature, 2023. https://doi.org/10.1007/s11856-023-2521-9.
ieee: U. Wagner and P. Wild, “Coboundary expansion, equivariant overlap, and crossing
numbers of simplicial complexes,” Israel Journal of Mathematics, vol. 256,
no. 2. Springer Nature, pp. 675–717, 2023.
ista: Wagner U, Wild P. 2023. Coboundary expansion, equivariant overlap, and crossing
numbers of simplicial complexes. Israel Journal of Mathematics. 256(2), 675–717.
mla: Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and
Crossing Numbers of Simplicial Complexes.” Israel Journal of Mathematics,
vol. 256, no. 2, Springer Nature, 2023, pp. 675–717, doi:10.1007/s11856-023-2521-9.
short: U. Wagner, P. Wild, Israel Journal of Mathematics 256 (2023) 675–717.
corr_author: '1'
date_created: 2023-10-22T22:01:14Z
date_published: 2023-09-01T00:00:00Z
date_updated: 2024-10-09T21:07:12Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/s11856-023-2521-9
external_id:
isi:
- '001081646400010'
file:
- access_level: open_access
checksum: fbb05619fe4b650f341cc730425dd9c3
content_type: application/pdf
creator: dernst
date_created: 2023-10-31T11:20:31Z
date_updated: 2023-10-31T11:20:31Z
file_id: '14475'
file_name: 2023_IsraelJourMath_Wagner.pdf
file_size: 623787
relation: main_file
success: 1
file_date_updated: 2023-10-31T11:20:31Z
has_accepted_license: '1'
intvolume: ' 256'
isi: 1
issue: '2'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 675-717
publication: Israel Journal of Mathematics
publication_identifier:
eissn:
- 1565-8511
issn:
- 0021-2172
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coboundary expansion, equivariant overlap, and crossing numbers of simplicial
complexes
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 256
year: '2023'
...
---
_id: '14446'
abstract:
- lang: eng
text: Recent work has paid close attention to the first principle of Granger causality,
according to which cause precedes effect. In this context, the question may arise
whether the detected direction of causality also reverses after the time reversal
of unidirectionally coupled data. Recently, it has been shown that for unidirectionally
causally connected autoregressive (AR) processes X → Y, after time reversal of
data, the opposite causal direction Y → X is indeed detected, although typically
as part of the bidirectional X↔ Y link. As we argue here, the answer is different
when the measured data are not from AR processes but from linked deterministic
systems. When the goal is the usual forward data analysis, cross-mapping-like
approaches correctly detect X → Y, while Granger causality-like approaches, which
should not be used for deterministic time series, detect causal independence X
→ Y. The results of backward causal analysis depend on the predictability of the
reversed data. Unlike AR processes, observables from deterministic dynamical systems,
even complex nonlinear ones, can be predicted well forward, while backward predictions
can be difficult (notably when the time reversal of a function leads to one-to-many
relations). To address this problem, we propose an approach based on models that
provide multiple candidate predictions for the target, combined with a loss function
that consideres only the best candidate. The resulting good forward and backward
predictability supports the view that unidirectionally causally linked deterministic
dynamical systems X → Y can be expected to detect the same link both before and
after time reversal.
acknowledgement: The work was supported by the Scientific Grant Agency of the Ministry
of Education of the Slovak Republic and the Slovak Academy of Sciences, projects
APVV-21-0216, VEGA2-0096-21 and VEGA 2-0023-22.
article_processing_charge: Yes
article_type: original
author:
- first_name: Jozef
full_name: Jakubík, Jozef
last_name: Jakubík
- first_name: Phuong
full_name: Bui Thi Mai, Phuong
id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
last_name: Bui Thi Mai
- first_name: Martina
full_name: Chvosteková, Martina
last_name: Chvosteková
- first_name: Anna
full_name: Krakovská, Anna
last_name: Krakovská
citation:
ama: Jakubík J, Phuong M, Chvosteková M, Krakovská A. Against the flow of time with
multi-output models. Measurement Science Review. 2023;23(4):175-183. doi:10.2478/msr-2023-0023
apa: Jakubík, J., Phuong, M., Chvosteková, M., & Krakovská, A. (2023). Against
the flow of time with multi-output models. Measurement Science Review.
Sciendo. https://doi.org/10.2478/msr-2023-0023
chicago: Jakubík, Jozef, Mary Phuong, Martina Chvosteková, and Anna Krakovská. “Against
the Flow of Time with Multi-Output Models.” Measurement Science Review.
Sciendo, 2023. https://doi.org/10.2478/msr-2023-0023.
ieee: J. Jakubík, M. Phuong, M. Chvosteková, and A. Krakovská, “Against the flow
of time with multi-output models,” Measurement Science Review, vol. 23,
no. 4. Sciendo, pp. 175–183, 2023.
ista: Jakubík J, Phuong M, Chvosteková M, Krakovská A. 2023. Against the flow of
time with multi-output models. Measurement Science Review. 23(4), 175–183.
mla: Jakubík, Jozef, et al. “Against the Flow of Time with Multi-Output Models.”
Measurement Science Review, vol. 23, no. 4, Sciendo, 2023, pp. 175–83,
doi:10.2478/msr-2023-0023.
short: J. Jakubík, M. Phuong, M. Chvosteková, A. Krakovská, Measurement Science
Review 23 (2023) 175–183.
date_created: 2023-10-22T22:01:15Z
date_published: 2023-08-01T00:00:00Z
date_updated: 2025-09-09T13:10:30Z
day: '01'
ddc:
- '510'
department:
- _id: ChLa
doi: 10.2478/msr-2023-0023
external_id:
isi:
- '001070829600005'
file:
- access_level: open_access
checksum: b069cc10fa6a7c96b2bc9f728165f9e6
content_type: application/pdf
creator: dernst
date_created: 2023-10-31T12:07:23Z
date_updated: 2023-10-31T12:07:23Z
file_id: '14476'
file_name: 2023_MeasurementScienceRev_Jakubik.pdf
file_size: 2639783
relation: main_file
success: 1
file_date_updated: 2023-10-31T12:07:23Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 175-183
publication: Measurement Science Review
publication_identifier:
eissn:
- 1335-8871
publication_status: published
publisher: Sciendo
quality_controlled: '1'
scopus_import: '1'
status: public
title: Against the flow of time with multi-output models
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 23
year: '2023'
...
---
_id: '14448'
abstract:
- lang: eng
text: We consider the problem of solving LP relaxations of MAP-MRF inference problems,
and in particular the method proposed recently in [16], [35]. As a key computational
subroutine, it uses a variant of the Frank-Wolfe (FW) method to minimize a smooth
convex function over a combinatorial polytope. We propose an efficient implementation
of this subroutine based on in-face Frank-Wolfe directions, introduced in [4]
in a different context. More generally, we define an abstract data structure for
a combinatorial subproblem that enables in-face FW directions, and describe its
specialization for tree-structured MAP-MRF inference subproblems. Experimental
results indicate that the resulting method is the current state-of-art LP solver
for some classes of problems. Our code is available at pub.ist.ac.at/~vnk/papers/IN-FACE-FW.html.
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Kolmogorov V. Solving relaxations of MAP-MRF problems: Combinatorial in-face
Frank-Wolfe directions. In: Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition. Vol 2023. IEEE; 2023:11980-11989.
doi:10.1109/CVPR52729.2023.01153'
apa: 'Kolmogorov, V. (2023). Solving relaxations of MAP-MRF problems: Combinatorial
in-face Frank-Wolfe directions. In Proceedings of the IEEE Computer Society
Conference on Computer Vision and Pattern Recognition (Vol. 2023, pp. 11980–11989).
Vancouver, Canada: IEEE. https://doi.org/10.1109/CVPR52729.2023.01153'
chicago: 'Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial
in-Face Frank-Wolfe Directions.” In Proceedings of the IEEE Computer Society
Conference on Computer Vision and Pattern Recognition, 2023:11980–89. IEEE,
2023. https://doi.org/10.1109/CVPR52729.2023.01153.'
ieee: 'V. Kolmogorov, “Solving relaxations of MAP-MRF problems: Combinatorial in-face
Frank-Wolfe directions,” in Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, Vancouver, Canada, 2023, vol.
2023, pp. 11980–11989.'
ista: 'Kolmogorov V. 2023. Solving relaxations of MAP-MRF problems: Combinatorial
in-face Frank-Wolfe directions. Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision
and Pattern Recognition vol. 2023, 11980–11989.'
mla: 'Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial
in-Face Frank-Wolfe Directions.” Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, vol. 2023, IEEE, 2023, pp. 11980–89,
doi:10.1109/CVPR52729.2023.01153.'
short: V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on
Computer Vision and Pattern Recognition, IEEE, 2023, pp. 11980–11989.
conference:
end_date: 2023-06-24
location: Vancouver, Canada
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2023-06-17
corr_author: '1'
date_created: 2023-10-22T22:01:16Z
date_published: 2023-08-22T00:00:00Z
date_updated: 2025-09-09T13:09:58Z
day: '22'
department:
- _id: VlKo
doi: 10.1109/CVPR52729.2023.01153
external_id:
arxiv:
- '2010.09567'
isi:
- '001062522104029'
intvolume: ' 2023'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2010.09567'
month: '08'
oa: 1
oa_version: Preprint
page: 11980-11989
publication: Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition
publication_identifier:
isbn:
- '9798350301298'
issn:
- 1063-6919
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe
directions'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2023
year: '2023'
...
---
_id: '14449'
abstract:
- lang: eng
text: The rapid development of machine learning (ML) techniques has opened up the
data-dense field of microbiome research for novel therapeutic, diagnostic, and
prognostic applications targeting a wide range of disorders, which could substantially
improve healthcare practices in the era of precision medicine. However, several
challenges must be addressed to exploit the benefits of ML in this field fully.
In particular, there is a need to establish “gold standard” protocols for conducting
ML analysis experiments and improve interactions between microbiome researchers
and ML experts. The Machine Learning Techniques in Human Microbiome Studies (ML4Microbiome)
COST Action CA18131 is a European network established in 2019 to promote collaboration
between discovery-oriented microbiome researchers and data-driven ML experts to
optimize and standardize ML approaches for microbiome analysis. This perspective
paper presents the key achievements of ML4Microbiome, which include identifying
predictive and discriminatory ‘omics’ features, improving repeatability and comparability,
developing automation procedures, and defining priority areas for the novel development
of ML methods targeting the microbiome. The insights gained from ML4Microbiome
will help to maximize the potential of ML in microbiome research and pave the
way for new and improved healthcare practices.
acknowledgement: "This study is based upon work from COST Action ML4Microbiome “Statistical
and machine learning techniques in human microbiome studies” (CA18131), supported
by COST (European Cooperation in Science and Technology), www.cost.eu. MB acknowledges
support through the Metagenopolis grant ANR-11-DPBS-0001. IM-I acknowledges support
by the “Miguel Servet Type II” program (CPII21/00013) of the ISCIII-Madrid (Spain),
co-financed by the FEDER.\r\nThe authors are grateful to all COST Action CA18131
“Statistical and machine learning techniques in human microbiome studies” members
for their contribution to the COST Action objectives, and to COST (European Cooperation
in Science and Technology) for the economic support, www.cost.eu. WG2 and WG3 thank
Emmanuelle Le Chatelier and Pauline Barbet (Université Paris-Saclay, INRAE, MetaGenoPolis,
78350, Jouy-en-Josas, France) for preparing the shotgun CRC benchmark dataset."
article_number: '1257002'
article_processing_charge: Yes
article_type: original
author:
- first_name: Domenica
full_name: D’Elia, Domenica
last_name: D’Elia
- first_name: Jaak
full_name: Truu, Jaak
last_name: Truu
- first_name: Leo
full_name: Lahti, Leo
last_name: Lahti
- first_name: Magali
full_name: Berland, Magali
last_name: Berland
- first_name: Georgios
full_name: Papoutsoglou, Georgios
last_name: Papoutsoglou
- first_name: Michelangelo
full_name: Ceci, Michelangelo
last_name: Ceci
- first_name: Aldert
full_name: Zomer, Aldert
last_name: Zomer
- first_name: Marta B.
full_name: Lopes, Marta B.
last_name: Lopes
- first_name: Eliana
full_name: Ibrahimi, Eliana
last_name: Ibrahimi
- first_name: Aleksandra
full_name: Gruca, Aleksandra
last_name: Gruca
- first_name: Alina
full_name: Nechyporenko, Alina
last_name: Nechyporenko
- first_name: Marcus
full_name: Frohme, Marcus
last_name: Frohme
- first_name: Thomas
full_name: Klammsteiner, Thomas
last_name: Klammsteiner
- first_name: Enrique Carrillo De Santa
full_name: Pau, Enrique Carrillo De Santa
last_name: Pau
- first_name: Laura Judith
full_name: Marcos-Zambrano, Laura Judith
last_name: Marcos-Zambrano
- first_name: Karel
full_name: Hron, Karel
last_name: Hron
- first_name: Gianvito
full_name: Pio, Gianvito
last_name: Pio
- first_name: Andrea
full_name: Simeon, Andrea
last_name: Simeon
- first_name: Ramona
full_name: Suharoschi, Ramona
last_name: Suharoschi
- first_name: Isabel
full_name: Moreno-Indias, Isabel
last_name: Moreno-Indias
- first_name: Andriy
full_name: Temko, Andriy
last_name: Temko
- first_name: Miroslava
full_name: Nedyalkova, Miroslava
last_name: Nedyalkova
- first_name: Elena Simona
full_name: Apostol, Elena Simona
last_name: Apostol
- first_name: Ciprian Octavian
full_name: Truică, Ciprian Octavian
last_name: Truică
- first_name: Rajesh
full_name: Shigdel, Rajesh
last_name: Shigdel
- first_name: Jasminka Hasić
full_name: Telalović, Jasminka Hasić
last_name: Telalović
- first_name: Erik
full_name: Bongcam-Rudloff, Erik
last_name: Bongcam-Rudloff
- first_name: Piotr
full_name: Przymus, Piotr
last_name: Przymus
- first_name: Naida Babić
full_name: Jordamović, Naida Babić
last_name: Jordamović
- first_name: Laurent
full_name: Falquet, Laurent
last_name: Falquet
- first_name: Sonia
full_name: Tarazona, Sonia
last_name: Tarazona
- first_name: Alexia
full_name: Sampri, Alexia
last_name: Sampri
- first_name: Gaetano
full_name: Isola, Gaetano
last_name: Isola
- first_name: David
full_name: Pérez-Serrano, David
last_name: Pérez-Serrano
- first_name: Vladimir
full_name: Trajkovik, Vladimir
last_name: Trajkovik
- first_name: Lubos
full_name: Klucar, Lubos
last_name: Klucar
- first_name: Tatjana
full_name: Loncar-Turukalo, Tatjana
last_name: Loncar-Turukalo
- first_name: Aki S.
full_name: Havulinna, Aki S.
last_name: Havulinna
- first_name: Christian
full_name: Jansen, Christian
id: 837b2259-bcc9-11ed-a196-ae55927bc6e2
last_name: Jansen
- first_name: Randi J.
full_name: Bertelsen, Randi J.
last_name: Bertelsen
- first_name: Marcus Joakim
full_name: Claesson, Marcus Joakim
last_name: Claesson
citation:
ama: 'D’Elia D, Truu J, Lahti L, et al. Advancing microbiome research with machine
learning: Key findings from the ML4Microbiome COST action. Frontiers in Microbiology.
2023;14. doi:10.3389/fmicb.2023.1257002'
apa: 'D’Elia, D., Truu, J., Lahti, L., Berland, M., Papoutsoglou, G., Ceci, M.,
… Claesson, M. J. (2023). Advancing microbiome research with machine learning:
Key findings from the ML4Microbiome COST action. Frontiers in Microbiology.
Frontiers. https://doi.org/10.3389/fmicb.2023.1257002'
chicago: 'D’Elia, Domenica, Jaak Truu, Leo Lahti, Magali Berland, Georgios Papoutsoglou,
Michelangelo Ceci, Aldert Zomer, et al. “Advancing Microbiome Research with Machine
Learning: Key Findings from the ML4Microbiome COST Action.” Frontiers in Microbiology.
Frontiers, 2023. https://doi.org/10.3389/fmicb.2023.1257002.'
ieee: 'D. D’Elia et al., “Advancing microbiome research with machine learning:
Key findings from the ML4Microbiome COST action,” Frontiers in Microbiology,
vol. 14. Frontiers, 2023.'
ista: 'D’Elia D, Truu J, Lahti L, Berland M, Papoutsoglou G, Ceci M, Zomer A, Lopes
MB, Ibrahimi E, Gruca A, Nechyporenko A, Frohme M, Klammsteiner T, Pau ECDS, Marcos-Zambrano
LJ, Hron K, Pio G, Simeon A, Suharoschi R, Moreno-Indias I, Temko A, Nedyalkova
M, Apostol ES, Truică CO, Shigdel R, Telalović JH, Bongcam-Rudloff E, Przymus
P, Jordamović NB, Falquet L, Tarazona S, Sampri A, Isola G, Pérez-Serrano D, Trajkovik
V, Klucar L, Loncar-Turukalo T, Havulinna AS, Jansen C, Bertelsen RJ, Claesson
MJ. 2023. Advancing microbiome research with machine learning: Key findings from
the ML4Microbiome COST action. Frontiers in Microbiology. 14, 1257002.'
mla: 'D’Elia, Domenica, et al. “Advancing Microbiome Research with Machine Learning:
Key Findings from the ML4Microbiome COST Action.” Frontiers in Microbiology,
vol. 14, 1257002, Frontiers, 2023, doi:10.3389/fmicb.2023.1257002.'
short: D. D’Elia, J. Truu, L. Lahti, M. Berland, G. Papoutsoglou, M. Ceci, A. Zomer,
M.B. Lopes, E. Ibrahimi, A. Gruca, A. Nechyporenko, M. Frohme, T. Klammsteiner,
E.C.D.S. Pau, L.J. Marcos-Zambrano, K. Hron, G. Pio, A. Simeon, R. Suharoschi,
I. Moreno-Indias, A. Temko, M. Nedyalkova, E.S. Apostol, C.O. Truică, R. Shigdel,
J.H. Telalović, E. Bongcam-Rudloff, P. Przymus, N.B. Jordamović, L. Falquet, S.
Tarazona, A. Sampri, G. Isola, D. Pérez-Serrano, V. Trajkovik, L. Klucar, T. Loncar-Turukalo,
A.S. Havulinna, C. Jansen, R.J. Bertelsen, M.J. Claesson, Frontiers in Microbiology
14 (2023).
date_created: 2023-10-22T22:01:16Z
date_published: 2023-09-25T00:00:00Z
date_updated: 2023-12-13T13:07:21Z
day: '25'
ddc:
- '000'
department:
- _id: ScienComp
doi: 10.3389/fmicb.2023.1257002
external_id:
isi:
- '001080536000001'
pmid:
- '37808321'
file:
- access_level: open_access
checksum: 6c0acdd8fa111a699826957b8dff19d5
content_type: application/pdf
creator: dernst
date_created: 2023-10-30T13:38:48Z
date_updated: 2023-10-30T13:38:48Z
file_id: '14471'
file_name: 2023_FrontiersMicrobiology_DElia.pdf
file_size: 505078
relation: main_file
success: 1
file_date_updated: 2023-10-30T13:38:48Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Frontiers in Microbiology
publication_identifier:
eissn:
- 1664-302X
publication_status: published
publisher: Frontiers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Advancing microbiome research with machine learning: Key findings from the
ML4Microbiome COST action'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2023'
...
---
_id: '14452'
abstract:
- lang: eng
text: The classical infinitesimal model is a simple and robust model for the inheritance
of quantitative traits. In this model, a quantitative trait is expressed as the
sum of a genetic and an environmental component, and the genetic component of
offspring traits within a family follows a normal distribution around the average
of the parents’ trait values, and has a variance that is independent of the parental
traits. In previous work, we showed that when trait values are determined by the
sum of a large number of additive Mendelian factors, each of small effect, one
can justify the infinitesimal model as a limit of Mendelian inheritance. In this
paper, we show that this result extends to include dominance. We define the model
in terms of classical quantities of quantitative genetics, before justifying it
as a limit of Mendelian inheritance as the number, M, of underlying loci tends
to infinity. As in the additive case, the multivariate normal distribution of
trait values across the pedigree can be expressed in terms of variance components
in an ancestral population and probabilities of identity by descent determined
by the pedigree. Now, with just first-order dominance effects, we require two-,
three-, and four-way identities. We also show that, even if we condition on parental
trait values, the “shared” and “residual” components of trait values within each
family will be asymptotically normally distributed as the number of loci tends
to infinity, with an error of order 1/M−−√. We illustrate our results with some
numerical examples.
acknowledgement: NHB was supported in part by ERC Grants 250152 and 101055327. AV
was partly supported by the chaire Modélisation Mathématique et Biodiversité of
Veolia Environment—Ecole Polytechnique—Museum National d’Histoire Naturelle—Fondation
X.
article_number: iyad133
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Alison M.
full_name: Etheridge, Alison M.
last_name: Etheridge
- first_name: Amandine
full_name: Véber, Amandine
last_name: Véber
citation:
ama: Barton NH, Etheridge AM, Véber A. The infinitesimal model with dominance. Genetics.
2023;225(2). doi:10.1093/genetics/iyad133
apa: Barton, N. H., Etheridge, A. M., & Véber, A. (2023). The infinitesimal
model with dominance. Genetics. Oxford University Press. https://doi.org/10.1093/genetics/iyad133
chicago: Barton, Nicholas H, Alison M. Etheridge, and Amandine Véber. “The Infinitesimal
Model with Dominance.” Genetics. Oxford University Press, 2023. https://doi.org/10.1093/genetics/iyad133.
ieee: N. H. Barton, A. M. Etheridge, and A. Véber, “The infinitesimal model with
dominance,” Genetics, vol. 225, no. 2. Oxford University Press, 2023.
ista: Barton NH, Etheridge AM, Véber A. 2023. The infinitesimal model with dominance.
Genetics. 225(2), iyad133.
mla: Barton, Nicholas H., et al. “The Infinitesimal Model with Dominance.” Genetics,
vol. 225, no. 2, iyad133, Oxford University Press, 2023, doi:10.1093/genetics/iyad133.
short: N.H. Barton, A.M. Etheridge, A. Véber, Genetics 225 (2023).
date_created: 2023-10-29T23:01:15Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2025-09-09T13:07:07Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/genetics/iyad133
ec_funded: 1
external_id:
arxiv:
- '2211.03515'
isi:
- '001148042000008'
file:
- access_level: open_access
checksum: 3f65b1fbe813e2f4dbb5d2b5e891844a
content_type: application/pdf
creator: dernst
date_created: 2023-10-30T12:57:53Z
date_updated: 2023-10-30T12:57:53Z
file_id: '14469'
file_name: 2023_Genetics_Barton.pdf
file_size: 1439032
relation: main_file
success: 1
file_date_updated: 2023-10-30T12:57:53Z
has_accepted_license: '1'
intvolume: ' 225'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: bd6958e0-d553-11ed-ba76-86eba6a76c00
grant_number: '101055327'
name: Understanding the evolution of continuous genomes
publication: Genetics
publication_identifier:
eissn:
- 1943-2631
issn:
- 0016-6731
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
related_material:
record:
- id: '12949'
relation: research_data
status: public
scopus_import: '1'
status: public
title: The infinitesimal model with dominance
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 225
year: '2023'
...
---
_id: '14453'
abstract:
- lang: eng
text: Squall lines are substantially influenced by the interaction of low-level
shear with cold pools associated with convective downdrafts. Beyond an optimal
shear amplitude, squall lines tend to orient themselves at an angle with respect
to the low-level shear. While the mechanisms behind squall line orientation seem
to be increasingly well understood, uncertainties remain on the implications of
this orientation. Roca and Fiolleau (2020, https://doi.org/10.1038/s43247-020-00015-4)
show that long lived mesoscale convective systems, including squall lines, are
disproportionately involved in rainfall extremes in the tropics. This article
investigates the influence of the interaction between low-level shear and squall
line outflow on squall line generated precipitation extrema in the tropics. Using
a cloud resolving model, simulated squall lines in radiative convective equilibrium
amid a shear-dominated regime (super optimal), a balanced regime (optimal), and
an outflow dominated regime (suboptimal). Our results show that precipitation
extremes in squall lines are 40% more intense in the case of optimal shear and
remain 30% superior in the superoptimal regime relative to a disorganized case.
With a theoretical scaling of precipitation extremes (C. Muller & Takayabu, 2020,
https://doi.org/10.1088/1748-9326/ab7130), we show that the condensation rates
control the amplification of precipitation extremes in tropical squall lines,
mainly due to its change in vertical mass flux (dynamic component). The reduction
of dilution by entrainment explains half of this change, consistent with Mulholland
et al. (2021, https://doi.org/10.1175/jas-d-20-0299.1). The other half is explained
by increased cloud-base velocity intensity in optimal and superoptimal squall
lines.
acknowledgement: The authors gratefully acknowledge funding from the European Research
Council under the European Union's Horizon 2020 research and innovation program
(Project CLUSTER, Grant Agreement No. 805041). This work is also supported by a
PhD fellowship funded by the Ecole Normale Supérieure de Paris-Saclay. Authors are
also grateful to Benjamin Filider, who was of great help and support in the development
of ideas. Eventually, we would like to thank Martin Singh, John M. Peters and an
anonymous reviewer for their valuable comments and suggestions, which greatly improved
the quality of the manuscript.
article_number: e2022MS003477
article_processing_charge: Yes
article_type: original
author:
- first_name: Sophie
full_name: Abramian, Sophie
last_name: Abramian
- first_name: Caroline J
full_name: Muller, Caroline J
id: f978ccb0-3f7f-11eb-b193-b0e2bd13182b
last_name: Muller
orcid: 0000-0001-5836-5350
- first_name: Camille
full_name: Risi, Camille
last_name: Risi
citation:
ama: Abramian S, Muller CJ, Risi C. Extreme precipitation in tropical squall lines.
Journal of Advances in Modeling Earth Systems. 2023;15(10). doi:10.1029/2022MS003477
apa: Abramian, S., Muller, C. J., & Risi, C. (2023). Extreme precipitation in
tropical squall lines. Journal of Advances in Modeling Earth Systems. Wiley.
https://doi.org/10.1029/2022MS003477
chicago: Abramian, Sophie, Caroline J Muller, and Camille Risi. “Extreme Precipitation
in Tropical Squall Lines.” Journal of Advances in Modeling Earth Systems.
Wiley, 2023. https://doi.org/10.1029/2022MS003477.
ieee: S. Abramian, C. J. Muller, and C. Risi, “Extreme precipitation in tropical
squall lines,” Journal of Advances in Modeling Earth Systems, vol. 15,
no. 10. Wiley, 2023.
ista: Abramian S, Muller CJ, Risi C. 2023. Extreme precipitation in tropical squall
lines. Journal of Advances in Modeling Earth Systems. 15(10), e2022MS003477.
mla: Abramian, Sophie, et al. “Extreme Precipitation in Tropical Squall Lines.”
Journal of Advances in Modeling Earth Systems, vol. 15, no. 10, e2022MS003477,
Wiley, 2023, doi:10.1029/2022MS003477.
short: S. Abramian, C.J. Muller, C. Risi, Journal of Advances in Modeling Earth
Systems 15 (2023).
date_created: 2023-10-29T23:01:15Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2024-11-05T09:00:44Z
day: '01'
ddc:
- '550'
department:
- _id: CaMu
doi: 10.1029/2022MS003477
ec_funded: 1
external_id:
isi:
- '001084933600001'
file:
- access_level: open_access
checksum: 43e6a1a35b663843c7d3f8d0caaca1a5
content_type: application/pdf
creator: dernst
date_created: 2023-10-30T13:31:42Z
date_updated: 2023-10-30T13:31:42Z
file_id: '14470'
file_name: 2023_JAMES_Abramian.pdf
file_size: 1975210
relation: main_file
success: 1
file_date_updated: 2023-10-30T13:31:42Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 629205d8-2b32-11ec-9570-e1356ff73576
call_identifier: H2020
grant_number: '805041'
name: Organization of CLoUdS, and implications of Tropical cyclones and for the
Energetics of the tropics, in current and waRming climate
publication: Journal of Advances in Modeling Earth Systems
publication_identifier:
eissn:
- 1942-2466
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extreme precipitation in tropical squall lines
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2023'
...
---
_id: '14454'
abstract:
- lang: eng
text: As AI and machine-learned software are used increasingly for making decisions
that affect humans, it is imperative that they remain fair and unbiased in their
decisions. To complement design-time bias mitigation measures, runtime verification
techniques have been introduced recently to monitor the algorithmic fairness of
deployed systems. Previous monitoring techniques assume full observability of
the states of the (unknown) monitored system. Moreover, they can monitor only
fairness properties that are specified as arithmetic expressions over the probabilities
of different events. In this work, we extend fairness monitoring to systems modeled
as partially observed Markov chains (POMC), and to specifications containing arithmetic
expressions over the expected values of numerical functions on event sequences.
The only assumptions we make are that the underlying POMC is aperiodic and starts
in the stationary distribution, with a bound on its mixing time being known. These
assumptions enable us to estimate a given property for the entire distribution
of possible executions of the monitored POMC, by observing only a single execution.
Our monitors observe a long run of the system and, after each new observation,
output updated PAC-estimates of how fair or biased the system is. The monitors
are computationally lightweight and, using a prototype implementation, we demonstrate
their effectiveness on several real-world examples.
acknowledgement: 'This work is supported by the European Research Council under Grant
No.: ERC-2020-AdG 101020093.'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Konstantin
full_name: Kueffner, Konstantin
id: 8121a2d0-dc85-11ea-9058-af578f3b4515
last_name: Kueffner
orcid: 0000-0001-8974-2542
- first_name: Kaushik
full_name: Mallik, Kaushik
id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
last_name: Mallik
orcid: 0000-0001-9864-7475
citation:
ama: 'Henzinger TA, Kueffner K, Mallik K. Monitoring algorithmic fairness under
partial observations. In: 23rd International Conference on Runtime Verification.
Vol 14245. Springer Nature; 2023:291-311. doi:10.1007/978-3-031-44267-4_15'
apa: 'Henzinger, T. A., Kueffner, K., & Mallik, K. (2023). Monitoring algorithmic
fairness under partial observations. In 23rd International Conference on Runtime
Verification (Vol. 14245, pp. 291–311). Thessaloniki, Greece: Springer Nature.
https://doi.org/10.1007/978-3-031-44267-4_15'
chicago: Henzinger, Thomas A, Konstantin Kueffner, and Kaushik Mallik. “Monitoring
Algorithmic Fairness under Partial Observations.” In 23rd International Conference
on Runtime Verification, 14245:291–311. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44267-4_15.
ieee: T. A. Henzinger, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness
under partial observations,” in 23rd International Conference on Runtime Verification,
Thessaloniki, Greece, 2023, vol. 14245, pp. 291–311.
ista: 'Henzinger TA, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness
under partial observations. 23rd International Conference on Runtime Verification.
RV: Conference on Runtime Verification, LNCS, vol. 14245, 291–311.'
mla: Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness under Partial
Observations.” 23rd International Conference on Runtime Verification, vol.
14245, Springer Nature, 2023, pp. 291–311, doi:10.1007/978-3-031-44267-4_15.
short: T.A. Henzinger, K. Kueffner, K. Mallik, in:, 23rd International Conference
on Runtime Verification, Springer Nature, 2023, pp. 291–311.
conference:
end_date: 2023-10-06
location: Thessaloniki, Greece
name: 'RV: Conference on Runtime Verification'
start_date: 2023-10-03
corr_author: '1'
date_created: 2023-10-29T23:01:15Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2025-04-14T07:55:55Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-031-44267-4_15
ec_funded: 1
external_id:
arxiv:
- '2308.00341'
intvolume: ' 14245'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2308.00341
month: '10'
oa: 1
oa_version: Preprint
page: 291-311
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 23rd International Conference on Runtime Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031442667'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitoring algorithmic fairness under partial observations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14245
year: '2023'
...
---
_id: '14455'
acknowledgement: The author(s) declare that financial support was received for the
research, authorship, and/or publication of this article. This work has been partially
supported by Italian Ministry of Health Grant RC2023 (and the 5 × 1,000 voluntary
contributions). The authors thank the children and their families with whom they
work daily.
article_number: '1287879'
article_processing_charge: Yes
article_type: letter_note
author:
- first_name: Antonio
full_name: Narzisi, Antonio
last_name: Narzisi
- first_name: Alycia
full_name: Halladay, Alycia
last_name: Halladay
- first_name: Gabriele
full_name: Masi, Gabriele
last_name: Masi
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Catherine
full_name: Lord, Catherine
last_name: Lord
citation:
ama: 'Narzisi A, Halladay A, Masi G, Novarino G, Lord C. Tempering expectations:
Considerations on the current state of stem cells therapy for autism treatment.
Frontiers in Psychiatry. 2023;14. doi:10.3389/fpsyt.2023.1287879'
apa: 'Narzisi, A., Halladay, A., Masi, G., Novarino, G., & Lord, C. (2023).
Tempering expectations: Considerations on the current state of stem cells therapy
for autism treatment. Frontiers in Psychiatry. Frontiers. https://doi.org/10.3389/fpsyt.2023.1287879'
chicago: 'Narzisi, Antonio, Alycia Halladay, Gabriele Masi, Gaia Novarino, and Catherine
Lord. “Tempering Expectations: Considerations on the Current State of Stem Cells
Therapy for Autism Treatment.” Frontiers in Psychiatry. Frontiers, 2023.
https://doi.org/10.3389/fpsyt.2023.1287879.'
ieee: 'A. Narzisi, A. Halladay, G. Masi, G. Novarino, and C. Lord, “Tempering expectations:
Considerations on the current state of stem cells therapy for autism treatment,”
Frontiers in Psychiatry, vol. 14. Frontiers, 2023.'
ista: 'Narzisi A, Halladay A, Masi G, Novarino G, Lord C. 2023. Tempering expectations:
Considerations on the current state of stem cells therapy for autism treatment.
Frontiers in Psychiatry. 14, 1287879.'
mla: 'Narzisi, Antonio, et al. “Tempering Expectations: Considerations on the Current
State of Stem Cells Therapy for Autism Treatment.” Frontiers in Psychiatry,
vol. 14, 1287879, Frontiers, 2023, doi:10.3389/fpsyt.2023.1287879.'
short: A. Narzisi, A. Halladay, G. Masi, G. Novarino, C. Lord, Frontiers in Psychiatry
14 (2023).
date_created: 2023-10-29T23:01:16Z
date_published: 2023-10-03T00:00:00Z
date_updated: 2023-12-13T13:06:07Z
day: '03'
ddc:
- '570'
department:
- _id: GaNo
doi: 10.3389/fpsyt.2023.1287879
external_id:
isi:
- '001084841700001'
pmid:
- '37854442'
file:
- access_level: open_access
checksum: 0a76373e9a4c0fc199f80380de257e86
content_type: application/pdf
creator: dernst
date_created: 2023-10-30T12:48:40Z
date_updated: 2023-10-30T12:48:40Z
file_id: '14468'
file_name: 2023_FrontiersPsychiatry_Narzisi.pdf
file_size: 147878
relation: main_file
success: 1
file_date_updated: 2023-10-30T12:48:40Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
publication: Frontiers in Psychiatry
publication_identifier:
eissn:
- 1664-0640
publication_status: published
publisher: Frontiers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Tempering expectations: Considerations on the current state of stem cells
therapy for autism treatment'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2023'
...
---
_id: '14456'
abstract:
- lang: eng
text: In this paper, we present novel algorithms that efficiently compute a shortest
reconfiguration sequence between two given dominating sets in trees and interval
graphs under the TOKEN SLIDING model. In this problem, a graph is provided along
with its two dominating sets, which can be imagined as tokens placed on vertices.
The objective is to find a shortest sequence of dominating sets that transforms
one set into the other, with each set in the sequence resulting from sliding a
single token in the previous set. While identifying any sequence has been well
studied, our work presents the first polynomial algorithms for this optimization
variant in the context of dominating sets.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Jan Matyáš
full_name: Křišťan, Jan Matyáš
last_name: Křišťan
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
citation:
ama: 'Křišťan JM, Svoboda J. Shortest dominating set reconfiguration under token
sliding. In: 24th International Symposium on Fundamentals of Computation Theory.
Vol 14292. Springer Nature; 2023:333-347. doi:10.1007/978-3-031-43587-4_24'
apa: 'Křišťan, J. M., & Svoboda, J. (2023). Shortest dominating set reconfiguration
under token sliding. In 24th International Symposium on Fundamentals of Computation
Theory (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature. https://doi.org/10.1007/978-3-031-43587-4_24'
chicago: Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration
under Token Sliding.” In 24th International Symposium on Fundamentals of Computation
Theory, 14292:333–47. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-43587-4_24.
ieee: J. M. Křišťan and J. Svoboda, “Shortest dominating set reconfiguration under
token sliding,” in 24th International Symposium on Fundamentals of Computation
Theory, Trier, Germany, 2023, vol. 14292, pp. 333–347.
ista: 'Křišťan JM, Svoboda J. 2023. Shortest dominating set reconfiguration under
token sliding. 24th International Symposium on Fundamentals of Computation Theory.
FCT: Fundamentals of Computation Theory, LNCS, vol. 14292, 333–347.'
mla: Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration
under Token Sliding.” 24th International Symposium on Fundamentals of Computation
Theory, vol. 14292, Springer Nature, 2023, pp. 333–47, doi:10.1007/978-3-031-43587-4_24.
short: J.M. Křišťan, J. Svoboda, in:, 24th International Symposium on Fundamentals
of Computation Theory, Springer Nature, 2023, pp. 333–347.
conference:
end_date: 2023-09-21
location: Trier, Germany
name: 'FCT: Fundamentals of Computation Theory'
start_date: 2023-09-18
date_created: 2023-10-29T23:01:16Z
date_published: 2023-09-21T00:00:00Z
date_updated: 2025-09-09T13:07:40Z
day: '21'
department:
- _id: KrCh
doi: 10.1007/978-3-031-43587-4_24
external_id:
arxiv:
- '2307.10847'
isi:
- '001162288800024'
intvolume: ' 14292'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2307.10847
month: '09'
oa: 1
oa_version: Preprint
page: 333-347
publication: 24th International Symposium on Fundamentals of Computation Theory
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031435867'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/978-3-031-43587-4_31
scopus_import: '1'
status: public
title: Shortest dominating set reconfiguration under token sliding
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14292
year: '2023'
...
---
_id: '14457'
abstract:
- lang: eng
text: "Threshold secret sharing allows a dealer to split a secret s into n shares,
such that any t shares allow for reconstructing s, but no t-1 shares reveal any
information about s. Leakage-resilient secret sharing requires that the secret
remains hidden, even when an adversary additionally obtains a limited amount of
leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret
sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n
and conjectured that the same holds for t = c.n for any constant 0≤c≤1. Nielsen
and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving
that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n).\r\nIn
this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy
leakage-resilience, where a random subset of leakages is replaced by uniformly
random noise. We prove a lower bound for Shamir’s secret sharing, similar to that
of Nielsen and Simkin, which holds even when a constant fraction of leakages is
replaced by random noise. To this end, we first prove a lower bound on the share
size of any noisy-leakage-resilient sharing scheme. We then use this lower bound
to show that there exist universal constants c1, c2, such that for sufficiently
large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient
for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random
noise.\r\n\r\n\r\n\r\n"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Charlotte
full_name: Hoffmann, Charlotte
id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
last_name: Hoffmann
orcid: 0000-0003-2027-5549
- first_name: Mark
full_name: Simkin, Mark
last_name: Simkin
citation:
ama: 'Hoffmann C, Simkin M. Stronger lower bounds for leakage-resilient secret sharing.
In: 8th International Conference on Cryptology and Information Security in
Latin America. Vol 14168. Springer Nature; 2023:215-228. doi:10.1007/978-3-031-44469-2_11'
apa: 'Hoffmann, C., & Simkin, M. (2023). Stronger lower bounds for leakage-resilient
secret sharing. In 8th International Conference on Cryptology and Information
Security in Latin America (Vol. 14168, pp. 215–228). Quito, Ecuador: Springer
Nature. https://doi.org/10.1007/978-3-031-44469-2_11'
chicago: Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient
Secret Sharing.” In 8th International Conference on Cryptology and Information
Security in Latin America, 14168:215–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44469-2_11.
ieee: C. Hoffmann and M. Simkin, “Stronger lower bounds for leakage-resilient secret
sharing,” in 8th International Conference on Cryptology and Information Security
in Latin America, Quito, Ecuador, 2023, vol. 14168, pp. 215–228.
ista: 'Hoffmann C, Simkin M. 2023. Stronger lower bounds for leakage-resilient secret
sharing. 8th International Conference on Cryptology and Information Security in
Latin America. LATINCRYPT: Cryptology and Information Security in Latin America,
LNCS, vol. 14168, 215–228.'
mla: Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient
Secret Sharing.” 8th International Conference on Cryptology and Information
Security in Latin America, vol. 14168, Springer Nature, 2023, pp. 215–28,
doi:10.1007/978-3-031-44469-2_11.
short: C. Hoffmann, M. Simkin, in:, 8th International Conference on Cryptology and
Information Security in Latin America, Springer Nature, 2023, pp. 215–228.
conference:
end_date: 2023-10-06
location: Quito, Ecuador
name: 'LATINCRYPT: Cryptology and Information Security in Latin America'
start_date: 2023-10-03
corr_author: '1'
date_created: 2023-10-29T23:01:16Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2025-09-09T13:09:21Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-031-44469-2_11
external_id:
isi:
- '001157041900011'
intvolume: ' 14168'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2023/1017
month: '10'
oa: 1
oa_version: Preprint
page: 215-228
publication: 8th International Conference on Cryptology and Information Security in
Latin America
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031444685'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stronger lower bounds for leakage-resilient secret sharing
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14168
year: '2023'
...
---
_id: '14460'
abstract:
- lang: eng
text: We provide an efficient implementation of the backpropagation algorithm, specialized
to the case where the weights of the neural network being trained are sparse.
Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and
common layer types (e.g., convolutional or linear). We provide a fast vectorized
implementation on commodity CPUs, and show that it can yield speedups in end-to-end
runtime experiments, both in transfer learning using already-sparsified networks,
and in training sparse networks from scratch. Thus, our results provide the first
support for sparse training on commodity hardware.
acknowledgement: 'We would like to thank Elias Frantar for his valuable assistance
and support at the outset of this project, and the anonymous ICML and SNN reviewers
for very constructive feedback. EI was supported in part by the FWF DK VGSCO, grant
agreement number W1260-N35. DA acknowledges generous ERC support, via Starting Grant
805223 ScaleML. '
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Mahdi
full_name: Nikdan, Mahdi
id: 66374281-f394-11eb-9cf6-869147deecc0
last_name: Nikdan
- first_name: Tommaso
full_name: Pegolotti, Tommaso
last_name: Pegolotti
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. SparseProp: Efficient
sparse backpropagation for faster training of neural networks at the edge. In:
Proceedings of the 40th International Conference on Machine Learning. Vol
202. ML Research Press; 2023:26215-26227.'
apa: 'Nikdan, M., Pegolotti, T., Iofinova, E. B., Kurtic, E., & Alistarh, D.-A.
(2023). SparseProp: Efficient sparse backpropagation for faster training of neural
networks at the edge. In Proceedings of the 40th International Conference on
Machine Learning (Vol. 202, pp. 26215–26227). Honolulu, Hawaii, HI, United
States: ML Research Press.'
chicago: 'Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and
Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster
Training of Neural Networks at the Edge.” In Proceedings of the 40th International
Conference on Machine Learning, 202:26215–27. ML Research Press, 2023.'
ieee: 'M. Nikdan, T. Pegolotti, E. B. Iofinova, E. Kurtic, and D.-A. Alistarh, “SparseProp:
Efficient sparse backpropagation for faster training of neural networks at the
edge,” in Proceedings of the 40th International Conference on Machine Learning,
Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 26215–26227.'
ista: 'Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. 2023. SparseProp:
Efficient sparse backpropagation for faster training of neural networks at the
edge. Proceedings of the 40th International Conference on Machine Learning. ICML:
International Conference on Machine Learning, PMLR, vol. 202, 26215–26227.'
mla: 'Nikdan, Mahdi, et al. “SparseProp: Efficient Sparse Backpropagation for Faster
Training of Neural Networks at the Edge.” Proceedings of the 40th International
Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 26215–27.'
short: M. Nikdan, T. Pegolotti, E.B. Iofinova, E. Kurtic, D.-A. Alistarh, in:, Proceedings
of the 40th International Conference on Machine Learning, ML Research Press, 2023,
pp. 26215–26227.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
corr_author: '1'
date_created: 2023-10-29T23:01:17Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2025-04-14T07:49:12Z
day: '30'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2302.04852'
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2302.04852
month: '07'
oa: 1
oa_version: Preprint
page: 26215-26227
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SparseProp: Efficient sparse backpropagation for faster training of neural
networks at the edge'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14462'
abstract:
- lang: eng
text: "We study fine-grained error bounds for differentially private algorithms
for counting under continual observation. Our main insight is that the matrix
mechanism when using lower-triangular matrices can be used in the continual observation
model. More specifically, we give an explicit factorization for the counting matrix
Mcount and upper bound the error explicitly. We also give a fine-grained analysis,
specifying the exact constant in the upper bound. Our analysis is based on upper
and lower bounds of the completely bounded norm (cb-norm) of Mcount\r\n. Along
the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal
on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large
range of the dimension of Mcount. Furthermore, we are the first to give concrete
error bounds for various problems under continual observation such as binary counting,
maintaining a histogram, releasing an approximately cut-preserving synthetic graph,
many graph-based statistics, and substring and episode counting. Finally, we note
that our result can be used to get a fine-grained error bound for non-interactive
local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private
counting under continual observation. Subsequent to this work, Henzinger et al.
(SODA, 2023) showed that our factorization also achieves fine-grained mean-squared
error."
acknowledgement: "This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(Grant agreement No.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures
(MoDynStruct)” and from the Austrian Science Fund (FWF) project Z 422-N, and project
“Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional
funding from the netidee SCIENCE Stiftung, 2020–2024. 2020–2024. JU’s research was
funded by Decanal Research Grant. A part of this work was done when JU was visiting
Indian Statistical Institute, Delhi. The authors would like to thank Rajat Bhatia,
Aleksandar Nikolov, Shanta Laisharam, Vern Paulsen, Ryan Rogers, Abhradeep Thakurta,
and Sarvagya Upadhyay for useful discussions."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Hendrik
full_name: Fichtenberger, Hendrik
last_name: Fichtenberger
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Jalaj
full_name: Upadhyay, Jalaj
last_name: Upadhyay
citation:
ama: 'Fichtenberger H, Henzinger M, Upadhyay J. Constant matters: Fine-grained error
bound on differentially private continual observation. In: Proceedings of the
40th International Conference on Machine Learning. Vol 202. ML Research Press;
2023:10072-10092.'
apa: 'Fichtenberger, H., Henzinger, M., & Upadhyay, J. (2023). Constant matters:
Fine-grained error bound on differentially private continual observation. In Proceedings
of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092).
Honolulu, Hawaii, HI, United States: ML Research Press.'
chicago: 'Fichtenberger, Hendrik, Monika Henzinger, and Jalaj Upadhyay. “Constant
Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.”
In Proceedings of the 40th International Conference on Machine Learning,
202:10072–92. ML Research Press, 2023.'
ieee: 'H. Fichtenberger, M. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained
error bound on differentially private continual observation,” in Proceedings
of the 40th International Conference on Machine Learning, Honolulu, Hawaii,
HI, United States, 2023, vol. 202, pp. 10072–10092.'
ista: 'Fichtenberger H, Henzinger M, Upadhyay J. 2023. Constant matters: Fine-grained
error bound on differentially private continual observation. Proceedings of the
40th International Conference on Machine Learning. ICML: International Conference
on Machine Learning, PMLR, vol. 202, 10072–10092.'
mla: 'Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound
on Differentially Private Continual Observation.” Proceedings of the 40th International
Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10072–92.'
short: H. Fichtenberger, M. Henzinger, J. Upadhyay, in:, Proceedings of the 40th
International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
corr_author: '1'
date_created: 2023-10-29T23:01:17Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2025-05-19T10:59:58Z
day: '30'
department:
- _id: MoHe
ec_funded: 1
external_id:
arxiv:
- '2202.11205'
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf
month: '07'
oa: 1
oa_version: Published Version
page: 10072-10092
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Constant matters: Fine-grained error bound on differentially private continual
observation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14464'
abstract:
- lang: eng
text: 'Given a triangle Δ, we study the problem of determining the smallest enclosing
and largest embedded isosceles triangles of Δ with respect to area and perimeter.
This problem was initially posed by Nandakumar [17, 22] and was first studied
by Kiss, Pach, and Somlai [13], who showed that if Δ′ is the smallest area isosceles
triangle containing Δ, then Δ′ and Δ share a side and an angle. In the present
paper, we prove that for any triangle Δ, every maximum area isosceles triangle
embedded in Δ and every maximum perimeter isosceles triangle embedded in Δ shares
a side and an angle with Δ. Somewhat surprisingly, the case of minimum perimeter
enclosing triangles is different: there are infinite families of triangles Δ whose
minimum perimeter isosceles containers do not share a side and an angle with Δ.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Áron
full_name: Ambrus, Áron
last_name: Ambrus
- first_name: Mónika
full_name: Csikós, Mónika
last_name: Csikós
- first_name: Gergely
full_name: Kiss, Gergely
last_name: Kiss
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
- first_name: Gábor
full_name: Somlai, Gábor
last_name: Somlai
citation:
ama: Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. Optimal embedded and enclosing
isosceles triangles. International Journal of Foundations of Computer Science.
2023;34(7):737-760. doi:10.1142/S012905412342008X
apa: Ambrus, Á., Csikós, M., Kiss, G., Pach, J., & Somlai, G. (2023). Optimal
embedded and enclosing isosceles triangles. International Journal of Foundations
of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S012905412342008X
chicago: Ambrus, Áron, Mónika Csikós, Gergely Kiss, János Pach, and Gábor Somlai.
“Optimal Embedded and Enclosing Isosceles Triangles.” International Journal
of Foundations of Computer Science. World Scientific Publishing, 2023. https://doi.org/10.1142/S012905412342008X.
ieee: Á. Ambrus, M. Csikós, G. Kiss, J. Pach, and G. Somlai, “Optimal embedded and
enclosing isosceles triangles,” International Journal of Foundations of Computer
Science, vol. 34, no. 7. World Scientific Publishing, pp. 737–760, 2023.
ista: Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. 2023. Optimal embedded and enclosing
isosceles triangles. International Journal of Foundations of Computer Science.
34(7), 737–760.
mla: Ambrus, Áron, et al. “Optimal Embedded and Enclosing Isosceles Triangles.”
International Journal of Foundations of Computer Science, vol. 34, no.
7, World Scientific Publishing, 2023, pp. 737–60, doi:10.1142/S012905412342008X.
short: Á. Ambrus, M. Csikós, G. Kiss, J. Pach, G. Somlai, International Journal
of Foundations of Computer Science 34 (2023) 737–760.
date_created: 2023-10-29T23:01:18Z
date_published: 2023-10-05T00:00:00Z
date_updated: 2023-12-13T13:04:55Z
day: '05'
department:
- _id: HeEd
doi: 10.1142/S012905412342008X
external_id:
arxiv:
- '2205.11637'
isi:
- '001080874400001'
intvolume: ' 34'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2205.11637
month: '10'
oa: 1
oa_version: Preprint
page: 737-760
publication: International Journal of Foundations of Computer Science
publication_identifier:
eissn:
- 1793-6373
issn:
- 0129-0541
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal embedded and enclosing isosceles triangles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2023'
...