--- OA_place: publisher OA_type: diamond _id: '20034' abstract: - lang: eng text: We introduce LDAdam, a memory-efficient optimizer for training large models, that performs adaptive optimization steps within lower dimensional subspaces, while consistently exploring the full parameter space during training. This strategy keeps the optimizer's memory footprint to a fraction of the model size. LDAdam relies on a new projection-aware update rule for the optimizer states that allows for transitioning between subspaces, i.e., estimation of the statistics of the projected gradients. To mitigate the errors due to low-rank projection, LDAdam integrates a new generalized error feedback mechanism, which explicitly accounts for both gradient and optimizer state compression. We prove the convergence of LDAdam under standard assumptions, and provide empirical evidence that LDAdam allows for efficient fine-tuning and pre-training of language models. article_processing_charge: No arxiv: 1 author: - first_name: Thomas full_name: Robert, Thomas last_name: Robert - first_name: Mher full_name: Safaryan, Mher id: dd546b39-0804-11ed-9c55-ef075c39778d last_name: Safaryan - first_name: Ionut-Vlad full_name: Modoranu, Ionut-Vlad id: 449f7a18-f128-11eb-9611-9b430c0c6333 last_name: Modoranu - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Robert T, Safaryan M, Modoranu I-V, Alistarh D-A. LDAdam: Adaptive optimization from low-dimensional gradient statistics. In: 13th International Conference on Learning Representations. ICLR; 2025:101877-101913.' apa: 'Robert, T., Safaryan, M., Modoranu, I.-V., & Alistarh, D.-A. (2025). LDAdam: Adaptive optimization from low-dimensional gradient statistics. In 13th International Conference on Learning Representations (pp. 101877–101913). Singapore, Singapore: ICLR.' chicago: 'Robert, Thomas, Mher Safaryan, Ionut-Vlad Modoranu, and Dan-Adrian Alistarh. “LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statistics.” In 13th International Conference on Learning Representations, 101877–913. ICLR, 2025.' ieee: 'T. Robert, M. Safaryan, I.-V. Modoranu, and D.-A. Alistarh, “LDAdam: Adaptive optimization from low-dimensional gradient statistics,” in 13th International Conference on Learning Representations, Singapore, Singapore, 2025, pp. 101877–101913.' ista: 'Robert T, Safaryan M, Modoranu I-V, Alistarh D-A. 2025. LDAdam: Adaptive optimization from low-dimensional gradient statistics. 13th International Conference on Learning Representations. ICLR: International Conference on Learning Representations, 101877–101913.' mla: 'Robert, Thomas, et al. “LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statistics.” 13th International Conference on Learning Representations, ICLR, 2025, pp. 101877–913.' short: T. Robert, M. Safaryan, I.-V. Modoranu, D.-A. Alistarh, in:, 13th International Conference on Learning Representations, ICLR, 2025, pp. 101877–101913. conference: end_date: 2025-04-28 location: Singapore, Singapore name: 'ICLR: International Conference on Learning Representations' start_date: 2025-04-24 corr_author: '1' date_created: 2025-07-20T22:02:02Z date_published: 2025-04-01T00:00:00Z date_updated: 2025-08-04T08:41:10Z day: '01' ddc: - '000' department: - _id: DaAl external_id: arxiv: - '2410.16103' file: - access_level: open_access checksum: 9327d82569358d7bf1c3ec1a9952e721 content_type: application/pdf creator: dernst date_created: 2025-08-04T08:39:51Z date_updated: 2025-08-04T08:39:51Z file_id: '20113' file_name: 2025_ICLR_Robert.pdf file_size: 1346111 relation: main_file success: 1 file_date_updated: 2025-08-04T08:39:51Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 101877-101913 publication: 13th International Conference on Learning Representations publication_identifier: isbn: - '9798331320850' publication_status: published publisher: ICLR quality_controlled: '1' related_material: link: - relation: software url: https://github.com/IST-DASLab/LDAdam scopus_import: '1' status: public title: 'LDAdam: Adaptive optimization from low-dimensional gradient statistics' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher OA_type: diamond _id: '20035' abstract: - lang: eng text: "Deep neural networks (DNNs) at convergence consistently represent the training data in the last layer via a geometric structure referred to as neural collapse. This empirical evidence has spurred a line of theoretical research aimed at proving the emergence of neural collapse, mostly focusing on the unconstrained features model. Here, the features of the penultimate layer are free variables, which makes the model data-agnostic and puts into question its ability to capture DNN training. Our work addresses the issue, moving away from unconstrained features and\r\nstudying DNNs that end with at least two linear layers. We first prove generic guarantees on neural collapse that assume (i) low training error and balancedness of linear layers (for within-class variability collapse), and (ii) bounded conditioning of the features before the linear part (for orthogonality of class-means, and their alignment with weight matrices). The balancedness refers to the fact that W⊤ℓ+1Wℓ+1 ≈ WℓW⊤ℓfor any pair of consecutive weight matrices of the linear part, and the bounded conditioning requires a well-behaved ratio between largest and smallest non-zero singular values of the features. We then show that such assumptions hold for gradient descent training with weight decay: (i) for networks with a wide first layer, we prove low training error and balancedness, and (ii) for solutions that are either nearly optimal or stable under large learning rates, we additionally prove the bounded conditioning. Taken together, our results are the first to show neural collapse in the end-to-end training of DNNs." acknowledgement: M. M. and P. S. are funded by the European Union (ERC, INF2, project number 101161364). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. article_processing_charge: No arxiv: 1 author: - first_name: Arthur full_name: Jacot, Arthur last_name: Jacot - first_name: Peter full_name: Súkeník, Peter id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c last_name: Súkeník - first_name: Zihan full_name: Wang, Zihan last_name: Wang - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: 'Jacot A, Súkeník P, Wang Z, Mondelli M. Wide neural networks trained with weight decay provably exhibit neural collapse. In: 13th International Conference on Learning Representations. ICLR; 2025:1905-1931.' apa: 'Jacot, A., Súkeník, P., Wang, Z., & Mondelli, M. (2025). Wide neural networks trained with weight decay provably exhibit neural collapse. In 13th International Conference on Learning Representations (pp. 1905–1931). Singapore, Singapore: ICLR.' chicago: Jacot, Arthur, Peter Súkeník, Zihan Wang, and Marco Mondelli. “Wide Neural Networks Trained with Weight Decay Provably Exhibit Neural Collapse.” In 13th International Conference on Learning Representations, 1905–31. ICLR, 2025. ieee: A. Jacot, P. Súkeník, Z. Wang, and M. Mondelli, “Wide neural networks trained with weight decay provably exhibit neural collapse,” in 13th International Conference on Learning Representations, Singapore, Singapore, 2025, pp. 1905–1931. ista: 'Jacot A, Súkeník P, Wang Z, Mondelli M. 2025. Wide neural networks trained with weight decay provably exhibit neural collapse. 13th International Conference on Learning Representations. ICLR: International Conference on Learning Representations, 1905–1931.' mla: Jacot, Arthur, et al. “Wide Neural Networks Trained with Weight Decay Provably Exhibit Neural Collapse.” 13th International Conference on Learning Representations, ICLR, 2025, pp. 1905–31. short: A. Jacot, P. Súkeník, Z. Wang, M. Mondelli, in:, 13th International Conference on Learning Representations, ICLR, 2025, pp. 1905–1931. conference: end_date: 2025-04-28 location: Singapore, Singapore name: 'ICLR: International Conference on Learning Representations' start_date: 2025-04-24 corr_author: '1' date_created: 2025-07-20T22:02:02Z date_published: 2025-04-01T00:00:00Z date_updated: 2025-08-04T08:47:00Z day: '01' ddc: - '000' department: - _id: MaMo external_id: arxiv: - '2410.04887' file: - access_level: open_access checksum: 59c48c173887139647cc9839c0801136 content_type: application/pdf creator: dernst date_created: 2025-08-04T08:45:43Z date_updated: 2025-08-04T08:45:43Z file_id: '20114' file_name: 2025_ICLR_Jacot.pdf file_size: 1337236 relation: main_file success: 1 file_date_updated: 2025-08-04T08:45:43Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 1905-1931 project: - _id: 911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf grant_number: '101161364' name: 'Inference in High Dimensions: Light-speed Algorithms and Information Limits' publication: 13th International Conference on Learning Representations publication_identifier: isbn: - '9798331320850' publication_status: published publisher: ICLR quality_controlled: '1' scopus_import: '1' status: public title: Wide neural networks trained with weight decay provably exhibit neural collapse tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher OA_type: diamond _id: '20036' abstract: - lang: eng text: 'We introduce NeCo: Patch Neighbor Consistency, a novel self-supervised training loss that enforces patch-level nearest neighbor consistency across a student and teacher model. Compared to contrastive approaches that only yield binary learning signals, i.e. "attract" and "repel", this approach benefits from the more fine-grained learning signal of sorting spatially dense features relative to reference patches. Our method leverages differentiable sorting applied on top of pretrained representations, such as DINOv2-registers to bootstrap the learning signal and further improve upon them. This dense post-pretraining leads to superior performance across various models and datasets, despite requiring only 19 hours on a single GPU. This method generates high-quality dense feature encoders and establishes several new state-of-the-art results such as +2.3 % and +4.2% for non-parametric in-context semantic segmentation on ADE20k and Pascal VOC, +1.6% and +4.8% for linear segmentation evaluations on COCO-Things and -Stuff and improvements in the 3D understanding of multi-view consistency on SPair-71k, by more than 1.5%.' article_processing_charge: No arxiv: 1 author: - first_name: Valentinos full_name: Pariza, Valentinos last_name: Pariza - first_name: Mohammadreza full_name: Salehi, Mohammadreza last_name: Salehi - first_name: Gertjan full_name: Burghouts, Gertjan last_name: Burghouts - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Yuki M. full_name: Asano, Yuki M. last_name: Asano citation: ama: 'Pariza V, Salehi M, Burghouts G, Locatello F, Asano YM. Near, far: Patch-ordering enhances vision foundation models’ scene understanding. In: 13th International Conference on Learning Representations. ICLR; 2025:72303-72330.' apa: 'Pariza, V., Salehi, M., Burghouts, G., Locatello, F., & Asano, Y. M. (2025). Near, far: Patch-ordering enhances vision foundation models’ scene understanding. In 13th International Conference on Learning Representations (pp. 72303–72330). Singapore, Singapore: ICLR.' chicago: 'Pariza, Valentinos, Mohammadreza Salehi, Gertjan Burghouts, Francesco Locatello, and Yuki M. Asano. “Near, Far: Patch-Ordering Enhances Vision Foundation Models’ Scene Understanding.” In 13th International Conference on Learning Representations, 72303–30. ICLR, 2025.' ieee: 'V. Pariza, M. Salehi, G. Burghouts, F. Locatello, and Y. M. Asano, “Near, far: Patch-ordering enhances vision foundation models’ scene understanding,” in 13th International Conference on Learning Representations, Singapore, Singapore, 2025, pp. 72303–72330.' ista: 'Pariza V, Salehi M, Burghouts G, Locatello F, Asano YM. 2025. Near, far: Patch-ordering enhances vision foundation models’ scene understanding. 13th International Conference on Learning Representations. ICLR: International Conference on Learning Representations, 72303–72330.' mla: 'Pariza, Valentinos, et al. “Near, Far: Patch-Ordering Enhances Vision Foundation Models’ Scene Understanding.” 13th International Conference on Learning Representations, ICLR, 2025, pp. 72303–30.' short: V. Pariza, M. Salehi, G. Burghouts, F. Locatello, Y.M. Asano, in:, 13th International Conference on Learning Representations, ICLR, 2025, pp. 72303–72330. conference: end_date: 2025-04-28 location: Singapore, Singapore name: 'ICLR: International Conference on Learning Representations' start_date: 2025-04-24 date_created: 2025-07-20T22:02:03Z date_published: 2025-04-01T00:00:00Z date_updated: 2025-08-04T08:10:55Z day: '01' ddc: - '000' department: - _id: FrLo external_id: arxiv: - '2408.11054' file: - access_level: open_access checksum: ddbe981f3ad3f6cb6daf12c954822eb8 content_type: application/pdf creator: dernst date_created: 2025-08-04T08:09:43Z date_updated: 2025-08-04T08:09:43Z file_id: '20109' file_name: 2025_ICLR_Pariza.pdf file_size: 37788223 relation: main_file success: 1 file_date_updated: 2025-08-04T08:09:43Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 72303-72330 publication: 13th International Conference on Learning Representations publication_identifier: isbn: - '9798331320850' publication_status: published publisher: ICLR quality_controlled: '1' scopus_import: '1' status: public title: 'Near, far: Patch-ordering enhances vision foundation models'' scene understanding' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher OA_type: diamond _id: '20037' abstract: - lang: eng text: 'Disentangling polysemantic neurons is at the core of many current approaches to interpretability of large language models. Here we attempt to study how disentanglement can be used to understand performance, particularly under weight sparsity, a leading post-training optimization technique. We suggest a novel measure for estimating neuronal entanglement: the Wasserstein distance of a neuron''s output distribution to a Gaussian. Moreover, we show the existence of a small number of highly entangled "Wasserstein Neurons" in each linear layer of an LLM, characterized by their highly non-Gaussian output distributions, their role in mapping similar inputs to dissimilar outputs, and their significant impact on model accuracy. To study these phenomena, we propose a new experimental framework for disentangling polysemantic neurons. Our framework separates each layer''s inputs to create a mixture of experts where each neuron''s output is computed by a mixture of neurons of lower Wasserstein distance, each better at maintaining accuracy when sparsified without retraining. We provide strong evidence that this is because the mixture of sparse experts is effectively disentangling the input-output relationship of individual neurons, in particular the difficult Wasserstein neurons.' acknowledgement: "The authors would like to extend their gratitude to Lori Leu for her insightful comments on the\r\napplication of the Wasserstein distance metric. We also wish to thank Elias Frantar for his help in\r\nworking with the SparseGPT implementation and his advice for the project. Additionally, we would like to thank Tony Tong Wang and Thomas Athey for their valuable feedback and constructive discussions.\r\nThis work was supported by an NIH Brains CONNECTS U01 grant and AMD’s AI & HPC Fund." article_processing_charge: No arxiv: 1 author: - first_name: Shashata full_name: Sawmya, Shashata last_name: Sawmya - first_name: Linghao full_name: Kong, Linghao last_name: Kong - first_name: Ilia full_name: Markov, Ilia id: D0CF4148-C985-11E9-8066-0BDEE5697425 last_name: Markov - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Nir full_name: Shavit, Nir last_name: Shavit citation: ama: 'Sawmya S, Kong L, Markov I, Alistarh D-A, Shavit N. Wasserstein distances, neuronal entanglement, and sparsity. In: 13th International Conference on Learning Representations. ICLR; 2025:26244-26274.' apa: 'Sawmya, S., Kong, L., Markov, I., Alistarh, D.-A., & Shavit, N. (2025). Wasserstein distances, neuronal entanglement, and sparsity. In 13th International Conference on Learning Representations (pp. 26244–26274). Singapore, Singapore: ICLR.' chicago: Sawmya, Shashata, Linghao Kong, Ilia Markov, Dan-Adrian Alistarh, and Nir Shavit. “Wasserstein Distances, Neuronal Entanglement, and Sparsity.” In 13th International Conference on Learning Representations, 26244–74. ICLR, 2025. ieee: S. Sawmya, L. Kong, I. Markov, D.-A. Alistarh, and N. Shavit, “Wasserstein distances, neuronal entanglement, and sparsity,” in 13th International Conference on Learning Representations, Singapore, Singapore, 2025, pp. 26244–26274. ista: 'Sawmya S, Kong L, Markov I, Alistarh D-A, Shavit N. 2025. Wasserstein distances, neuronal entanglement, and sparsity. 13th International Conference on Learning Representations. ICLR: International Conference on Learning Representations, 26244–26274.' mla: Sawmya, Shashata, et al. “Wasserstein Distances, Neuronal Entanglement, and Sparsity.” 13th International Conference on Learning Representations, ICLR, 2025, pp. 26244–74. short: S. Sawmya, L. Kong, I. Markov, D.-A. Alistarh, N. Shavit, in:, 13th International Conference on Learning Representations, ICLR, 2025, pp. 26244–26274. conference: end_date: 2025-04-28 location: Singapore, Singapore name: 'ICLR: International Conference on Learning Representations' start_date: 2025-04-24 corr_author: '1' date_created: 2025-07-20T22:02:03Z date_published: 2025-04-01T00:00:00Z date_updated: 2025-08-04T08:16:43Z day: '01' ddc: - '000' department: - _id: DaAl external_id: arxiv: - '2405.15756' file: - access_level: open_access checksum: 39a8fa7dbdd7029859e156f53f20f6bc content_type: application/pdf creator: dernst date_created: 2025-08-04T08:14:09Z date_updated: 2025-08-04T08:14:09Z file_id: '20110' file_name: 2025_ICLR_Sawmya.pdf file_size: 5447177 relation: main_file success: 1 file_date_updated: 2025-08-04T08:14:09Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 26244-26274 publication: 13th International Conference on Learning Representations publication_identifier: isbn: - '9798331320850' publication_status: published publisher: ICLR quality_controlled: '1' related_material: link: - relation: software url: https://github.com/Shavit-Lab/Sparse-Expansion scopus_import: '1' status: public title: Wasserstein distances, neuronal entanglement, and sparsity tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher OA_type: diamond _id: '20038' abstract: - lang: eng text: Pruning eliminates unnecessary parameters in neural networks; it offers a promising solution to the growing computational demands of large language models (LLMs). While many focus on post-training pruning, sparse pre-training--which combines pruning and pre-training into a single phase--provides a simpler alternative. In this work, we present the first systematic exploration of optimal sparse pre-training configurations for LLMs through an examination of 80 unique pruning schedules across different sparsity levels and training durations. We find that initiating pruning at 25% of total training compute and concluding at 75% achieves near-optimal final evaluation loss. These findings provide valuable insights for efficient and effective sparse pre-training of LLMs. Furthermore, we propose a new scaling law that modifies the Chinchilla scaling law to use the average parameter count over pre-training. Through empirical and theoretical validation, we demonstrate that this modified scaling law accurately models evaluation loss for both sparsely and densely pre-trained LLMs, unifying scaling laws across pre-training paradigms. Our findings indicate that while sparse pre-training achieves the same final model quality as dense pre-training for equivalent compute budgets, it provides substantial benefits through reduced model size, enabling significant potential computational savings during inference. acknowledgement: "We are deeply grateful to Elias Frantar, Naveen Kumar, Sanjiv Kumar, Daniel\r\nM. Roy, and Clemens Schaefer for their valuable feedback and thoughtful review of this paper.\r\nWe also acknowledge the critical support provided by the Google CoreML Performance Team, and Google Research during this project. We further recognize the extended team at Google DeepMind, who enabled and supported this research direction.\r\nThis work was in part supported by the Sloan Foundation, the MIT-IBM Watson AI Lab, Apple, and SRC JUMP 2.0 (CoCoSys)." article_processing_charge: No arxiv: 1 author: - first_name: Tian full_name: Jin, Tian last_name: Jin - first_name: Ahmed Imtiaz full_name: Humayun, Ahmed Imtiaz last_name: Humayun - first_name: Utku full_name: Evci, Utku last_name: Evci - first_name: Suvinay full_name: Subramanian, Suvinay last_name: Subramanian - first_name: Amir full_name: Yazdanbakhsh, Amir last_name: Yazdanbakhsh - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Gintare Karolina full_name: Dziugaite, Gintare Karolina last_name: Dziugaite citation: ama: 'Jin T, Humayun AI, Evci U, et al. The journey matters: Average parameter count over pre-training unifies sparse and dense scaling laws. In: 13th International Conference on Learning Representations. ICLR; 2025:85165-85181.' apa: 'Jin, T., Humayun, A. I., Evci, U., Subramanian, S., Yazdanbakhsh, A., Alistarh, D.-A., & Dziugaite, G. K. (2025). The journey matters: Average parameter count over pre-training unifies sparse and dense scaling laws. In 13th International Conference on Learning Representations (pp. 85165–85181). Singapore, Singapore: ICLR.' chicago: 'Jin, Tian, Ahmed Imtiaz Humayun, Utku Evci, Suvinay Subramanian, Amir Yazdanbakhsh, Dan-Adrian Alistarh, and Gintare Karolina Dziugaite. “The Journey Matters: Average Parameter Count over Pre-Training Unifies Sparse and Dense Scaling Laws.” In 13th International Conference on Learning Representations, 85165–81. ICLR, 2025.' ieee: 'T. Jin et al., “The journey matters: Average parameter count over pre-training unifies sparse and dense scaling laws,” in 13th International Conference on Learning Representations, Singapore, Singapore, 2025, pp. 85165–85181.' ista: 'Jin T, Humayun AI, Evci U, Subramanian S, Yazdanbakhsh A, Alistarh D-A, Dziugaite GK. 2025. The journey matters: Average parameter count over pre-training unifies sparse and dense scaling laws. 13th International Conference on Learning Representations. ICLR: International Conference on Learning Representations, 85165–85181.' mla: 'Jin, Tian, et al. “The Journey Matters: Average Parameter Count over Pre-Training Unifies Sparse and Dense Scaling Laws.” 13th International Conference on Learning Representations, ICLR, 2025, pp. 85165–81.' short: T. Jin, A.I. Humayun, U. Evci, S. Subramanian, A. Yazdanbakhsh, D.-A. Alistarh, G.K. Dziugaite, in:, 13th International Conference on Learning Representations, ICLR, 2025, pp. 85165–85181. conference: end_date: 2025-04-28 location: Singapore, Singapore name: 'ICLR: International Conference on Learning Representations' start_date: 2025-04-24 date_created: 2025-07-20T22:02:03Z date_published: 2025-04-01T00:00:00Z date_updated: 2025-08-04T08:24:59Z day: '01' ddc: - '000' department: - _id: DaAl external_id: arxiv: - '2501.12486 ' file: - access_level: open_access checksum: dbc27120e9aba67dffbd9e5d513a6803 content_type: application/pdf creator: dernst date_created: 2025-08-04T08:23:47Z date_updated: 2025-08-04T08:23:47Z file_id: '20111' file_name: 2025_ICLR_Jin.pdf file_size: 704989 relation: main_file success: 1 file_date_updated: 2025-08-04T08:23:47Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 85165-85181 publication: 13th International Conference on Learning Representations publication_identifier: isbn: - '9798331320850' publication_status: published publisher: ICLR quality_controlled: '1' scopus_import: '1' status: public title: 'The journey matters: Average parameter count over pre-training unifies sparse and dense scaling laws' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: repository OA_type: green _id: '20040' abstract: - lang: eng text: 'Contractive coupling rates have been recently introduced by Conforti as a tool to establish convex Sobolev inequalities (including modified log-Sobolev and Poincaré inequality) for some classes of Markov chains. In this work, for most of the examples discussed by Conforti, we use contractive coupling rates to prove stronger inequalities, in the form of curvature lower bounds (in entropic and discrete Bakry–Émery sense) and geodesic convexity of some entropic functionals. In addition, we recall and give straightforward generalizations of some notions of coarse Ricci curvature, and we discuss some of their properties and relations with the concepts of couplings and coupling rates: as an application, we show exponential contraction of the p-Wasserstein distance for the heat flow in the aforementioned examples.' acknowledgement: "The author warmly thanks Jan Maas for suggesting the project and for his guidance, and Melchior Wirth and Haonan Zhang for useful discussions. The author is also grateful to an anonymous reviewer for carefully reading the manuscript and providing many valuable suggestions. The author gratefully acknowledges support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme\r\n(grant agreement No. 716117) and by the Austrian Science Fund (FWF), Project SFB F65." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti citation: ama: Pedrotti F. Contractive coupling rates and curvature lower bounds for Markov chains. The Annals of Applied Probability. 2025;35(1):196-250. doi:10.1214/24-aap2113 apa: Pedrotti, F. (2025). Contractive coupling rates and curvature lower bounds for Markov chains. The Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/24-aap2113 chicago: Pedrotti, Francesco. “Contractive Coupling Rates and Curvature Lower Bounds for Markov Chains.” The Annals of Applied Probability. Institute of Mathematical Statistics, 2025. https://doi.org/10.1214/24-aap2113. ieee: F. Pedrotti, “Contractive coupling rates and curvature lower bounds for Markov chains,” The Annals of Applied Probability, vol. 35, no. 1. Institute of Mathematical Statistics, pp. 196–250, 2025. ista: Pedrotti F. 2025. Contractive coupling rates and curvature lower bounds for Markov chains. The Annals of Applied Probability. 35(1), 196–250. mla: Pedrotti, Francesco. “Contractive Coupling Rates and Curvature Lower Bounds for Markov Chains.” The Annals of Applied Probability, vol. 35, no. 1, Institute of Mathematical Statistics, 2025, pp. 196–250, doi:10.1214/24-aap2113. short: F. Pedrotti, The Annals of Applied Probability 35 (2025) 196–250. corr_author: '1' date_created: 2025-07-21T07:49:15Z date_published: 2025-02-01T00:00:00Z date_updated: 2025-11-05T13:50:07Z day: '01' department: - _id: JaMa doi: 10.1214/24-aap2113 ec_funded: 1 external_id: arxiv: - '2308.00516' isi: - '001434322900006' intvolume: ' 35' isi: 1 issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2308.00516 month: '02' oa: 1 oa_version: Preprint page: 196 - 250 project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems publication: The Annals of Applied Probability publication_identifier: issn: - 1050-5164 publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' related_material: record: - id: '17351' relation: earlier_version status: public scopus_import: '1' status: public title: Contractive coupling rates and curvature lower bounds for Markov chains type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 35 year: '2025' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '20043' abstract: - lang: eng text: We establish an isomorphism of complex K-theory of the moduli space M of “SL n​ ”-Higgs bundles of degree d and rank n (in the sense of Hausel–Thaddeus) and twisted complex K-theory of the orbifold M of PGL n​ -Higgs bundles of degree e, where (n,d)=(n,e)=1. Along the way, we prove the vanishing of torsion for H ∗ ( M ) and certain twisted complex K-theory groups of M . We also extend Arinkin’s autoduality of compactified Jacobian to a derived equivalence between SL n​ - and PGL n​ -Hitchin systems over the elliptic locus. In the appendix, we develop a formalism of G-sheaves of spectra, generalising equivariant homotopy theory to a relative setting. acknowledgement: "It is a pleasure to thank Tom Baird for sharing his insights about vanishing of torsion for H.M{1\r\n2/. Furthermore, we would like to thank him for bringing [25] to our attention. We also thank Alexander Kupers for enlightening conversations about the Atiyah–Hirzebruch spectral sequence and for pointing out a reference. We are grateful to Victoria Hoskins and Simon Pepin-Lehalleur for sharing a preprint of their recent paper on a motivic version of topological mirror symmetry and for useful remarks on Section 6. Anne Larsen pointed out that our previous proof Lemma 4.5 was incomplete, we thank her for bringing this to our attention. We are grateful to the anonymous referee for many valuable comments that have improved the paper tremendously. The report we received was one of the most detailed referee report either of us has ever seen. We thank them for their hard work and the resulting contribution to this paper. Michael Groechenig was supported by an NSERC discovery grant and an Alfred P. Sloan\r\nfellowship. Shiyu Shen has received funding from the European Union’s Horizon 2020 research\r\nand innovation program under the Marie Skłodowska-Curie grant agreement No. 101034413." article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Michael full_name: Groechenig, Michael last_name: Groechenig - first_name: Shiyu full_name: Shen, Shiyu id: 544cccd3-9005-11ec-87bc-94aef1c5b814 last_name: Shen orcid: 0000-0002-4444-8718 citation: ama: Groechenig M, Shen S. Complex K-theory of moduli spaces of Higgs bundles. Journal of the European Mathematical Society. 2025. doi:10.4171/jems/1601 apa: Groechenig, M., & Shen, S. (2025). Complex K-theory of moduli spaces of Higgs bundles. Journal of the European Mathematical Society. EMS Press. https://doi.org/10.4171/jems/1601 chicago: Groechenig, Michael, and Shiyu Shen. “Complex K-Theory of Moduli Spaces of Higgs Bundles.” Journal of the European Mathematical Society. EMS Press, 2025. https://doi.org/10.4171/jems/1601. ieee: M. Groechenig and S. Shen, “Complex K-theory of moduli spaces of Higgs bundles,” Journal of the European Mathematical Society. EMS Press, 2025. ista: Groechenig M, Shen S. 2025. Complex K-theory of moduli spaces of Higgs bundles. Journal of the European Mathematical Society. mla: Groechenig, Michael, and Shiyu Shen. “Complex K-Theory of Moduli Spaces of Higgs Bundles.” Journal of the European Mathematical Society, EMS Press, 2025, doi:10.4171/jems/1601. short: M. Groechenig, S. Shen, Journal of the European Mathematical Society (2025). corr_author: '1' date_created: 2025-07-21T07:54:50Z date_published: 2025-03-20T00:00:00Z date_updated: 2026-02-19T09:24:54Z day: '20' department: - _id: TaHa doi: 10.4171/jems/1601 ec_funded: 1 external_id: arxiv: - '2212.10695' isi: - '001608254800001' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4171/JEMS/1601 month: '03' oa: 1 oa_version: Published Version project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Journal of the European Mathematical Society publication_identifier: eissn: - 1435-9863 issn: - 1435-9855 publication_status: epub_ahead publisher: EMS Press quality_controlled: '1' status: public title: Complex K-theory of moduli spaces of Higgs bundles type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '20044' abstract: - lang: eng text: Genetic trade-offs—which occur when variants that are beneficial in some contexts of natural selection are harmful in others—can influence a wide range of evolutionary phenomena, from the maintenance of genetic variation to the evolution of aging and sex differences. An extensive body of evolutionary theory has focused on the consequences of such trade-offs, and recent analyses of Fisher’s geometric model have further quantified the expected proportion of new mutations that exhibit trade-offs. However, the theory remains silent regarding the prevalence of trade-offs among the variants that contribute to adaptation. Here, we extend Fisher’s geometric model to predict the prevalence of trade-offs among the adaptive mutations that become established or fixed in a population. We consider trade-offs between sexes, habitats, fitness components, and temporally fluctuating environments. In all 4 scenarios, trade-off alleles are consistently under-represented among established relative to new beneficial mutations—an effect that arises from the greater susceptibility of trade-off alleles to genetic drift. Adaptation during a population size decline exacerbates this deficit of trade-offs among established mutations, whereas population expansions dampen it. Consequently, threatened populations should primarily adapt using unconditionally beneficial alleles, while invasive populations are more prone to adaptation using variants that exhibit trade-offs. acknowledgement: 'Support for this research came from the European Society of Evolutionary Biology (ESEB) through a “Special Topics Network” grant. Further financial support came from the European Research Council (ERC-2023-STG916 #101117517, to C.O.), the Swedish Research Council (#2022-03603, to C.O.; #2020‑03123, to E.I.S.), the Research Council of Norway (Norges forskningsråd #302619, to D.G.), the Alexander von Humboldt Foundation and the GenEvo graduate school (to H.K.), the Foundation for Zoological Research and the Birgitta Sintring Foundation (#S2024-0007, to M.K.Z.), a postdoctoral fellowship from the Consejo Nacional de Humanidades, Ciencias y Tecnología (to A.N.B.), and a H2020 Marie Skłodowska-Curie COFUND Action fellowship (#101034413, to F.R.). We wish to express our deepest gratitude to Lotte de Vries for extensive discussion of the project, rederiving some of our results, and providing comments on an earlier version of the manuscript, and to the European Society of Evolutionary Biology (ESEB) for a “Special Topics Network” grant that supported workshops that initiated this collaboration and facilitated many new ideas and friendships. We also thank two anonymous reviewers for their thoughtful comments and suggestions that helped us to substantially improve upon the original version of the article.' article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Tim full_name: Connallon, Tim last_name: Connallon - first_name: Peter full_name: Czuppon, Peter last_name: Czuppon - first_name: Colin full_name: Olito, Colin last_name: Olito - first_name: Debora full_name: Goedert, Debora last_name: Goedert - first_name: Hanna full_name: Kokko, Hanna last_name: Kokko - first_name: Angela full_name: Nava-Bolaños, Angela last_name: Nava-Bolaños - first_name: Sofie full_name: Nilén, Sofie last_name: Nilén - first_name: Erik I full_name: Svensson, Erik I last_name: Svensson - first_name: Martyna full_name: Zwoinska, Martyna last_name: Zwoinska - first_name: Ludovic full_name: Dutoit, Ludovic last_name: Dutoit - first_name: Filip full_name: Ruzicka, Filip id: 347955dd-57b0-11ee-9095-c28bdd368f4b last_name: Ruzicka citation: ama: Connallon T, Czuppon P, Olito C, et al. Predicting the prevalence of genetic trade-offs among adaptive substitutions. Evolution. 2025;79(7):1243-1255. doi:10.1093/evolut/qpaf061 apa: Connallon, T., Czuppon, P., Olito, C., Goedert, D., Kokko, H., Nava-Bolaños, A., … Ruzicka, F. (2025). Predicting the prevalence of genetic trade-offs among adaptive substitutions. Evolution. Oxford University Press. https://doi.org/10.1093/evolut/qpaf061 chicago: Connallon, Tim, Peter Czuppon, Colin Olito, Debora Goedert, Hanna Kokko, Angela Nava-Bolaños, Sofie Nilén, et al. “Predicting the Prevalence of Genetic Trade-Offs among Adaptive Substitutions.” Evolution. Oxford University Press, 2025. https://doi.org/10.1093/evolut/qpaf061. ieee: T. Connallon et al., “Predicting the prevalence of genetic trade-offs among adaptive substitutions,” Evolution, vol. 79, no. 7. Oxford University Press, pp. 1243–1255, 2025. ista: Connallon T, Czuppon P, Olito C, Goedert D, Kokko H, Nava-Bolaños A, Nilén S, Svensson EI, Zwoinska M, Dutoit L, Ruzicka F. 2025. Predicting the prevalence of genetic trade-offs among adaptive substitutions. Evolution. 79(7), 1243–1255. mla: Connallon, Tim, et al. “Predicting the Prevalence of Genetic Trade-Offs among Adaptive Substitutions.” Evolution, vol. 79, no. 7, Oxford University Press, 2025, pp. 1243–55, doi:10.1093/evolut/qpaf061. short: T. Connallon, P. Czuppon, C. Olito, D. Goedert, H. Kokko, A. Nava-Bolaños, S. Nilén, E.I. Svensson, M. Zwoinska, L. Dutoit, F. Ruzicka, Evolution 79 (2025) 1243–1255. date_created: 2025-07-21T07:57:28Z date_published: 2025-07-01T00:00:00Z date_updated: 2025-09-30T14:06:38Z day: '01' ddc: - '570' department: - _id: BeVi doi: 10.1093/evolut/qpaf061 ec_funded: 1 external_id: isi: - '001477180800001' file: - access_level: open_access checksum: 68c4c996d0e8c9ee3d4fb61bca75b31a content_type: application/pdf creator: dernst date_created: 2025-07-22T10:04:57Z date_updated: 2025-07-22T10:04:57Z file_id: '20068' file_name: 2025_Evolution_Connallon.pdf file_size: 8150623 relation: main_file success: 1 file_date_updated: 2025-07-22T10:04:57Z has_accepted_license: '1' intvolume: ' 79' isi: 1 issue: '7' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 1243-1255 project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Evolution publication_identifier: eissn: - 1558-5646 issn: - 0014-3820 publication_status: published publisher: Oxford University Press quality_controlled: '1' status: public title: Predicting the prevalence of genetic trade-offs among adaptive substitutions 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: 79 year: '2025' ... --- DOAJ_listed: '1' OA_place: repository OA_type: green _id: '20045' abstract: - lang: eng text: We consider the time evolution of the renormalized Nelson model, which describes N bosons linearly coupled to a quantized scalar field, in the mean-field limit of many particles N≫1 with coupling constant proportional to N^−1/2. First, we show that initial states exhibiting Bose–Einstein condensation for the particles and approximating a coherent state for the quantum field retain their structure under the many-body time evolution. Concretely, the dynamics of the reduced densities are approximated by solutions of two coupled PDEs, the Schrödinger–Klein–Gordon equations. Second, we construct a renormalized Bogoliubov evolution that describes the quantum fluctuations around the Schrödinger–Klein–Gordon equations. This evolution is used to extend the approximation of the evolved many-body state to the full norm topology. In summary, we provide a comprehensive analysis of the Nelson model that reveals the role of renormalization in the mean-field Bogoliubov theory. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Marco full_name: Falconi, Marco last_name: Falconi - first_name: Jonas full_name: Lampart, Jonas last_name: Lampart - first_name: Nikolai full_name: Leopold, Nikolai last_name: Leopold - first_name: David Johannes full_name: Mitrouskas, David Johannes id: cbddacee-2b11-11eb-a02e-a2e14d04e52d last_name: Mitrouskas citation: ama: Falconi M, Lampart J, Leopold N, Mitrouskas DJ. Renormalized Bogoliubov theory for the Nelson model. Annales de l’Institut Henri Poincaré C. 2025. doi:10.4171/aihpc/154 apa: Falconi, M., Lampart, J., Leopold, N., & Mitrouskas, D. J. (2025). Renormalized Bogoliubov theory for the Nelson model. Annales de l’Institut Henri Poincaré C. EMS Press. https://doi.org/10.4171/aihpc/154 chicago: Falconi, Marco, Jonas Lampart, Nikolai Leopold, and David Johannes Mitrouskas. “Renormalized Bogoliubov Theory for the Nelson Model.” Annales de l’Institut Henri Poincaré C. EMS Press, 2025. https://doi.org/10.4171/aihpc/154. ieee: M. Falconi, J. Lampart, N. Leopold, and D. J. Mitrouskas, “Renormalized Bogoliubov theory for the Nelson model,” Annales de l’Institut Henri Poincaré C. EMS Press, 2025. ista: Falconi M, Lampart J, Leopold N, Mitrouskas DJ. 2025. Renormalized Bogoliubov theory for the Nelson model. Annales de l’Institut Henri Poincaré C. mla: Falconi, Marco, et al. “Renormalized Bogoliubov Theory for the Nelson Model.” Annales de l’Institut Henri Poincaré C, EMS Press, 2025, doi:10.4171/aihpc/154. short: M. Falconi, J. Lampart, N. Leopold, D.J. Mitrouskas, Annales de l’Institut Henri Poincaré C (2025). date_created: 2025-07-21T07:59:16Z date_published: 2025-05-06T00:00:00Z date_updated: 2025-12-30T07:31:09Z day: '06' department: - _id: RoSe doi: 10.4171/aihpc/154 external_id: arxiv: - '2305.06722' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2305.06722 month: '05' oa: 1 oa_version: Preprint publication: Annales de l'Institut Henri Poincaré C publication_identifier: eissn: - 1873-1430 issn: - 0294-1449 publication_status: epub_ahead publisher: EMS Press quality_controlled: '1' status: public title: Renormalized Bogoliubov theory for the Nelson model type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '20046' abstract: - lang: eng text: A Laplacian matrix is a real symmetric matrix whose row and column sums are zero. We investigate the limiting distribution of the largest eigenvalues of a Laplacian random matrix with Gaussian entries. Unlike many classical matrix ensembles, this random matrix model contains dependent entries. Our main results show that the extreme eigenvalues of this model exhibit Poisson statistics. In particular, after properly shifting and scaling, we show that the largest eigenvalue converges to the Gumbel distribution as the dimension of the matrix tends to infinity. While the largest diagonal entry is also shown to have Gumbel fluctuations, there is a rather surprising difference between its deterministic centering term and the centering term required for the largest eigenvalues. acknowledgement: "The authors thank Santiago Arenas-Velilla and Victor Pérez-Abreu for comments on an earlier draft of this manuscript and for contributing Appendix A. The authors also thank Yan Fyodorov for providing useful references.\r\nA. Campbell was partially supported by the European Research Council Grant No. 101020331. K. Luh was supported in part by the Ralph E. Powe Junior Faculty Enhancement Award and Simons Foundation Grant MP-TSM-00001988. S. O’Rourke has been supported in part by NSF CAREER grant DMS-2143142. " article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Andrew J full_name: Campbell, Andrew J id: 582b06a9-1f1c-11ee-b076-82ffce00dde4 last_name: Campbell - first_name: Kyle full_name: Luh, Kyle last_name: Luh - first_name: Sean full_name: O’Rourke, Sean last_name: O’Rourke - first_name: Santiago full_name: Arenas-Velilla, Santiago last_name: Arenas-Velilla - first_name: Victor full_name: Perez-Abreu, Victor last_name: Perez-Abreu citation: ama: Campbell AJ, Luh K, O’Rourke S, Arenas-Velilla S, Perez-Abreu V. Extreme eigenvalues of Laplacian random matrices with Gaussian entries. Electronic Journal of Probability. 2025;30:1-52. doi:10.1214/25-ejp1366 apa: Campbell, A. J., Luh, K., O’Rourke, S., Arenas-Velilla, S., & Perez-Abreu, V. (2025). Extreme eigenvalues of Laplacian random matrices with Gaussian entries. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/25-ejp1366 chicago: Campbell, Andrew J, Kyle Luh, Sean O’Rourke, Santiago Arenas-Velilla, and Victor Perez-Abreu. “Extreme Eigenvalues of Laplacian Random Matrices with Gaussian Entries.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2025. https://doi.org/10.1214/25-ejp1366. ieee: A. J. Campbell, K. Luh, S. O’Rourke, S. Arenas-Velilla, and V. Perez-Abreu, “Extreme eigenvalues of Laplacian random matrices with Gaussian entries,” Electronic Journal of Probability, vol. 30. Institute of Mathematical Statistics, pp. 1–52, 2025. ista: Campbell AJ, Luh K, O’Rourke S, Arenas-Velilla S, Perez-Abreu V. 2025. Extreme eigenvalues of Laplacian random matrices with Gaussian entries. Electronic Journal of Probability. 30, 1–52. mla: Campbell, Andrew J., et al. “Extreme Eigenvalues of Laplacian Random Matrices with Gaussian Entries.” Electronic Journal of Probability, vol. 30, Institute of Mathematical Statistics, 2025, pp. 1–52, doi:10.1214/25-ejp1366. short: A.J. Campbell, K. Luh, S. O’Rourke, S. Arenas-Velilla, V. Perez-Abreu, Electronic Journal of Probability 30 (2025) 1–52. corr_author: '1' date_created: 2025-07-21T08:06:18Z date_published: 2025-06-27T00:00:00Z date_updated: 2025-09-30T14:07:19Z day: '27' ddc: - '510' department: - _id: LaEr doi: 10.1214/25-ejp1366 ec_funded: 1 external_id: arxiv: - '2211.17175' isi: - '001540927000024' file: - access_level: open_access checksum: a7a9f2bb7a6295786c16d4c7bd612621 content_type: application/pdf creator: dernst date_created: 2025-07-23T08:35:53Z date_updated: 2025-07-23T08:35:53Z file_id: '20069' file_name: 2025_ElectronJourProbab_Campbell.pdf file_size: 580591 relation: main_file success: 1 file_date_updated: 2025-07-23T08:35:53Z has_accepted_license: '1' intvolume: ' 30' isi: 1 language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 1-52 project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Electronic Journal of Probability publication_identifier: eissn: - 1083-6489 publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' status: public title: Extreme eigenvalues of Laplacian random matrices with Gaussian entries 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: 30 year: '2025' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '20048' abstract: - lang: eng text: 'During embryonic development, cell behaviors need to be tightly regulated in time and space. Yet how the temporal and spatial regulations of cell behaviors are interconnected during embryonic development remains elusive. To address this, we turned to zebrafish gastrulation, the process whereby dynamic cell behaviors generate the three principal germ layers of the early embryo. Here, we show that Hoxb cluster genes are expressed in a temporally collinear manner at the blastoderm margin, where mesodermal and endodermal (mesendoderm) progenitor cells are specified and ingress to form mesendoderm/hypoblast. Functional analysis shows that these Hoxb genes regulate the timing of cell ingression: under- or overexpression of Hoxb genes perturb the timing of mesendoderm cell ingression and, consequently, the positioning of these cells along the forming anterior-posterior body axis after gastrulation. Finally, we found that Hoxb genes control the timing of mesendoderm ingression by regulating cellular bleb formation and cell surface fluctuations in the ingressing cells. Collectively, our findings suggest that Hoxb genes interconnect the temporal and spatial pattern of cell behaviors during zebrafish gastrulation by controlling cell surface fluctuations.' acknowledgement: We thank all the Heisenberg lab members for discussions and comments on the manuscript, and the Bioimaging and Life Science facilities of ISTA for support with microscopy and fish maintenance, respectively. This study was funded by a Japan Society for the Promotion of Science (JSPS) Overseas Research Fellowship and a Japan Science and Technology Agency PRESTO grant (JPMJPR214B) to Y.M. Open Access funding provided by the Japan Science and Technology Agency. Deposited in PMC for immediate release. article_number: dev204261 article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Yuuta full_name: Moriyama, Yuuta id: addc9b8c-67a0-11f0-b374-a2e094825470 last_name: Moriyama orcid: 0000-0002-2853-8051 - first_name: Toshiyuki full_name: Mitsui, Toshiyuki last_name: Mitsui - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 citation: ama: Moriyama Y, Mitsui T, Heisenberg C-PJ. Hoxb genes determine the timing of cell ingression by regulating cell surface fluctuations during zebrafish gastrulation. Development. 2025;152(12). doi:10.1242/dev.204261 apa: Moriyama, Y., Mitsui, T., & Heisenberg, C.-P. J. (2025). Hoxb genes determine the timing of cell ingression by regulating cell surface fluctuations during zebrafish gastrulation. Development. The Company of Biologists. https://doi.org/10.1242/dev.204261 chicago: Moriyama, Yuuta, Toshiyuki Mitsui, and Carl-Philipp J Heisenberg. “Hoxb Genes Determine the Timing of Cell Ingression by Regulating Cell Surface Fluctuations during Zebrafish Gastrulation.” Development. The Company of Biologists, 2025. https://doi.org/10.1242/dev.204261. ieee: Y. Moriyama, T. Mitsui, and C.-P. J. Heisenberg, “Hoxb genes determine the timing of cell ingression by regulating cell surface fluctuations during zebrafish gastrulation,” Development, vol. 152, no. 12. The Company of Biologists, 2025. ista: Moriyama Y, Mitsui T, Heisenberg C-PJ. 2025. Hoxb genes determine the timing of cell ingression by regulating cell surface fluctuations during zebrafish gastrulation. Development. 152(12), dev204261. mla: Moriyama, Yuuta, et al. “Hoxb Genes Determine the Timing of Cell Ingression by Regulating Cell Surface Fluctuations during Zebrafish Gastrulation.” Development, vol. 152, no. 12, dev204261, The Company of Biologists, 2025, doi:10.1242/dev.204261. short: Y. Moriyama, T. Mitsui, C.-P.J. Heisenberg, Development 152 (2025). corr_author: '1' date_created: 2025-07-21T08:10:32Z date_published: 2025-06-27T00:00:00Z date_updated: 2025-09-30T14:07:51Z day: '27' ddc: - '570' department: - _id: CaHe doi: 10.1242/dev.204261 external_id: isi: - '001525252300001' pmid: - '40576478' file: - access_level: open_access checksum: 808d8aa28df79d23fb661838d1fdc1be content_type: application/pdf creator: dernst date_created: 2025-07-23T08:43:01Z date_updated: 2025-07-23T08:43:01Z file_id: '20070' file_name: 2025_Development_Moriyama.pdf file_size: 25935563 relation: main_file success: 1 file_date_updated: 2025-07-23T08:43:01Z has_accepted_license: '1' intvolume: ' 152' isi: 1 issue: '12' language: - iso: eng month: '06' oa: 1 oa_version: Published Version pmid: 1 publication: Development publication_identifier: eissn: - 1477-9129 issn: - 0950-1991 publication_status: published publisher: The Company of Biologists quality_controlled: '1' scopus_import: '1' status: public title: Hoxb genes determine the timing of cell ingression by regulating cell surface fluctuations during zebrafish gastrulation 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: 152 year: '2025' ... --- OA_place: repository OA_type: green _id: '20050' abstract: - lang: eng text: We prove upper bounds on the L∞-Wasserstein distance from optimal transport between strongly log-concave probability densities and log-Lipschitz perturbations. In the simplest setting, such a bound amounts to a transport-information inequality involving the L∞-Wasserstein metric and the relative L∞-Fisher information. We show that this inequality can be sharpened significantly in situations where the involved densities are anisotropic. Our proof is based on probabilistic techniques using Langevin dynamics. As an application of these results, we obtain sharp exponential rates of convergence in Fisher’s infinitesimal model from quantitative genetics, generalising recent results by Calvez, Poyato, and Santambrogio in dimension 1 to arbitrary dimensions. acknowledgement: This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/F65 and the Austrian Academy of Science, DOC fellowship nr. 26293. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Kseniia full_name: Khudiakova, Kseniia id: 4E6DC800-AE37-11E9-AC72-31CAE5697425 last_name: Khudiakova orcid: 0000-0002-6246-1465 - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti citation: ama: Khudiakova K, Maas J, Pedrotti F. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. The Annals of Applied Probability. 2025;35(3):1913-1940. doi:10.1214/25-aap2162 apa: Khudiakova, K., Maas, J., & Pedrotti, F. (2025). L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. The Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/25-aap2162 chicago: Khudiakova, Kseniia, Jan Maas, and Francesco Pedrotti. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” The Annals of Applied Probability. Institute of Mathematical Statistics, 2025. https://doi.org/10.1214/25-aap2162. ieee: K. Khudiakova, J. Maas, and F. Pedrotti, “L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model,” The Annals of Applied Probability, vol. 35, no. 3. Institute of Mathematical Statistics, pp. 1913–1940, 2025. ista: Khudiakova K, Maas J, Pedrotti F. 2025. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. The Annals of Applied Probability. 35(3), 1913–1940. mla: Khudiakova, Kseniia, et al. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” The Annals of Applied Probability, vol. 35, no. 3, Institute of Mathematical Statistics, 2025, pp. 1913–40, doi:10.1214/25-aap2162. short: K. Khudiakova, J. Maas, F. Pedrotti, The Annals of Applied Probability 35 (2025) 1913–1940. corr_author: '1' date_created: 2025-07-21T08:13:54Z date_published: 2025-06-01T00:00:00Z date_updated: 2025-09-30T14:12:48Z day: '01' department: - _id: JaMa doi: 10.1214/25-aap2162 external_id: arxiv: - '2402.04151' isi: - '001523520000012' intvolume: ' 35' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2402.04151 month: '06' oa: 1 oa_version: Preprint page: 1913-1940 project: - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 34d33d68-11ca-11ed-8bc3-ec13763c0ca8 grant_number: '26293' name: The impact of deleterious mutations on small populations publication: The Annals of Applied Probability publication_identifier: issn: - 1050-5164 publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' related_material: record: - id: '17352' relation: earlier_version status: public scopus_import: '1' status: public title: L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 35 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '20051' abstract: - lang: eng text: "We revisit the majority problem in the population protocol communication model, as first studied by Angluin et al. (Distributed Computing 2008). We consider a more general version of this problem known as plurality consensus, which has already been studied intensively in the literature. In this problem, each node in a system of n nodes, has initially one of k different opinions, and they need to agree on the (relative) majority opinion. In particular, we consider the important and intensively studied model of Undecided State Dynamics.\r\nOur main contribution is an almost tight lower bound on the stabilization time: we prove that there exists an initial configuration, even with bias \\Delta = \\omega(\\sqrt{n\\log n}), where stabilization requires \\Omega(kn\\log \\frac {\\sqrt n} {k \\log n}) interactions, or equivalently, \\Omega(k\\log \\frac {\\sqrt n} {k \\log n}) parallel time for any k = o\\left(\\frac {\\sqrt n}{\\log n}\\right). This bound is tight for any k \\le n^{\\frac 1 2 - \\epsilon}, where \\epsilon >0 can be any small constant, as Amir et al.~(PODC'23) gave a O(k\\log n) parallel time upper bound for k = O\\left(\\frac {\\sqrt n} {\\log ^2 n}\\right)." acknowledgement: "This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5862,grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with\r\nadditional funding from the netidee SCIENCE Stiftung, 2020–2024\r\nand the German Research Foundation (DFG), grant 470029389\r\n(FlexNets)." article_processing_charge: Yes (via OA deal) arxiv: 1 author: - first_name: Antoine full_name: El-Hayek, Antoine id: 888a098e-fcac-11ee-aff7-d347be57b725 last_name: El-Hayek orcid: 0000-0003-4268-7368 - first_name: Robert full_name: Elsässer, Robert last_name: Elsässer - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'El-Hayek A, Elsässer R, Schmid S. An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2025. doi:10.1145/3732772.3733505' apa: 'El-Hayek, A., Elsässer, R., & Schmid, S. (2025). An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. In Proceedings of the ACM Symposium on Principles of Distributed Computing. Huatulco, Mexico: Association for Computing Machinery. https://doi.org/10.1145/3732772.3733505' chicago: El-Hayek, Antoine, Robert Elsässer, and Stefan Schmid. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” In Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733505. ieee: A. El-Hayek, R. Elsässer, and S. Schmid, “An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Huatulco, Mexico, 2025. ista: 'El-Hayek A, Elsässer R, Schmid S. 2025. An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing.' mla: El-Hayek, Antoine, et al. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, doi:10.1145/3732772.3733505. short: A. El-Hayek, R. Elsässer, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025. conference: end_date: 2025-06-20 location: Huatulco, Mexico name: 'PODC: Symposium on Principles of Distributed Computing' start_date: 2025-06-16 corr_author: '1' date_created: 2025-07-21T08:16:15Z date_published: 2025-06-13T00:00:00Z date_updated: 2025-10-16T13:08:45Z day: '13' ddc: - '000' department: - _id: MoHe doi: 10.1145/3732772.3733505 ec_funded: 1 external_id: arxiv: - '2505.02765' isi: - '001525534800066' file: - access_level: open_access checksum: 52976d226f3f691aa519d71c1c718fa5 content_type: application/pdf creator: dernst date_created: 2025-08-04T09:10:55Z date_updated: 2025-08-04T09:10:55Z file_id: '20115' file_name: 2025_PODC_ElHayek.pdf file_size: 2200347 relation: main_file success: 1 file_date_updated: 2025-08-04T09:10:55Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '06' 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: 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 ACM Symposium on Principles of Distributed Computing publication_identifier: isbn: - ' 9798400718854' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' status: public title: An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '20052' abstract: - lang: eng text: "This paper revisits a fundamental distributed computing problem in the population protocol model. Provided n agents each starting with an input color in [k], the relative majority problem asks to find the predominant color. In the population protocol model, at each time step, a scheduler selects two agents that first learn each other's states and then update their states based on what they learned.\r\nWe present the Circles protocol that solves the relative majority problem with k3 states. It is always-correct under weakly fair scheduling. Not only does it improve upon the best known upper bound of O(k7), but it also shows a strikingly simpler design inspired by energy minimization in chemical settings." acknowledgement: 'This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024 and the German Research Foundation (DFG), grant 470029389 (FlexNets). ' article_processing_charge: No author: - first_name: Tom-Lukas full_name: Breitkopf, Tom-Lukas last_name: Breitkopf - first_name: Julien full_name: Dallot, Julien last_name: Dallot - first_name: Antoine full_name: El-Hayek, Antoine id: 888a098e-fcac-11ee-aff7-d347be57b725 last_name: El-Hayek orcid: 0000-0003-4268-7368 - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2025:549-552. doi:10.1145/3732772.3733512' apa: 'Breitkopf, T.-L., Dallot, J., El-Hayek, A., & Schmid, S. (2025). Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols. In Proceedings of the ACM Symposium on Principles of Distributed Computing (pp. 549–552). Huatulco, Mexico: Association for Computing Machinery. https://doi.org/10.1145/3732772.3733512' chicago: 'Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid. “Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 549–52. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733512.' ieee: 'T.-L. Breitkopf, J. Dallot, A. El-Hayek, and S. Schmid, “Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Huatulco, Mexico, 2025, pp. 549–552.' ista: 'Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. 2025. Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 549–552.' mla: 'Breitkopf, Tom-Lukas, et al. “Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.” Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, pp. 549–52, doi:10.1145/3732772.3733512.' short: T.-L. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, pp. 549–552. conference: end_date: 2025-06-20 location: Huatulco, Mexico name: 'PODC: Symposium on Principles of Distributed Computing' start_date: 2025-06-16 corr_author: '1' date_created: 2025-07-21T08:17:04Z date_published: 2025-06-13T00:00:00Z date_updated: 2026-02-16T11:46:37Z day: '13' ddc: - '000' department: - _id: MoHe doi: 10.1145/3732772.3733512 ec_funded: 1 external_id: isi: - '001525534800069' file: - access_level: open_access checksum: e99679ffb28877b7cea4d54860302790 content_type: application/pdf creator: dernst date_created: 2025-08-05T07:32:01Z date_updated: 2025-08-05T07:32:01Z file_id: '20123' file_name: 2025_PODC_Breitkopf.pdf file_size: 549706 relation: main_file success: 1 file_date_updated: 2025-08-05T07:32:01Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 549-552 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: 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 ACM Symposium on Principles of Distributed Computing publication_identifier: isbn: - '9798400718854' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' status: public title: 'Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '20053' abstract: - lang: eng text: "Liquid democracy is a transitive vote delegation mechanism over voting graphs. It enables each voter to delegate their vote(s) to another better-informed voter, with the goal of collectively making a better decision. The question of whether liquid democracy outperforms direct voting has been previously studied in the context of local delegation mechanisms (where voters can only delegate to someone in their neighbourhood) and binary decision problems. It has previously been shown that it is impossible for local delegation mechanisms to outperform direct voting in general graphs. This raises the question: for which classes of graphs do local delegation mechanisms yield good results?\r\nIn this work, we analyse (1) properties of specific graphs and (2) properties of local delegation mechanisms on these graphs, determining where local delegation actually outperforms direct voting. We show that a critical graph property enabling liquid democracy is that the voting outcome of local delegation mechanisms preserves a sufficient amount of variance, thereby avoiding situations where delegation falls behind direct voting1. These insights allow us to prove our main results, namely that there exist local delegation mechanisms that perform no worse and in fact quantitatively better than direct voting in natural graph topologies like complete, random d-regular, and bounded degree graphs, lending a more nuanced perspective to previous impossibility results." acknowledgement: This work was partially supported by MOE-T2EP20122-0014 (DataDriven Distributed Algorithms), German Research Foundation (DFG) project ReNO (SPP 2378) from 2023-2027, ERC CoG 863818 (ForMSMArt) and Austrian Science Fund (FWF) 10.55776/COE12. article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Seth full_name: Gilbert, Seth last_name: Gilbert - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda orcid: 0000-0002-1419-3267 - first_name: Michelle X full_name: Yeo, Michelle X id: 2D82B818-F248-11E8-B48F-1D18A9856A87 last_name: Yeo orcid: 0009-0001-3676-4809 citation: ama: 'Chatterjee K, Gilbert S, Schmid S, Svoboda J, Yeo MX. When is liquid democracy possible?: On the manipulation of variance. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2025:241-251. doi:10.1145/3732772.3733544' apa: 'Chatterjee, K., Gilbert, S., Schmid, S., Svoboda, J., & Yeo, M. X. (2025). When is liquid democracy possible?: On the manipulation of variance. In Proceedings of the ACM Symposium on Principles of Distributed Computing (pp. 241–251). Huatulco, Mexico: Association for Computing Machinery. https://doi.org/10.1145/3732772.3733544' chicago: 'Chatterjee, Krishnendu, Seth Gilbert, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “When Is Liquid Democracy Possible?: On the Manipulation of Variance.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 241–51. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733544.' ieee: 'K. Chatterjee, S. Gilbert, S. Schmid, J. Svoboda, and M. X. Yeo, “When is liquid democracy possible?: On the manipulation of variance,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Huatulco, Mexico, 2025, pp. 241–251.' ista: 'Chatterjee K, Gilbert S, Schmid S, Svoboda J, Yeo MX. 2025. When is liquid democracy possible?: On the manipulation of variance. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 241–251.' mla: 'Chatterjee, Krishnendu, et al. “When Is Liquid Democracy Possible?: On the Manipulation of Variance.” Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, pp. 241–51, doi:10.1145/3732772.3733544.' short: K. Chatterjee, S. Gilbert, S. Schmid, J. Svoboda, M.X. Yeo, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, pp. 241–251. conference: end_date: 2025-06-20 location: Huatulco, Mexico name: 'PODC: Symposium on Principles of Distributed Computing' start_date: 2025-06-16 corr_author: '1' date_created: 2025-07-21T08:18:26Z date_published: 2025-06-13T00:00:00Z date_updated: 2026-02-16T11:46:51Z day: '13' ddc: - '000' department: - _id: KrCh - _id: KrPi doi: 10.1145/3732772.3733544 ec_funded: 1 external_id: isi: - '001525534800030' file: - access_level: open_access checksum: cd628fe54d96e9fc6cc789bb8145422b content_type: application/pdf creator: dernst date_created: 2025-08-05T07:15:31Z date_updated: 2025-08-05T07:15:31Z file_id: '20122' file_name: 2025_PODC_Chatterjee.pdf file_size: 783297 relation: main_file success: 1 file_date_updated: 2025-08-05T07:15:31Z has_accepted_license: '1' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2025/745 month: '06' oa: 1 oa_version: Published Version page: 241-251 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Proceedings of the ACM Symposium on Principles of Distributed Computing publication_identifier: isbn: - '9798400718854' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' status: public title: 'When is liquid democracy possible?: On the manipulation of variance' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- _id: '20054' article_number: '220' article_processing_charge: No author: - first_name: Sharona full_name: Horta, Sharona id: 03a7e858-01b1-11ec-8b71-99ae6c4a05bc last_name: Horta citation: ama: 'Horta S. Solid state diffusion in metal-semiconductors core-shell nanoparticle. In: Proceedings of the MATSUS Spring 2025 Conference. Fundació de la comunitat valenciana SCITO; 2025. doi:10.29363/nanoge.matsusspring.2025.220' apa: 'Horta, S. (2025). Solid state diffusion in metal-semiconductors core-shell nanoparticle. In Proceedings of the MATSUS Spring 2025 Conference. Sevilla, Spain: Fundació de la comunitat valenciana SCITO. https://doi.org/10.29363/nanoge.matsusspring.2025.220' chicago: Horta, Sharona. “Solid State Diffusion in Metal-Semiconductors Core-Shell Nanoparticle.” In Proceedings of the MATSUS Spring 2025 Conference. Fundació de la comunitat valenciana SCITO, 2025. https://doi.org/10.29363/nanoge.matsusspring.2025.220. ieee: S. Horta, “Solid state diffusion in metal-semiconductors core-shell nanoparticle,” in Proceedings of the MATSUS Spring 2025 Conference, Sevilla, Spain, 2025. ista: 'Horta S. 2025. Solid state diffusion in metal-semiconductors core-shell nanoparticle. Proceedings of the MATSUS Spring 2025 Conference. MATSUS: Materials for Sustainable Development Conference, 220.' mla: Horta, Sharona. “Solid State Diffusion in Metal-Semiconductors Core-Shell Nanoparticle.” Proceedings of the MATSUS Spring 2025 Conference, 220, Fundació de la comunitat valenciana SCITO, 2025, doi:10.29363/nanoge.matsusspring.2025.220. short: S. Horta, in:, Proceedings of the MATSUS Spring 2025 Conference, Fundació de la comunitat valenciana SCITO, 2025. conference: end_date: 2025-03-07 location: Sevilla, Spain name: 'MATSUS: Materials for Sustainable Development Conference' start_date: 2025-03-03 corr_author: '1' date_created: 2025-07-21T08:22:29Z date_published: 2025-03-03T00:00:00Z date_updated: 2025-09-23T09:04:03Z day: '03' department: - _id: MaIb doi: 10.29363/nanoge.matsusspring.2025.220 language: - iso: eng month: '03' oa_version: None publication: Proceedings of the MATSUS Spring 2025 Conference publication_status: published publisher: Fundació de la comunitat valenciana SCITO quality_controlled: '1' status: public title: Solid state diffusion in metal-semiconductors core-shell nanoparticle type: conference_abstract user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_type: closed access _id: '20055' abstract: - lang: eng text: Supercrystals represent three-dimensional orderings of colloidal nanocrystals (NCs), showcasing collective properties in photonics, phononics, and electronics applications.1,2 Recent studies have shown that such assemblies are directly produced during nanocrystal reactions.3–6 However, a fundamental understanding of in situ formed supercrystals that withstand typical NC purification processes remains underexplored, which is important for further use. Herein, we report the reaction precursor-mediated formation of stable PbTe supercrystals. Rationalizing the formation of these assemblies through small-angle x-ray scattering (SAXS) measurements, we unveil their formation mechanism. Our findings reveal that the supercrystal formation occurs in the presence of an excess of lead oleates in the crude solution. It should be noted that the formed supercrystals can be stabilized under specific conditions determined by the lead oleate cluster concentration, content of trioctylphosphine telluride (TOP-Te), NC size and the need of an annealing step at mild conditions. Furthermore, this approach allows for the continuous growth of a secondary phase within the supercrystal; for example in the case of PbTe supercrystals, a PbS shell can be grown on each PbTe NC constituent, resulting in core-shell PbTe-PbS supercrystals. Our work elucidates that reaction precursors play an important role in in situ SC formation and stabilization, implying the possibility of applying this knowledge to other NC reactions. acknowledged_ssus: - _id: EM-Fac - _id: NMR - _id: LifeSc acknowledgement: ISTA and the Werner Siemens Foundation financially supported this work. The Scientific Service Units (SSU) of ISTA supported this research through resources provided by the Electron Microscopy Facility (EMF), NMR Facility and the Lab Support Facility (LSF). article_number: '173' article_processing_charge: No author: - first_name: Seungho full_name: Lee, Seungho id: BB243B88-D767-11E9-B658-BC13E6697425 last_name: Lee orcid: 0000-0002-6962-8598 - first_name: Daniel full_name: Balazs, Daniel id: 302BADF6-85FC-11EA-9E3B-B9493DDC885E last_name: Balazs orcid: 0000-0001-7597-043X - first_name: Sharona full_name: Horta, Sharona id: 03a7e858-01b1-11ec-8b71-99ae6c4a05bc last_name: Horta - first_name: Aiswarya full_name: Rayaroth Puthiyaveettil, Aiswarya id: 8aceb01b-8972-11ed-ae7b-d5fe53775add last_name: Rayaroth Puthiyaveettil - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 citation: ama: 'Lee S, Balazs D, Horta S, Rayaroth Puthiyaveettil A, Ibáñez M. Reaction precursor-mediated formation of stable supercrystals in colloidal nanocrystal synthesis: PbTe case. In: Proceedings of the MATSUS Spring 2025 Conference. Fundació de la comunitat valenciana SCITO; 2025. doi:10.29363/nanoge.matsusspring.2025.173' apa: 'Lee, S., Balazs, D., Horta, S., Rayaroth Puthiyaveettil, A., & Ibáñez, M. (2025). Reaction precursor-mediated formation of stable supercrystals in colloidal nanocrystal synthesis: PbTe case. In Proceedings of the MATSUS Spring 2025 Conference. Sevilla, Spain: Fundació de la comunitat valenciana SCITO. https://doi.org/10.29363/nanoge.matsusspring.2025.173' chicago: 'Lee, Seungho, Daniel Balazs, Sharona Horta, Aiswarya Rayaroth Puthiyaveettil, and Maria Ibáñez. “Reaction Precursor-Mediated Formation of Stable Supercrystals in Colloidal Nanocrystal Synthesis: PbTe Case.” In Proceedings of the MATSUS Spring 2025 Conference. Fundació de la comunitat valenciana SCITO, 2025. https://doi.org/10.29363/nanoge.matsusspring.2025.173.' ieee: 'S. Lee, D. Balazs, S. Horta, A. Rayaroth Puthiyaveettil, and M. Ibáñez, “Reaction precursor-mediated formation of stable supercrystals in colloidal nanocrystal synthesis: PbTe case,” in Proceedings of the MATSUS Spring 2025 Conference, Sevilla, Spain, 2025.' ista: 'Lee S, Balazs D, Horta S, Rayaroth Puthiyaveettil A, Ibáñez M. 2025. Reaction precursor-mediated formation of stable supercrystals in colloidal nanocrystal synthesis: PbTe case. Proceedings of the MATSUS Spring 2025 Conference. MATSUS: Materials for Sustainable Development Conference, 173.' mla: 'Lee, Seungho, et al. “Reaction Precursor-Mediated Formation of Stable Supercrystals in Colloidal Nanocrystal Synthesis: PbTe Case.” Proceedings of the MATSUS Spring 2025 Conference, 173, Fundació de la comunitat valenciana SCITO, 2025, doi:10.29363/nanoge.matsusspring.2025.173.' short: S. Lee, D. Balazs, S. Horta, A. Rayaroth Puthiyaveettil, M. Ibáñez, in:, Proceedings of the MATSUS Spring 2025 Conference, Fundació de la comunitat valenciana SCITO, 2025. conference: end_date: 2025-03-07 location: Sevilla, Spain name: 'MATSUS: Materials for Sustainable Development Conference' start_date: 2025-03-03 corr_author: '1' date_created: 2025-07-21T08:33:20Z date_published: 2025-03-15T00:00:00Z date_updated: 2026-02-19T09:25:57Z day: '15' department: - _id: MaIb - _id: LifeSc doi: 10.29363/nanoge.matsusspring.2025.173 language: - iso: eng month: '03' oa_version: None project: - _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery' publication: Proceedings of the MATSUS Spring 2025 Conference publication_status: published publisher: Fundació de la comunitat valenciana SCITO quality_controlled: '1' status: public title: 'Reaction precursor-mediated formation of stable supercrystals in colloidal nanocrystal synthesis: PbTe case' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: repository OA_type: green _id: '20056' abstract: - lang: eng text: Theoretical studies have shown that stochasticity can affect the dynamics of ecosystems in counterintuitive ways. However, without knowing the equations governing the dynamics of populations or ecosystems, it is difficult to ascertain the role of stochasticity in real datasets. Therefore, the inverse problem of inferring the governing stochastic equations from datasets is important. Here, we present an equation discovery methodology that takes time series data of state variables as input and outputs a stochastic differential equation. We achieve this by combining traditional approaches from stochastic calculus with the equation discovery techniques. We demonstrate the generality of the method via several applications. First, we deliberately choose various stochastic models with fundamentally different governing equations, yet they produce nearly identical steady-state distributions. We show that we can recover the correct underlying equations, and thus infer the structure of their stability, accurately from the analysis of time series data alone. We demonstrate our method on two real-world datasets—fish schooling and single-cell migration—that have vastly different spatiotemporal scales and dynamics. We illustrate various limitations and potential pitfalls of the method and how to overcome them via diagnostic measures. Finally, we provide our open-source code via a package named PyDaDDy (Python Library for Data-Driven Dynamics). acknowledgement: V.G. acknowledges support from the Science and Engi-neering Research Board, Department of Biotechnology,and the Indo-French Centre for the Promotion of Ad-vanced Research (64T4-1). D.R.M. acknowledges supportfrom a Department of Science and Technology (DST) In-novation in Science Pursuit for Inspired Research (IN-SPIRE) Faculty Award. J.J. acknowledges support froma Humboldt postdoctoral fellowship and the Heidelber-ger Akademie der Wissenschaften, Heidelberg, Germany.D.B.B. acknowledges support from the NOMIS Founda-tion and an European Molecular Biology Organization(EMBO) postdoctoral fellowship (ALTF 343-2022). A.N.and S.P. acknowledge support from Ministry of Educa-tion (MoE) PhD fellowships. We thank Ashrit Mangal-wedhekar, Vivek Jadhav, Shikhara Bhat, Cassandre Aimon,and Harishankar Muppirala for comments on the manu-script and code. We thank Kollegala Sharma for his inputon the Kannada translation of the title and abstract.Data-Driven Model Discovery E115 article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Arshed full_name: Nabeel, Arshed last_name: Nabeel - first_name: Ashwin full_name: Karichannavar, Ashwin last_name: Karichannavar - first_name: Shuaib full_name: Palathingal, Shuaib last_name: Palathingal - first_name: Jitesh full_name: Jhawar, Jitesh last_name: Jhawar - first_name: David full_name: Brückner, David id: e1e86031-6537-11eb-953a-f7ab92be508d last_name: Brückner orcid: 0000-0001-7205-2975 - first_name: Danny full_name: Raj M, Danny last_name: Raj M - first_name: Vishwesha full_name: Guttal, Vishwesha last_name: Guttal citation: ama: Nabeel A, Karichannavar A, Palathingal S, et al. Discovering stochastic dynamical equations from ecological time series data. The American Naturalist. 2025;205(4):E100-E117. doi:10.1086/734083 apa: Nabeel, A., Karichannavar, A., Palathingal, S., Jhawar, J., Brückner, D., Raj M, D., & Guttal, V. (2025). Discovering stochastic dynamical equations from ecological time series data. The American Naturalist. University of Chicago Press. https://doi.org/10.1086/734083 chicago: Nabeel, Arshed, Ashwin Karichannavar, Shuaib Palathingal, Jitesh Jhawar, David Brückner, Danny Raj M, and Vishwesha Guttal. “Discovering Stochastic Dynamical Equations from Ecological Time Series Data.” The American Naturalist. University of Chicago Press, 2025. https://doi.org/10.1086/734083. ieee: A. Nabeel et al., “Discovering stochastic dynamical equations from ecological time series data,” The American Naturalist, vol. 205, no. 4. University of Chicago Press, pp. E100–E117, 2025. ista: Nabeel A, Karichannavar A, Palathingal S, Jhawar J, Brückner D, Raj M D, Guttal V. 2025. Discovering stochastic dynamical equations from ecological time series data. The American Naturalist. 205(4), E100–E117. mla: Nabeel, Arshed, et al. “Discovering Stochastic Dynamical Equations from Ecological Time Series Data.” The American Naturalist, vol. 205, no. 4, University of Chicago Press, 2025, pp. E100–17, doi:10.1086/734083. short: A. Nabeel, A. Karichannavar, S. Palathingal, J. Jhawar, D. Brückner, D. Raj M, V. Guttal, The American Naturalist 205 (2025) E100–E117. date_created: 2025-07-21T08:37:27Z date_published: 2025-04-01T00:00:00Z date_updated: 2025-09-30T14:14:43Z day: '01' department: - _id: EdHa doi: 10.1086/734083 external_id: arxiv: - '2205.02645' isi: - '001433250500001' pmid: - '40179429' intvolume: ' 205' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2205.02645 month: '04' oa: 1 oa_version: Preprint page: E100-E117 pmid: 1 project: - _id: 34e2a5b5-11ca-11ed-8bc3-b2265616ef0b grant_number: ALTF 343-2022 name: A mechano-chemical theory for stem cell fate decisions in organoid development publication: The American Naturalist publication_identifier: eissn: - 1537-5323 issn: - 0003-0147 publication_status: published publisher: University of Chicago Press quality_controlled: '1' related_material: record: - id: '20121' relation: software status: public status: public title: Discovering stochastic dynamical equations from ecological time series data type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 205 year: '2025' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold PlanS_conform: '1' _id: '20077' abstract: - lang: eng text: Hyaluronic acid (HA) is a key extracellular matrix component of vertebrates, where it mediates cell adhesion, immune regulation, and tissue remodeling through its interaction with specific receptors. Although HA has been detected in a few invertebrate species, the lack of fundamental components of the molecular HA pathway poses relevant objections about its functional role in these species. Mining genomic and transcriptomic data, we considered the conservation of the gene locus encoding for the extracellular link protein (XLINK) in marine mussels as well as its expression patterns. Structural and phylogenetic analyses were undertaken to evaluate possible similarities with vertebrate orthologs and to infer the origin of this gene in invertebrates. Biochemical analysis was used to quantify HA in tissues of Mytilus galloprovincialis. As a result, we confirm that the mussel can produce HA (up to 1.02 ng/mg in mantle) and that its genome encodes two XLINK gene loci. These loci are conserved in Mytilidae species and show a complex evolutionary path. Mussel XLINK genes appeared to be expressed during developmental stages in three mussel species, ranking in the top 100 expressed genes in M. trossulus at 17 h post-fertilization. In conclusion, the presence of HA and an active gene with the potential to bind HA suggests that mussels have the potential to synthesize and use HA and are among the few invertebrates encoding this gene. acknowledgement: 'This research was funded by the Italian Ministry of University and Research (MIUR), grant ID: P2022JEEMT (Developing a tool for the study of haplotype diversity in Mytilus galloprovincialis (HAMIGA)).' article_number: '930' article_processing_charge: Yes article_type: original author: - first_name: Umberto full_name: Rosani, Umberto last_name: Rosani - first_name: Nehir full_name: Altan, Nehir last_name: Altan - first_name: Paola full_name: Venier, Paola last_name: Venier - first_name: Enrico full_name: Bortoletto, Enrico last_name: Bortoletto - first_name: Nicola full_name: Volpi, Nicola last_name: Volpi - first_name: Carrie A full_name: Bernecky, Carrie A id: 2CB9DFE2-F248-11E8-B48F-1D18A9856A87 last_name: Bernecky orcid: 0000-0003-0893-7036 citation: ama: Rosani U, Altan N, Venier P, Bortoletto E, Volpi N, Bernecky C. Ancestral origin and functional expression of a hyaluronic acid pathway complement in mussels. Biology. 2025;14(8). doi:10.3390/biology14080930 apa: Rosani, U., Altan, N., Venier, P., Bortoletto, E., Volpi, N., & Bernecky, C. (2025). Ancestral origin and functional expression of a hyaluronic acid pathway complement in mussels. Biology. MDPI. https://doi.org/10.3390/biology14080930 chicago: Rosani, Umberto, Nehir Altan, Paola Venier, Enrico Bortoletto, Nicola Volpi, and Carrie Bernecky. “Ancestral Origin and Functional Expression of a Hyaluronic Acid Pathway Complement in Mussels.” Biology. MDPI, 2025. https://doi.org/10.3390/biology14080930. ieee: U. Rosani, N. Altan, P. Venier, E. Bortoletto, N. Volpi, and C. Bernecky, “Ancestral origin and functional expression of a hyaluronic acid pathway complement in mussels,” Biology, vol. 14, no. 8. MDPI, 2025. ista: Rosani U, Altan N, Venier P, Bortoletto E, Volpi N, Bernecky C. 2025. Ancestral origin and functional expression of a hyaluronic acid pathway complement in mussels. Biology. 14(8), 930. mla: Rosani, Umberto, et al. “Ancestral Origin and Functional Expression of a Hyaluronic Acid Pathway Complement in Mussels.” Biology, vol. 14, no. 8, 930, MDPI, 2025, doi:10.3390/biology14080930. short: U. Rosani, N. Altan, P. Venier, E. Bortoletto, N. Volpi, C. Bernecky, Biology 14 (2025). date_created: 2025-07-25T08:28:26Z date_published: 2025-07-24T00:00:00Z date_updated: 2025-09-30T14:10:07Z day: '24' ddc: - '570' department: - _id: CaBe doi: 10.3390/biology14080930 external_id: isi: - '001557922100001' file: - access_level: open_access checksum: f5e059e66803fa54249c1db029aef0f6 content_type: application/pdf creator: dernst date_created: 2025-07-31T09:11:09Z date_updated: 2025-07-31T09:11:09Z file_id: '20097' file_name: 2025_Biology_Rosani.pdf file_size: 1885781 relation: main_file success: 1 file_date_updated: 2025-07-31T09:11:09Z has_accepted_license: '1' intvolume: ' 14' isi: 1 issue: '8' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: Biology publication_identifier: issn: - 2079-7737 publication_status: published publisher: MDPI quality_controlled: '1' status: public title: Ancestral origin and functional expression of a hyaluronic acid pathway complement in mussels tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 14 year: '2025' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '20078' abstract: - lang: eng text: 'Let A be an abelian variety defined over a number field K, E/K be an elliptic curve, and ϕ : A → Em be an isogeny defined over K. Let P ∈ A(K) be such that ϕ(P)=(Q1,..., Qm) with RankZ(⟨Q1,...,Qm⟩)=1. We will study a divisibility sequence related to the point P and show its relation with elliptic divisibility sequences.' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Stefan full_name: Barańczuk, Stefan last_name: Barańczuk - first_name: Bartosz full_name: Naskręcki, Bartosz last_name: Naskręcki - first_name: Matteo full_name: Verzobio, Matteo id: 7aa8f170-131e-11ed-88e1-a9efd01027cb last_name: Verzobio orcid: 0000-0002-0854-0306 citation: ama: Barańczuk S, Naskręcki B, Verzobio M. Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve. Journal of Number Theory. 2025;279:170-183. doi:10.1016/j.jnt.2025.06.001 apa: Barańczuk, S., Naskręcki, B., & Verzobio, M. (2025). Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve. Journal of Number Theory. Elsevier. https://doi.org/10.1016/j.jnt.2025.06.001 chicago: Barańczuk, Stefan, Bartosz Naskręcki, and Matteo Verzobio. “Divisibility Sequences Related to Abelian Varieties Isogenous to a Power of an Elliptic Curve.” Journal of Number Theory. Elsevier, 2025. https://doi.org/10.1016/j.jnt.2025.06.001. ieee: S. Barańczuk, B. Naskręcki, and M. Verzobio, “Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve,” Journal of Number Theory, vol. 279. Elsevier, pp. 170–183, 2025. ista: Barańczuk S, Naskręcki B, Verzobio M. 2025. Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve. Journal of Number Theory. 279, 170–183. mla: Barańczuk, Stefan, et al. “Divisibility Sequences Related to Abelian Varieties Isogenous to a Power of an Elliptic Curve.” Journal of Number Theory, vol. 279, Elsevier, 2025, pp. 170–83, doi:10.1016/j.jnt.2025.06.001. short: S. Barańczuk, B. Naskręcki, M. Verzobio, Journal of Number Theory 279 (2025) 170–183. corr_author: '1' date_created: 2025-07-27T22:01:25Z date_published: 2025-07-23T00:00:00Z date_updated: 2025-09-30T14:09:38Z day: '23' department: - _id: TiBr doi: 10.1016/j.jnt.2025.06.001 external_id: arxiv: - '2309.09699' isi: - '001541172400002' intvolume: ' 279' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.jnt.2025.06.001 month: '07' oa: 1 oa_version: Published Version page: 170-183 publication: Journal of Number Theory publication_identifier: issn: - 0022-314X publication_status: epub_ahead publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 279 year: '2025' ...