---
OA_place: publisher
OA_type: gold
_id: '18308'
abstract:
- lang: eng
text: We study in this paper the problem of maintaining a solution to k-median and
k-means clustering in a fully dynamic setting. To do so, we present an algorithm
to efficiently maintain a coreset, a compressed version of the dataset, that allows
easy computation of a clustering solution at query time. Our coreset algorithm
has near-optimal update time of Õ(k) in general metric spaces, which reduces to
Õ(d) in the Euclidean space ℝ^d. The query time is O(k²) in general metrics, and
O(kd) in ℝ^d. To maintain a constant-factor approximation for k-median and k-means
clustering in Euclidean space, this directly leads to an algorithm with update
time Õ(d), and query time Õ(kd + k²). To maintain a O(polylog k)-approximation,
the query time is reduced to Õ(kd).
acknowledgement: "Monika Henzinger: This project has received funding from the European
Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation
programme (MoDynStruct Grant agreement No. 101019564) and the Austrian Science Fund
(FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775
with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nDavid Saulpic:
Work partially done while at ISTA. Received funding from the European Union’s\r\nHorizon
2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement
No 101034413. This work was partially funded by the grant ANR-19-CE48-0016 from
the French National Research Agency (ANR)."
alternative_title:
- LIPIcs
article_number: '100'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Max Dupré
full_name: La Tour, Max Dupré
last_name: La Tour
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: David
full_name: Saulpic, David
id: f8e48cf0-b0ff-11ed-b0e9-b4c35598f964
last_name: Saulpic
citation:
ama: 'La Tour MD, Henzinger M, Saulpic D. Fully dynamic k-means coreset in near-optimal
update time. In: 32nd Annual European Symposium on Algorithms. Vol 308.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ESA.2024.100'
apa: 'La Tour, M. D., Henzinger, M., & Saulpic, D. (2024). Fully dynamic k-means
coreset in near-optimal update time. In 32nd Annual European Symposium on Algorithms
(Vol. 308). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ESA.2024.100'
chicago: La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Fully Dynamic
K-Means Coreset in near-Optimal Update Time.” In 32nd Annual European Symposium
on Algorithms, Vol. 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024. https://doi.org/10.4230/LIPIcs.ESA.2024.100.
ieee: M. D. La Tour, M. Henzinger, and D. Saulpic, “Fully dynamic k-means coreset
in near-optimal update time,” in 32nd Annual European Symposium on Algorithms,
London, United Kingdom, 2024, vol. 308.
ista: 'La Tour MD, Henzinger M, Saulpic D. 2024. Fully dynamic k-means coreset in
near-optimal update time. 32nd Annual European Symposium on Algorithms. ESA: European
Symposium on Algorithms, LIPIcs, vol. 308, 100.'
mla: La Tour, Max Dupré, et al. “Fully Dynamic K-Means Coreset in near-Optimal Update
Time.” 32nd Annual European Symposium on Algorithms, vol. 308, 100, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ESA.2024.100.
short: M.D. La Tour, M. Henzinger, D. Saulpic, in:, 32nd Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
conference:
end_date: 2024-09-04
location: London, United Kingdom
name: 'ESA: European Symposium on Algorithms'
start_date: 2024-09-02
corr_author: '1'
das_tickbox: '0'
date_created: 2024-10-13T22:01:50Z
date_published: 2024-09-23T00:00:00Z
date_updated: 2026-10-21T08:04:40Z
day: '23'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.ESA.2024.100
ec_funded: 1
external_id:
arxiv:
- '2406.19926'
isi:
- '001545622400100'
file:
- access_level: open_access
checksum: 8e8c0b13049f11bb0133dfac22e32718
content_type: application/pdf
creator: dernst
date_created: 2024-10-21T09:41:48Z
date_updated: 2024-10-21T09:41:48Z
file_id: '18454'
file_name: 2024_LIPICs_DuprelaTour.pdf
file_size: 873561
relation: main_file
success: 1
file_date_updated: 2024-10-21T09:41:48Z
fulldoi: https://doi.org/10.4230/LIPIcs.ESA.2024.100
has_accepted_license: '1'
intvolume: ' 308'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 32nd Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959773386'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Fully dynamic k-means coreset in near-optimal update time
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: 308
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18309'
abstract:
- lang: eng
text: 'The problem of designing connectivity oracles supporting vertex failures
is one of the basic data structures problems for undirected graphs. It is already
well understood: previous works [Duan-Pettie STOC''10; Long-Saranurak FOCS''22]
achieve query time linear in the number of failed vertices, and it is conditionally
optimal as long as we require preprocessing time polynomial in the size of the
graph and update time polynomial in the number of failed vertices. We revisit
this problem in the paradigm of algorithms with predictions: we ask if the query
time can be improved if the set of failed vertices can be predicted beforehand
up to a small number of errors. More specifically, we design a data structure
that, given a graph G = (V,E) and a set of vertices predicted to fail D̂ ⊆ V of
size d = |D̂|, preprocesses it in time Õ(d|E|) and then can receive an update
given as the symmetric difference between the predicted and the actual set of
failed vertices D̂△D = (D̂ ⧵ D) ∪ (D ⧵ D̂) of size η = |D̂△D|, process it in time
Õ(η⁴), and after that answer connectivity queries in G ⧵ D in time O(η). Viewed
from another perspective, our data structure provides an improvement over the
state of the art for the fully dynamic subgraph connectivity problem in the sensitivity
setting [Henzinger-Neumann ESA''16]. We argue that the preprocessing time and
query time of our data structure are conditionally optimal under standard fine-grained
complexity assumptions.'
acknowledgement: "Part of this work was done when Evangelos Kosinas was at University
of Ioannina and Adam Polak was at Max Planck Institute of Informatics.\r\n"
alternative_title:
- LIPIcs
article_number: '72'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Bingbing
full_name: Hu, Bingbing
last_name: Hu
- first_name: Evangelos
full_name: Kosinas, Evangelos
id: 4c7f9625-dbbc-11ee-9d86-bdcc2db5a949
last_name: Kosinas
- first_name: Adam
full_name: Polak, Adam
last_name: Polak
citation:
ama: 'Hu B, Kosinas E, Polak A. Connectivity oracles for predictable vertex failures.
In: 32nd Annual European Symposium on Algorithms. Vol 308. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ESA.2024.72'
apa: 'Hu, B., Kosinas, E., & Polak, A. (2024). Connectivity oracles for predictable
vertex failures. In 32nd Annual European Symposium on Algorithms (Vol.
308). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ESA.2024.72'
chicago: Hu, Bingbing, Evangelos Kosinas, and Adam Polak. “Connectivity Oracles
for Predictable Vertex Failures.” In 32nd Annual European Symposium on Algorithms,
Vol. 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ESA.2024.72.
ieee: B. Hu, E. Kosinas, and A. Polak, “Connectivity oracles for predictable vertex
failures,” in 32nd Annual European Symposium on Algorithms, London, United
Kingdom, 2024, vol. 308.
ista: 'Hu B, Kosinas E, Polak A. 2024. Connectivity oracles for predictable vertex
failures. 32nd Annual European Symposium on Algorithms. ESA: European Symposium
on Algorithms, LIPIcs, vol. 308, 72.'
mla: Hu, Bingbing, et al. “Connectivity Oracles for Predictable Vertex Failures.”
32nd Annual European Symposium on Algorithms, vol. 308, 72, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ESA.2024.72.
short: B. Hu, E. Kosinas, A. Polak, in:, 32nd Annual European Symposium on Algorithms,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
conference:
end_date: 2024-09-04
location: London, United Kingdom
name: 'ESA: European Symposium on Algorithms'
start_date: 2024-09-02
corr_author: '1'
das_tickbox: '0'
date_created: 2024-10-13T22:01:50Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-10-21T08:04:56Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.ESA.2024.72
external_id:
arxiv:
- '2312.08489'
isi:
- '001545622400072'
file:
- access_level: open_access
checksum: ab1f2f9161549a8763eda15db40e022c
content_type: application/pdf
creator: dernst
date_created: 2024-10-21T10:03:48Z
date_updated: 2024-10-21T10:03:48Z
file_id: '18455'
file_name: 2024_LIPICs_Hu.pdf
file_size: 853914
relation: main_file
success: 1
file_date_updated: 2024-10-21T10:03:48Z
fulldoi: https://doi.org/10.4230/LIPIcs.ESA.2024.72
has_accepted_license: '1'
intvolume: ' 308'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: 32nd Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959773386'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Connectivity oracles for predictable vertex failures
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: 308
year: '2024'
...
---
_id: '18115'
abstract:
- lang: eng
text: "We study the data selection problem, whose aim is to select a small representative
subset of data that can be used to efficiently train a machine learning model.
We present a new data selection approach based on k-means clustering and sensitivity
sampling. Assuming access to an embedding representation of the data with respect
to which the model loss is Holder continuous, our approach provably allows selecting
a set of “typical” k+1/ε2 elements whose average loss corresponds to the average
loss of the whole dataset, up to a multiplicative (1±ε)\r\n factor and an additive
ελΦk, where Φk represents the k-means cost for the input embeddings and λ is the
Holder constant. We furthermore demonstrate the performance and scalability of
our approach on fine-tuning foundation models and show that it outperforms state-of-the-art
methods. We also show how it can be applied on linear regression, leading to a
new sampling strategy that surprisingly matches the performance of leverage score
sampling, while being conceptually simpler and more scalable."
acknowledgement: "Monika Henzinger: This project has received funding from the European
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant
DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with
additional funding from the netidee SCIENCE Stiftung, 2020–2024. This work was partially
done while David Saulpic was at the Institute for Science and Technology, Austria
(ISTA). David Sauplic has received funding from the European Union’s Horizon 2020
research and innovation programme under the\r\nMarie Sklodowska-Curie grant agreement
No 101034413. Work was done while David Woodruff was visiting Google Research."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Kyriakos
full_name: Axiotis, Kyriakos
last_name: Axiotis
- first_name: Vincent
full_name: Cohen-Addad, Vincent
last_name: Cohen-Addad
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sammy
full_name: Jerome, Sammy
last_name: Jerome
- first_name: Vahab
full_name: Mirrokni, Vahab
last_name: Mirrokni
- first_name: David
full_name: Saulpic, David
id: f8e48cf0-b0ff-11ed-b0e9-b4c35598f964
last_name: Saulpic
- first_name: David P.
full_name: Woodruff, David P.
last_name: Woodruff
- first_name: Michael
full_name: Wunder, Michael
last_name: Wunder
citation:
ama: 'Axiotis K, Cohen-Addad V, Henzinger M, et al. Data-efficient learning via
clustering-based sensitivity sampling: Foundation models and beyond. In: Proceedings
of the 41st International Conference on Machine Learning. Vol 235. ML Research
Press; 2024:2086-2107.'
apa: 'Axiotis, K., Cohen-Addad, V., Henzinger, M., Jerome, S., Mirrokni, V., Saulpic,
D., … Wunder, M. (2024). Data-efficient learning via clustering-based sensitivity
sampling: Foundation models and beyond. In Proceedings of the 41st International
Conference on Machine Learning (Vol. 235, pp. 2086–2107). Vienna, Austria:
ML Research Press.'
chicago: 'Axiotis, Kyriakos, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome,
Vahab Mirrokni, David Saulpic, David P. Woodruff, and Michael Wunder. “Data-Efficient
Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.”
In Proceedings of the 41st International Conference on Machine Learning,
235:2086–2107. ML Research Press, 2024.'
ieee: 'K. Axiotis et al., “Data-efficient learning via clustering-based sensitivity
sampling: Foundation models and beyond,” in Proceedings of the 41st International
Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 2086–2107.'
ista: 'Axiotis K, Cohen-Addad V, Henzinger M, Jerome S, Mirrokni V, Saulpic D, Woodruff
DP, Wunder M. 2024. Data-efficient learning via clustering-based sensitivity sampling:
Foundation models and beyond. Proceedings of the 41st International Conference
on Machine Learning. ICML: International Conference on Machine Learning, PMLR,
vol. 235, 2086–2107.'
mla: 'Axiotis, Kyriakos, et al. “Data-Efficient Learning via Clustering-Based Sensitivity
Sampling: Foundation Models and Beyond.” Proceedings of the 41st International
Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 2086–107.'
short: K. Axiotis, V. Cohen-Addad, M. Henzinger, S. Jerome, V. Mirrokni, D. Saulpic,
D.P. Woodruff, M. Wunder, in:, Proceedings of the 41st International Conference
on Machine Learning, ML Research Press, 2024, pp. 2086–2107.
conference:
end_date: 2024-07-27
location: Vienna, Austria
name: 'ICML: International Conference on Machine Learning'
start_date: 2024-07-21
das_tickbox: '0'
date_created: 2024-09-22T22:01:44Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-10-21T08:03:43Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
ec_funded: 1
external_id:
arxiv:
- '2402.17327'
intvolume: ' 235'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2402.17327
month: '09'
oa: 1
oa_version: Published Version
page: 2086-2107
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Proceedings of the 41st International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Data-efficient learning via clustering-based sensitivity sampling: Foundation
models and beyond'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 235
year: '2024'
...
---
OA_place: repository
OA_type: free access
_id: '18503'
abstract:
- lang: eng
text: "In 1996, Karger [Kar96] gave a startling randomized algorithm that finds
a minimum-cut in a (weighted) graph in time O(m log3 n) which he termed near-linear
time meaning linear (in the size of the input) times a polylogarthmic factor.
In this paper, we give the first deterministic algorithm which runs in near-linear
time for weighted graphs.\r\nPreviously, the breakthrough results of Kawarabayashi
and Thorup [KT19] gave a near-linear time algorithm for simple graphs (which was
improved to have running time O(m log2 n log log n) in [HRW20].) The main technique
here is a clustering procedure that perfectly preserves minimum cuts. Recently,
Li [Li21] gave an m1+o(1) deterministic minimum-cut algorithm for weighted graphs;
this form of running time has been termed “almost-linear”. Li uses almost-linear
time deterministic expander decompositions which do not perfectly preserve minimum
cuts, but he can use these clusterings to, in a sense, “derandomize” the methods
of Karger.\r\nIn terms of techniques, we provide a structural theorem that says
there exists a sparse clustering that preserves minimum cuts in a weighted graph
with o(1) error. In addition, we construct it deterministically in near linear
time. This was done exactly for simple graphs in [KT19, HRW20] and with polylogarithmic
error for weighted graphs in [Li21]. Extending the techniques in [KT19, HRW20]
to weighted graphs presents significant challenges, and moreover, the algorithm
can only polylogarithmically approximately preserve minimum cuts. A remaining
challenge is to reduce the polylogarithmic-approximate clusterings to 1 + o(1/
log n)-approximate so that they can be applied recursively as in [Li21] over O(log
n) many levels. This is an additional challenge that requires building on properties
of tree-packings in the presence of a wide range of edge weights to, for example,
find sources for local flow computations which identify minimum cuts that cross
clusters."
acknowledgement: This project has received funding from the European Research Council(ERC)
under the European Union’s Horizon 2020 research and innovation programme (Grant
agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDyn-Struct)”
and the Austrian Science Fund (FWF) project Z 422-N, project “Static and Dynamic
Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a
Reactive Network Layer (ReactNet)”, P33775-N, with additional funding from the netidee
SCIENCE Stiftung, 2020–2024.
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Jason
full_name: Li, Jason
last_name: Li
- first_name: Satish
full_name: Rao, Satish
last_name: Rao
- first_name: Di
full_name: Wang, Di
last_name: Wang
citation:
ama: 'Henzinger M, Li J, Rao S, Wang D. Deterministic near-linear time minimum cut
in weighted graphs. In: 35th Annual ACM-SIAM Symposium on Discrete Algorithms.
Society for Industrial and Applied Mathematics; 2024:3089-3139. doi:10.1137/1.9781611977912.111'
apa: 'Henzinger, M., Li, J., Rao, S., & Wang, D. (2024). Deterministic near-linear
time minimum cut in weighted graphs. In 35th Annual ACM-SIAM Symposium on Discrete
Algorithms (pp. 3089–3139). Alexandria, VA, United States: Society for Industrial
and Applied Mathematics. https://doi.org/10.1137/1.9781611977912.111'
chicago: Henzinger, Monika, Jason Li, Satish Rao, and Di Wang. “Deterministic Near-Linear
Time Minimum Cut in Weighted Graphs.” In 35th Annual ACM-SIAM Symposium on
Discrete Algorithms, 3089–3139. Society for Industrial and Applied Mathematics,
2024. https://doi.org/10.1137/1.9781611977912.111.
ieee: M. Henzinger, J. Li, S. Rao, and D. Wang, “Deterministic near-linear time
minimum cut in weighted graphs,” in 35th Annual ACM-SIAM Symposium on Discrete
Algorithms, Alexandria, VA, United States, 2024, pp. 3089–3139.
ista: 'Henzinger M, Li J, Rao S, Wang D. 2024. Deterministic near-linear time minimum
cut in weighted graphs. 35th Annual ACM-SIAM Symposium on Discrete Algorithms.
SODA: Symposium on Discrete Algorithms, 3089–3139.'
mla: Henzinger, Monika, et al. “Deterministic Near-Linear Time Minimum Cut in Weighted
Graphs.” 35th Annual ACM-SIAM Symposium on Discrete Algorithms, Society
for Industrial and Applied Mathematics, 2024, pp. 3089–139, doi:10.1137/1.9781611977912.111.
short: M. Henzinger, J. Li, S. Rao, D. Wang, in:, 35th Annual ACM-SIAM Symposium
on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024,
pp. 3089–3139.
conference:
end_date: 2024-01-10
location: Alexandria, VA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2024-01-07
corr_author: '1'
das_tickbox: '0'
date_created: 2024-11-04T10:54:21Z
date_published: 2024-01-04T00:00:00Z
date_updated: 2026-10-21T08:05:18Z
day: '04'
department:
- _id: MoHe
doi: 10.1137/1.9781611977912.111
ec_funded: 1
external_id:
arxiv:
- '2401.05627'
fulldoi: https://doi.org/10.1137/1.9781611977912.111
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2401.05627
month: '01'
oa: 1
oa_version: Preprint
page: 3089-3139
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: 35th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- '9781611977912'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Deterministic near-linear time minimum cut in weighted graphs
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
_id: '18116'
abstract:
- lang: eng
text: 'As a staple of data analysis and unsupervised learning, the problem of private
clustering has been widely studied, under various privacy models. Centralized
differential privacy is the first of them, and the problem has also been studied
for the local and the shuffle variation. In each case, the goal is to design an
algorithm that computes privately a clustering, with the smallest possible error.
The study of each variation gave rise to new algorithm: the landscape of private
clustering algorithm is therefore quite intricate. In this paper, we show that
a 20 year-old algorithm can be slightly modified to work for any of those models.
This provides a unified picture: while matching almost all previously known results,
it allows us to improve some of them, and extend to a new privacy model, the continual
observation setting, where the input is changing over time and the algorithm must
output a new solution at each time step.'
acknowledgement: 'Monika Henzinger: This project has received funding from the European
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant
DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with
additional funding from the netidee SCIENCE Stiftung, 2020–2024.This work was partially
done while David Saulpic was at the Institute for Science and Technology, Austria
(ISTA). David Sauplic has received funding from the European Union’s Horizon 2020
research and innovation programme under the Marie Sklodowska-Curie grant agreement
No 101034413.'
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Max Dupré
full_name: La Tour, Max Dupré
last_name: La Tour
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: David
full_name: Saulpic, David
id: f8e48cf0-b0ff-11ed-b0e9-b4c35598f964
last_name: Saulpic
citation:
ama: 'La Tour MD, Henzinger M, Saulpic D. Making old things new: A unified algorithm
for differentially private clustering. In: Proceedings of the 41st International
Conference on Machine Learning. Vol 235. ML Research Press; 2024:12046-12086.'
apa: 'La Tour, M. D., Henzinger, M., & Saulpic, D. (2024). Making old things
new: A unified algorithm for differentially private clustering. In Proceedings
of the 41st International Conference on Machine Learning (Vol. 235, pp. 12046–12086).
Vienna, Austria: ML Research Press.'
chicago: 'La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Making Old Things
New: A Unified Algorithm for Differentially Private Clustering.” In Proceedings
of the 41st International Conference on Machine Learning, 235:12046–86. ML
Research Press, 2024.'
ieee: 'M. D. La Tour, M. Henzinger, and D. Saulpic, “Making old things new: A unified
algorithm for differentially private clustering,” in Proceedings of the 41st
International Conference on Machine Learning, Vienna, Austria, 2024, vol.
235, pp. 12046–12086.'
ista: 'La Tour MD, Henzinger M, Saulpic D. 2024. Making old things new: A unified
algorithm for differentially private clustering. Proceedings of the 41st International
Conference on Machine Learning. ICML: International Conference on Machine Learning,
PMLR, vol. 235, 12046–12086.'
mla: 'La Tour, Max Dupré, et al. “Making Old Things New: A Unified Algorithm for
Differentially Private Clustering.” Proceedings of the 41st International Conference
on Machine Learning, vol. 235, ML Research Press, 2024, pp. 12046–86.'
short: M.D. La Tour, M. Henzinger, D. Saulpic, in:, Proceedings of the 41st International
Conference on Machine Learning, ML Research Press, 2024, pp. 12046–12086.
conference:
end_date: 2024-07-27
location: Vienna, Austria
name: 'ICML: International Conference on Machine Learning'
start_date: 2024-07-21
corr_author: '1'
das_tickbox: '0'
date_created: 2024-09-22T22:01:44Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-10-21T08:04:04Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
ec_funded: 1
external_id:
arxiv:
- '2406.11649'
intvolume: ' 235'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2406.11649
month: '09'
oa: 1
oa_version: Published Version
page: 12046-12086
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Proceedings of the 41st International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Making old things new: A unified algorithm for differentially private clustering'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 235
year: '2024'
...
---
_id: '15253'
abstract:
- lang: eng
text: "We study the problem of maintaining a differentially private decaying sum
under continual observation. We give a unifying framework and an efficient algorithm
for this problem for any sufficiently smooth function. Our algorithm is the first
differentially private algorithm that does not have a multiplicative error for
polynomially decaying weights. Our algorithm improves on all prior works on differentially
private decaying sums under continual observation and recovers exactly the additive
error for the special case of continual counting from Henzinger et al. (SODA 2023)
as a corollary.\r\nOur algorithm is a variant of the matrix mechanism whose error
depends on the γ2 and γF norm of the underlying matrix. We give a constructive
proof for an almost exact upper bound on the γ2 and γF norm and an almost tight
lower bound on the γ2 norm for a large class of lower-triangular matrices. This
is the first non-trivial lower bound for lower-triangular matrices whose non-zero
entries are not all the same. It includes matrices for all continual decaying
sums problems, resulting in an upper bound on the additive error of any differentially
private decaying sums algorithm under continual observation.\r\nWe also explore
some implications of our result in discrepancy theory and operator algebra. Given
the importance of the γ2 norm in computer science and the extensive work in mathematics,
we believe our result will have further applications."
acknowledgement: This project has received funding from the European Research Council (ERC)under
the European Union’s Horizon 2020 research and innovation programme (Grant agreement
No.101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)”
and the AustrianScience Fund (FWF) project Z 422-N, project “Static and Dynamic
Hierarchical Graph Decompositions”, I 5982-N, andproject “Fast Algorithms for a
Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the
netideeSCIENCE Stiftung, 2020–2024. JU’s research was funded by the Decanal Research Grant. We thank the anonymousreviewers
for their useful feedback and pointing us to the results in Matousek et al
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Jalaj
full_name: Upadhyay, Jalaj
last_name: Upadhyay
- first_name: Sarvagya
full_name: Upadhyay, Sarvagya
last_name: Upadhyay
citation:
ama: 'Henzinger M, Upadhyay J, Upadhyay S. A unifying framework for differentially
private sums under continual observation. In: Proceedings of the 2024 Annual
ACM-SIAM Symposium on Discrete Algorithms. Vol 2024. Society for Industrial
and Applied Mathematics; 2024:995-1018. doi:10.1137/1.9781611977912.38'
apa: 'Henzinger, M., Upadhyay, J., & Upadhyay, S. (2024). A unifying framework
for differentially private sums under continual observation. In Proceedings
of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2024, pp.
995–1018). Alexandria, VA, United States: Society for Industrial and Applied Mathematics.
https://doi.org/10.1137/1.9781611977912.38'
chicago: Henzinger, Monika, Jalaj Upadhyay, and Sarvagya Upadhyay. “A Unifying Framework
for Differentially Private Sums under Continual Observation.” In Proceedings
of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, 2024:995–1018.
Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/1.9781611977912.38.
ieee: M. Henzinger, J. Upadhyay, and S. Upadhyay, “A unifying framework for differentially
private sums under continual observation,” in Proceedings of the 2024 Annual
ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States,
2024, vol. 2024, pp. 995–1018.
ista: 'Henzinger M, Upadhyay J, Upadhyay S. 2024. A unifying framework for differentially
private sums under continual observation. Proceedings of the 2024 Annual ACM-SIAM
Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol.
2024, 995–1018.'
mla: Henzinger, Monika, et al. “A Unifying Framework for Differentially Private
Sums under Continual Observation.” Proceedings of the 2024 Annual ACM-SIAM
Symposium on Discrete Algorithms, vol. 2024, Society for Industrial and Applied
Mathematics, 2024, pp. 995–1018, doi:10.1137/1.9781611977912.38.
short: M. Henzinger, J. Upadhyay, S. Upadhyay, in:, Proceedings of the 2024 Annual
ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied
Mathematics, 2024, pp. 995–1018.
conference:
end_date: 2024-01-10
location: Alexandria, VA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2024-01-07
corr_author: '1'
das_tickbox: '0'
date_created: 2024-03-31T22:01:13Z
date_published: 2024-01-04T00:00:00Z
date_updated: 2026-10-21T08:03:24Z
day: '04'
department:
- _id: MoHe
doi: 10.1137/1.9781611977912.38
ec_funded: 1
external_id:
arxiv:
- '2307.08970'
fulldoi: https://doi.org/10.1137/1.9781611977912.38
intvolume: ' 2024'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2307.08970
month: '01'
oa: 1
oa_version: Preprint
page: 995-1018
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- '9781611977912'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: A unifying framework for differentially private sums under continual observation
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2024
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18928'
abstract:
- lang: eng
text: "Algorithms with predictions is a new research direction that leverages machine
learned predictions for algorithm design. So far a plethora of recent works have
incorporated predictions to improve on worst-case bounds for online problems.
In this paper, we initiate the study of complexity of dynamic data structures
with predictions, including dynamic graph algorithms. Unlike online algorithms,
the goal in dynamic data structures is to maintain the solution efficiently with
every update.\r\nWe investigate three natural models of prediction: (1) δ-accurate
predictions where each predicted request matches the true request with probability
δ, (2) list-accurate predictions where a true request comes from a list of possible
requests, and (3) bounded delay predictions where the true requests are a permutation
of the predicted requests. We give general reductions among the prediction models,
showing that bounded delay is the strongest prediction model, followed by list-accurate,
and δ-accurate.\r\nFurther, we identify two broad problem classes based on lower
bounds due to the Online Matrix Vector (OMv) conjecture. Specifically, we show
that locally correctable dynamic problems have strong conditional lower bounds
for list-accurate predictions that are equivalent to the non-prediction setting,
unless list-accurate predictions are perfect. Moreover, we show that locally reducible
dynamic problems have time complexity that degrades gracefully with the quality
of bounded delay predictions. We categorize problems with known OMv lower bounds
accordingly and give several upper bounds in the delay model that show that our
lower bounds are almost tight.\r\nWe note that concurrent work by v.d.Brand et
al. [SODA '24] and Liu and Srinivas [arXiv:2307.08890] independently study dynamic
graph algorithms with predictions, but their work is mostly focused on showing
upper bounds."
acknowledgement: "Henzinger, Monika: This project has received funding from the European
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) project
Z 422-N, project I 5982-N, and project P 33775-N, with additional funding from the
netidee SCIENCE Stiftung, 2020-2024.\r\nSaha, Barna: This project is partially supported
by NSF grants 1652303, 1909046, 2112533, and HDR TRIPODS Phase II grant 2217058.\r\nWe
would like to thank Andrea Lincoln for many helpful discussions and insightful comments."
alternative_title:
- LIPIcs
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Barna
full_name: Saha, Barna
last_name: Saha
- first_name: Martin P.
full_name: Seybold, Martin P.
last_name: Seybold
- first_name: Christopher
full_name: Ye, Christopher
last_name: Ye
citation:
ama: 'Henzinger M, Saha B, Seybold MP, Ye C. On the complexity of algorithms with
predictions for dynamic graph problems. In: 15th Innovations in Theoretical
Computer Science Conference. Vol 287. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2024:62:1-62:25. doi:10.4230/LIPIcs.ITCS.2024.62'
apa: 'Henzinger, M., Saha, B., Seybold, M. P., & Ye, C. (2024). On the complexity
of algorithms with predictions for dynamic graph problems. In 15th Innovations
in Theoretical Computer Science Conference (Vol. 287, p. 62:1-62:25). Berkeley,
CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2024.62'
chicago: Henzinger, Monika, Barna Saha, Martin P. Seybold, and Christopher Ye. “On
the Complexity of Algorithms with Predictions for Dynamic Graph Problems.” In
15th Innovations in Theoretical Computer Science Conference, 287:62:1-62:25.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ITCS.2024.62.
ieee: M. Henzinger, B. Saha, M. P. Seybold, and C. Ye, “On the complexity of algorithms
with predictions for dynamic graph problems,” in 15th Innovations in Theoretical
Computer Science Conference, Berkeley, CA, United States, 2024, vol. 287,
p. 62:1-62:25.
ista: 'Henzinger M, Saha B, Seybold MP, Ye C. 2024. On the complexity of algorithms
with predictions for dynamic graph problems. 15th Innovations in Theoretical Computer
Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs,
vol. 287, 62:1-62:25.'
mla: Henzinger, Monika, et al. “On the Complexity of Algorithms with Predictions
for Dynamic Graph Problems.” 15th Innovations in Theoretical Computer Science
Conference, vol. 287, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024,
p. 62:1-62:25, doi:10.4230/LIPIcs.ITCS.2024.62.
short: M. Henzinger, B. Saha, M.P. Seybold, C. Ye, in:, 15th Innovations in Theoretical
Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024, p. 62:1-62:25.
conference:
end_date: 2024-02-02
location: Berkeley, CA, United States
name: 'ITCS: Innovations in Theoretical Computer Science'
start_date: 2024-01-30
corr_author: '1'
das_tickbox: '0'
date_created: 2025-01-27T15:33:42Z
date_published: 2024-01-24T00:00:00Z
date_updated: 2026-10-21T08:07:36Z
day: '24'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.ITCS.2024.62
ec_funded: 1
external_id:
arxiv:
- '2307.16771'
isi:
- '001300389400062'
file:
- access_level: open_access
checksum: 15085a5b3697a408b92a4a7a27293927
content_type: application/pdf
creator: dernst
date_created: 2025-01-27T15:33:24Z
date_updated: 2025-01-27T15:33:24Z
file_id: '18929'
file_name: 2024_LIPICs_HenzingerMo.pdf
file_size: 1084372
relation: main_file
success: 1
file_date_updated: 2025-01-27T15:33:24Z
fulldoi: https://doi.org/10.4230/LIPIcs.ITCS.2024.62
has_accepted_license: '1'
intvolume: ' 287'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 62:1-62:25
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: 15th Innovations in Theoretical Computer Science Conference
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959773096'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: On the complexity of algorithms with predictions for dynamic graph problems
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: 287
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '17479'
abstract:
- lang: eng
text: Phonon polaritons (PhPs), light coupled to lattice vibrations, in the highly
anisotropic polar layered material molybdenum trioxide (α-MoO3) are currently
the focus of intense research efforts due to their extreme subwavelength field
confinement, directional propagation, and unprecedented low losses. Nevertheless,
prior research has primarily concentrated on exploiting the squeezing and steering
capabilities of α-MoO3 PhPs, without inquiring much into the dominant microscopic
mechanism that determines their long lifetimes, which is key for their implementation
in nanophotonic applications. This study delves into the fundamental processes
that govern PhP damping in α-MoO3 by combining ab initio calculations with scattering-type
scanning near-field optical microscopy (s-SNOM) and Fourier transform infrared
(FTIR) spectroscopy measurements across a broad temperature range (8–300 K). The
remarkable agreement between our theoretical predictions and experimental observations
allows us to identify third-order anharmonic phonon–phonon scattering as the main
damping mechanism of α-MoO3 PhPs. These findings shed light on the fundamental
limits of low-loss PhPs, which is a crucial factor for assessing their implementation
into nanophotonic devices.
acknowledgement: 'Funding Sources ─ A.I.F.T.-M. and G.Á.-P. acknowledge support through
the Severo Ochoa program from the Government of the Principality of Asturias (references
PA-21-PF-BP20-117 and PA20-PF-BP19-053, respectively). A.B.K. and J.T.-G. acknowledge
support from the Swiss National Science Foundation (grant # 200020_201096). J.M.-S.
acknowledges financial support from the Ramón y Cajal Program of the Government
of Spain and FSE (RYC2018-026196-I), the Spanish Ministry of Science and Innovation
(State Plan for Scientific and Technical Research and Innovation grant number PID2019-110308GA-I00/AEI/10.13039/501100011033)
and project PCI2022-132953 funded by MCIN/AEI/10.13039/501100011033 and the EU “NextGenerationEU”/PRTR”.
P.A.-G. acknowledges support from the European Research Council under starting grant
no. 715496, 2DNANOPTICA and the Spanish Ministry of Science and Innovation (State
Plan for Scientific and Technical Research and Innovation grant number PID2019-111156GB-I00).
A.Y.N. acknowledges the Spanish Ministry of Science and Innovation (grant PID2020-115221GB-C42)
and the Basque Department of Education (grant PIBA-2023-1-0007). M.V. and J.I.M.
acknowledge support by Spanish MCIN/AEI/10.13039/501100011033/FEDER, UE under grant
PID2022-136784NB and by Asturias FICYT under grant AYUD/2021/51185 with the support
of FEDER funds. I.E. acknowledges funding from the Spanish Ministry of Science and
Innovation (Grant No. PID2022-142861NA-I00) and the Department of Education, Universities,
and Research of the Eusko Jaurlaritza and the University of the Basque Country UPV/EHU
(Grant No. IT1527-22). J. Duan acknowledges the support from the Beijing Natural
Science Foundation (Grant No. Z240005), and National Natural Science Foundation
of China.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Javier
full_name: Taboada-Gutiérrez, Javier
last_name: Taboada-Gutiérrez
- first_name: Yixi
full_name: Zhou, Yixi
last_name: Zhou
- first_name: Ana I.F.
full_name: Tresguerres-Mata, Ana I.F.
last_name: Tresguerres-Mata
- first_name: Christian
full_name: Lanza, Christian
last_name: Lanza
- first_name: Abel
full_name: Martínez-Suárez, Abel
last_name: Martínez-Suárez
- first_name: Gonzalo
full_name: Álvarez-Pérez, Gonzalo
last_name: Álvarez-Pérez
- first_name: Jiahua
full_name: Duan, Jiahua
last_name: Duan
- first_name: José Ignacio
full_name: Martín, José Ignacio
last_name: Martín
- first_name: María
full_name: Vélez, María
last_name: Vélez
- first_name: Ivan
full_name: Prieto Gonzalez, Ivan
id: 2A307FE2-F248-11E8-B48F-1D18A9856A87
last_name: Prieto Gonzalez
orcid: 0000-0002-7370-5357
- first_name: Adrien
full_name: Bercher, Adrien
last_name: Bercher
- first_name: Jérémie
full_name: Teyssier, Jérémie
last_name: Teyssier
- first_name: Ion
full_name: Errea, Ion
last_name: Errea
- first_name: Alexey Y.
full_name: Nikitin, Alexey Y.
last_name: Nikitin
- first_name: Javier
full_name: Martín-Sánchez, Javier
last_name: Martín-Sánchez
- first_name: Alexey B.
full_name: Kuzmenko, Alexey B.
last_name: Kuzmenko
- first_name: Pablo
full_name: Alonso-González, Pablo
last_name: Alonso-González
citation:
ama: Taboada-Gutiérrez J, Zhou Y, Tresguerres-Mata AIF, et al. Unveiling the mechanism
of phonon-polariton damping in α‑MoO3. ACS Photonics. 2024;11(9):3570-3577.
doi:10.1021/acsphotonics.4c00485
apa: Taboada-Gutiérrez, J., Zhou, Y., Tresguerres-Mata, A. I. F., Lanza, C., Martínez-Suárez,
A., Álvarez-Pérez, G., … Alonso-González, P. (2024). Unveiling the mechanism of
phonon-polariton damping in α‑MoO3. ACS Photonics. American Chemical Society.
https://doi.org/10.1021/acsphotonics.4c00485
chicago: Taboada-Gutiérrez, Javier, Yixi Zhou, Ana I.F. Tresguerres-Mata, Christian
Lanza, Abel Martínez-Suárez, Gonzalo Álvarez-Pérez, Jiahua Duan, et al. “Unveiling
the Mechanism of Phonon-Polariton Damping in Α‑MoO3.” ACS Photonics. American
Chemical Society, 2024. https://doi.org/10.1021/acsphotonics.4c00485.
ieee: J. Taboada-Gutiérrez et al., “Unveiling the mechanism of phonon-polariton
damping in α‑MoO3,” ACS Photonics, vol. 11, no. 9. American Chemical Society,
pp. 3570–3577, 2024.
ista: Taboada-Gutiérrez J, Zhou Y, Tresguerres-Mata AIF, Lanza C, Martínez-Suárez
A, Álvarez-Pérez G, Duan J, Martín JI, Vélez M, Prieto Gonzalez I, Bercher A,
Teyssier J, Errea I, Nikitin AY, Martín-Sánchez J, Kuzmenko AB, Alonso-González
P. 2024. Unveiling the mechanism of phonon-polariton damping in α‑MoO3. ACS Photonics.
11(9), 3570–3577.
mla: Taboada-Gutiérrez, Javier, et al. “Unveiling the Mechanism of Phonon-Polariton
Damping in Α‑MoO3.” ACS Photonics, vol. 11, no. 9, American Chemical Society,
2024, pp. 3570–77, doi:10.1021/acsphotonics.4c00485.
short: J. Taboada-Gutiérrez, Y. Zhou, A.I.F. Tresguerres-Mata, C. Lanza, A. Martínez-Suárez,
G. Álvarez-Pérez, J. Duan, J.I. Martín, M. Vélez, I. Prieto Gonzalez, A. Bercher,
J. Teyssier, I. Errea, A.Y. Nikitin, J. Martín-Sánchez, A.B. Kuzmenko, P. Alonso-González,
ACS Photonics 11 (2024) 3570–3577.
das_tickbox: '0'
date_created: 2024-09-01T22:01:09Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-10-21T08:08:01Z
day: '01'
ddc:
- '530'
department:
- _id: NanoFab
doi: 10.1021/acsphotonics.4c00485
external_id:
arxiv:
- '2408.09811'
isi:
- '001298164600001'
pmid:
- '39310295'
file:
- access_level: open_access
checksum: bd7e6a138c406e93eaf0a6268fc42bfe
content_type: application/pdf
creator: dernst
date_created: 2025-01-09T14:01:06Z
date_updated: 2025-01-09T14:01:06Z
file_id: '18819'
file_name: 2024_ACSPhotonics_TaboadaGutierrez_.pdf
file_size: 2664512
relation: main_file
success: 1
file_date_updated: 2025-01-09T14:01:06Z
fulldoi: https://doi.org/10.1021/acsphotonics.4c00485
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 3570-3577
pmid: 1
publication: ACS Photonics
publication_identifier:
eissn:
- 2330-4022
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Unveiling the mechanism of phonon-polariton damping in α‑MoO3
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: 11
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '18906'
abstract:
- lang: eng
text: "Expander decompositions of graphs have significantly advanced the understanding
of many classical graph problems and led to numerous fundamental theoretical results.
However, their adoption in practice has been hindered due to their inherent intricacies
and large hidden factors in their asymptotic running times. Here, we introduce
the first practically efficient algorithm for computing expander decompositions
and their hierarchies and demonstrate its effectiveness and utility by incorporating
it as the core component in a novel solver for the normalized cut graph clustering
objective.\r\nOur extensive experiments on a variety of large graphs show that
our expander-based algorithm outperforms state-of-the-art solvers for normalized
cut with respect to solution quality by a large margin on a variety of graph classes
such as citation, e-mail, and social networks or web graphs while remaining competitive
in running time."
acknowledgement: "Monika Henzinger: This project has received funding from the European
Research\r\nCouncil (ERC) under the European Union’s Horizon 2020 research and innovation
programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant
DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with
additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nHarald Räcke,
Robin Münk: This project has received funding from the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) – 498605858 and 470029389."
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Kathrin
full_name: Hanauer, Kathrin
last_name: Hanauer
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Robin
full_name: Münk, Robin
last_name: Münk
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Maximilian
full_name: Vötsch, Maximilian
last_name: Vötsch
citation:
ama: 'Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. Expander hierarchies for
normalized cuts on graphs. In: Proceedings of the 30th ACM SIGKDD Conference
on Knowledge Discovery and Data Mining. ACM; 2024:1016-1027. doi:10.1145/3637528.3671978'
apa: 'Hanauer, K., Henzinger, M., Münk, R., Räcke, H., & Vötsch, M. (2024).
Expander hierarchies for normalized cuts on graphs. In Proceedings of the 30th
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (pp. 1016–1027).
Barcelona, Spain: ACM. https://doi.org/10.1145/3637528.3671978'
chicago: Hanauer, Kathrin, Monika Henzinger, Robin Münk, Harald Räcke, and Maximilian
Vötsch. “Expander Hierarchies for Normalized Cuts on Graphs.” In Proceedings
of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining,
1016–27. ACM, 2024. https://doi.org/10.1145/3637528.3671978.
ieee: K. Hanauer, M. Henzinger, R. Münk, H. Räcke, and M. Vötsch, “Expander hierarchies
for normalized cuts on graphs,” in Proceedings of the 30th ACM SIGKDD Conference
on Knowledge Discovery and Data Mining, Barcelona, Spain, 2024, pp. 1016–1027.
ista: 'Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. 2024. Expander hierarchies
for normalized cuts on graphs. Proceedings of the 30th ACM SIGKDD Conference on
Knowledge Discovery and Data Mining. KDD: Knowledge Discovery and Data Mining,
1016–1027.'
mla: Hanauer, Kathrin, et al. “Expander Hierarchies for Normalized Cuts on Graphs.”
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data
Mining, ACM, 2024, pp. 1016–27, doi:10.1145/3637528.3671978.
short: K. Hanauer, M. Henzinger, R. Münk, H. Räcke, M. Vötsch, in:, Proceedings
of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM,
2024, pp. 1016–1027.
conference:
end_date: 2024-08-29
location: Barcelona, Spain
name: 'KDD: Knowledge Discovery and Data Mining'
start_date: 2024-08-05
das_tickbox: '0'
date_created: 2025-01-27T13:20:26Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-10-21T08:06:58Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.1145/3637528.3671978
ec_funded: 1
external_id:
isi:
- '001324524201013'
file:
- access_level: open_access
checksum: 1265d5cf6aa5f94157631651723c4a2b
content_type: application/pdf
creator: dernst
date_created: 2025-01-27T13:25:23Z
date_updated: 2025-01-27T13:25:23Z
file_id: '18907'
file_name: 2024_ACMKDD_Hanauer.pdf
file_size: 1450331
relation: main_file
success: 1
file_date_updated: 2025-01-27T13:25:23Z
fulldoi: https://doi.org/10.1145/3637528.3671978
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1016-1027
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
publication: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery
and Data Mining
publication_identifier:
isbn:
- '9798400704901'
publication_status: published
publisher: ACM
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Expander hierarchies for normalized cuts on graphs
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'
...
---
OA_place: publisher
OA_type: hybrid
_id: '17188'
abstract:
- lang: eng
text: "In a delegation problem, a principal P with commitment power tries to pick
one out of \U0001D45B options.\r\nEach option is drawn independently from a known
distribution. Instead of inspecting the options\r\nherself, P delegates the information
acquisition to a rational and self-interested agent A. After\r\ninspection, A
proposes one of the options, and P can accept or reject.\r\nDelegation is a classic
setting in economic information design with many prominent applications,\r\nbut
the computational problems are only poorly understood. In this paper, we study
a natural\r\nonline variant of delegation, in which the agent searches through
the options in an online fashion.\r\nFor each option, he has to irrevocably decide
if he wants to propose the current option or discard\r\nit, before seeing information
on the next option(s). How can we design algorithms for P that\r\napproximate
the utility of her best option in hindsight?\r\nWe show that in general P can
obtain a Θ(1∕\U0001D45B)-approximation and extend this result to ratios\r\nof
Θ(\U0001D458∕\U0001D45B) in case (1) A has a lookahead of \U0001D458 rounds, or
(2) A can propose up to \U0001D458 different\r\noptions. We provide fine-grained
bounds independent of \U0001D45B based on three parameters. If the ratio\r\nof
maximum and minimum utility for A is bounded by a factor \U0001D6FC, we obtain
an Ω(loglog \U0001D6FC∕ log \U0001D6FC)-\r\napproximation algorithm, and we show
that this is best possible. Additionally, if P cannot\r\ndistinguish options with
the same value for herself, we show that ratios polynomial in 1∕\U0001D6FC cannot\r\nbe
avoided. If there are at most \U0001D6FD different utility values for A, we show
a Θ(1∕\U0001D6FD)-approximation.\r\nIf the utilities of P and A for each option
are related by a factor \U0001D6FE, we obtain an Ω(1∕ log \U0001D6FE)-\r\napproximation,
where \U0001D442(log log \U0001D6FE∕ log \U0001D6FE) is best possible."
acknowledgement: Hahn gratefully acknowledges the support of GIF grant I-1419-118.4/2017.
Hoefer gratefully acknowledges the support of GIF grant I-1419-118.4/2017, DFG Research
Unit ADYN (project number 411362735), and DFG grant Ho 3831/9-1 (project number
514505843).
article_number: '104171'
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Pirmin
full_name: Braun, Pirmin
last_name: Braun
- first_name: Niklas
full_name: Hahn, Niklas
id: 0a01c7b2-b823-11ed-9928-cc3f874f9ffd
last_name: Hahn
- first_name: Martin
full_name: Hoefer, Martin
last_name: Hoefer
- first_name: Conrad
full_name: Schecker, Conrad
last_name: Schecker
citation:
ama: Braun P, Hahn N, Hoefer M, Schecker C. Delegated online search. Artificial
Intelligence. 2024;334. doi:10.1016/j.artint.2024.104171
apa: Braun, P., Hahn, N., Hoefer, M., & Schecker, C. (2024). Delegated online
search. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2024.104171
chicago: Braun, Pirmin, Niklas Hahn, Martin Hoefer, and Conrad Schecker. “Delegated
Online Search.” Artificial Intelligence. Elsevier, 2024. https://doi.org/10.1016/j.artint.2024.104171.
ieee: P. Braun, N. Hahn, M. Hoefer, and C. Schecker, “Delegated online search,”
Artificial Intelligence, vol. 334. Elsevier, 2024.
ista: Braun P, Hahn N, Hoefer M, Schecker C. 2024. Delegated online search. Artificial
Intelligence. 334, 104171.
mla: Braun, Pirmin, et al. “Delegated Online Search.” Artificial Intelligence,
vol. 334, 104171, Elsevier, 2024, doi:10.1016/j.artint.2024.104171.
short: P. Braun, N. Hahn, M. Hoefer, C. Schecker, Artificial Intelligence 334 (2024).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: "No data was used for the research described in the article.\r\n"
date_created: 2024-06-30T22:01:05Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-10-21T08:06:15Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.1016/j.artint.2024.104171
external_id:
arxiv:
- '2203.01084'
isi:
- '001260448100001'
file:
- access_level: open_access
checksum: f02a56bc7ea88f41fcc68968e4ceddf3
content_type: application/pdf
creator: dernst
date_created: 2025-01-09T10:45:24Z
date_updated: 2025-01-09T10:45:24Z
file_id: '18806'
file_name: 2024_ArtificialIntelligence_Braun.pdf
file_size: 772226
relation: main_file
success: 1
file_date_updated: 2025-01-09T10:45:24Z
fulldoi: https://doi.org/10.1016/j.artint.2024.104171
has_accepted_license: '1'
intvolume: ' 334'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: Artificial Intelligence
publication_identifier:
issn:
- 0004-3702
publication_status: published
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: not applicable
scopus_import: '1'
status: public
supplementarymaterial: no
title: Delegated online search
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: 334
year: '2024'
...
---
_id: '17238'
abstract:
- lang: eng
text: We know that heritable variation is abundant, and that selection causes all
but the smallest populations to rapidly shift beyond their original trait distribution.
So then, what limits the range of a species? There are physical constraints and
also population genetic limits to the effectiveness of selection, ultimately set
by population size. Global adaptation, where the same genotype is favoured over
the whole range, is most efficient when based on a multitude of weakly selected
alleles and is effective even when local demes are small, provided that there
is some gene flow. In contrast, local adaptation is sensitive to gene flow and
may require alleles with substantial effect. How can populations combine the advantages
of large effective size with the ability to specialise into local niches? To what
extent does reproductive isolation help resolve this tension? I address these
questions using eco-evolutionary models of polygenic adaptation, contrasting discrete
demes with continuousspace.
acknowledgement: This work was supported by a grant from the ERC, 101055327, “HaplotypeStructure”.
I thank Himani Sachdeva, Michal Hledik, Jitka Polechova, and the reviewers for their
helpful comments.
article_processing_charge: Yes (via OA deal)
article_type: review
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Barton NH. Limits to species’ range: The tension between local and global
adaptation. Journal of Evolutionary Biology. 2024;37(6):605-615. doi:10.1093/jeb/voae052'
apa: 'Barton, N. H. (2024). Limits to species’ range: The tension between local
and global adaptation. Journal of Evolutionary Biology. Oxford University
Press. https://doi.org/10.1093/jeb/voae052'
chicago: 'Barton, Nicholas H. “Limits to Species’ Range: The Tension between Local
and Global Adaptation.” Journal of Evolutionary Biology. Oxford University
Press, 2024. https://doi.org/10.1093/jeb/voae052.'
ieee: 'N. H. Barton, “Limits to species’ range: The tension between local and global
adaptation,” Journal of Evolutionary Biology, vol. 37, no. 6. Oxford University
Press, pp. 605–615, 2024.'
ista: 'Barton NH. 2024. Limits to species’ range: The tension between local and
global adaptation. Journal of Evolutionary Biology. 37(6), 605–615.'
mla: 'Barton, Nicholas H. “Limits to Species’ Range: The Tension between Local and
Global Adaptation.” Journal of Evolutionary Biology, vol. 37, no. 6, Oxford
University Press, 2024, pp. 605–15, doi:10.1093/jeb/voae052.'
short: N.H. Barton, Journal of Evolutionary Biology 37 (2024) 605–615.
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: All code used to generate the figures is in the accompanying
Mathematica notebook.
date_created: 2024-07-14T22:01:12Z
date_published: 2024-06-01T00:00:00Z
date_updated: 2026-10-21T08:11:09Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/jeb/voae052
external_id:
isi:
- '001225323900001'
pmid:
- '38683160'
file:
- access_level: open_access
checksum: 94e6b68bddf6cadcec29c7f41647359f
content_type: application/pdf
creator: dernst
date_created: 2024-07-15T09:45:25Z
date_updated: 2024-07-15T09:45:25Z
file_id: '17241'
file_name: 2024_JourEvolutionaryBiology_Barton.pdf
file_size: 1194263
relation: main_file
success: 1
file_date_updated: 2024-07-15T09:45:25Z
fulldoi: https://doi.org/10.1093/jeb/voae052
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 605-615
pmid: 1
project:
- _id: bd6958e0-d553-11ed-ba76-86eba6a76c00
grant_number: '101055327'
name: Understanding the evolution of continuous genomes
publication: Journal of Evolutionary Biology
publication_identifier:
eissn:
- 1420-9101
issn:
- 1010-061X
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
researchdata_availability: yes (supplementary data)
scopus_import: '1'
status: public
supplementarymaterial: yes
title: 'Limits to species'' range: The tension between local and global adaptation'
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: 37
year: '2024'
...
---
_id: '17237'
abstract:
- lang: eng
text: 'The impact of climate change on populations will be contingent upon their
contemporary adaptive evolution. In this study, we investigated the contemporary
evolution of 4 populations of the cold-water kelp Laminaria digitata by analyzing
their spatial and temporal genomic variations using ddRAD-sequencing. These populations
were sampled from the center to the southern margin of its north-eastern Atlantic
distribution at 2 time points, spanning at least 2 generations. Through genome
scans for local adaptation at a single time point, we identified candidate loci
that showed clinal variation correlated with changes in sea surface temperature
(SST) along latitudinal gradients. This finding suggests that SST may drive the
adaptive response of these kelp populations, although factors such as species’
demographic history should also be considered. Additionally, we performed a simulation
approach to distinguish the effect of selection from genetic drift in allele frequency
changes over time. This enabled the detection of loci in the southernmost population
that exhibited temporal differentiation beyond what would be expected from genetic
drift alone: these are candidate loci which could have evolved under selection
over time. In contrast, we did not detect any outlier locus based on temporal
differentiation in the population from the North Sea, which also displayed low
and decreasing levels of genetic diversity. The diverse evolutionary scenarios
observed among populations can be attributed to variations in the prevalence of
selection relative to genetic drift across different environments. Therefore,
our study highlights the potential of temporal genomics to offer valuable insights
into the contemporary evolution of marine foundation species facing climate change.'
acknowledgement: "This work was funded by the EU project MARFOR Biodiversa/004/2015.
L.F. was additionally funded by the Region Bretagne (ARED 2017 REEALG) and the NOMIS
Foundation. The project leading to this publication has received funding from the
EC2CO (CNRS) fund and from the European FEDER Fund under project 1166-39417.\r\nThis
work is especially dedicated to the memory of Gernot Glöckner who contributed to
the sequencing of Laminaria digitata genome and passed away in very recent time.
The authors thank the ABiMS platform of the Roscoff biological station (http://abims.sb-roscoff.fr)
for providing the HPC resources that contributed to the search results reported
in this document. We also acknowledge the staff of the “Cluster de calcul intensif
HPC” Platform of the OSU Institut Pythéas (Aix-Marseille Université, INSU-CNRS)
for providing the computing facilities."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Lauric
full_name: Reynes, Lauric
last_name: Reynes
- first_name: Louise
full_name: Fouqueau, Louise
id: 1676e173-8143-11ed-8927-fe165216a93f
last_name: Fouqueau
orcid: 0000-0003-0371-9339
- first_name: Didier
full_name: Aurelle, Didier
last_name: Aurelle
- first_name: Stephane
full_name: Mauger, Stephane
last_name: Mauger
- first_name: Christophe
full_name: Destombe, Christophe
last_name: Destombe
- first_name: Myriam
full_name: Valero, Myriam
last_name: Valero
citation:
ama: Reynes L, Fouqueau L, Aurelle D, Mauger S, Destombe C, Valero M. Temporal genomics
help in deciphering neutral and adaptive patterns in the contemporary evolution
of kelp populations. Journal of Evolutionary Biology. 2024;37(6):677-692.
doi:10.1093/jeb/voae048
apa: Reynes, L., Fouqueau, L., Aurelle, D., Mauger, S., Destombe, C., & Valero,
M. (2024). Temporal genomics help in deciphering neutral and adaptive patterns
in the contemporary evolution of kelp populations. Journal of Evolutionary
Biology. Oxford University Press. https://doi.org/10.1093/jeb/voae048
chicago: Reynes, Lauric, Louise Fouqueau, Didier Aurelle, Stephane Mauger, Christophe
Destombe, and Myriam Valero. “Temporal Genomics Help in Deciphering Neutral and
Adaptive Patterns in the Contemporary Evolution of Kelp Populations.” Journal
of Evolutionary Biology. Oxford University Press, 2024. https://doi.org/10.1093/jeb/voae048.
ieee: L. Reynes, L. Fouqueau, D. Aurelle, S. Mauger, C. Destombe, and M. Valero,
“Temporal genomics help in deciphering neutral and adaptive patterns in the contemporary
evolution of kelp populations,” Journal of Evolutionary Biology, vol. 37,
no. 6. Oxford University Press, pp. 677–692, 2024.
ista: Reynes L, Fouqueau L, Aurelle D, Mauger S, Destombe C, Valero M. 2024. Temporal
genomics help in deciphering neutral and adaptive patterns in the contemporary
evolution of kelp populations. Journal of Evolutionary Biology. 37(6), 677–692.
mla: Reynes, Lauric, et al. “Temporal Genomics Help in Deciphering Neutral and Adaptive
Patterns in the Contemporary Evolution of Kelp Populations.” Journal of Evolutionary
Biology, vol. 37, no. 6, Oxford University Press, 2024, pp. 677–92, doi:10.1093/jeb/voae048.
short: L. Reynes, L. Fouqueau, D. Aurelle, S. Mauger, C. Destombe, M. Valero, Journal
of Evolutionary Biology 37 (2024) 677–692.
das_tickbox: '1'
dataavailabilitystatement: Individual high-quality reads (paired-end reads) generated
in the present study (fq.gz files) and the filtered vcf file can be accessed via
the Dryad repository at https://doi.org/10.5061/dryad.tb2rbp064. Additionally, the
scaffolds assembly of the Laminaria digitata genome, utilized for read mapping and
produced by Gernot Glöckner, is also available in the same repository. Furthermore,
the custom R script developed for identifying temporal outlier SNPs, along with
the FST datasets comparing observed and simulated FST between time points, can be
found on GitHub at https://doi.org/10.5281/zenodo.10946282.
date_created: 2024-07-14T22:01:12Z
date_published: 2024-06-01T00:00:00Z
date_updated: 2026-10-21T08:10:14Z
day: '01'
department:
- _id: NiBa
doi: 10.1093/jeb/voae048
external_id:
arxiv:
- '2404.14003'
pmid:
- '38629140'
fulldoi: https://doi.org/10.1093/jeb/voae048
intvolume: ' 37'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2404.14003
month: '06'
oa: 1
oa_version: Preprint
page: 677-692
pmid: 1
publication: Journal of Evolutionary Biology
publication_identifier:
eissn:
- 1420-9101
issn:
- 1010-061X
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
related_material:
record:
- id: '22867'
relation: research_data
status: public
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Temporal genomics help in deciphering neutral and adaptive patterns in the
contemporary evolution of kelp populations
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 37
year: '2024'
...
---
OA_type: closed access
_id: '18922'
abstract:
- lang: eng
text: 'Let G be a directed graph with m edges and n vertices. We present a deterministic
linear-time algorithm for computing the 3-edge-connected components of G. This
is a significant improvement over the previous best bound by Georgiadis et al.
[SODA 2023], which is Õ(m√{m}) and randomized. Our result is based on a novel
characterization of 2-edge cuts in directed graphs and on a new technique that
exploits the concept of divergent spanning trees and 2-connectivity-light graphs,
and requires a careful modification of the minset-poset technique of Gabow [TALG
2016]. As a side result, our new technique yields also an oracle for providing
in constant time a minimum edge-cut for any two vertices that are not 3-edge-connected.
The oracle uses space O(n) and can be built in O(mlog n) time: given two query
vertices, it determines in constant time whether they are 3-edge-connected, or
provides a k-edge cut, with k≤ 2, that separates them.'
acknowledgement: "Giuseppe F. Italiano was partially supported by the Italian Ministry
of\r\nUniversity and Reseach under PRIN Project n. 2022TS4Y3N - EXPAND: scalable
algorithms for EXPloratory Analyses of heterogeneous and dynamic Networked Data.\r\n"
article_processing_charge: No
author:
- first_name: Loukas
full_name: Georgiadis, Loukas
last_name: Georgiadis
- first_name: Giuseppe F.
full_name: Italiano, Giuseppe F.
last_name: Italiano
- first_name: Evangelos
full_name: Kosinas, Evangelos
id: 4c7f9625-dbbc-11ee-9d86-bdcc2db5a949
last_name: Kosinas
citation:
ama: 'Georgiadis L, Italiano GF, Kosinas E. Computing the 3-edge-connected components
of directed graphs in linear time. In: 65th Annual Symposium on Foundations
of Computer Science. IEEE; 2024:62-85. doi:10.1109/focs61266.2024.00015'
apa: 'Georgiadis, L., Italiano, G. F., & Kosinas, E. (2024). Computing the 3-edge-connected
components of directed graphs in linear time. In 65th Annual Symposium on Foundations
of Computer Science (pp. 62–85). Chicago, IL, United States: IEEE. https://doi.org/10.1109/focs61266.2024.00015'
chicago: Georgiadis, Loukas, Giuseppe F. Italiano, and Evangelos Kosinas. “Computing
the 3-Edge-Connected Components of Directed Graphs in Linear Time.” In 65th
Annual Symposium on Foundations of Computer Science, 62–85. IEEE, 2024. https://doi.org/10.1109/focs61266.2024.00015.
ieee: L. Georgiadis, G. F. Italiano, and E. Kosinas, “Computing the 3-edge-connected
components of directed graphs in linear time,” in 65th Annual Symposium on
Foundations of Computer Science, Chicago, IL, United States, 2024, pp. 62–85.
ista: 'Georgiadis L, Italiano GF, Kosinas E. 2024. Computing the 3-edge-connected
components of directed graphs in linear time. 65th Annual Symposium on Foundations
of Computer Science. FOCS: Foundations of Computer Science, 62–85.'
mla: Georgiadis, Loukas, et al. “Computing the 3-Edge-Connected Components of Directed
Graphs in Linear Time.” 65th Annual Symposium on Foundations of Computer Science,
IEEE, 2024, pp. 62–85, doi:10.1109/focs61266.2024.00015.
short: L. Georgiadis, G.F. Italiano, E. Kosinas, in:, 65th Annual Symposium on Foundations
of Computer Science, IEEE, 2024, pp. 62–85.
conference:
end_date: 2024-10-30
location: Chicago, IL, United States
name: 'FOCS: Foundations of Computer Science'
start_date: 2024-10-27
corr_author: '1'
das_tickbox: '0'
date_created: 2025-01-27T14:50:23Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2026-10-21T08:07:18Z
day: '01'
department:
- _id: MoHe
doi: 10.1109/focs61266.2024.00015
external_id:
isi:
- '001419526400005'
fulldoi: https://doi.org/10.1109/focs61266.2024.00015
isi: 1
language:
- iso: eng
month: '10'
oa_version: None
page: 62-85
publication: 65th Annual Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- '9798331516741'
publication_status: published
publisher: IEEE
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Computing the 3-edge-connected components of directed graphs in linear time
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
_id: '17207'
acknowledgement: "This research was funded by the Austrian Science Fund (FWF), project
doi: 10.55776/P32896, Institutional Identifier: 501100002428, grant number: P32896
and L.F. acknowledges the support of the NOMIS-ISTA Fellowship Program.\r\nWe would
like to thank Nick Barton, Roger Butlin, Stuart Baird, Patrik Nosil, and Jason Sexton
for their insightful comments on the earlier drafts, and to John Carchrae for his
valuable contribution in refining phrasing and enhancing clarity. For open access
purposes, the author has applied a CC BY public copyright license to any author-accepted
manuscript version arising from this submission."
article_processing_charge: No
article_type: letter_note
author:
- first_name: Louise
full_name: Fouqueau, Louise
id: 1676e173-8143-11ed-8927-fe165216a93f
last_name: Fouqueau
orcid: 0000-0003-0371-9339
- first_name: Jitka
full_name: Polechova, Jitka
id: 3BBFB084-F248-11E8-B48F-1D18A9856A87
last_name: Polechova
orcid: 0000-0003-0951-3112
citation:
ama: 'Fouqueau L, Polechova J. Eco-evolutionary dynamics in changing environments:
Integrating theory with data. Journal of evolutionary biology. 2024;37(6):579-587.
doi:10.1093/jeb/voae067'
apa: 'Fouqueau, L., & Polechova, J. (2024). Eco-evolutionary dynamics in changing
environments: Integrating theory with data. Journal of Evolutionary Biology.
Oxford University Press. https://doi.org/10.1093/jeb/voae067'
chicago: 'Fouqueau, Louise, and Jitka Polechova. “Eco-Evolutionary Dynamics in Changing
Environments: Integrating Theory with Data.” Journal of Evolutionary Biology.
Oxford University Press, 2024. https://doi.org/10.1093/jeb/voae067.'
ieee: 'L. Fouqueau and J. Polechova, “Eco-evolutionary dynamics in changing environments:
Integrating theory with data,” Journal of evolutionary biology, vol. 37,
no. 6. Oxford University Press, pp. 579–587, 2024.'
ista: 'Fouqueau L, Polechova J. 2024. Eco-evolutionary dynamics in changing environments:
Integrating theory with data. Journal of evolutionary biology. 37(6), 579–587.'
mla: 'Fouqueau, Louise, and Jitka Polechova. “Eco-Evolutionary Dynamics in Changing
Environments: Integrating Theory with Data.” Journal of Evolutionary Biology,
vol. 37, no. 6, Oxford University Press, 2024, pp. 579–87, doi:10.1093/jeb/voae067.'
short: L. Fouqueau, J. Polechova, Journal of Evolutionary Biology 37 (2024) 579–587.
das_tickbox: '0'
date_created: 2024-07-07T22:01:04Z
date_published: 2024-06-28T00:00:00Z
date_updated: 2026-10-21T08:08:57Z
day: '28'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/jeb/voae067
external_id:
isi:
- '001258359900001'
pmid:
- '38941551'
fulldoi: https://doi.org/10.1093/jeb/voae067
intvolume: ' 37'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/jeb/voae067
month: '06'
oa: 1
oa_version: Published Version
page: 579-587
pmid: 1
project:
- _id: c08d3278-5a5b-11eb-8a69-fdb09b55f4b8
grant_number: P32896
name: Causes and consequences of population fragmentation
- _id: 9B861AAC-BA93-11EA-9121-9846C619BF3A
name: NOMIS Fellowship Program
publication: Journal of evolutionary biology
publication_identifier:
eissn:
- 1420-9101
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Eco-evolutionary dynamics in changing environments: Integrating theory with
data'
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: 37
year: '2024'
...
---
_id: '17888'
abstract:
- lang: eng
text: "Context: Biotic resource exploitation is a critical determinant of species’
distributions. However, quantifying resource exploitation patterns through space
and time can be difficult, complicating their incorporation in spatial ecology
studies. Therefore, understanding the local drivers of spatial patterns of resource
exploitation may contribute to better large-scale species distribution models.\r\nObjectives:
We investigated (1) how the resource exploitation patterns of two trophic interactions
(plant–insect) are explained by insect behaviour, resource aggregation, and potential
insect-insect interactions. We also analyzed how (2) resource patch size and (3)
resource accessibility in a heterogeneous landscape affected host exploitation
patterns.\r\nMethods: We quantified nectar robbing by insects in the genus Bombus
(bumblebees) and seed predation by Brachypterolus vestitus larvae (Antirrhinum
beetle) on Antirrhinum majus L. (wild snapdragons) in the Pyrenees Mountains,
Catalonia, Spain. We tested hypotheses about resource exploitation by integrating
spatial analyses at multiple scales.\r\nResults: Both trophic interactions were
aggregated, explained by the aggregation of their resource. At some scales, nectar
robbing is more aggregated than the resource. Trophic interaction abundance is
proportional to resource patch size, following the ideal free distribution model.
Landscape features do not explain the locations exploited. Nectar robbing and
seed predation occur together more often than expected.\r\nConclusions: Our findings
suggest that multiple biotic and ecological spatial factors may simultaneously
affect resource exploitation at a local scale. These findings should be considered
when developing agricultural projects, management plans and conservation policies."
acknowledgement: "For the beetle barcoding, we are very thankful to Brent Emerson’s
laboratory at the Consejo Superior de Investigaciones Científicas (CSIC) at the
Instituto de Productos Naturales y Agrobiología (IPNA) in La Laguna, Tenerife. Many
thanks to numerous field assistants, especially Sandra Cuevas Gallego, Beatriz Pablo
Carmona, Luís Santos Cid and Alex Fuster, for their assistance in data collection.
Finally, we thank Jesús Muñoz, Virgilio Gómez-Rubio, and two anonymous reviewers
for comments that greatly improved the quality of the manuscript.\r\nOpen access
funding provided by Institute of Science and Technology (IST Austria). CB received
funding from the European Union’s Horizon 2020 research and innovation programme
under the Marie Skłodowska-Curie Grant Agreement No. 754411. NB was funded by the
FWF grant “Löwenmaul speciation” P 32166-B32."
article_number: '172'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Guillem
full_name: Pocull Belles, Guillem
id: 54359172-700c-11ef-a103-c1d91ceac6d6
last_name: Pocull Belles
- first_name: Carina
full_name: Baskett, Carina
id: 3B4A7CE2-F248-11E8-B48F-1D18A9856A87
last_name: Baskett
orcid: 0000-0002-7354-8574
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Pocull Belles G, Baskett C, Barton NH. Multiscale spatial analysis of two
plant–insect interactions: Effects of landscape, resource distribution, and other
insects. Landscape Ecology. 2024;39(9). doi:10.1007/s10980-024-01899-9'
apa: 'Pocull Belles, G., Baskett, C., & Barton, N. H. (2024). Multiscale spatial
analysis of two plant–insect interactions: Effects of landscape, resource distribution,
and other insects. Landscape Ecology. Springer Nature. https://doi.org/10.1007/s10980-024-01899-9'
chicago: 'Pocull Belles, Guillem, Carina Baskett, and Nicholas H Barton. “Multiscale
Spatial Analysis of Two Plant–Insect Interactions: Effects of Landscape, Resource
Distribution, and Other Insects.” Landscape Ecology. Springer Nature, 2024.
https://doi.org/10.1007/s10980-024-01899-9.'
ieee: 'G. Pocull Belles, C. Baskett, and N. H. Barton, “Multiscale spatial analysis
of two plant–insect interactions: Effects of landscape, resource distribution,
and other insects,” Landscape Ecology, vol. 39, no. 9. Springer Nature,
2024.'
ista: 'Pocull Belles G, Baskett C, Barton NH. 2024. Multiscale spatial analysis
of two plant–insect interactions: Effects of landscape, resource distribution,
and other insects. Landscape Ecology. 39(9), 172.'
mla: 'Pocull Belles, Guillem, et al. “Multiscale Spatial Analysis of Two Plant–Insect
Interactions: Effects of Landscape, Resource Distribution, and Other Insects.”
Landscape Ecology, vol. 39, no. 9, 172, Springer Nature, 2024, doi:10.1007/s10980-024-01899-9.'
short: G. Pocull Belles, C. Baskett, N.H. Barton, Landscape Ecology 39 (2024).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: The datasets generated and analysed during the current
study will be deposited to the ISTA Research Explorer repository upon manuscript
acceptance. Voucher specimens of insects are deposited in the Museo Nacional de
Ciencias Naturales, Spain.
date_created: 2024-09-08T22:01:11Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-10-21T08:12:11Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1007/s10980-024-01899-9
ec_funded: 1
external_id:
isi:
- '001304011900001'
file:
- access_level: open_access
checksum: 2e1cbc320ec1b4447a5a8562a90bcbc3
content_type: application/pdf
creator: dernst
date_created: 2024-09-11T07:14:03Z
date_updated: 2024-09-11T07:14:03Z
file_id: '18054'
file_name: 2024_LandscapeEcology_Pocull.pdf
file_size: 1494987
relation: main_file
success: 1
file_date_updated: 2024-09-11T07:14:03Z
fulldoi: https://doi.org/10.1007/s10980-024-01899-9
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 05959E1C-7A3F-11EA-A408-12923DDC885E
grant_number: P32166
name: Snapdragon Speciation
publication: Landscape Ecology
publication_identifier:
eissn:
- 1572-9761
issn:
- 0921-2973
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: 'Multiscale spatial analysis of two plant–insect interactions: Effects of landscape,
resource distribution, and other insects'
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: 39
year: '2024'
...
---
_id: '14850'
abstract:
- lang: eng
text: Elaborate sexual signals are thought to have evolved and be maintained to
serve as honest indicators of signaller quality. One measure of quality is health,
which can be affected by parasite infection. Cnemaspis mysoriensis is a diurnal
gecko that is often infested with ectoparasites in the wild, and males of this
species express visual (coloured gular patches) and chemical (femoral gland secretions)
traits that receivers could assess during social interactions. In this paper,
we tested whether ectoparasites affect individual health, and whether signal quality
is an indicator of ectoparasite levels. In wild lizards, we found that ectoparasite
level was negatively correlated with body condition in both sexes. Moreover, some
characteristics of both visual and chemical traits in males were strongly associated
with ectoparasite levels. Specifically, males with higher ectoparasite levels
had yellow gular patches with lower brightness and chroma, and chemical secretions
with a lower proportion of aromatic compounds. We then determined whether ectoparasite
levels in males influence female behaviour. Using sequential choice trials, wherein
females were provided with either the visual or the chemical signals of wild-caught
males that varied in ectoparasite level, we found that only chemical secretions
evoked an elevated female response towards less parasitised males. Simultaneous
choice trials in which females were exposed to the chemical secretions from males
that varied in parasite level further confirmed a preference for males with lower
parasites loads. Overall, we find that although health (body condition) or ectoparasite
load can be honestly advertised through multiple modalities, the parasite-mediated
female response is exclusively driven by chemical signals.
acknowledgement: "We thank Anuradha Batabyal and Shakilur Kabir for scientific discussions,
and help with sampling and colour analyses. We thank Muralidhar and the central
LCMS facility of the IISc for their technical support with the GCMS.\r\nResearch
funding was provided by the Department of Science and Technology Fund for Improvement
of S&T Infrastructure (DST-FIST), the Department of Biotechnology-Indian Institute
of Science (DBT-IISc) partnership program and a Science and Engineering Research
Board (SERB) grant to M.T. (EMR/2017/002228). Open Access funding provided by Indian
Institute of Science. Deposited in PMC for immediate release."
article_number: jeb246217
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Arka
full_name: Pal, Arka
id: 6AAB2240-CA9A-11E9-9C1A-D9D1E5697425
last_name: Pal
orcid: 0000-0002-4530-8469
- first_name: Mihir
full_name: Joshi, Mihir
last_name: Joshi
- first_name: Maria
full_name: Thaker, Maria
last_name: Thaker
citation:
ama: Pal A, Joshi M, Thaker M. Too much information? Males convey parasite levels
using more signal modalities than females utilise. Journal of Experimental
Biology. 2024;227(1). doi:10.1242/jeb.246217
apa: Pal, A., Joshi, M., & Thaker, M. (2024). Too much information? Males convey
parasite levels using more signal modalities than females utilise. Journal
of Experimental Biology. The Company of Biologists. https://doi.org/10.1242/jeb.246217
chicago: Pal, Arka, Mihir Joshi, and Maria Thaker. “Too Much Information? Males
Convey Parasite Levels Using More Signal Modalities than Females Utilise.” Journal
of Experimental Biology. The Company of Biologists, 2024. https://doi.org/10.1242/jeb.246217.
ieee: A. Pal, M. Joshi, and M. Thaker, “Too much information? Males convey parasite
levels using more signal modalities than females utilise,” Journal of Experimental
Biology, vol. 227, no. 1. The Company of Biologists, 2024.
ista: Pal A, Joshi M, Thaker M. 2024. Too much information? Males convey parasite
levels using more signal modalities than females utilise. Journal of Experimental
Biology. 227(1), jeb246217.
mla: Pal, Arka, et al. “Too Much Information? Males Convey Parasite Levels Using
More Signal Modalities than Females Utilise.” Journal of Experimental Biology,
vol. 227, no. 1, jeb246217, The Company of Biologists, 2024, doi:10.1242/jeb.246217.
short: A. Pal, M. Joshi, M. Thaker, Journal of Experimental Biology 227 (2024).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: Raw data for this paper are available from Zenodo (doi:10.5281/zenodo.10423540).
All analysis code is available from GitHub (https://github.com/arka-pal/Cnemaspis-SexualSignaling)
date_created: 2024-01-22T08:14:49Z
date_published: 2024-01-10T00:00:00Z
date_updated: 2026-10-21T08:13:07Z
day: '10'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1242/jeb.246217
external_id:
isi:
- '001214515700016'
pmid:
- '38054353'
file:
- access_level: open_access
checksum: 136325372f6f45abaa62a71e2d23bfb6
content_type: application/pdf
creator: dernst
date_created: 2024-01-23T12:08:24Z
date_updated: 2024-01-23T12:08:24Z
file_id: '14877'
file_name: 2024_JourExperimBiology_Pal.pdf
file_size: 594128
relation: main_file
success: 1
file_date_updated: 2024-01-23T12:08:24Z
fulldoi: https://doi.org/10.1242/jeb.246217
has_accepted_license: '1'
intvolume: ' 227'
isi: 1
issue: '1'
keyword:
- Insect Science
- Molecular Biology
- Animal Science and Zoology
- Aquatic Science
- Physiology
- Ecology
- Evolution
- Behavior and Systematics
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
pmid: 1
publication: Journal of Experimental Biology
publication_identifier:
eissn:
- 0022-0949
issn:
- 1477-9145
publication_status: published
publisher: The Company of Biologists
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/arka-pal/Cnemaspis-SexualSignaling
record:
- id: '22868'
relation: research_data
status: public
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Too much information? Males convey parasite levels using more signal modalities
than females utilise
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: 227
year: '2024'
...
---
_id: '15358'
abstract:
- lang: eng
text: 'We consider how a population of N haploid individuals responds to directional
selection on standing variation, with no new variation from recombination or mutation.
Individuals have trait values z1,…,zN, which are drawn from a distribution ψ;
the fitness of individual i is proportional to [Formula: see text] . For illustration,
we consider the Laplace and Gaussian distributions, which are parametrised only
by the variance V0, and show that for large N, there is a scaling limit which
depends on a single parameter NV0. When selection is weak relative to drift (NV0≪1),
the variance decreases exponentially at rate 1/N, and the expected ultimate gain
in log fitness (scaled by V0), is just NV0, which is the same as Robertson''s
(1960) prediction for a sexual population. In contrast, when selection is strong
relative to drift (NV0≫1), the ultimate gain can be found by approximating the
establishment of alleles by a branching process in which each allele competes
independently with the population mean and the fittest allele to establish is
certain to fix. Then, if the probability of survival to time t∼1/V0 of an allele
with value z is P(z), with mean P¯, the winning allele is the fittest of NP¯ survivors
drawn from a distribution ψP/P¯. The expected ultimate change is ∼2log(1.15NV0)
for a Gaussian distribution, and ∼-12log0.36NV0-log-log0.36NV0 for a Laplace distribution.
This approach also predicts the variability of the process, and its dynamics;
we show that in the strong selection regime, the expected genetic variance decreases
as ∼t-3 at large times. We discuss how these results may be related to selection
on standing variation that is spread along a linear chromosome.'
acknowledgement: We thank Emmanuel Schertzer and two reviewers for comments on this
manuscript. NB thanks the European Research Council for support via the grant “HaplotypeStructure”
101055327. We would also like to give our sincere thanks to Alison Etheridge for
her insight, inspiration and support over the years.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Himani
full_name: Sachdeva, Himani
id: 42377A0A-F248-11E8-B48F-1D18A9856A87
last_name: Sachdeva
citation:
ama: Barton NH, Sachdeva H. Limits to selection on standing variation in an asexual
population. Theoretical Population Biology. 2024;157:129-137. doi:10.1016/j.tpb.2024.04.001
apa: Barton, N. H., & Sachdeva, H. (2024). Limits to selection on standing variation
in an asexual population. Theoretical Population Biology. Elsevier. https://doi.org/10.1016/j.tpb.2024.04.001
chicago: Barton, Nicholas H, and Himani Sachdeva. “Limits to Selection on Standing
Variation in an Asexual Population.” Theoretical Population Biology. Elsevier,
2024. https://doi.org/10.1016/j.tpb.2024.04.001.
ieee: N. H. Barton and H. Sachdeva, “Limits to selection on standing variation in
an asexual population,” Theoretical Population Biology, vol. 157. Elsevier,
pp. 129–137, 2024.
ista: Barton NH, Sachdeva H. 2024. Limits to selection on standing variation in
an asexual population. Theoretical Population Biology. 157, 129–137.
mla: Barton, Nicholas H., and Himani Sachdeva. “Limits to Selection on Standing
Variation in an Asexual Population.” Theoretical Population Biology, vol.
157, Elsevier, 2024, pp. 129–37, doi:10.1016/j.tpb.2024.04.001.
short: N.H. Barton, H. Sachdeva, Theoretical Population Biology 157 (2024) 129–137.
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: Selection_SGV_Asexual (Original data) (GitHub).
date_created: 2024-05-05T22:01:03Z
date_published: 2024-06-01T00:00:00Z
date_updated: 2026-10-21T08:14:58Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1016/j.tpb.2024.04.001
external_id:
isi:
- '001237016800001'
pmid:
- '38643838'
file:
- access_level: open_access
checksum: 78f36488d24f868d5913624e9c8d88bf
content_type: application/pdf
creator: dernst
date_created: 2024-05-13T08:22:21Z
date_updated: 2024-05-13T08:22:21Z
file_id: '15383'
file_name: 2024_TheorPopulationBiology_Barton.pdf
file_size: 1098292
relation: main_file
success: 1
file_date_updated: 2024-05-13T08:22:21Z
fulldoi: https://doi.org/10.1016/j.tpb.2024.04.001
has_accepted_license: '1'
intvolume: ' 157'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 129-137
pmid: 1
project:
- _id: bd6958e0-d553-11ed-ba76-86eba6a76c00
grant_number: '101055327'
name: Understanding the evolution of continuous genomes
publication: Theoretical Population Biology
publication_identifier:
eissn:
- 1096-0325
issn:
- 0040-5809
publication_status: published
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Limits to selection on standing variation in an asexual population
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: 157
year: '2024'
...
---
_id: '15099'
abstract:
- lang: eng
text: Speciation is a key evolutionary process that is not yet fully understood.
Combining population genomic and ecological data from multiple diverging pairs
of marine snails (Littorina) supports the search for speciation mechanisms. Placing
pairs on a one-dimensional speciation continuum, from undifferentiated populations
to species, obscured the complexity of speciation. Adding multiple axes helped
to describe either speciation routes or reproductive isolation in the snails.
Divergent ecological selection repeatedly generated barriers between ecotypes,
but appeared less important in completing speciation while genetic incompatibilities
played a key role. Chromosomal inversions contributed to genomic barriers, but
with variable impact. A multidimensional (hypercube) approach supported framing
of questions and identification of knowledge gaps and can be useful to understand
speciation in many other systems.
acknowledgement: KJ, MR, and RKB were supported by grants from the Swedish Research
Council (2021-0419, 2021-05243, and 2018-03695, respectively). RKB was also supported
by the Leverhulme Trust (RPG-2021-141), RF by FCT- Portuguese Science Foundation
(PTDC/BIA-EVL/1614/2021 and 2020.00275.CEECIND), and AMW by Norwegian Research Council
RCN (Project number 315287). We thank the members of the Integration of Speciation
Research network for stimulating discussions, the Littorina research community for
important contributions of data and analyses, and Cynthia Riginos for useful comments
on an earlier draft.
article_processing_charge: Yes (in subscription journal)
article_type: review
author:
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Alan
full_name: Le Moan, Alan
last_name: Le Moan
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
- first_name: Sean
full_name: Stankowski, Sean
id: 43161670-5719-11EA-8025-FABC3DDC885E
last_name: Stankowski
citation:
ama: Johannesson K, Faria R, Le Moan A, et al. Diverse pathways to speciation revealed
by marine snails. Trends in Genetics. 2024;40(4):337-351. doi:10.1016/j.tig.2024.01.002
apa: Johannesson, K., Faria, R., Le Moan, A., Rafajlović, M., Westram, A. M., Butlin,
R. K., & Stankowski, S. (2024). Diverse pathways to speciation revealed by
marine snails. Trends in Genetics. Elsevier. https://doi.org/10.1016/j.tig.2024.01.002
chicago: Johannesson, Kerstin, Rui Faria, Alan Le Moan, Marina Rafajlović, Anja
M Westram, Roger K. Butlin, and Sean Stankowski. “Diverse Pathways to Speciation
Revealed by Marine Snails.” Trends in Genetics. Elsevier, 2024. https://doi.org/10.1016/j.tig.2024.01.002.
ieee: K. Johannesson et al., “Diverse pathways to speciation revealed by
marine snails,” Trends in Genetics, vol. 40, no. 4. Elsevier, pp. 337–351,
2024.
ista: Johannesson K, Faria R, Le Moan A, Rafajlović M, Westram AM, Butlin RK, Stankowski
S. 2024. Diverse pathways to speciation revealed by marine snails. Trends in Genetics.
40(4), 337–351.
mla: Johannesson, Kerstin, et al. “Diverse Pathways to Speciation Revealed by Marine
Snails.” Trends in Genetics, vol. 40, no. 4, Elsevier, 2024, pp. 337–51,
doi:10.1016/j.tig.2024.01.002.
short: K. Johannesson, R. Faria, A. Le Moan, M. Rafajlović, A.M. Westram, R.K. Butlin,
S. Stankowski, Trends in Genetics 40 (2024) 337–351.
das_tickbox: '0'
date_created: 2024-03-10T23:00:54Z
date_published: 2024-04-01T00:00:00Z
date_updated: 2026-10-21T08:13:54Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1016/j.tig.2024.01.002
external_id:
isi:
- '001224671300001'
pmid:
- '38395682'
file:
- access_level: open_access
checksum: 3077ea808c4cdc24d02dc58aced7eb35
content_type: application/pdf
creator: dernst
date_created: 2024-07-22T12:05:58Z
date_updated: 2024-07-22T12:05:58Z
file_id: '17313'
file_name: 2024_TrendsGenetics_Johannesson.pdf
file_size: 2288340
relation: main_file
success: 1
file_date_updated: 2024-07-22T12:05:58Z
fulldoi: https://doi.org/10.1016/j.tig.2024.01.002
has_accepted_license: '1'
intvolume: ' 40'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 337-351
pmid: 1
publication: Trends in Genetics
publication_identifier:
eissn:
- 1362-4555
issn:
- 0168-9525
publication_status: published
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Diverse pathways to speciation revealed by marine snails
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: 40
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18949'
abstract:
- lang: eng
text: 'Speciation research—the scientific field focused on understanding the origin
and diversity of species—has a long and complex history. While relevant to one
another, the specific goals and activities of speciation researchers are highly
diverse, and scattered across a collection of different perspectives. Thus, our
understanding of speciation will benefit from efforts to bridge scientific findings
and the diverse people who do the work. In this paper, we outline two ways of
integrating speciation research: (i) scientific integration, through the bringing
together of ideas, data, and approaches; and (ii) social integration, by creating
ways for a diversity of researchers to participate in the scientific process.
We then discuss five challenges to integration: (i) the multidisciplinary nature
of speciation research, (ii) the complex language of speciation; (iii) a bias
toward certain study systems; (iv) the challenges of working across scales; and
(v) inconsistent measures and reporting standards. We provide practical steps
that individuals and groups can take to help overcome these challenges, and argue
that integration is a team effort in which we all have a role to play.'
acknowledgement: "We thank the staff of the Tvärminne Zoological Station (University
of Helsinki) for their hospitality during the workshop. We are also grateful to
everyone who applied to attend the workshop.\r\nFunding for the workshop was provided
by the European Society for Evolutionary Biology through the Special Topic Network
(STN) funding scheme."
article_number: kzae001
article_processing_charge: Yes
article_type: original
author:
- first_name: Sean
full_name: Stankowski, Sean
id: 43161670-5719-11EA-8025-FABC3DDC885E
last_name: Stankowski
- first_name: Asher D
full_name: Cutter, Asher D
last_name: Cutter
- first_name: Ina
full_name: Satokangas, Ina
last_name: Satokangas
- first_name: Brian A
full_name: Lerch, Brian A
last_name: Lerch
- first_name: Jonathan
full_name: Rolland, Jonathan
last_name: Rolland
- first_name: Carole M
full_name: Smadja, Carole M
last_name: Smadja
- first_name: J Carolina
full_name: Segami Marzal, J Carolina
last_name: Segami Marzal
- first_name: Christopher R
full_name: Cooney, Christopher R
last_name: Cooney
- first_name: Philine G D
full_name: Feulner, Philine G D
last_name: Feulner
- first_name: Fabricius Maia Chaves Bicalho
full_name: Domingos, Fabricius Maia Chaves Bicalho
last_name: Domingos
- first_name: Henry L
full_name: North, Henry L
last_name: North
- first_name: Ryo
full_name: Yamaguchi, Ryo
last_name: Yamaguchi
- first_name: Roger K
full_name: Butlin, Roger K
last_name: Butlin
- first_name: Jochen B W
full_name: Wolf, Jochen B W
last_name: Wolf
- first_name: Jenn
full_name: Coughlan, Jenn
last_name: Coughlan
- first_name: Patrick
full_name: Heidbreder, Patrick
last_name: Heidbreder
- first_name: Rebeca
full_name: Hernández-Gutiérrez, Rebeca
last_name: Hernández-Gutiérrez
- first_name: Karen B
full_name: Barnard-Kubow, Karen B
last_name: Barnard-Kubow
- first_name: David
full_name: Peede, David
last_name: Peede
- first_name: Loïs
full_name: Rancilhac, Loïs
last_name: Rancilhac
- first_name: Rodrigo Brincalepe
full_name: Salvador, Rodrigo Brincalepe
last_name: Salvador
- first_name: Ken A
full_name: Thompson, Ken A
last_name: Thompson
- first_name: Elizabeth A
full_name: Stacy, Elizabeth A
last_name: Stacy
- first_name: Leonie C
full_name: Moyle, Leonie C
last_name: Moyle
- first_name: Martin D
full_name: Garlovsky, Martin D
last_name: Garlovsky
- first_name: Arif
full_name: Maulana, Arif
last_name: Maulana
- first_name: Annina
full_name: Kantelinen, Annina
last_name: Kantelinen
- first_name: N Ivalú
full_name: Cacho, N Ivalú
last_name: Cacho
- first_name: Hilde
full_name: Schneemann, Hilde
last_name: Schneemann
- first_name: Marisol
full_name: Domínguez, Marisol
last_name: Domínguez
- first_name: Erik B
full_name: Dopman, Erik B
last_name: Dopman
- first_name: Konrad
full_name: Lohse, Konrad
last_name: Lohse
- first_name: Sina J
full_name: Rometsch, Sina J
last_name: Rometsch
- first_name: Aaron A
full_name: Comeault, Aaron A
last_name: Comeault
- first_name: Richard M
full_name: Merrill, Richard M
last_name: Merrill
- first_name: Elizabeth S C
full_name: Scordato, Elizabeth S C
last_name: Scordato
- first_name: Sonal
full_name: Singhal, Sonal
last_name: Singhal
- first_name: Varpu
full_name: Pärssinen, Varpu
last_name: Pärssinen
- first_name: Alycia C R
full_name: Lackey, Alycia C R
last_name: Lackey
- first_name: Sanghamitra
full_name: Kumar, Sanghamitra
last_name: Kumar
- first_name: Joana I
full_name: Meier, Joana I
last_name: Meier
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Mark
full_name: Ravinet, Mark
last_name: Ravinet
- first_name: Jonna
full_name: Kulmuni, Jonna
last_name: Kulmuni
citation:
ama: Stankowski S, Cutter AD, Satokangas I, et al. Toward the integration of speciation
research. Evolutionary Journal of the Linnean Society. 2024;3(1). doi:10.1093/evolinnean/kzae001
apa: Stankowski, S., Cutter, A. D., Satokangas, I., Lerch, B. A., Rolland, J., Smadja,
C. M., … Kulmuni, J. (2024). Toward the integration of speciation research. Evolutionary
Journal of the Linnean Society. Oxford University Press. https://doi.org/10.1093/evolinnean/kzae001
chicago: Stankowski, Sean, Asher D Cutter, Ina Satokangas, Brian A Lerch, Jonathan
Rolland, Carole M Smadja, J Carolina Segami Marzal, et al. “Toward the Integration
of Speciation Research.” Evolutionary Journal of the Linnean Society. Oxford
University Press, 2024. https://doi.org/10.1093/evolinnean/kzae001.
ieee: S. Stankowski et al., “Toward the integration of speciation research,”
Evolutionary Journal of the Linnean Society, vol. 3, no. 1. Oxford University
Press, 2024.
ista: Stankowski S, Cutter AD, Satokangas I, Lerch BA, Rolland J, Smadja CM, Segami
Marzal JC, Cooney CR, Feulner PGD, Domingos FMCB, North HL, Yamaguchi R, Butlin
RK, Wolf JBW, Coughlan J, Heidbreder P, Hernández-Gutiérrez R, Barnard-Kubow KB,
Peede D, Rancilhac L, Salvador RB, Thompson KA, Stacy EA, Moyle LC, Garlovsky
MD, Maulana A, Kantelinen A, Cacho NI, Schneemann H, Domínguez M, Dopman EB, Lohse
K, Rometsch SJ, Comeault AA, Merrill RM, Scordato ESC, Singhal S, Pärssinen V,
Lackey ACR, Kumar S, Meier JI, Barton NH, Fraisse C, Ravinet M, Kulmuni J. 2024.
Toward the integration of speciation research. Evolutionary Journal of the Linnean
Society. 3(1), kzae001.
mla: Stankowski, Sean, et al. “Toward the Integration of Speciation Research.” Evolutionary
Journal of the Linnean Society, vol. 3, no. 1, kzae001, Oxford University
Press, 2024, doi:10.1093/evolinnean/kzae001.
short: S. Stankowski, A.D. Cutter, I. Satokangas, B.A. Lerch, J. Rolland, C.M. Smadja,
J.C. Segami Marzal, C.R. Cooney, P.G.D. Feulner, F.M.C.B. Domingos, H.L. North,
R. Yamaguchi, R.K. Butlin, J.B.W. Wolf, J. Coughlan, P. Heidbreder, R. Hernández-Gutiérrez,
K.B. Barnard-Kubow, D. Peede, L. Rancilhac, R.B. Salvador, K.A. Thompson, E.A.
Stacy, L.C. Moyle, M.D. Garlovsky, A. Maulana, A. Kantelinen, N.I. Cacho, H. Schneemann,
M. Domínguez, E.B. Dopman, K. Lohse, S.J. Rometsch, A.A. Comeault, R.M. Merrill,
E.S.C. Scordato, S. Singhal, V. Pärssinen, A.C.R. Lackey, S. Kumar, J.I. Meier,
N.H. Barton, C. Fraisse, M. Ravinet, J. Kulmuni, Evolutionary Journal of the Linnean
Society 3 (2024).
corr_author: '1'
das_tickbox: '0'
date_created: 2025-01-29T10:38:17Z
date_published: 2024-02-16T00:00:00Z
date_updated: 2026-10-21T08:21:06Z
day: '16'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/evolinnean/kzae001
file:
- access_level: open_access
checksum: db08120a92527acaef476bd93f2b87f9
content_type: application/pdf
creator: dernst
date_created: 2025-01-29T10:52:40Z
date_updated: 2025-01-29T10:52:40Z
file_id: '18950'
file_name: 2024_EvolJourLinneanSoc_Stankowski.pdf
file_size: 3935454
relation: main_file
success: 1
file_date_updated: 2025-01-29T10:52:40Z
fulldoi: https://doi.org/10.1093/evolinnean/kzae001
has_accepted_license: '1'
intvolume: ' 3'
issue: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
publication: Evolutionary Journal of the Linnean Society
publication_identifier:
issn:
- 2752-938X
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Toward the integration of speciation research
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: 3
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18908'
abstract:
- lang: eng
text: Chromosomal rearrangements can lead to the coupling of reproductive barriers,
but whether and how they contribute to the completion of speciation remains unclear.
Marine snails of the genus Littorina repeatedly form hybrid zones between populations
segregating for multiple inversion arrangements, providing opportunities to study
their barrier effects. Here, we analyzed 2 adjacent transects across hybrid zones
between 2 ecotypes of Littorina fabalis (“large” and “dwarf”) adapted to different
wave exposure conditions on a Swedish island. Applying whole-genome sequencing,
we found 12 putative inversions on 9 of 17 chromosomes. Nine of the putative inversions
reached near differential fixation between the 2 ecotypes, and all were in strong
linkage disequilibrium. These inversions cover 20% of the genome and carry 93%
of divergent single nucleotide polymorphisms (SNPs). Bimodal hybrid zones in both
transects indicated that the 2 ecotypes of Littorina fabalis maintain their genetic
and phenotypic integrity following contact. The bimodality reflects the strong
coupling between inversion clines and the extension of the barrier effect across
the whole genome. Demographic inference suggests that coupling arose during a
period of allopatry and has been maintained for > 1,000 generations after
secondary contact. Overall, this study shows that the coupling of multiple chromosomal
inversions contributes to strong reproductive isolation. Notably, 2 of the putative
inversions overlap with inverted genomic regions associated with ecotype differences
in a closely related species (Littorina saxatilis), suggesting the same regions,
with similar structural variants, repeatedly contribute to ecotype evolution in
distinct species.
acknowledgement: The computations and data handling were enabled by resources provided
by the Swedish National Infrastructure for Computing at UPPMAX partially funded
by the Swedish Research Council through grant agreement no. 2018-05973. We thank
all the member of the Littorina team for the stimulating discussions about the manuscripts,
James Reeves for his help the implementation of Hsplit, and Thomas Broquet for his
useful comments in the latter stage of manuscript revisions.
article_processing_charge: Yes
article_type: letter_note
author:
- first_name: Alan
full_name: Le Moan, Alan
last_name: Le Moan
- first_name: Sean
full_name: Stankowski, Sean
id: 43161670-5719-11EA-8025-FABC3DDC885E
last_name: Stankowski
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Olga
full_name: Ortega-Martinez, Olga
last_name: Ortega-Martinez
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Roger K
full_name: Butlin, Roger K
last_name: Butlin
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
citation:
ama: Le Moan A, Stankowski S, Rafajlović M, et al. Coupling of twelve putative chromosomal
inversions maintains a strong barrier to gene flow between snail ecotypes. Evolution
Letters. 2024;8(4):575-586. doi:10.1093/evlett/qrae014
apa: Le Moan, A., Stankowski, S., Rafajlović, M., Ortega-Martinez, O., Faria, R.,
Butlin, R. K., & Johannesson, K. (2024). Coupling of twelve putative chromosomal
inversions maintains a strong barrier to gene flow between snail ecotypes. Evolution
Letters. Oxford University Press. https://doi.org/10.1093/evlett/qrae014
chicago: Le Moan, Alan, Sean Stankowski, Marina Rafajlović, Olga Ortega-Martinez,
Rui Faria, Roger K Butlin, and Kerstin Johannesson. “Coupling of Twelve Putative
Chromosomal Inversions Maintains a Strong Barrier to Gene Flow between Snail Ecotypes.”
Evolution Letters. Oxford University Press, 2024. https://doi.org/10.1093/evlett/qrae014.
ieee: A. Le Moan et al., “Coupling of twelve putative chromosomal inversions
maintains a strong barrier to gene flow between snail ecotypes,” Evolution
Letters, vol. 8, no. 4. Oxford University Press, pp. 575–586, 2024.
ista: Le Moan A, Stankowski S, Rafajlović M, Ortega-Martinez O, Faria R, Butlin
RK, Johannesson K. 2024. Coupling of twelve putative chromosomal inversions maintains
a strong barrier to gene flow between snail ecotypes. Evolution Letters. 8(4),
575–586.
mla: Le Moan, Alan, et al. “Coupling of Twelve Putative Chromosomal Inversions Maintains
a Strong Barrier to Gene Flow between Snail Ecotypes.” Evolution Letters,
vol. 8, no. 4, Oxford University Press, 2024, pp. 575–86, doi:10.1093/evlett/qrae014.
short: A. Le Moan, S. Stankowski, M. Rafajlović, O. Ortega-Martinez, R. Faria, R.K.
Butlin, K. Johannesson, Evolution Letters 8 (2024) 575–586.
das_tickbox: '1'
dataavailabilitystatement: 'The raw fasta files are available on NCBI SRA under the
project name “Littorina fabalis transect WGS” with accession number PRJNA836378.
The filtered vcf file, metadata, as well as the R scripts used to analyse these
datasets, are available as a zenodo archive here: doi: 10.5281/zenodo.10790257.'
date_created: 2025-01-27T13:30:27Z
date_published: 2024-04-23T00:00:00Z
date_updated: 2026-10-21T08:20:21Z
day: '23'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/evlett/qrae014
external_id:
isi:
- '001206532900001'
pmid:
- '39479507'
file:
- access_level: open_access
checksum: 2f7780b7b6b3489755f1815f476639c6
content_type: application/pdf
creator: dernst
date_created: 2025-01-27T13:33:14Z
date_updated: 2025-01-27T13:33:14Z
file_id: '18909'
file_name: 2024_EvolutionLetter_Moan.pdf
file_size: 24356661
relation: main_file
success: 1
file_date_updated: 2025-01-27T13:33:14Z
fulldoi: https://doi.org/10.1093/evlett/qrae014
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 575-586
pmid: 1
publication: Evolution Letters
publication_identifier:
issn:
- 2056-3744
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
related_material:
record:
- id: '22870'
relation: research_data
status: public
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Coupling of twelve putative chromosomal inversions maintains a strong barrier
to gene flow between snail ecotypes
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: 8
year: '2024'
...