---
_id: '17325'
abstract:
- lang: eng
text: Bacterial ion fluxes are involved in the generation of energy, transport,
and motility. As such, bacterial electrophysiology is fundamentally important
for the bacterial life cycle, but it is often neglected and consequently, by and
large, not understood. Arguably, the two main reasons for this are the complexity
of measuring relevant variables in small cells with a cell envelope that contains
the cell wall and the fact that, in a unicellular organism, relevant variables
become intertwined in a nontrivial manner. To help give bacterial electrophysiology
studies a firm footing, in this review, we go back to basics. We look first at
the biophysics of bacterial membrane potential, and then at the approaches and
models developed mostly for the study of neurons and eukaryotic mitochondria.
We discuss their applicability to bacterial cells. Finally, we connect bacterial
membrane potential with other relevant (electro)physiological variables and summarize
methods that can be used to both measure and influence bacterial electrophysiology.
acknowledgement: We would like to thank all members of the Pilizota lab, as well as
Calin Guet, Orkun Soyer, Munehiro Asally, Peter Swain, and in particular Matt Scott
and Ariel Amir, for their support, comments, and useful discussions. T.P. and W.-C.L.
were supported by the Leverhulme Trust, grant RPG-2019-187, and T.P. is supported
by EPSRC Fellowship EP/V03264X/1. E.K. was supported by a European Molecular Biology
Organization Long-Term Postdoctoral Fellowship, ALTF 44-2021.
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Wei Chang
full_name: Lo, Wei Chang
last_name: Lo
- first_name: Ekaterina
full_name: Krasnopeeva, Ekaterina
id: 1F1EE44A-BF83-11EA-B3C1-BB9CC619BF3A
last_name: Krasnopeeva
- first_name: Teuta
full_name: Pilizota, Teuta
last_name: Pilizota
citation:
ama: Lo WC, Krasnopeeva E, Pilizota T. Bacterial Electrophysiology. Annual Review
of Biophysics. 2024;53:487-510. doi:10.1146/annurev-biophys-030822-032215
apa: Lo, W. C., Krasnopeeva, E., & Pilizota, T. (2024). Bacterial Electrophysiology.
Annual Review of Biophysics. Annual Reviews. https://doi.org/10.1146/annurev-biophys-030822-032215
chicago: Lo, Wei Chang, Ekaterina Krasnopeeva, and Teuta Pilizota. “Bacterial Electrophysiology.”
Annual Review of Biophysics. Annual Reviews, 2024. https://doi.org/10.1146/annurev-biophys-030822-032215.
ieee: W. C. Lo, E. Krasnopeeva, and T. Pilizota, “Bacterial Electrophysiology,”
Annual Review of Biophysics, vol. 53. Annual Reviews, pp. 487–510, 2024.
ista: Lo WC, Krasnopeeva E, Pilizota T. 2024. Bacterial Electrophysiology. Annual
Review of Biophysics. 53, 487–510.
mla: Lo, Wei Chang, et al. “Bacterial Electrophysiology.” Annual Review of Biophysics,
vol. 53, Annual Reviews, 2024, pp. 487–510, doi:10.1146/annurev-biophys-030822-032215.
short: W.C. Lo, E. Krasnopeeva, T. Pilizota, Annual Review of Biophysics 53 (2024)
487–510.
date_created: 2024-07-28T22:01:09Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2025-09-08T08:34:43Z
day: '01'
ddc:
- '570'
department:
- _id: CaGu
doi: 10.1146/annurev-biophys-030822-032215
external_id:
isi:
- '001278237500021'
pmid:
- '38382113'
file:
- access_level: open_access
checksum: e0505553b3cee624fa865f0cc5a99ecc
content_type: application/pdf
creator: dernst
date_created: 2024-07-29T10:56:01Z
date_updated: 2024-07-29T10:56:01Z
file_id: '17339'
file_name: 2024_AnnualReviewBiophys_Lo.pdf
file_size: 1276645
relation: main_file
success: 1
file_date_updated: 2024-07-29T10:56:01Z
has_accepted_license: '1'
intvolume: ' 53'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 487-510
pmid: 1
project:
- _id: eb872896-77a9-11ec-83b8-f59a38ec17f8
grant_number: ALTF 44-2021
name: 'Bacterial cytoplasm glass transition: passive physiological switch or active
survival strategy'
publication: Annual Review of Biophysics
publication_identifier:
eissn:
- 1936-1238
issn:
- 1936-122X
publication_status: published
publisher: Annual Reviews
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bacterial Electrophysiology
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: 53
year: '2024'
...
---
DOAJ_listed: '1'
_id: '17326'
abstract:
- lang: eng
text: Magnetic fields in the stellar interiors are key candidates to explain observed
core rotation rates inside solar-like stars along their evolution. Recently, asteroseismic
estimates of radial magnetic field amplitudes near the hydrogen-burning shell
(H-shell) inside about 24 red giants (RGs) have been obtained by measuring frequency
splittings from their power spectra. Using general Lorentz-stress (magnetic) kernels,
we investigated the potential for detectability of near-surface magnetism in a
1.3 M⊙ star of supersolar metallicity as it evolves from a mid subgiant to a late
subgiant into an RG. Based on these sensitivity kernels, we decompose an RG into
three zones—deep core, H-shell, and near-surface. The subgiants instead required
decomposition into an inner core, an outer core, and a near-surface layer. Additionally,
we find that for a low-frequency g-dominated dipolar mode in the presence of a
typical stable magnetic field, ∼25% of the frequency shift comes from the H-shell
and the remaining from deeper layers. The ratio of the subsurface tangential field
to the radial field in the H-burning shell decides if subsurface fields may be
potentially detectable. For p-dominated dipole modes close to vmax, this ratio
is around two orders of magnitude smaller in subgiant phases than the corresponding
RG. Further, with the availability of magnetic kernels, we propose lower limits
of field strengths in crucial layers in our stellar model during its evolutionary
phases. The theoretical prescription outlined here provides the first formal way
to devise inverse problems for stellar magnetism and can be seamlessly employed
for slow rotators.
acknowledgement: "This project has received funding from the European Union's Horizon
2020 research and innovation program under the Marie Skłodowska-Curie grant agreement
No. 101034413. S.\r\nB.D. acknowledges Prof. Jeroen Tromp at Princeton University
for supporting a part of this work. S.M.H., S.B., and S.P. acknowledge support from
the Department of Atomic Energy,\r\nGovernment of India, under Project Identification
No. RTI 4002. The authors would like to thank the reviewer(s) and data editor for
their constructive comments and suggestions. The\r\ngeneration of the stellar models
was done using the Modules for Experiments in Stellar Astrophysics (MESA Paxton
et al. 2011, 2013, 2015, 2018, 2019; we have used MESA version\r\nr22.05.1 for RG
and r23.05.1 for SG models, MESA-SDK version x86_64-linux-22.6.1). The eigenfrequencies
and eigenfunctions for this model were calculated using the GYRE\r\n(Townsend &
Teitler 2013) code. The code to calculate the kernels and the splittings has been
written completely in Python 3.8.16."
article_number: '42'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Shatanik
full_name: Bhattacharya, Shatanik
last_name: Bhattacharya
- first_name: Srijan B
full_name: Das, Srijan B
id: 9ce7c423-dacf-11ed-8942-e09c6cb27149
last_name: Das
orcid: 0000-0003-0896-7972
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: Subrata
full_name: Panda, Subrata
last_name: Panda
- first_name: Shravan M.
full_name: Hanasoge, Shravan M.
last_name: Hanasoge
citation:
ama: Bhattacharya S, Das SB, Bugnet LA, Panda S, Hanasoge SM. Detectability of axisymmetric
magnetic fields from the core to the surface of oscillating post-main-sequence
stars. Astrophysical Journal. 2024;970(1). doi:10.3847/1538-4357/ad4708
apa: Bhattacharya, S., Das, S. B., Bugnet, L. A., Panda, S., & Hanasoge, S.
M. (2024). Detectability of axisymmetric magnetic fields from the core to the
surface of oscillating post-main-sequence stars. Astrophysical Journal.
IOP Publishing. https://doi.org/10.3847/1538-4357/ad4708
chicago: Bhattacharya, Shatanik, Srijan B Das, Lisa Annabelle Bugnet, Subrata Panda,
and Shravan M. Hanasoge. “Detectability of Axisymmetric Magnetic Fields from the
Core to the Surface of Oscillating Post-Main-Sequence Stars.” Astrophysical
Journal. IOP Publishing, 2024. https://doi.org/10.3847/1538-4357/ad4708.
ieee: S. Bhattacharya, S. B. Das, L. A. Bugnet, S. Panda, and S. M. Hanasoge, “Detectability
of axisymmetric magnetic fields from the core to the surface of oscillating post-main-sequence
stars,” Astrophysical Journal, vol. 970, no. 1. IOP Publishing, 2024.
ista: Bhattacharya S, Das SB, Bugnet LA, Panda S, Hanasoge SM. 2024. Detectability
of axisymmetric magnetic fields from the core to the surface of oscillating post-main-sequence
stars. Astrophysical Journal. 970(1), 42.
mla: Bhattacharya, Shatanik, et al. “Detectability of Axisymmetric Magnetic Fields
from the Core to the Surface of Oscillating Post-Main-Sequence Stars.” Astrophysical
Journal, vol. 970, no. 1, 42, IOP Publishing, 2024, doi:10.3847/1538-4357/ad4708.
short: S. Bhattacharya, S.B. Das, L.A. Bugnet, S. Panda, S.M. Hanasoge, Astrophysical
Journal 970 (2024).
date_created: 2024-07-28T22:01:09Z
date_published: 2024-07-15T00:00:00Z
date_updated: 2025-09-08T08:42:20Z
day: '15'
ddc:
- '520'
department:
- _id: LiBu
doi: 10.3847/1538-4357/ad4708
ec_funded: 1
external_id:
arxiv:
- '2404.17167'
isi:
- '001270972500001'
file:
- access_level: open_access
checksum: acb42a87deecbc9228fbbe6a48a37ec6
content_type: application/pdf
creator: dernst
date_created: 2024-07-29T11:02:48Z
date_updated: 2024-07-29T11:02:48Z
file_id: '17340'
file_name: 2024_AstrophysicalJourn_Bhattacharya.pdf
file_size: 3912290
relation: main_file
success: 1
file_date_updated: 2024-07-29T11:02:48Z
has_accepted_license: '1'
intvolume: ' 970'
isi: 1
issue: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Astrophysical Journal
publication_identifier:
eissn:
- 1538-4357
issn:
- 0004-637X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Detectability of axisymmetric magnetic fields from the core to the surface
of oscillating post-main-sequence stars
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: 970
year: '2024'
...
---
_id: '17327'
abstract:
- lang: eng
text: Sequential decision-making in probabilistic environments is a fundamental
problem with many applications in AI and economics. In this paper, we present
an algorithm for synthesizing sequential decision-making agents that optimize
statistical properties such as maximum and average response times. In the general
setting of sequential decision-making, the environment is modeled as a random
process that generates inputs. The agent responds to each input, aiming to maximize
rewards and minimize costs within a specified time horizon. The corresponding
synthesis problem is known to be PSPACE-hard. We consider the special case where
the input distribution, reward, and cost depend on input-output statistics specified
by counter automata. For such problems, this paper presents the first PTIME synthesis
algorithms. We introduce the notion of statistical abstraction, which clusters
statistically indistinguishable input-output sequences into equivalence classes.
This abstraction allows for a dynamic programming algorithm whose complexity grows
polynomially with the considered horizon, making the statistical case exponentially
more efficient than the general case. We evaluate our algorithm on three different
application scenarios of a client-server protocol, where multiple clients compete
via bidding to gain access to the service offered by the server. The synthesized
policies optimize profit while guaranteeing that none of the server’s clients
is disproportionately starved of the service.
acknowledgement: "This work is partly supported by the European Research Council under
Grant No.: ERC2020-AdG 101020093. It is also partially supported by the State Government
of Styria, Austria –\r\nDepartment Zukunftsfonds Steiermark."
alternative_title:
- LIPIcs
article_number: '2'
article_processing_charge: Yes
author:
- first_name: Filip
full_name: Cano, Filip
last_name: Cano
- 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: Bettina
full_name: Könighofer, Bettina
last_name: Könighofer
- 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: 'Cano F, Henzinger TA, Könighofer B, Kueffner K, Mallik K. Abstraction-based
decision making for statistical properties. In: 9th International Conference
on Formal Structures for Computation and Deduction. Vol 299. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.FSCD.2024.2'
apa: 'Cano, F., Henzinger, T. A., Könighofer, B., Kueffner, K., & Mallik, K.
(2024). Abstraction-based decision making for statistical properties. In 9th
International Conference on Formal Structures for Computation and Deduction
(Vol. 299). Tallinn, Estonia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.FSCD.2024.2'
chicago: Cano, Filip, Thomas A Henzinger, Bettina Könighofer, Konstantin Kueffner,
and Kaushik Mallik. “Abstraction-Based Decision Making for Statistical Properties.”
In 9th International Conference on Formal Structures for Computation and Deduction,
Vol. 299. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.FSCD.2024.2.
ieee: F. Cano, T. A. Henzinger, B. Könighofer, K. Kueffner, and K. Mallik, “Abstraction-based
decision making for statistical properties,” in 9th International Conference
on Formal Structures for Computation and Deduction, Tallinn, Estonia, 2024,
vol. 299.
ista: 'Cano F, Henzinger TA, Könighofer B, Kueffner K, Mallik K. 2024. Abstraction-based
decision making for statistical properties. 9th International Conference on Formal
Structures for Computation and Deduction. FSCD: Conference on Formal Structures
for Computation and Deduction, LIPIcs, vol. 299, 2.'
mla: Cano, Filip, et al. “Abstraction-Based Decision Making for Statistical Properties.”
9th International Conference on Formal Structures for Computation and Deduction,
vol. 299, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.FSCD.2024.2.
short: F. Cano, T.A. Henzinger, B. Könighofer, K. Kueffner, K. Mallik, in:, 9th
International Conference on Formal Structures for Computation and Deduction, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
conference:
end_date: 2024-07-13
location: Tallinn, Estonia
name: 'FSCD: Conference on Formal Structures for Computation and Deduction'
start_date: 2024-07-10
corr_author: '1'
date_created: 2024-07-28T22:01:09Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2025-12-02T13:43:50Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.FSCD.2024.2
ec_funded: 1
external_id:
isi:
- '001587746100002'
file:
- access_level: open_access
checksum: cc6bb89be0eaa404a6ce019392cd293e
content_type: application/pdf
creator: dernst
date_created: 2024-07-29T11:15:59Z
date_updated: 2024-07-29T11:15:59Z
file_id: '17341'
file_name: 2024_LIPICs_Cano.pdf
file_size: 1391381
relation: main_file
success: 1
file_date_updated: 2024-07-29T11:15:59Z
has_accepted_license: '1'
intvolume: ' 299'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 9th International Conference on Formal Structures for Computation and
Deduction
publication_identifier:
isbn:
- '9783959773232'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Abstraction-based decision making for statistical properties
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 299
year: '2024'
...
---
_id: '17328'
abstract:
- lang: eng
text: "We study selfish mining attacks in longest-chain blockchains like Bitcoin,
but where the proof of work is replaced with efficient proof systems - like proofs
of stake or proofs of space - and consider the problem of computing an optimal
selfish mining attack which maximizes expected relative revenue of the adversary,
thus minimizing the chain quality. To this end, we propose a novel selfish mining
attack that aims to maximize this objective and formally model the attack as a
Markov decision process (MDP). We then present a formal analysis procedure which
computes an ϵ-tight lower bound on the optimal expected relative revenue in the
MDP and a strategy that achieves this ϵ-tight lower bound, where ϵ > 0 may be
any specified precision. Our analysis is fully automated and provides formal guarantees
on the correctness. We evaluate our selfish mining attack and observe that it
achieves superior expected relative revenue compared to two considered baselines.\r\nIn
concurrent work [Sarenche FC'24] does an automated analysis on selfish mining
in predictable longest-chain blockchains based on efficient proof systems. Predictable
means the randomness for the challenges is fixed for many blocks (as used e.g.,
in Ouroboros), while we consider unpredictable (Bitcoin-like) chains where the
challenge is derived from the previous block."
acknowledgement: "This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt)
grant and the MOE-T2EP20122-0014 (Data-Driven Distributed Algorithms) grant.\r\n"
article_processing_charge: Yes (via OA deal)
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amirali
full_name: Ebrahimzadeh, Amirali
last_name: Ebrahimzadeh
- first_name: Mehrdad
full_name: Karrabi, Mehrdad
id: 67638922-f394-11eb-9cf6-f20423e08757
last_name: Karrabi
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Michelle X
full_name: Yeo, Michelle X
id: 2D82B818-F248-11E8-B48F-1D18A9856A87
last_name: Yeo
orcid: 0009-0001-3676-4809
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Chatterjee K, Ebrahimzadeh A, Karrabi M, Pietrzak KZ, Yeo MX, Zikelic D. Fully
automated selfish mining analysis in efficient proof systems blockchains. In:
Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed
Computing. Association for Computing Machinery; 2024:268-278. doi:10.1145/3662158.3662769'
apa: 'Chatterjee, K., Ebrahimzadeh, A., Karrabi, M., Pietrzak, K. Z., Yeo, M. X.,
& Zikelic, D. (2024). Fully automated selfish mining analysis in efficient
proof systems blockchains. In Proceedings of the 43rd Annual ACM Symposium
on Principles of Distributed Computing (pp. 268–278). Nantes, France: Association
for Computing Machinery. https://doi.org/10.1145/3662158.3662769'
chicago: Chatterjee, Krishnendu, Amirali Ebrahimzadeh, Mehrdad Karrabi, Krzysztof
Z Pietrzak, Michelle X Yeo, and Dorde Zikelic. “Fully Automated Selfish Mining
Analysis in Efficient Proof Systems Blockchains.” In Proceedings of the 43rd
Annual ACM Symposium on Principles of Distributed Computing, 268–78. Association
for Computing Machinery, 2024. https://doi.org/10.1145/3662158.3662769.
ieee: K. Chatterjee, A. Ebrahimzadeh, M. Karrabi, K. Z. Pietrzak, M. X. Yeo, and
D. Zikelic, “Fully automated selfish mining analysis in efficient proof systems
blockchains,” in Proceedings of the 43rd Annual ACM Symposium on Principles
of Distributed Computing, Nantes, France, 2024, pp. 268–278.
ista: 'Chatterjee K, Ebrahimzadeh A, Karrabi M, Pietrzak KZ, Yeo MX, Zikelic D.
2024. Fully automated selfish mining analysis in efficient proof systems blockchains. Proceedings
of the 43rd Annual ACM Symposium on Principles of Distributed Computing. PODC:
Symposium on Principles of Distributed Computing, 268–278.'
mla: Chatterjee, Krishnendu, et al. “Fully Automated Selfish Mining Analysis in
Efficient Proof Systems Blockchains.” Proceedings of the 43rd Annual ACM Symposium
on Principles of Distributed Computing, Association for Computing Machinery,
2024, pp. 268–78, doi:10.1145/3662158.3662769.
short: K. Chatterjee, A. Ebrahimzadeh, M. Karrabi, K.Z. Pietrzak, M.X. Yeo, D. Zikelic,
in:, Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed
Computing, Association for Computing Machinery, 2024, pp. 268–278.
conference:
end_date: 2024-06-21
location: Nantes, France
name: 'PODC: Symposium on Principles of Distributed Computing'
start_date: 2024-06-17
corr_author: '1'
date_created: 2024-07-28T22:01:10Z
date_published: 2024-06-17T00:00:00Z
date_updated: 2025-04-14T07:52:47Z
day: '17'
ddc:
- '000'
department:
- _id: KrCh
- _id: KrPi
doi: 10.1145/3662158.3662769
ec_funded: 1
external_id:
arxiv:
- '2405.04420'
file:
- access_level: open_access
checksum: 6122bd97b42751ff81c452a19970f67d
content_type: application/pdf
creator: dernst
date_created: 2024-07-29T07:18:12Z
date_updated: 2024-07-29T07:18:12Z
file_id: '17334'
file_name: 2024_ACM_Chatterjee.pdf
file_size: 832034
relation: main_file
success: 1
file_date_updated: 2024-07-29T07:18:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 268-278
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: ' Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed
Computing'
publication_identifier:
isbn:
- '9798400706684'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fully automated selfish mining analysis in efficient proof systems blockchains
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
_id: '17329'
abstract:
- lang: eng
text: 'We initiate the study of game dynamics in the population protocol model:
n agents each maintain a current local strategy and interact in pairs uniformly
at random. Upon each interaction, the agents play a two-person game and receive
a payoff from an underlying utility function, and they can subsequently update
their strategies according to a fixed local algorithm. In this setting, we ask
how the distribution over agent strategies evolves over a sequence of interactions,
and we introduce a new distributional equilibrium concept to quantify the quality
of such distributions. As an initial example, we study a class of repeated prisoner''s
dilemma games, and we consider a family of simple local update algorithms that
yield non-trivial dynamics over the distribution of agent strategies. We show
that these dynamics are related to a new class of high-dimensional Ehrenfest random
walks, and we derive exact characterizations of their stationary distributions,
bounds on their mixing times, and prove their convergence to approximate distributional
equilibria. Our results highlight trade-offs between the local state space of
each agent, and the convergence rate and approximation factor of the underlying
dynamics. Our approach opens the door towards the further characterization of
equilibrium computation for other classes of games and dynamics in the population
setting.'
acknowledgement: This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt)
grant. We thank James Aspnes and Thomas Sauerwald for several helpful discussions
on Ehrenfest random walks.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Mehrdad
full_name: Karrabi, Mehrdad
id: 67638922-f394-11eb-9cf6-f20423e08757
last_name: Karrabi
- first_name: John M
full_name: Lazarsfeld, John M
id: 17ce3656-183e-11ef-84c3-8932383e1b23
last_name: Lazarsfeld
citation:
ama: 'Alistarh D-A, Chatterjee K, Karrabi M, Lazarsfeld JM. Game dynamics and equilibrium
computation in the population protocol model. In: Proceedings of the 43rd Annual
ACM Symposium on Principles of Distributed Computing. Association for Computing
Machinery; 2024:40-49. doi:10.1145/3662158.3662768'
apa: 'Alistarh, D.-A., Chatterjee, K., Karrabi, M., & Lazarsfeld, J. M. (2024).
Game dynamics and equilibrium computation in the population protocol model. In
Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing
(pp. 40–49). Nantes, France: Association for Computing Machinery. https://doi.org/10.1145/3662158.3662768'
chicago: Alistarh, Dan-Adrian, Krishnendu Chatterjee, Mehrdad Karrabi, and John
M Lazarsfeld. “Game Dynamics and Equilibrium Computation in the Population Protocol
Model.” In Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed
Computing, 40–49. Association for Computing Machinery, 2024. https://doi.org/10.1145/3662158.3662768.
ieee: D.-A. Alistarh, K. Chatterjee, M. Karrabi, and J. M. Lazarsfeld, “Game dynamics
and equilibrium computation in the population protocol model,” in Proceedings
of the 43rd Annual ACM Symposium on Principles of Distributed Computing, Nantes,
France, 2024, pp. 40–49.
ista: 'Alistarh D-A, Chatterjee K, Karrabi M, Lazarsfeld JM. 2024. Game dynamics
and equilibrium computation in the population protocol model. Proceedings of the
43rd Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium
on Principles of Distributed Computing, 40–49.'
mla: Alistarh, Dan-Adrian, et al. “Game Dynamics and Equilibrium Computation in
the Population Protocol Model.” Proceedings of the 43rd Annual ACM Symposium
on Principles of Distributed Computing, Association for Computing Machinery,
2024, pp. 40–49, doi:10.1145/3662158.3662768.
short: D.-A. Alistarh, K. Chatterjee, M. Karrabi, J.M. Lazarsfeld, in:, Proceedings
of the 43rd Annual ACM Symposium on Principles of Distributed Computing, Association
for Computing Machinery, 2024, pp. 40–49.
conference:
end_date: 2024-06-21
location: Nantes, France
name: 'PODC: Symposium on Principles of Distributed Computing'
start_date: 2024-06-17
corr_author: '1'
date_created: 2024-07-28T22:01:10Z
date_published: 2024-06-17T00:00:00Z
date_updated: 2025-04-14T07:52:47Z
day: '17'
ddc:
- '000'
department:
- _id: DaAl
- _id: KrCh
doi: 10.1145/3662158.3662768
ec_funded: 1
file:
- access_level: open_access
checksum: 65a40437f83373fa79dd999d5287509e
content_type: application/pdf
creator: dernst
date_created: 2024-07-29T07:37:31Z
date_updated: 2024-07-29T07:37:31Z
file_id: '17335'
file_name: 2024_ACMPODC_Alistarh.pdf
file_size: 750908
relation: main_file
success: 1
file_date_updated: 2024-07-29T07:37:31Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 40-49
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed
Computing
publication_identifier:
isbn:
- '9798400706684'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Game dynamics and equilibrium computation in the population protocol model
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '17330'
abstract:
- lang: eng
text: In this work we consider the list-decodability and list-recoverability of
arbitrary q -ary codes, for all integer values of q ⩾ 2. A code is called ( p
, L ) q -list-decodable if every radius pn Hamming ball contains less than L codewords;
( p , ℓ, L ) q -recoverability is a generalization where we place radius pn Hamming
balls on every point of a combinatorial rectangle with side length ℓ and again
stipulate that there be less than L codewords. Our main contribution is to precisely
calculate the maximum value of p for which there exist infinite families of positive
rate ( p , ℓ, L ) q -list-recoverable codes, the quantity we call the zero-rate
threshold . Denoting this value by p *, we in fact show that codes correcting
a p * + ε fraction of errors must have size O ε (1), i.e., independent of n .
Such a result is typically referred to as a “Plotkin bound.” To complement this,
a standard random code with expurgation construction shows that there exist positive
rate codes correcting a p * − ε fraction of errors. We also follow a classical
proof template (typically attributed to Elias and Bassalygo) to derive from the
zero-rate threshold other tradeoffs between rate and decoding radius for list-decoding
and list-recovery. Technically, proving the Plotkin bound boils down to demon-strating
the Schur convexity of a certain function defined on the q -simplex as well as
the convexity of a univariate function derived from it. We remark that an earlier
argument claimed similar results for q -ary list-decoding; however, we point out
that this earlier proof is flawed.
acknowledgement: Part of this work was done while Nicolas Resch was affiliated with
the Centrum Wiskunde & Informatica and supported in part by ERC H2020 grant No.74079
(ALGSTRONGCRYPTO). Chen Yuan is supported in part by the National Key Research and
Development Projects under Grant 2022YFA1004900 and Grant 2021YFE0109900, the National
Natural Science Foundation of China under Grant 12101403 and Grant 12031011.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nicolas
full_name: Resch, Nicolas
last_name: Resch
- first_name: Chen
full_name: Yuan, Chen
last_name: Yuan
- first_name: Yihan
full_name: Zhang, Yihan
id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
last_name: Zhang
orcid: 0000-0002-6465-6258
citation:
ama: Resch N, Yuan C, Zhang Y. Zero-rate thresholds and new capacity bounds for
list-decoding and list-recovery. IEEE Transactions on Information Theory.
2024;70(9):6211-6238. doi:10.1109/TIT.2024.3430842
apa: Resch, N., Yuan, C., & Zhang, Y. (2024). Zero-rate thresholds and new capacity
bounds for list-decoding and list-recovery. IEEE Transactions on Information
Theory. IEEE. https://doi.org/10.1109/TIT.2024.3430842
chicago: Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Zero-Rate Thresholds and New
Capacity Bounds for List-Decoding and List-Recovery.” IEEE Transactions on
Information Theory. IEEE, 2024. https://doi.org/10.1109/TIT.2024.3430842.
ieee: N. Resch, C. Yuan, and Y. Zhang, “Zero-rate thresholds and new capacity bounds
for list-decoding and list-recovery,” IEEE Transactions on Information Theory,
vol. 70, no. 9. IEEE, pp. 6211–6238, 2024.
ista: Resch N, Yuan C, Zhang Y. 2024. Zero-rate thresholds and new capacity bounds
for list-decoding and list-recovery. IEEE Transactions on Information Theory.
70(9), 6211–6238.
mla: Resch, Nicolas, et al. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding
and List-Recovery.” IEEE Transactions on Information Theory, vol. 70, no.
9, IEEE, 2024, pp. 6211–38, doi:10.1109/TIT.2024.3430842.
short: N. Resch, C. Yuan, Y. Zhang, IEEE Transactions on Information Theory 70 (2024)
6211–6238.
corr_author: '1'
date_created: 2024-07-28T22:01:10Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-09-08T08:31:53Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/TIT.2024.3430842
external_id:
arxiv:
- '2210.07754'
isi:
- '001299623600019'
intvolume: ' 70'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2210.07754
month: '09'
oa: 1
oa_version: Preprint
page: 6211-6238
publication: IEEE Transactions on Information Theory
publication_identifier:
eissn:
- 1557-9654
issn:
- 0018-9448
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '14083'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 70
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '17331'
abstract:
- lang: eng
text: Amyloidosis are a group of diseases in which soluble proteins aggregate and
deposit in fibrillar conformation extracellularly in tissues. The effectiveness
of therapeutic strategies depends on the specific protein involved, being crucial
to accurately determine its nature. Moreover, following the diagnosis, the search
for the mutation within relatives allows the clinical advice. Here we report the
precise diagnosis and explored the possible reasons of the structural pathogenicity
for a renal amyloidosis related to a fibrinogen Aα-chain variant. Whole-exome
sequencing and GATK calling pipeline were leveraged to characterize the protein
variant present in a patient with kidney failure. Bioinformatics strategies were
applied to suggest potential explanations of the variants aggregation. Our pipeline
allowed the identification of a single-point variant of fibrinogen Aα-chain, which
opened the possibility of curative transplantation. In silico structural analysis
suggested that the pathogenicity of the variant may be attributed to a heightened
susceptibility to yield a peptide prone to deposit as an oligomer with a β-sheet
structure. Exploiting the comprehensive coverage of whole-genome sequencing, we
managed to fill a vacant stage in the diagnosis of hereditary amyloidosis and
to stimulate the advancement in biomedicine.
acknowledgement: The authors acknowledge Rosana del Cid for her help with English
corrections, Mario Ramos for the figure editions, and Gabriela Finarelli for technical
assistance. S.A. Rosú, N.A. Ramella, and M.A. Tricerri acknowledge support from
Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET) (Grant PIP
11220200102381), Agencia Nacional de Promoción Científica y Tecnológica (PICT 2019-03592),
Universidad Nacional de La Plata (UNLP) (Grants M234 and PPID M014), and Fundación
Florencio Fiorini. The authors warmly thank M.P. for her willingness to conduct
these studies.
article_processing_charge: No
article_type: original
author:
- first_name: Elizabeth R
full_name: Cattaneo, Elizabeth R
last_name: Cattaneo
- first_name: Romina A
full_name: Gisonno, Romina A
id: a9e08d76-6a98-11ec-8f7b-c777fe5ca519
last_name: Gisonno
- first_name: Martín C
full_name: Abba, Martín C
last_name: Abba
- first_name: Marianela
full_name: Santana, Marianela
last_name: Santana
- first_name: Silvana A
full_name: Rosú, Silvana A
last_name: Rosú
- first_name: Elsa
full_name: Nucifora, Elsa
last_name: Nucifora
- first_name: María A
full_name: Aguirre, María A
last_name: Aguirre
- first_name: María C
full_name: Giordani, María C
last_name: Giordani
- first_name: M. Alejandra
full_name: Tricerri, M. Alejandra
last_name: Tricerri
- first_name: Nahuel A
full_name: Ramella, Nahuel A
last_name: Ramella
citation:
ama: 'Cattaneo ER, Gisonno RA, Abba MC, et al. Hereditary amyloidosis: Insights
into a fibrinogen A variant protein. Proteins: Structure, Function and Bioinformatics.
2024;92(12):1366-1374. doi:10.1002/prot.26732'
apa: 'Cattaneo, E. R., Gisonno, R. A., Abba, M. C., Santana, M., Rosú, S. A., Nucifora,
E., … Ramella, N. A. (2024). Hereditary amyloidosis: Insights into a fibrinogen
A variant protein. Proteins: Structure, Function and Bioinformatics. Wiley.
https://doi.org/10.1002/prot.26732'
chicago: 'Cattaneo, Elizabeth R, Romina A Gisonno, Martín C Abba, Marianela Santana,
Silvana A Rosú, Elsa Nucifora, María A Aguirre, María C Giordani, M. Alejandra
Tricerri, and Nahuel A Ramella. “Hereditary Amyloidosis: Insights into a Fibrinogen
A Variant Protein.” Proteins: Structure, Function and Bioinformatics. Wiley,
2024. https://doi.org/10.1002/prot.26732.'
ieee: 'E. R. Cattaneo et al., “Hereditary amyloidosis: Insights into a fibrinogen
A variant protein,” Proteins: Structure, Function and Bioinformatics, vol.
92, no. 12. Wiley, pp. 1366–1374, 2024.'
ista: 'Cattaneo ER, Gisonno RA, Abba MC, Santana M, Rosú SA, Nucifora E, Aguirre
MA, Giordani MC, Tricerri MA, Ramella NA. 2024. Hereditary amyloidosis: Insights
into a fibrinogen A variant protein. Proteins: Structure, Function and Bioinformatics.
92(12), 1366–1374.'
mla: 'Cattaneo, Elizabeth R., et al. “Hereditary Amyloidosis: Insights into a Fibrinogen
A Variant Protein.” Proteins: Structure, Function and Bioinformatics, vol.
92, no. 12, Wiley, 2024, pp. 1366–74, doi:10.1002/prot.26732.'
short: 'E.R. Cattaneo, R.A. Gisonno, M.C. Abba, M. Santana, S.A. Rosú, E. Nucifora,
M.A. Aguirre, M.C. Giordani, M.A. Tricerri, N.A. Ramella, Proteins: Structure,
Function and Bioinformatics 92 (2024) 1366–1374.'
date_created: 2024-07-28T22:01:10Z
date_published: 2024-12-01T00:00:00Z
date_updated: 2025-09-08T08:33:53Z
day: '01'
department:
- _id: GaNo
doi: 10.1002/prot.26732
external_id:
isi:
- '001272128100001'
pmid:
- '39031927'
intvolume: ' 92'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.22541/au.171804763.37967262/v1
month: '12'
oa: 1
oa_version: Preprint
page: 1366-1374
pmid: 1
publication: 'Proteins: Structure, Function and Bioinformatics'
publication_identifier:
eissn:
- 1097-0134
issn:
- 0887-3585
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Hereditary amyloidosis: Insights into a fibrinogen A variant protein'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 92
year: '2024'
...
---
_id: '17332'
abstract:
- lang: eng
text: 'Tree data structures, such as red-black trees, quad trees, treaps, or tries,
are fundamental tools in computer science. A classical problem in concurrency
is to obtain expressive, efficient, and scalable versions of practical tree data
structures. We are interested in concurrent trees supporting range queries, i.e.,
queries that involve multiple consecutive data items. Existing implementations
with this capability can list keys in a specific range, but do not support aggregate
range queries: for instance, if we want to calculate the number of keys in a range,
the only choice is to retrieve a whole list and return its size. This is suboptimal:
in the sequential setting, one can augment a balanced search tree with counters
and, consequently, perform these aggregate requests in logarithmic rather than
linear time.In this paper, we propose a generic approach to implement a broad
class of range queries on concurrent trees in a way that is wait-free, asymptotically
efficient, and practically scalable. The key idea is a new mechanism for maintaining
metadata concurrently at tree nodes, which can be seen as a wait-free variant
of hand-over-hand locking (which we call hand-over-hand helping). We did a preliminary
implementation of the wait-free binary search tree and preliminary experiments
have indicated the soundness of our approach.'
acknowledgement: We thank Trevor Brown and Yuanhao Wei for the discussion and anonymous
reviewers for helping us to improve the paper. Also, we thank JetBrains and Huawei
for their support.
article_processing_charge: No
arxiv: 1
author:
- first_name: Ilya
full_name: Kokorin, Ilya
last_name: Kokorin
- first_name: Victor
full_name: Yudov, Victor
last_name: Yudov
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- 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: 'Kokorin I, Yudov V, Aksenov V, Alistarh D-A. Wait-free trees with asymptotically-efficient
range queries. In: 2024 IEEE International Parallel and Distributed Processing
Symposium. IEEE; 2024:169-179. doi:10.1109/IPDPS57955.2024.00023'
apa: 'Kokorin, I., Yudov, V., Aksenov, V., & Alistarh, D.-A. (2024). Wait-free
trees with asymptotically-efficient range queries. In 2024 IEEE International
Parallel and Distributed Processing Symposium (pp. 169–179). San Francisco,
CA, United States: IEEE. https://doi.org/10.1109/IPDPS57955.2024.00023'
chicago: Kokorin, Ilya, Victor Yudov, Vitaly Aksenov, and Dan-Adrian Alistarh. “Wait-Free
Trees with Asymptotically-Efficient Range Queries.” In 2024 IEEE International
Parallel and Distributed Processing Symposium, 169–79. IEEE, 2024. https://doi.org/10.1109/IPDPS57955.2024.00023.
ieee: I. Kokorin, V. Yudov, V. Aksenov, and D.-A. Alistarh, “Wait-free trees with
asymptotically-efficient range queries,” in 2024 IEEE International Parallel
and Distributed Processing Symposium, San Francisco, CA, United States, 2024,
pp. 169–179.
ista: 'Kokorin I, Yudov V, Aksenov V, Alistarh D-A. 2024. Wait-free trees with asymptotically-efficient
range queries. 2024 IEEE International Parallel and Distributed Processing Symposium.
IPDPS: International Parallel and Distributed Processing Symposium, 169–179.'
mla: Kokorin, Ilya, et al. “Wait-Free Trees with Asymptotically-Efficient Range
Queries.” 2024 IEEE International Parallel and Distributed Processing Symposium,
IEEE, 2024, pp. 169–79, doi:10.1109/IPDPS57955.2024.00023.
short: I. Kokorin, V. Yudov, V. Aksenov, D.-A. Alistarh, in:, 2024 IEEE International
Parallel and Distributed Processing Symposium, IEEE, 2024, pp. 169–179.
conference:
end_date: 2024-05-31
location: San Francisco, CA, United States
name: 'IPDPS: International Parallel and Distributed Processing Symposium'
start_date: 2024-05-27
corr_author: '1'
date_created: 2024-07-28T22:01:11Z
date_published: 2024-07-08T00:00:00Z
date_updated: 2025-09-08T08:29:45Z
day: '08'
department:
- _id: DaAl
doi: 10.1109/IPDPS57955.2024.00023
external_id:
arxiv:
- '2310.05293'
isi:
- '001270389600078'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2310.05293
month: '07'
oa: 1
oa_version: Preprint
page: 169-179
publication: 2024 IEEE International Parallel and Distributed Processing Symposium
publication_identifier:
eissn:
- 1530-2075
isbn:
- '9798350337662'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Wait-free trees with asymptotically-efficient range queries
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
_id: '17333'
abstract:
- lang: eng
text: Aqueous zinc-ion batteries are attractive due to their low cost, environmental
friendliness, and exceptional performance, but the latter remains poorly understood.
Now, a fast catalytic step involved in oxygen redox catalysis is shown to contribute
to capacity at a high rate.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Soumyadip
full_name: Mondal, Soumyadip
id: d25d21ef-dc8d-11ea-abe3-ec4576307f48
last_name: Mondal
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Mondal S, Freunberger SA. Catalysing rate and capacity. Nature Catalysis.
2024;7(7):759-760. doi:10.1038/s41929-024-01184-7
apa: Mondal, S., & Freunberger, S. A. (2024). Catalysing rate and capacity.
Nature Catalysis. Springer Nature. https://doi.org/10.1038/s41929-024-01184-7
chicago: Mondal, Soumyadip, and Stefan Alexander Freunberger. “Catalysing Rate and
Capacity.” Nature Catalysis. Springer Nature, 2024. https://doi.org/10.1038/s41929-024-01184-7.
ieee: S. Mondal and S. A. Freunberger, “Catalysing rate and capacity,” Nature
Catalysis, vol. 7, no. 7. Springer Nature, pp. 759–760, 2024.
ista: Mondal S, Freunberger SA. 2024. Catalysing rate and capacity. Nature Catalysis.
7(7), 759–760.
mla: Mondal, Soumyadip, and Stefan Alexander Freunberger. “Catalysing Rate and Capacity.”
Nature Catalysis, vol. 7, no. 7, Springer Nature, 2024, pp. 759–60, doi:10.1038/s41929-024-01184-7.
short: S. Mondal, S.A. Freunberger, Nature Catalysis 7 (2024) 759–760.
corr_author: '1'
date_created: 2024-07-29T07:05:33Z
date_published: 2024-07-26T00:00:00Z
date_updated: 2025-09-08T08:30:59Z
day: '26'
department:
- _id: StFr
doi: 10.1038/s41929-024-01184-7
external_id:
isi:
- '001278986700012'
intvolume: ' 7'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa_version: None
page: 759-760
publication: Nature Catalysis
publication_identifier:
issn:
- 2520-1158
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Catalysing rate and capacity
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 7
year: '2024'
...
---
_id: '17344'
abstract:
- lang: eng
text: 'This file contains the Mathematica notebook associated with the paper Effect
of assortative mating and sexual selection on polygenic barriers to gene flow.
It contains the numerical approximations, analyses, and simulations used in the
study. '
acknowledged_ssus:
- _id: ScienComp
article_processing_charge: No
author:
- first_name: Parvathy
full_name: Surendranadh, Parvathy
id: 455235B8-F248-11E8-B48F-1D18A9856A87
last_name: Surendranadh
orcid: 0000-0001-6395-386X
- first_name: Himani
full_name: Sachdeva, Himani
last_name: Sachdeva
citation:
ama: Surendranadh P, Sachdeva H. Mathematica notebook for “Effect of assortative
mating and sexual selection on polygenic barriers to gene flow.” 2024. doi:10.15479/AT:ISTA:17344
apa: Surendranadh, P., & Sachdeva, H. (2024). Mathematica notebook for “Effect
of assortative mating and sexual selection on polygenic barriers to gene flow.”
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:17344
chicago: Surendranadh, Parvathy, and Himani Sachdeva. “Mathematica Notebook for
‘Effect of Assortative Mating and Sexual Selection on Polygenic Barriers to Gene
Flow.’” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/AT:ISTA:17344.
ieee: P. Surendranadh and H. Sachdeva, “Mathematica notebook for ‘Effect of assortative
mating and sexual selection on polygenic barriers to gene flow.’” Institute of
Science and Technology Austria, 2024.
ista: Surendranadh P, Sachdeva H. 2024. Mathematica notebook for ‘Effect of assortative
mating and sexual selection on polygenic barriers to gene flow’, Institute of
Science and Technology Austria, 10.15479/AT:ISTA:17344.
mla: Surendranadh, Parvathy, and Himani Sachdeva. Mathematica Notebook for “Effect
of Assortative Mating and Sexual Selection on Polygenic Barriers to Gene Flow.”
Institute of Science and Technology Austria, 2024, doi:10.15479/AT:ISTA:17344.
short: P. Surendranadh, H. Sachdeva, (2024).
date_created: 2024-07-29T14:01:43Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2025-01-14T13:02:59Z
ddc:
- '576'
department:
- _id: GradSch
- _id: NiBa
doi: 10.15479/AT:ISTA:17344
file:
- access_level: open_access
checksum: 75bdbc7ad7cc6afe4459bc4a8824a302
content_type: application/octet-stream
creator: psurendr
date_created: 2024-07-29T13:51:11Z
date_updated: 2024-07-29T13:51:11Z
file_id: '17345'
file_name: Submission.nb
file_size: 726132
relation: main_file
success: 1
file_date_updated: 2024-07-29T13:51:11Z
has_accepted_license: '1'
month: '07'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Mathematica notebook for 'Effect of assortative mating and sexual selection
on polygenic barriers to gene flow'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
_id: '17372'
abstract:
- lang: eng
text: 'In this paper, we investigate the global well-posedness of reaction-diffusion
systems with transport noise on the d-dimensional torus. We show new global well-posedness
results for a large class of scalar equations (e.g. the Allen-Cahn equation),
and dissipative systems (e.g. equations in coagulation dynamics). Moreover, we
prove global well-posedness for two weakly dissipative systems: Lotka-Volterra
equations for d∈{1,2,3,4} and the Brusselator for d∈{1,2,3}. Many of the results
are also new without transport noise. The proofs are based on maximal regularity
techniques, positivity results, and sharp blow-up criteria developed in our recent
works, combined with energy estimates based on Itô''s formula and stochastic Gronwall
inequalities. Key novelties include the introduction of new Lζ -coercivity/dissipativity
conditions and the development of an Lp(Lq) -framework for systems of reaction-diffusion
equations, which are needed when treating dimensions d∈{2,3} in the case of
cubic or higher order nonlinearities.'
acknowledgement: The first author’s research was supported by the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
grant 948819. . The second author’s research was supported by the VICI subsidy VI.C.212.027
of the Netherlands Organisation for Scientific Research (NWO).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Antonio
full_name: Agresti, Antonio
id: 673cd0cc-9b9a-11eb-b144-88f30e1fbb72
last_name: Agresti
orcid: 0000-0002-9573-2962
- first_name: Mark
full_name: Veraar, Mark
last_name: Veraar
citation:
ama: 'Agresti A, Veraar M. Reaction-diffusion equations with transport noise and
critical superlinear diffusion: Global well-posedness of weakly dissipative systems.
SIAM Journal on Mathematical Analysis. 2024;56(4):4870-4927. doi:10.1137/23M1562482'
apa: 'Agresti, A., & Veraar, M. (2024). Reaction-diffusion equations with transport
noise and critical superlinear diffusion: Global well-posedness of weakly dissipative
systems. SIAM Journal on Mathematical Analysis. Society for Industrial
and Applied Mathematics. https://doi.org/10.1137/23M1562482'
chicago: 'Agresti, Antonio, and Mark Veraar. “Reaction-Diffusion Equations with
Transport Noise and Critical Superlinear Diffusion: Global Well-Posedness of Weakly
Dissipative Systems.” SIAM Journal on Mathematical Analysis. Society for
Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/23M1562482.'
ieee: 'A. Agresti and M. Veraar, “Reaction-diffusion equations with transport noise
and critical superlinear diffusion: Global well-posedness of weakly dissipative
systems,” SIAM Journal on Mathematical Analysis, vol. 56, no. 4. Society
for Industrial and Applied Mathematics, pp. 4870–4927, 2024.'
ista: 'Agresti A, Veraar M. 2024. Reaction-diffusion equations with transport noise
and critical superlinear diffusion: Global well-posedness of weakly dissipative
systems. SIAM Journal on Mathematical Analysis. 56(4), 4870–4927.'
mla: 'Agresti, Antonio, and Mark Veraar. “Reaction-Diffusion Equations with Transport
Noise and Critical Superlinear Diffusion: Global Well-Posedness of Weakly Dissipative
Systems.” SIAM Journal on Mathematical Analysis, vol. 56, no. 4, Society
for Industrial and Applied Mathematics, 2024, pp. 4870–927, doi:10.1137/23M1562482.'
short: A. Agresti, M. Veraar, SIAM Journal on Mathematical Analysis 56 (2024) 4870–4927.
corr_author: '1'
date_created: 2024-08-04T22:01:21Z
date_published: 2024-08-01T00:00:00Z
date_updated: 2025-09-08T08:46:57Z
day: '01'
department:
- _id: JuFi
doi: 10.1137/23M1562482
ec_funded: 1
external_id:
arxiv:
- '2301.06897'
isi:
- '001315424500021'
intvolume: ' 56'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2301.06897
month: '08'
oa: 1
oa_version: Preprint
page: 4870-4927
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
call_identifier: H2020
grant_number: '948819'
name: Bridging Scales in Random Materials
publication: SIAM Journal on Mathematical Analysis
publication_identifier:
eissn:
- 1095-7154
issn:
- 0036-1410
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Reaction-diffusion equations with transport noise and critical superlinear
diffusion: Global well-posedness of weakly dissipative systems'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 56
year: '2024'
...
---
_id: '17373'
abstract:
- lang: eng
text: Scanning Kelvin probe microscopy (SKPM) is a powerful technique for investigating
the electrostatic properties of material surfaces, enabling the imaging of variations
in work function, topology, surface charge density, or combinations thereof. Regardless
of the underlying signal source, SKPM results in a voltage image, which is spatially
distorted due to the finite size of the probe, long-range electrostatic interactions,
mechanical and electrical noise, and the finite response time of the electronics.
In order to recover the underlying signal, it is necessary to deconvolve the measurement
with an appropriate point spread function (PSF) that accounts the aforementioned
distortions, but determining this PSF is difficult. Here, we describe how such
PSFs can be determined experimentally and show how they can be used to recover
the underlying information of interest. We first consider the physical principles
that enable SKPM and discuss how these affect the system PSF. We then show how
one can experimentally measure PSFs by looking at well-defined features, and that
these compare well to simulated PSFs, provided scans are performed extremely slowly
and carefully. Next, we work at realistic scan speeds and show that the idealized
PSFs fail to capture temporal distortions in the scan direction. While simulating
PSFs for these situations would be quite challenging, we show that measuring PSFs
with similar scan conditions works well. Our approach clarifies the basic principles
and inherent challenges to SKPM measurements and gives practical methods to improve
results.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
- _id: LifeSc
- _id: ScienComp
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation program (Grant
Agreement No. 949120). This research was supported by the Scientific Service Units
of the Institute of Science and Technology Austria (ISTA) through resources provided
by the Miba Machine Shop, Nanofabrication Facility, Scientific Computing Facility,
and Lab Support Facility. The authors wish to thank Dmytro Rak and Juan Carlos Sobarzo
for letting us use their equipment. The authors wish to thank the contributions
of the whole Waitukaitis Group for useful discussions and feedback.
article_number: '045305'
article_processing_charge: No
article_type: original
author:
- first_name: Isaac C
full_name: Lenton, Isaac C
id: a550210f-223c-11ec-8182-e2d45e817efb
last_name: Lenton
orcid: 0000-0002-5010-6984
- first_name: Felix
full_name: Pertl, Felix
id: 6313aec0-15b2-11ec-abd3-ed67d16139af
last_name: Pertl
orcid: 0000-0003-0463-5794
- first_name: Lubuna B
full_name: Shafeek, Lubuna B
id: 3CD37A82-F248-11E8-B48F-1D18A9856A87
last_name: Shafeek
orcid: 0000-0001-7180-6050
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
citation:
ama: 'Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. Beyond the blur: Using experimentally
determined point spread functions to improve scanning Kelvin probe imaging. Journal
of Applied Physics. 2024;136(4). doi:10.1063/5.0215151'
apa: 'Lenton, I. C., Pertl, F., Shafeek, L. B., & Waitukaitis, S. R. (2024).
Beyond the blur: Using experimentally determined point spread functions to improve
scanning Kelvin probe imaging. Journal of Applied Physics. AIP Publishing.
https://doi.org/10.1063/5.0215151'
chicago: 'Lenton, Isaac C, Felix Pertl, Lubuna B Shafeek, and Scott R Waitukaitis.
“Beyond the Blur: Using Experimentally Determined Point Spread Functions to Improve
Scanning Kelvin Probe Imaging.” Journal of Applied Physics. AIP Publishing,
2024. https://doi.org/10.1063/5.0215151.'
ieee: 'I. C. Lenton, F. Pertl, L. B. Shafeek, and S. R. Waitukaitis, “Beyond the
blur: Using experimentally determined point spread functions to improve scanning
Kelvin probe imaging,” Journal of Applied Physics, vol. 136, no. 4. AIP
Publishing, 2024.'
ista: 'Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. 2024. Beyond the blur: Using
experimentally determined point spread functions to improve scanning Kelvin probe
imaging. Journal of Applied Physics. 136(4), 045305.'
mla: 'Lenton, Isaac C., et al. “Beyond the Blur: Using Experimentally Determined
Point Spread Functions to Improve Scanning Kelvin Probe Imaging.” Journal of
Applied Physics, vol. 136, no. 4, 045305, AIP Publishing, 2024, doi:10.1063/5.0215151.'
short: I.C. Lenton, F. Pertl, L.B. Shafeek, S.R. Waitukaitis, Journal of Applied
Physics 136 (2024).
corr_author: '1'
date_created: 2024-08-04T22:01:21Z
date_published: 2024-07-28T00:00:00Z
date_updated: 2025-09-08T08:47:42Z
day: '28'
ddc:
- '530'
department:
- _id: ScWa
- _id: NanoFab
doi: 10.1063/5.0215151
ec_funded: 1
external_id:
isi:
- '001281681100003'
file:
- access_level: open_access
checksum: 6141d05cd68d540a7446dce9490975db
content_type: application/pdf
creator: dernst
date_created: 2024-08-05T08:19:58Z
date_updated: 2024-08-05T08:19:58Z
file_id: '17386'
file_name: 2024_JourApplPhysics_Lenton.pdf
file_size: 2537502
relation: main_file
success: 1
file_date_updated: 2024-08-05T08:19:58Z
has_accepted_license: '1'
intvolume: ' 136'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 0aa60e99-070f-11eb-9043-a6de6bdc3afa
call_identifier: H2020
grant_number: '949120'
name: 'Tribocharge: a multi-scale approach to an enduring problem in physics'
publication: Journal of Applied Physics
publication_identifier:
eissn:
- 1089-7550
issn:
- 0021-8979
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Beyond the blur: Using experimentally determined point spread functions to
improve scanning Kelvin probe imaging'
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: 136
year: '2024'
...
---
_id: '17374'
abstract:
- lang: eng
text: Achieving photorealistic 3D view synthesis and relighting of human portraits
is pivotal for advancing AR/VR applications. Existing methodologies in portrait
relighting demonstrate substantial limitations in terms of generalization and
3D consistency, coupled with inaccuracies in physically realistic lighting and
identity preservation. Furthermore, personalization from a single view is difficult
to achieve and often requires multiview images during the testing phase or involves
slow optimization processes. This paper introduces Lite2Relight , a novel technique
that can predict 3D consistent head poses of portraits while performing physically
plausible light editing at interactive speed. Our method uniquely extends the
generative capabilities and efficient volumetric representation of EG3D, leveraging
a lightstage dataset to implicitly disentangle face reflectance and perform relighting
under target HDRI environment maps. By utilizing a pre-trained geometry-aware
encoder and a feature alignment module, we map input images into a relightable
3D space, enhancing them with a strong face geometry and reflectance prior. Through
extensive quantitative and qualitative evaluations, we show that our method outperforms
the state-of-the-art methods in terms of efficacy, photorealism, and practical
application. This includes producing 3D-consistent results of the full head, including
hair, eyes, and expressions. Lite2Relight paves the way for large-scale adoption
of photorealistic portrait editing in various domains, offering a robust, interactive
solution to a previously constrained problem.
acknowledgement: This work was supported by the ERC Consolidator Grant 4DReply (770784).
We extend our gratitude to Shrisha Bharadwaj for providing feedback and constant
support.
article_number: '41'
article_processing_charge: Yes (in subscription journal)
arxiv: 1
author:
- first_name: Pramod
full_name: Rao, Pramod
last_name: Rao
- first_name: Gereon
full_name: Fox, Gereon
last_name: Fox
- first_name: Abhimitra
full_name: Meka, Abhimitra
last_name: Meka
- first_name: B. R.
full_name: Mallikarjun, B. R.
last_name: Mallikarjun
- first_name: Fangneng
full_name: Zhan, Fangneng
last_name: Zhan
- first_name: Tim
full_name: Weyrich, Tim
last_name: Weyrich
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Hanspeter
full_name: Pfister, Hanspeter
last_name: Pfister
- first_name: Wojciech
full_name: Matusik, Wojciech
last_name: Matusik
- first_name: Mohamed
full_name: Elgharib, Mohamed
last_name: Elgharib
- first_name: Christian
full_name: Theobalt, Christian
last_name: Theobalt
citation:
ama: 'Rao P, Fox G, Meka A, et al. Lite2Relight: 3D-aware single image portrait
relighting. In: Proceedings - SIGGRAPH 2024 Conference Papers. Association
for Computing Machinery; 2024. doi:10.1145/3641519.3657470'
apa: 'Rao, P., Fox, G., Meka, A., Mallikarjun, B. R., Zhan, F., Weyrich, T., … Theobalt,
C. (2024). Lite2Relight: 3D-aware single image portrait relighting. In Proceedings
- SIGGRAPH 2024 Conference Papers. Denver, CO, United States: Association
for Computing Machinery. https://doi.org/10.1145/3641519.3657470'
chicago: 'Rao, Pramod, Gereon Fox, Abhimitra Meka, B. R. Mallikarjun, Fangneng Zhan,
Tim Weyrich, Bernd Bickel, et al. “Lite2Relight: 3D-Aware Single Image Portrait
Relighting.” In Proceedings - SIGGRAPH 2024 Conference Papers. Association
for Computing Machinery, 2024. https://doi.org/10.1145/3641519.3657470.'
ieee: 'P. Rao et al., “Lite2Relight: 3D-aware single image portrait relighting,”
in Proceedings - SIGGRAPH 2024 Conference Papers, Denver, CO, United States,
2024.'
ista: 'Rao P, Fox G, Meka A, Mallikarjun BR, Zhan F, Weyrich T, Bickel B, Pfister
H, Matusik W, Elgharib M, Theobalt C. 2024. Lite2Relight: 3D-aware single image
portrait relighting. Proceedings - SIGGRAPH 2024 Conference Papers. SIGGRAPH:
Computer Graphics and Interactive Techniques Conference, 41.'
mla: 'Rao, Pramod, et al. “Lite2Relight: 3D-Aware Single Image Portrait Relighting.”
Proceedings - SIGGRAPH 2024 Conference Papers, 41, Association for Computing
Machinery, 2024, doi:10.1145/3641519.3657470.'
short: P. Rao, G. Fox, A. Meka, B.R. Mallikarjun, F. Zhan, T. Weyrich, B. Bickel,
H. Pfister, W. Matusik, M. Elgharib, C. Theobalt, in:, Proceedings - SIGGRAPH
2024 Conference Papers, Association for Computing Machinery, 2024.
conference:
end_date: 2024-08-01
location: Denver, CO, United States
name: 'SIGGRAPH: Computer Graphics and Interactive Techniques Conference'
start_date: 2024-07-27
date_created: 2024-08-04T22:01:21Z
date_published: 2024-07-13T00:00:00Z
date_updated: 2025-09-08T08:48:22Z
day: '13'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1145/3641519.3657470
external_id:
arxiv:
- '2407.10487'
isi:
- '001282218200076'
file:
- access_level: open_access
checksum: 4650f6d1419e675929133e46a91ca177
content_type: application/pdf
creator: dernst
date_created: 2024-08-05T08:25:18Z
date_updated: 2024-08-05T08:25:18Z
file_id: '17387'
file_name: 2024_SIGGRAPH_Rao.pdf
file_size: 59683257
relation: main_file
success: 1
file_date_updated: 2024-08-05T08:25:18Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Proceedings - SIGGRAPH 2024 Conference Papers
publication_identifier:
isbn:
- '9798400705250'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Lite2Relight: 3D-aware single image portrait relighting'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
_id: '17375'
abstract:
- lang: eng
text: We consider the spectral radius of a large random matrix X with independent,
identically distributed entries. We show that its typical size is given by a precise
three-term asymptotics with an optimal error term beyond the radius of the celebrated
circular law. The coefficients in this asymptotics are universal but they differ
from a similar asymptotics recently proved for the rightmost eigenvalue of X in
Cipolloni et al., Ann. Probab. 51(6), 2192–2242 (2023). To access the more complicated
spectral radius, we need to establish a new decorrelation mechanism for the low-lying
singular values of X − z for different complex shift parameters z using the Dyson
Brownian Motion.
acknowledgement: L.E. and Y.X. were supported by the ERC Advanced Grant “RMTBeyond”
Grant No. 101020331.
article_number: '063302'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Yuanyuan
full_name: Xu, Yuanyuan
id: 7902bdb1-a2a4-11eb-a164-c9216f71aea3
last_name: Xu
orcid: 0000-0003-1559-1205
citation:
ama: Cipolloni G, Erdös L, Xu Y. Precise asymptotics for the spectral radius of
a large random matrix. Journal of Mathematical Physics. 2024;65(6). doi:10.1063/5.0209705
apa: Cipolloni, G., Erdös, L., & Xu, Y. (2024). Precise asymptotics for the
spectral radius of a large random matrix. Journal of Mathematical Physics.
AIP Publishing. https://doi.org/10.1063/5.0209705
chicago: Cipolloni, Giorgio, László Erdös, and Yuanyuan Xu. “Precise Asymptotics
for the Spectral Radius of a Large Random Matrix.” Journal of Mathematical
Physics. AIP Publishing, 2024. https://doi.org/10.1063/5.0209705.
ieee: G. Cipolloni, L. Erdös, and Y. Xu, “Precise asymptotics for the spectral radius
of a large random matrix,” Journal of Mathematical Physics, vol. 65, no.
6. AIP Publishing, 2024.
ista: Cipolloni G, Erdös L, Xu Y. 2024. Precise asymptotics for the spectral radius
of a large random matrix. Journal of Mathematical Physics. 65(6), 063302.
mla: Cipolloni, Giorgio, et al. “Precise Asymptotics for the Spectral Radius of
a Large Random Matrix.” Journal of Mathematical Physics, vol. 65, no. 6,
063302, AIP Publishing, 2024, doi:10.1063/5.0209705.
short: G. Cipolloni, L. Erdös, Y. Xu, Journal of Mathematical Physics 65 (2024).
corr_author: '1'
date_created: 2024-08-04T22:01:22Z
date_published: 2024-06-01T00:00:00Z
date_updated: 2025-09-08T08:44:57Z
day: '01'
department:
- _id: LaEr
doi: 10.1063/5.0209705
ec_funded: 1
external_id:
arxiv:
- '2210.15643'
isi:
- '001252240700002'
intvolume: ' 65'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2210.15643
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Journal of Mathematical Physics
publication_identifier:
issn:
- 0022-2488
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Precise asymptotics for the spectral radius of a large random matrix
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 65
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '17376'
abstract:
- lang: eng
text: "The inertia bound and ratio bound (also known as the Cvetković bound and
Hoffman bound) are two fundamental inequalities in spectral graph theory, giving
upper bounds on the independence number α(G) of a graph G in terms of spectral
information about a weighted adjacency matrix of G. For both inequalities, given
a graph G, one needs to make a judicious choice of weighted adjacency matrix to
obtain as strong a bound as possible.\r\nWhile there is a well-established theory
surrounding the ratio bound, the inertia bound is much more mysterious, and its
limits are rather unclear. In fact, only recently did Sinkovic find the first
example of a graph for which the inertia bound is not tight (for any weighted
adjacency matrix), answering a longstanding question of Godsil. We show that the
inertia bound can be extremely far from tight, and in fact can significantly underperform
the ratio bound: for example, one of our results is that for infinitely many n,
there is an n-vertex graph for which even the unweighted ratio bound can prove
α(G)≤4n3/4, but the inertia bound is always at least n/4. In particular, these
results address questions of Rooney, Sinkovic, and Wocjan--Elphick--Abiad."
acknowledgement: "The authors are grateful to Noga Alon, Anurag Bishnoi, Clive Elphick,
and Ferdinand Ihringer for helpful comments and interesting discussions on earlier
drafts of this paper. Matthew Kwan is supported by ERC Starting Grant “RANDSTRUCT”
No. 101076777. Yuval Wigderson is supported by Dr. Max Rössler, the Walter Haefner
Foundation, and the ETH Zürich Foundation.\r\nOpen access funding provided by Eidgenossische
Technische Hochschule Zurich."
article_processing_charge: Yes (via OA deal)
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: Yuval
full_name: Wigderson, Yuval
last_name: Wigderson
citation:
ama: Kwan MA, Wigderson Y. The inertia bound is far from tight. Bulletin of the
London Mathematical Society. 2024;56(10):3196-3208. doi:10.1112/blms.13127
apa: Kwan, M. A., & Wigderson, Y. (2024). The inertia bound is far from tight.
Bulletin of the London Mathematical Society. London Mathematical Society.
https://doi.org/10.1112/blms.13127
chicago: Kwan, Matthew Alan, and Yuval Wigderson. “The Inertia Bound Is Far from
Tight.” Bulletin of the London Mathematical Society. London Mathematical
Society, 2024. https://doi.org/10.1112/blms.13127.
ieee: M. A. Kwan and Y. Wigderson, “The inertia bound is far from tight,” Bulletin
of the London Mathematical Society, vol. 56, no. 10. London Mathematical Society,
pp. 3196–3208, 2024.
ista: Kwan MA, Wigderson Y. 2024. The inertia bound is far from tight. Bulletin
of the London Mathematical Society. 56(10), 3196–3208.
mla: Kwan, Matthew Alan, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.”
Bulletin of the London Mathematical Society, vol. 56, no. 10, London Mathematical
Society, 2024, pp. 3196–208, doi:10.1112/blms.13127.
short: M.A. Kwan, Y. Wigderson, Bulletin of the London Mathematical Society 56 (2024)
3196–3208.
date_created: 2024-08-04T22:01:22Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2025-09-08T08:45:39Z
day: '01'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.1112/blms.13127
external_id:
arxiv:
- '2312.04925'
isi:
- '001279563300001'
file:
- access_level: open_access
checksum: 7117f9819eaeb45eef1b0a226f9c2709
content_type: application/pdf
creator: dernst
date_created: 2025-01-09T13:36:53Z
date_updated: 2025-01-09T13:36:53Z
file_id: '18814'
file_name: 2024_BulletinLondonMathSoc_Kwan.pdf
file_size: 175966
relation: main_file
success: 1
file_date_updated: 2025-01-09T13:36:53Z
has_accepted_license: '1'
intvolume: ' 56'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 3196-3208
project:
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
grant_number: '101076777'
name: Randomness and structure in combinatorics
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: London Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: The inertia bound is far from tight
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: 56
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '17377'
abstract:
- lang: eng
text: "Lateral root (LR) formation, that is vital for plant development, is one
of many auxin-modulated processes, but the underlying regulatory mechanism is
not yet fully known. Recently, \r\nGonzález-García et al. discovered the BiAux
compound and showed that it is involved in LR development via regulating specific
auxin coreceptors."
acknowledgement: "This work was supported by funding from the National Science Centre,
Poland, under the OPUS call in the Weave program and the Austrian Science Fund,
Austria project (FWF)/OPUS – Peptide receptor complexes for auxin canalization and
regeneration in Arabidopsis (grant \r\n2021/43/I/NZ1/01835) to E.M., and grant I
6123-B to J.F."
article_processing_charge: No
article_type: original
author:
- first_name: Barbara
full_name: Wójcikowska, Barbara
last_name: Wójcikowska
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Ewa
full_name: Mazur, Ewa
last_name: Mazur
citation:
ama: Wójcikowska B, Friml J, Mazur E. BiAux, a newly discovered compound triggering
auxin signaling. Trends in Plant Science. 2024;29(12):1279-1281. doi:10.1016/j.tplants.2024.07.008
apa: Wójcikowska, B., Friml, J., & Mazur, E. (2024). BiAux, a newly discovered
compound triggering auxin signaling. Trends in Plant Science. Elsevier.
https://doi.org/10.1016/j.tplants.2024.07.008
chicago: Wójcikowska, Barbara, Jiří Friml, and Ewa Mazur. “BiAux, a Newly Discovered
Compound Triggering Auxin Signaling.” Trends in Plant Science. Elsevier,
2024. https://doi.org/10.1016/j.tplants.2024.07.008.
ieee: B. Wójcikowska, J. Friml, and E. Mazur, “BiAux, a newly discovered compound
triggering auxin signaling,” Trends in Plant Science, vol. 29, no. 12.
Elsevier, pp. 1279–1281, 2024.
ista: Wójcikowska B, Friml J, Mazur E. 2024. BiAux, a newly discovered compound
triggering auxin signaling. Trends in Plant Science. 29(12), 1279–1281.
mla: Wójcikowska, Barbara, et al. “BiAux, a Newly Discovered Compound Triggering
Auxin Signaling.” Trends in Plant Science, vol. 29, no. 12, Elsevier, 2024,
pp. 1279–81, doi:10.1016/j.tplants.2024.07.008.
short: B. Wójcikowska, J. Friml, E. Mazur, Trends in Plant Science 29 (2024) 1279–1281.
corr_author: '1'
date_created: 2024-08-04T22:01:22Z
date_published: 2024-12-01T00:00:00Z
date_updated: 2025-11-24T15:13:16Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1016/j.tplants.2024.07.008
external_id:
isi:
- '001375335200001'
pmid:
- '39079770'
file:
- access_level: open_access
checksum: 89a83fe25b9ec1aad8e22d134a342c09
content_type: application/pdf
creator: dernst
date_created: 2025-11-24T15:12:50Z
date_updated: 2025-11-24T15:12:50Z
file_id: '20691'
file_name: 2024_TrendsPlantScience_Wojcikowska_submittedversion.pdf
file_size: 277636
relation: main_file
success: 1
file_date_updated: 2025-11-24T15:12:50Z
has_accepted_license: '1'
intvolume: ' 29'
isi: 1
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 1279-1281
pmid: 1
project:
- _id: bd76d395-d553-11ed-ba76-f678c14f9033
grant_number: I06123
name: Peptide receptors for auxin canalization in Arabidopsis
publication: Trends in Plant Science
publication_identifier:
issn:
- 1360-1385
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: BiAux, a newly discovered compound triggering auxin signaling
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2024'
...
---
_id: '17389'
abstract:
- lang: eng
text: The potential of Si and SiGe-based devices for the scaling of quantum circuits
is tainted by device variability. Each device needs to be tuned to operation conditions
and each device realisation requires a different tuning protocol. We demonstrate
that it is possible to automate the tuning of a 4-gate Si FinFET, a 5-gate GeSi
nanowire and a 7-gate Ge/SiGe heterostructure double quantum dot device from scratch
with the same algorithm. We achieve tuning times of 30, 10, and 92 min, respectively.
The algorithm also provides insight into the parameter space landscape for each
of these devices, allowing for the characterization of the regions where double
quantum dot regimes are found. These results show that overarching solutions for
the tuning of quantum devices are enabled by machine learning.
acknowledged_ssus:
- _id: NanoFab
acknowledgement: We acknowledge Ang Li, Erik P. A. M. Bakkers (University of Eindhoven)
for the fabrication of the Ge/Si nanowire. This work was supported by the Royal
Society, the EPSRC National Quantum Technology Hub in Networked Quantum Information
Technology (EP/M013243/1), Quantum Technology Capital (EP/N014995/1), EPSRC Platform
Grant (EP/R029229/1), the European Research Council (Grant agreement 948932), the
Swiss Nanoscience Institute, the NCCR SPIN, the EU H2020 European Microkelvin Platform
EMP grant No. 824109, the Scientific Service Units of IST Austria through resources
provided by the nanofabrication facility, the FWF-I 05060 and the FWF-P 30207 project.
article_number: '17281'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: B.
full_name: Severin, B.
last_name: Severin
- first_name: D. T.
full_name: Lennon, D. T.
last_name: Lennon
- first_name: L. C.
full_name: Camenzind, L. C.
last_name: Camenzind
- first_name: F.
full_name: Vigneau, F.
last_name: Vigneau
- first_name: F.
full_name: Fedele, F.
last_name: Fedele
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
- first_name: A.
full_name: Ballabio, A.
last_name: Ballabio
- first_name: D.
full_name: Chrastina, D.
last_name: Chrastina
- first_name: G.
full_name: Isella, G.
last_name: Isella
- first_name: M.
full_name: de Kruijf, M.
last_name: de Kruijf
- first_name: M. J.
full_name: Carballido, M. J.
last_name: Carballido
- first_name: S.
full_name: Svab, S.
last_name: Svab
- first_name: A. V.
full_name: Kuhlmann, A. V.
last_name: Kuhlmann
- first_name: S.
full_name: Geyer, S.
last_name: Geyer
- first_name: F. N. M.
full_name: Froning, F. N. M.
last_name: Froning
- first_name: H.
full_name: Moon, H.
last_name: Moon
- first_name: M. A.
full_name: Osborne, M. A.
last_name: Osborne
- first_name: D.
full_name: Sejdinovic, D.
last_name: Sejdinovic
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
- first_name: D. M.
full_name: Zumbühl, D. M.
last_name: Zumbühl
- first_name: G. A. D.
full_name: Briggs, G. A. D.
last_name: Briggs
- first_name: N.
full_name: Ares, N.
last_name: Ares
citation:
ama: Severin B, Lennon DT, Camenzind LC, et al. Cross-architecture tuning of silicon
and SiGe-based quantum devices using machine learning. Scientific Reports.
2024;14. doi:10.1038/s41598-024-67787-z
apa: Severin, B., Lennon, D. T., Camenzind, L. C., Vigneau, F., Fedele, F., Jirovec,
D., … Ares, N. (2024). Cross-architecture tuning of silicon and SiGe-based quantum
devices using machine learning. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-024-67787-z
chicago: Severin, B., D. T. Lennon, L. C. Camenzind, F. Vigneau, F. Fedele, Daniel
Jirovec, A. Ballabio, et al. “Cross-Architecture Tuning of Silicon and SiGe-Based
Quantum Devices Using Machine Learning.” Scientific Reports. Springer Nature,
2024. https://doi.org/10.1038/s41598-024-67787-z.
ieee: B. Severin et al., “Cross-architecture tuning of silicon and SiGe-based
quantum devices using machine learning,” Scientific Reports, vol. 14. Springer
Nature, 2024.
ista: Severin B, Lennon DT, Camenzind LC, Vigneau F, Fedele F, Jirovec D, Ballabio
A, Chrastina D, Isella G, de Kruijf M, Carballido MJ, Svab S, Kuhlmann AV, Geyer
S, Froning FNM, Moon H, Osborne MA, Sejdinovic D, Katsaros G, Zumbühl DM, Briggs
GAD, Ares N. 2024. Cross-architecture tuning of silicon and SiGe-based quantum
devices using machine learning. Scientific Reports. 14, 17281.
mla: Severin, B., et al. “Cross-Architecture Tuning of Silicon and SiGe-Based Quantum
Devices Using Machine Learning.” Scientific Reports, vol. 14, 17281, Springer
Nature, 2024, doi:10.1038/s41598-024-67787-z.
short: B. Severin, D.T. Lennon, L.C. Camenzind, F. Vigneau, F. Fedele, D. Jirovec,
A. Ballabio, D. Chrastina, G. Isella, M. de Kruijf, M.J. Carballido, S. Svab,
A.V. Kuhlmann, S. Geyer, F.N.M. Froning, H. Moon, M.A. Osborne, D. Sejdinovic,
G. Katsaros, D.M. Zumbühl, G.A.D. Briggs, N. Ares, Scientific Reports 14 (2024).
date_created: 2024-08-05T08:50:51Z
date_published: 2024-07-27T00:00:00Z
date_updated: 2025-09-08T08:49:16Z
day: '27'
ddc:
- '530'
department:
- _id: GeKa
doi: 10.1038/s41598-024-67787-z
external_id:
arxiv:
- '2107.12975'
isi:
- '001281273100062'
pmid:
- '39068242'
file:
- access_level: open_access
checksum: 0b34b89e5f4f3f7b32ffadf104394594
content_type: application/pdf
creator: dernst
date_created: 2024-08-05T08:52:14Z
date_updated: 2024-08-05T08:52:14Z
file_id: '17390'
file_name: 2024_ScientificReports_Severin.pdf
file_size: 2255741
relation: main_file
success: 1
file_date_updated: 2024-08-05T08:52:14Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: c0977eea-5a5b-11eb-8a69-a862db0cf4d1
grant_number: I05060
name: High impedance circuit quantum electrodynamics with hole spins
- _id: 2641CE5E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P30207
name: Hole spin orbit qubits in Ge quantum wells
publication: Scientific Reports
publication_identifier:
issn:
- 2045-2322
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10066'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Cross-architecture tuning of silicon and SiGe-based quantum devices using machine
learning
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: 14
year: '2024'
...
---
_id: '17396'
abstract:
- lang: eng
text: Wildfire intensity and severity have been increasing in the Iberian Peninsula
in recent years, particularly in the Galicia region, due to rising temperatures
and accumulating drier combustible vegetation in unmanaged lands. This leads to
substantial emissions of air pollutants, notably fine particles (PM2.5), posing
a risk to public health. This study aims to assess the impact of local and regional
wildfires on PM2.5 levels in Galicia's main cities and their implications for
air quality and public health. Over a decade (2013–2022), PM2.5 data during wildfire
seasons were analyzed using statistical methods and Lagrangian tracking to monitor
smoke plume evolution. The results reveal a notable increase in PM2.5 concentration
during the wildfire season (June–November) in Galicia, surpassing health guidelines
during extreme events and posing a significant health risk to the population.
Regional wildfire analyses indicate that smoke plumes from Northern Portugal contribute
to pollution in Galician cities, influencing the seasonality of heightened PM2.5
levels. During extensive wildfires, elevated PM2.5 concentration values persisted
for several days, potentially exacerbating health concerns in Galicia. These findings
underscore the urgency of implementing air pollution prevention and management
measures in the region, including developing effective alerts for large-scale
events and improved wildfire management strategies to mitigate their impact on
air quality in Galician cities.
acknowledgement: 'Alejandro Casallas was partially funded by a fellowship from the
Abdus Salam International Centre for Theoretical Physics – ICTP. 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 awarded
to Alejandro Casallas. '
article_number: '122093'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: César
full_name: Quishpe-Vásquez, César
last_name: Quishpe-Vásquez
- first_name: Patricia
full_name: Oliva, Patricia
last_name: Oliva
- first_name: Ellie Anne
full_name: López-Barrera, Ellie Anne
last_name: López-Barrera
- first_name: Alejandro
full_name: Casallas Garcia, Alejandro
id: 92081129-2d75-11ef-a48d-b04dd7a2385a
last_name: Casallas Garcia
orcid: 0000-0002-1988-5035
citation:
ama: Quishpe-Vásquez C, Oliva P, López-Barrera EA, Casallas Garcia A. Wildfires
impact on PM2.5 concentration in galicia Spain. Journal of Environmental Management.
2024;367. doi:10.1016/j.jenvman.2024.122093
apa: Quishpe-Vásquez, C., Oliva, P., López-Barrera, E. A., & Casallas Garcia,
A. (2024). Wildfires impact on PM2.5 concentration in galicia Spain. Journal
of Environmental Management. Elsevier. https://doi.org/10.1016/j.jenvman.2024.122093
chicago: Quishpe-Vásquez, César, Patricia Oliva, Ellie Anne López-Barrera, and Alejandro
Casallas Garcia. “Wildfires Impact on PM2.5 Concentration in Galicia Spain.” Journal
of Environmental Management. Elsevier, 2024. https://doi.org/10.1016/j.jenvman.2024.122093.
ieee: C. Quishpe-Vásquez, P. Oliva, E. A. López-Barrera, and A. Casallas Garcia,
“Wildfires impact on PM2.5 concentration in galicia Spain,” Journal of Environmental
Management, vol. 367. Elsevier, 2024.
ista: Quishpe-Vásquez C, Oliva P, López-Barrera EA, Casallas Garcia A. 2024. Wildfires
impact on PM2.5 concentration in galicia Spain. Journal of Environmental Management.
367, 122093.
mla: Quishpe-Vásquez, César, et al. “Wildfires Impact on PM2.5 Concentration in
Galicia Spain.” Journal of Environmental Management, vol. 367, 122093,
Elsevier, 2024, doi:10.1016/j.jenvman.2024.122093.
short: C. Quishpe-Vásquez, P. Oliva, E.A. López-Barrera, A. Casallas Garcia, Journal
of Environmental Management 367 (2024).
date_created: 2024-08-06T05:54:52Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-09-08T08:53:10Z
day: '01'
ddc:
- '550'
department:
- _id: CaMu
doi: 10.1016/j.jenvman.2024.122093
ec_funded: 1
external_id:
isi:
- '001289532100001'
pmid:
- '39106804'
file:
- access_level: open_access
checksum: 6fa476a4c08aded413844d92336b0e52
content_type: application/pdf
creator: acasalla
date_created: 2024-08-09T13:37:23Z
date_updated: 2024-08-09T13:37:23Z
file_id: '17405'
file_name: Fires_Galicia_SM.pdf
file_size: 1595118
relation: main_file
success: 1
- access_level: open_access
checksum: 859dcdef9555c383b702cf8cc7da66f2
content_type: application/pdf
creator: acasalla
date_created: 2024-08-09T13:37:24Z
date_updated: 2024-08-09T13:37:24Z
file_id: '17406'
file_name: Fires_Galicia.pdf
file_size: 13662676
relation: main_file
success: 1
file_date_updated: 2024-08-09T13:37:24Z
has_accepted_license: '1'
intvolume: ' 367'
isi: 1
language:
- iso: eng
month: '09'
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: Journal of Environmental Management
publication_identifier:
issn:
- 0301-4797
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Wildfires impact on PM2.5 concentration in galicia Spain
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 367
year: '2024'
...
---
_id: '17402'
abstract:
- lang: eng
text: We present version 2.0 of the Partial Exploration Tool (PET), a tool for verification
of probabilistic systems. We extend the previous version by adding support for
stochastic games, based on a recent unified framework for sound value iteration
algorithms. Thereby, PET2 is the first tool implementing a sound and efficient
approach for solving stochastic games with objectives of the type reachability/safety
and mean payoff. We complement this approach by developing and implementing a
partial-exploration based variant for all three objectives. Our experimental evaluation
shows that PET2 offers the most efficient partial-exploration based algorithm
and is the most viable tool on SGs, even outperforming unsound tools.
acknowledgement: M. Weininger has received funding from the EU’s Horizon 2020 research
and innovation programme under the Marie Skłodowska-Curie grant agreement No. 101034413.
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
arxiv: 1
author:
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Maximilian
full_name: Weininger, Maximilian
id: 02ab0197-cc70-11ed-ab61-918e71f56881
last_name: Weininger
citation:
ama: 'Meggendorfer T, Weininger M. Playing games with your PET: Extending the Partial
Exploration Tool to stochastic games. In: 36th International Conference on
Computer Aided Verification. Vol 14683. Springer Nature; 2024:359-372. doi:10.1007/978-3-031-65633-0_16'
apa: 'Meggendorfer, T., & Weininger, M. (2024). Playing games with your PET:
Extending the Partial Exploration Tool to stochastic games. In 36th International
Conference on Computer Aided Verification (Vol. 14683, pp. 359–372). Montreal,
Canada: Springer Nature. https://doi.org/10.1007/978-3-031-65633-0_16'
chicago: 'Meggendorfer, Tobias, and Maximilian Weininger. “Playing Games with Your
PET: Extending the Partial Exploration Tool to Stochastic Games.” In 36th International
Conference on Computer Aided Verification, 14683:359–72. Springer Nature,
2024. https://doi.org/10.1007/978-3-031-65633-0_16.'
ieee: 'T. Meggendorfer and M. Weininger, “Playing games with your PET: Extending
the Partial Exploration Tool to stochastic games,” in 36th International Conference
on Computer Aided Verification, Montreal, Canada, 2024, vol. 14683, pp. 359–372.'
ista: 'Meggendorfer T, Weininger M. 2024. Playing games with your PET: Extending
the Partial Exploration Tool to stochastic games. 36th International Conference
on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 14683,
359–372.'
mla: 'Meggendorfer, Tobias, and Maximilian Weininger. “Playing Games with Your PET:
Extending the Partial Exploration Tool to Stochastic Games.” 36th International
Conference on Computer Aided Verification, vol. 14683, Springer Nature, 2024,
pp. 359–72, doi:10.1007/978-3-031-65633-0_16.'
short: T. Meggendorfer, M. Weininger, in:, 36th International Conference on Computer
Aided Verification, Springer Nature, 2024, pp. 359–372.
conference:
end_date: 2024-07-27
location: Montreal, Canada
name: 'CAV: Computer Aided Verification'
start_date: 2024-07-24
corr_author: '1'
date_created: 2024-08-09T11:24:54Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2025-09-08T08:53:55Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-65633-0_16
ec_funded: 1
external_id:
arxiv:
- '2405.03885'
isi:
- '001307897000016'
file:
- access_level: open_access
checksum: c888231d0a47b55786b7b4c0f02216bb
content_type: application/pdf
creator: dernst
date_created: 2024-08-12T08:39:12Z
date_updated: 2024-08-12T08:39:12Z
file_id: '17419'
file_name: 2024_CAV_Meggendorfer.pdf
file_size: 368487
relation: main_file
success: 1
file_date_updated: 2024-08-12T08:39:12Z
has_accepted_license: '1'
intvolume: ' 14683'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 359-372
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 36th International Conference on Computer Aided Verification
publication_identifier:
eisbn:
- '9783031656330'
eissn:
- 1611-3349
isbn:
- '9783031656323'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Playing games with your PET: Extending the Partial Exploration Tool to stochastic
games'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14683
year: '2024'
...
---
APC_amount: 3534 EUR
OA_place: publisher
OA_type: gold
_id: '17407'
abstract:
- lang: eng
text: The ability to control forces between sub-micron-scale building blocks offers
significant potential for designing new materials through self-assembly. Traditionally,
this involves identifying a crystal structure with a desired property and then
designing building-block interactions so that it assembles spontaneously. However,
this paradigm fails for structurally disordered solids, which lack a well-defined
structure. Here, we show that disordered solids can still be treated from an inverse
self-assembly perspective by bypassing structure and directly targeting material
properties. Using the Poisson’s ratio as a primary example, we demonstrate how
differentiable programming links interaction parameters with emergent behavior,
enabling iterative training to achieve the desired Poisson’s ratio. We also tune
other properties, including pressure and local 8-fold structural order, and can
even control multiple properties simultaneously. This robust, transferable, and
scalable approach can handle a wide variety of systems and properties, demonstrating
the utility of disordered solids as a practical avenue for self-assembly platforms.
acknowledgement: We thank M. Lechner for helpful discussions.
article_number: '141'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Mengjie
full_name: Zu, Mengjie
id: 26dd9e7c-e86a-11eb-a854-82ac731c9ae2
last_name: Zu
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
citation:
ama: Zu M, Goodrich CP. Designing athermal disordered solids with automatic differentiation.
Communications Materials. 2024;5. doi:10.1038/s43246-024-00583-4
apa: Zu, M., & Goodrich, C. P. (2024). Designing athermal disordered solids
with automatic differentiation. Communications Materials. Springer Nature.
https://doi.org/10.1038/s43246-024-00583-4
chicago: Zu, Mengjie, and Carl Peter Goodrich. “Designing Athermal Disordered Solids
with Automatic Differentiation.” Communications Materials. Springer Nature,
2024. https://doi.org/10.1038/s43246-024-00583-4.
ieee: M. Zu and C. P. Goodrich, “Designing athermal disordered solids with automatic
differentiation,” Communications Materials, vol. 5. Springer Nature, 2024.
ista: Zu M, Goodrich CP. 2024. Designing athermal disordered solids with automatic
differentiation. Communications Materials. 5, 141.
mla: Zu, Mengjie, and Carl Peter Goodrich. “Designing Athermal Disordered Solids
with Automatic Differentiation.” Communications Materials, vol. 5, 141,
Springer Nature, 2024, doi:10.1038/s43246-024-00583-4.
short: M. Zu, C.P. Goodrich, Communications Materials 5 (2024).
corr_author: '1'
date_created: 2024-08-11T22:01:11Z
date_published: 2024-08-01T00:00:00Z
date_updated: 2025-05-08T09:45:35Z
day: '01'
ddc:
- '530'
department:
- _id: CaGo
doi: 10.1038/s43246-024-00583-4
external_id:
arxiv:
- '2404.15101'
file:
- access_level: open_access
checksum: d6f74e242db5f46bb0e380ee23a268af
content_type: application/pdf
creator: dernst
date_created: 2024-08-12T07:56:38Z
date_updated: 2024-08-12T07:56:38Z
file_id: '17416'
file_name: 2024_CommMaterials_Zu.pdf
file_size: 9824134
relation: main_file
success: 1
file_date_updated: 2024-08-12T07:56:38Z
has_accepted_license: '1'
intvolume: ' 5'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Communications Materials
publication_identifier:
eissn:
- 2662-4443
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Designing athermal disordered solids with automatic differentiation
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: 5
year: '2024'
...