[{"citation":{"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.","mla":"Robert, Thomas, et al. “LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statistics.” 13th International Conference on Learning Representations, ICLR, 2025, pp. 101877–913.","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.","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.","short":"T. Robert, M. Safaryan, I.-V. Modoranu, D.-A. Alistarh, in:, 13th International Conference on Learning Representations, ICLR, 2025, pp. 101877–101913.","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.","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."},"publisher":"ICLR","day":"01","page":"101877-101913","type":"conference","related_material":{"link":[{"url":"https://github.com/IST-DASLab/LDAdam","relation":"software"}]},"publication":"13th International Conference on Learning Representations","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9798331320850"]},"OA_place":"publisher","has_accepted_license":"1","date_updated":"2025-08-04T08:41:10Z","corr_author":"1","external_id":{"arxiv":["2410.16103"]},"file_date_updated":"2025-08-04T08:39:51Z","date_created":"2025-07-20T22:02:02Z","department":[{"_id":"DaAl"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"20034","year":"2025","oa_version":"Published Version","title":"LDAdam: Adaptive optimization from low-dimensional gradient statistics","article_processing_charge":"No","month":"04","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."}],"scopus_import":"1","date_published":"2025-04-01T00:00:00Z","status":"public","OA_type":"diamond","ddc":["000"],"arxiv":1,"conference":{"location":"Singapore, Singapore","start_date":"2025-04-24","name":"ICLR: International Conference on Learning Representations","end_date":"2025-04-28"},"publication_status":"published","license":"https://creativecommons.org/licenses/by/4.0/","author":[{"first_name":"Thomas","full_name":"Robert, Thomas","last_name":"Robert"},{"last_name":"Safaryan","id":"dd546b39-0804-11ed-9c55-ef075c39778d","full_name":"Safaryan, Mher","first_name":"Mher"},{"last_name":"Modoranu","first_name":"Ionut-Vlad","id":"449f7a18-f128-11eb-9611-9b430c0c6333","full_name":"Modoranu, Ionut-Vlad"},{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","creator":"dernst","date_created":"2025-08-04T08:39:51Z","content_type":"application/pdf","relation":"main_file","file_size":1346111,"file_id":"20113","checksum":"9327d82569358d7bf1c3ec1a9952e721","success":1,"date_updated":"2025-08-04T08:39:51Z","file_name":"2025_ICLR_Robert.pdf"}],"oa":1},{"title":"Wide neural networks trained with weight decay provably exhibit neural collapse","_id":"20035","year":"2025","oa_version":"Published Version","month":"04","article_processing_charge":"No","OA_type":"diamond","arxiv":1,"ddc":["000"],"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.","conference":{"location":"Singapore, Singapore","name":"ICLR: International Conference on Learning Representations","end_date":"2025-04-28","start_date":"2025-04-24"},"scopus_import":"1","date_published":"2025-04-01T00:00:00Z","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."}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_size":1337236,"file_id":"20114","access_level":"open_access","date_created":"2025-08-04T08:45:43Z","creator":"dernst","content_type":"application/pdf","date_updated":"2025-08-04T08:45:43Z","file_name":"2025_ICLR_Jacot.pdf","checksum":"59c48c173887139647cc9839c0801136","success":1}],"oa":1,"publication_status":"published","project":[{"name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf","grant_number":"101161364"}],"author":[{"last_name":"Jacot","full_name":"Jacot, Arthur","first_name":"Arthur"},{"id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","full_name":"Súkeník, Peter","first_name":"Peter","last_name":"Súkeník"},{"last_name":"Wang","first_name":"Zihan","full_name":"Wang, Zihan"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020"}],"publisher":"ICLR","day":"01","page":"1905-1931","type":"conference","citation":{"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.","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.","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.","short":"A. Jacot, P. Súkeník, Z. Wang, M. Mondelli, in:, 13th International Conference on Learning Representations, ICLR, 2025, pp. 1905–1931.","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.","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."},"publication":"13th International Conference on Learning Representations","OA_place":"publisher","has_accepted_license":"1","date_updated":"2025-08-04T08:47:00Z","corr_author":"1","external_id":{"arxiv":["2410.04887"]},"quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9798331320850"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file_date_updated":"2025-08-04T08:45:43Z","date_created":"2025-07-20T22:02:02Z","department":[{"_id":"MaMo"}]},{"month":"04","article_processing_charge":"No","title":"Near, far: Patch-ordering enhances vision foundation models' scene understanding","oa_version":"Published Version","_id":"20036","year":"2025","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","date_created":"2025-08-04T08:09:43Z","creator":"dernst","content_type":"application/pdf","file_size":37788223,"relation":"main_file","file_id":"20109","checksum":"ddbe981f3ad3f6cb6daf12c954822eb8","success":1,"date_updated":"2025-08-04T08:09:43Z","file_name":"2025_ICLR_Pariza.pdf"}],"author":[{"first_name":"Valentinos","full_name":"Pariza, Valentinos","last_name":"Pariza"},{"full_name":"Salehi, Mohammadreza","first_name":"Mohammadreza","last_name":"Salehi"},{"last_name":"Burghouts","first_name":"Gertjan","full_name":"Burghouts, Gertjan"},{"orcid":"0000-0002-4850-0683","last_name":"Locatello","first_name":"Francesco","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"first_name":"Yuki M.","full_name":"Asano, Yuki M.","last_name":"Asano"}],"publication_status":"published","ddc":["000"],"arxiv":1,"conference":{"location":"Singapore, Singapore","end_date":"2025-04-28","name":"ICLR: International Conference on Learning Representations","start_date":"2025-04-24"},"OA_type":"diamond","status":"public","abstract":[{"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%.","lang":"eng"}],"scopus_import":"1","date_published":"2025-04-01T00:00:00Z","publication":"13th International Conference on Learning Representations","type":"conference","publisher":"ICLR","day":"01","page":"72303-72330","citation":{"short":"V. Pariza, M. Salehi, G. Burghouts, F. Locatello, Y.M. Asano, in:, 13th International Conference on Learning Representations, ICLR, 2025, pp. 72303–72330.","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.","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.","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.","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.","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."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"FrLo"}],"file_date_updated":"2025-08-04T08:09:43Z","date_created":"2025-07-20T22:02:03Z","external_id":{"arxiv":["2408.11054"]},"has_accepted_license":"1","OA_place":"publisher","date_updated":"2025-08-04T08:10:55Z","publication_identifier":{"isbn":["9798331320850"]},"language":[{"iso":"eng"}],"quality_controlled":"1"},{"corr_author":"1","external_id":{"arxiv":["2405.15756"]},"OA_place":"publisher","has_accepted_license":"1","date_updated":"2025-08-04T08:16:43Z","publication_identifier":{"isbn":["9798331320850"]},"language":[{"iso":"eng"}],"quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"DaAl"}],"date_created":"2025-07-20T22:02:03Z","file_date_updated":"2025-08-04T08:14:09Z","type":"conference","related_material":{"link":[{"url":"https://github.com/Shavit-Lab/Sparse-Expansion","relation":"software"}]},"day":"01","publisher":"ICLR","page":"26244-26274","citation":{"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.","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.","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.","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.","short":"S. Sawmya, L. Kong, I. Markov, D.-A. Alistarh, N. Shavit, in:, 13th International Conference on Learning Representations, ICLR, 2025, pp. 26244–26274."},"publication":"13th International Conference on Learning Representations","ddc":["000"],"arxiv":1,"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.","conference":{"location":"Singapore, Singapore","name":"ICLR: International Conference on Learning Representations","end_date":"2025-04-28","start_date":"2025-04-24"},"OA_type":"diamond","status":"public","abstract":[{"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.","lang":"eng"}],"scopus_import":"1","date_published":"2025-04-01T00:00:00Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"20110","file_size":5447177,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_created":"2025-08-04T08:14:09Z","creator":"dernst","date_updated":"2025-08-04T08:14:09Z","file_name":"2025_ICLR_Sawmya.pdf","success":1,"checksum":"39a8fa7dbdd7029859e156f53f20f6bc"}],"author":[{"last_name":"Sawmya","full_name":"Sawmya, Shashata","first_name":"Shashata"},{"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"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"},{"last_name":"Shavit","full_name":"Shavit, Nir","first_name":"Nir"}],"publication_status":"published","title":"Wasserstein distances, neuronal entanglement, and sparsity","oa_version":"Published Version","_id":"20037","year":"2025","month":"04","article_processing_charge":"No"},{"oa_version":"Published Version","year":"2025","_id":"20038","title":"The journey matters: Average parameter count over pre-training unifies sparse and dense scaling laws","article_processing_charge":"No","month":"04","status":"public","scopus_import":"1","date_published":"2025-04-01T00:00:00Z","abstract":[{"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.","lang":"eng"}],"conference":{"end_date":"2025-04-28","name":"ICLR: International Conference on Learning Representations","start_date":"2025-04-24","location":"Singapore, Singapore"},"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).","arxiv":1,"ddc":["000"],"OA_type":"diamond","author":[{"last_name":"Jin","first_name":"Tian","full_name":"Jin, Tian"},{"first_name":"Ahmed Imtiaz","full_name":"Humayun, Ahmed Imtiaz","last_name":"Humayun"},{"last_name":"Evci","full_name":"Evci, Utku","first_name":"Utku"},{"last_name":"Subramanian","full_name":"Subramanian, Suvinay","first_name":"Suvinay"},{"last_name":"Yazdanbakhsh","full_name":"Yazdanbakhsh, Amir","first_name":"Amir"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"},{"last_name":"Dziugaite","full_name":"Dziugaite, Gintare Karolina","first_name":"Gintare Karolina"}],"publication_status":"published","oa":1,"file":[{"file_name":"2025_ICLR_Jin.pdf","date_updated":"2025-08-04T08:23:47Z","success":1,"checksum":"dbc27120e9aba67dffbd9e5d513a6803","file_id":"20111","file_size":704989,"relation":"main_file","content_type":"application/pdf","creator":"dernst","date_created":"2025-08-04T08:23:47Z","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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.","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.","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.","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."},"type":"conference","page":"85165-85181","day":"01","publisher":"ICLR","publication":"13th International Conference on Learning Representations","publication_identifier":{"isbn":["9798331320850"]},"quality_controlled":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["2501.12486 "]},"date_updated":"2025-08-04T08:24:59Z","OA_place":"publisher","has_accepted_license":"1","department":[{"_id":"DaAl"}],"date_created":"2025-07-20T22:02:03Z","file_date_updated":"2025-08-04T08:23:47Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}},{"OA_type":"green","arxiv":1,"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.","scopus_import":"1","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."}],"date_published":"2025-02-01T00:00:00Z","status":"public","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","article_type":"original","project":[{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"author":[{"id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","full_name":"Pedrotti, Francesco","first_name":"Francesco","last_name":"Pedrotti"}],"title":"Contractive coupling rates and curvature lower bounds for Markov chains","issue":"1","_id":"20040","year":"2025","oa_version":"Preprint","month":"02","article_processing_charge":"No","OA_place":"repository","date_updated":"2025-11-05T13:50:07Z","corr_author":"1","external_id":{"arxiv":["2308.00516"],"isi":["001434322900006"]},"quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":" 35","publication_identifier":{"issn":["1050-5164"]},"date_created":"2025-07-21T07:49:15Z","department":[{"_id":"JaMa"}],"doi":"10.1214/24-aap2113","day":"01","publisher":"Institute of Mathematical Statistics","page":"196 - 250","type":"journal_article","ec_funded":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"17351"}]},"citation":{"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.","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","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.","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.","short":"F. Pedrotti, The Annals of Applied Probability 35 (2025) 196–250."},"volume":35,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2308.00516","open_access":"1"}],"publication":"The Annals of Applied Probability"},{"status":"public","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."}],"date_published":"2025-03-20T00:00:00Z","arxiv":1,"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.","OA_type":"gold","author":[{"last_name":"Groechenig","full_name":"Groechenig, Michael","first_name":"Michael"},{"orcid":"0000-0002-4444-8718","last_name":"Shen","first_name":"Shiyu","id":"544cccd3-9005-11ec-87bc-94aef1c5b814","full_name":"Shen, Shiyu"}],"publication_status":"epub_ahead","article_type":"original","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"oa_version":"Published Version","_id":"20043","year":"2025","title":"Complex K-theory of moduli spaces of Higgs bundles","article_processing_charge":"Yes","month":"03","publication_identifier":{"eissn":["1435-9863"],"issn":["1435-9855"]},"quality_controlled":"1","language":[{"iso":"eng"}],"corr_author":"1","external_id":{"isi":["001608254800001"],"arxiv":["2212.10695"]},"OA_place":"publisher","date_updated":"2026-02-19T09:24:54Z","department":[{"_id":"TaHa"}],"date_created":"2025-07-21T07:54:50Z","DOAJ_listed":"1","citation":{"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.","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","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).","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.","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"},"ec_funded":1,"type":"journal_article","day":"20","doi":"10.4171/jems/1601","publisher":"EMS Press","publication":"Journal of the European Mathematical Society","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4171/JEMS/1601"}]},{"external_id":{"isi":["001477180800001"]},"has_accepted_license":"1","OA_place":"publisher","date_updated":"2025-09-30T14:06:38Z","publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":" 79","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"BeVi"}],"PlanS_conform":"1","date_created":"2025-07-21T07:57:28Z","file_date_updated":"2025-07-22T10:04:57Z","type":"journal_article","ec_funded":1,"doi":"10.1093/evolut/qpaf061","day":"01","publisher":"Oxford University Press","page":"1243-1255","volume":79,"citation":{"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.","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","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.","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","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.","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.","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."},"publication":"Evolution","ddc":["570"],"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.","OA_type":"hybrid","status":"public","date_published":"2025-07-01T00:00:00Z","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."}],"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"file":[{"access_level":"open_access","creator":"dernst","date_created":"2025-07-22T10:04:57Z","content_type":"application/pdf","file_size":8150623,"relation":"main_file","file_id":"20068","checksum":"68c4c996d0e8c9ee3d4fb61bca75b31a","success":1,"date_updated":"2025-07-22T10:04:57Z","file_name":"2025_Evolution_Connallon.pdf"}],"author":[{"last_name":"Connallon","first_name":"Tim","full_name":"Connallon, Tim"},{"full_name":"Czuppon, Peter","first_name":"Peter","last_name":"Czuppon"},{"first_name":"Colin","full_name":"Olito, Colin","last_name":"Olito"},{"last_name":"Goedert","first_name":"Debora","full_name":"Goedert, Debora"},{"full_name":"Kokko, Hanna","first_name":"Hanna","last_name":"Kokko"},{"first_name":"Angela","full_name":"Nava-Bolaños, Angela","last_name":"Nava-Bolaños"},{"full_name":"Nilén, Sofie","first_name":"Sofie","last_name":"Nilén"},{"full_name":"Svensson, Erik I","first_name":"Erik I","last_name":"Svensson"},{"first_name":"Martyna","full_name":"Zwoinska, Martyna","last_name":"Zwoinska"},{"last_name":"Dutoit","full_name":"Dutoit, Ludovic","first_name":"Ludovic"},{"last_name":"Ruzicka","first_name":"Filip","full_name":"Ruzicka, Filip","id":"347955dd-57b0-11ee-9095-c28bdd368f4b"}],"article_type":"original","publication_status":"published","project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413"}],"title":"Predicting the prevalence of genetic trade-offs among adaptive substitutions","oa_version":"Published Version","_id":"20044","issue":"7","year":"2025","month":"07","article_processing_charge":"Yes (in subscription journal)"},{"_id":"20045","year":"2025","oa_version":"Preprint","title":"Renormalized Bogoliubov theory for the Nelson model","article_processing_charge":"No","month":"05","date_published":"2025-05-06T00:00:00Z","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."}],"status":"public","OA_type":"green","arxiv":1,"publication_status":"epub_ahead","article_type":"original","author":[{"last_name":"Falconi","full_name":"Falconi, Marco","first_name":"Marco"},{"first_name":"Jonas","full_name":"Lampart, Jonas","last_name":"Lampart"},{"first_name":"Nikolai","full_name":"Leopold, Nikolai","last_name":"Leopold"},{"first_name":"David Johannes","id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","full_name":"Mitrouskas, David Johannes","last_name":"Mitrouskas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"DOAJ_listed":"1","citation":{"ista":"Falconi M, Lampart J, Leopold N, Mitrouskas DJ. 2025. Renormalized Bogoliubov theory for the Nelson model. Annales de l’Institut Henri Poincaré C.","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","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.","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.","short":"M. Falconi, J. Lampart, N. Leopold, D.J. Mitrouskas, Annales de l’Institut Henri Poincaré C (2025).","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.","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"},"doi":"10.4171/aihpc/154","day":"06","publisher":"EMS Press","type":"journal_article","publication":"Annales de l'Institut Henri Poincaré C","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2305.06722"}],"language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"eissn":["1873-1430"],"issn":["0294-1449"]},"OA_place":"repository","date_updated":"2025-12-30T07:31:09Z","external_id":{"arxiv":["2305.06722"]},"date_created":"2025-07-21T07:59:16Z","department":[{"_id":"RoSe"}]},{"department":[{"_id":"LaEr"}],"date_created":"2025-07-21T08:06:18Z","file_date_updated":"2025-07-23T08:35:53Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publication_identifier":{"eissn":["1083-6489"]},"quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":" 30","corr_author":"1","external_id":{"isi":["001540927000024"],"arxiv":["2211.17175"]},"OA_place":"publisher","has_accepted_license":"1","date_updated":"2025-09-30T14:07:19Z","publication":"Electronic Journal of Probability","volume":30,"DOAJ_listed":"1","citation":{"short":"A.J. Campbell, K. Luh, S. O’Rourke, S. Arenas-Velilla, V. Perez-Abreu, Electronic Journal of Probability 30 (2025) 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.","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","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.","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.","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","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."},"ec_funded":1,"type":"journal_article","doi":"10.1214/25-ejp1366","publisher":"Institute of Mathematical Statistics","day":"27","page":"1-52","author":[{"last_name":"Campbell","first_name":"Andrew J","id":"582b06a9-1f1c-11ee-b076-82ffce00dde4","full_name":"Campbell, Andrew J"},{"first_name":"Kyle","full_name":"Luh, Kyle","last_name":"Luh"},{"first_name":"Sean","full_name":"O’Rourke, Sean","last_name":"O’Rourke"},{"last_name":"Arenas-Velilla","full_name":"Arenas-Velilla, Santiago","first_name":"Santiago"},{"last_name":"Perez-Abreu","full_name":"Perez-Abreu, Victor","first_name":"Victor"}],"article_type":"original","publication_status":"published","project":[{"call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"file":[{"success":1,"checksum":"a7a9f2bb7a6295786c16d4c7bd612621","date_updated":"2025-07-23T08:35:53Z","file_name":"2025_ElectronJourProbab_Campbell.pdf","content_type":"application/pdf","access_level":"open_access","creator":"dernst","date_created":"2025-07-23T08:35:53Z","file_id":"20069","relation":"main_file","file_size":580591}],"status":"public","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."}],"date_published":"2025-06-27T00:00:00Z","ddc":["510"],"arxiv":1,"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. ","OA_type":"gold","article_processing_charge":"Yes","month":"06","oa_version":"Published Version","_id":"20046","year":"2025","title":"Extreme eigenvalues of Laplacian random matrices with Gaussian entries"},{"month":"06","pmid":1,"article_processing_charge":"Yes (via OA deal)","title":"Hoxb genes determine the timing of cell ingression by regulating cell surface fluctuations during zebrafish gastrulation","oa_version":"Published Version","year":"2025","issue":"12","_id":"20048","oa":1,"file":[{"file_name":"2025_Development_Moriyama.pdf","date_updated":"2025-07-23T08:43:01Z","checksum":"808d8aa28df79d23fb661838d1fdc1be","success":1,"file_size":25935563,"relation":"main_file","file_id":"20070","date_created":"2025-07-23T08:43:01Z","creator":"dernst","access_level":"open_access","content_type":"application/pdf"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"id":"addc9b8c-67a0-11f0-b374-a2e094825470","full_name":"Moriyama, Yuuta","first_name":"Yuuta","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"}],"publication_status":"published","article_type":"original","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.","ddc":["570"],"OA_type":"hybrid","status":"public","abstract":[{"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.","lang":"eng"}],"date_published":"2025-06-27T00:00:00Z","scopus_import":"1","publication":"Development","type":"journal_article","doi":"10.1242/dev.204261","day":"27","publisher":"The Company of Biologists","volume":152,"citation":{"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.","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","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.","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.","short":"Y. Moriyama, T. Mitsui, C.-P.J. Heisenberg, Development 152 (2025).","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.","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"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_number":"dev204261","department":[{"_id":"CaHe"}],"PlanS_conform":"1","date_created":"2025-07-21T08:10:32Z","file_date_updated":"2025-07-23T08:43:01Z","external_id":{"isi":["001525252300001"],"pmid":["40576478"]},"corr_author":"1","date_updated":"2025-09-30T14:07:51Z","OA_place":"publisher","has_accepted_license":"1","publication_identifier":{"issn":["0950-1991"],"eissn":["1477-9129"]},"intvolume":" 152","language":[{"iso":"eng"}],"quality_controlled":"1"},{"article_processing_charge":"No","month":"06","issue":"3","_id":"20050","year":"2025","oa_version":"Preprint","title":"L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model","publication_status":"published","article_type":"original","project":[{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"},{"name":"The impact of deleterious mutations on small populations","_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8","grant_number":"26293"}],"author":[{"first_name":"Kseniia","full_name":"Khudiakova, Kseniia","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","last_name":"Khudiakova","orcid":"0000-0002-6246-1465"},{"last_name":"Maas","orcid":"0000-0002-0845-1338","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan"},{"last_name":"Pedrotti","full_name":"Pedrotti, Francesco","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","first_name":"Francesco"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"abstract":[{"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.","lang":"eng"}],"scopus_import":"1","date_published":"2025-06-01T00:00:00Z","status":"public","OA_type":"green","arxiv":1,"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.","publication":"The Annals of Applied Probability","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2402.04151","open_access":"1"}],"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","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.","short":"K. Khudiakova, J. Maas, F. Pedrotti, The Annals of Applied Probability 35 (2025) 1913–1940.","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","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.","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."},"volume":35,"publisher":"Institute of Mathematical Statistics","doi":"10.1214/25-aap2162","day":"01","page":"1913-1940","type":"journal_article","related_material":{"record":[{"id":"17352","relation":"earlier_version","status":"public"}]},"date_created":"2025-07-21T08:13:54Z","department":[{"_id":"JaMa"}],"quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":" 35","publication_identifier":{"issn":["1050-5164"]},"OA_place":"repository","date_updated":"2025-09-30T14:12:48Z","corr_author":"1","external_id":{"isi":["001523520000012"],"arxiv":["2402.04151"]}},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"MoHe"}],"date_created":"2025-07-21T08:16:15Z","file_date_updated":"2025-08-04T09:10:55Z","corr_author":"1","external_id":{"isi":["001525534800066"],"arxiv":["2505.02765"]},"OA_place":"publisher","has_accepted_license":"1","date_updated":"2025-10-16T13:08:45Z","publication_identifier":{"isbn":[" 9798400718854"]},"quality_controlled":"1","language":[{"iso":"eng"}],"publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing","ec_funded":1,"type":"conference","publisher":"Association for Computing Machinery","day":"13","doi":"10.1145/3732772.3733505","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","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.","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.","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.","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.","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","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."},"oa":1,"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","date_created":"2025-08-04T09:10:55Z","creator":"dernst","content_type":"application/pdf","file_size":2200347,"relation":"main_file","file_id":"20115","checksum":"52976d226f3f691aa519d71c1c718fa5","success":1,"date_updated":"2025-08-04T09:10:55Z","file_name":"2025_PODC_ElHayek.pdf"}],"author":[{"orcid":"0000-0003-4268-7368","last_name":"El-Hayek","full_name":"El-Hayek, Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725","first_name":"Antoine"},{"last_name":"Elsässer","first_name":"Robert","full_name":"Elsässer, Robert"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"publication_status":"published","project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"ddc":["000"],"arxiv":1,"conference":{"end_date":"2025-06-20","name":"PODC: Symposium on Principles of Distributed Computing","start_date":"2025-06-16","location":"Huatulco, Mexico"},"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).","OA_type":"hybrid","status":"public","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)."}],"date_published":"2025-06-13T00:00:00Z","month":"06","article_processing_charge":"Yes (via OA deal)","title":"An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model","oa_version":"Published Version","_id":"20051","year":"2025"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2025-07-21T08:17:04Z","file_date_updated":"2025-08-05T07:32:01Z","department":[{"_id":"MoHe"}],"date_updated":"2026-02-16T11:46:37Z","has_accepted_license":"1","OA_place":"publisher","external_id":{"isi":["001525534800069"]},"corr_author":"1","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9798400718854"]},"publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing","page":"549-552","day":"13","publisher":"Association for Computing Machinery","doi":"10.1145/3732772.3733512","type":"conference","ec_funded":1,"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","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.","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.","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.","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.","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","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."},"file":[{"file_size":549706,"relation":"main_file","file_id":"20123","access_level":"open_access","creator":"dernst","date_created":"2025-08-05T07:32:01Z","content_type":"application/pdf","date_updated":"2025-08-05T07:32:01Z","file_name":"2025_PODC_Breitkopf.pdf","checksum":"e99679ffb28877b7cea4d54860302790","success":1}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"oa":1,"project":[{"name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"publication_status":"published","author":[{"last_name":"Breitkopf","full_name":"Breitkopf, Tom-Lukas","first_name":"Tom-Lukas"},{"first_name":"Julien","full_name":"Dallot, Julien","last_name":"Dallot"},{"last_name":"El-Hayek","orcid":"0000-0003-4268-7368","first_name":"Antoine","full_name":"El-Hayek, Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"OA_type":"hybrid","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). ","conference":{"location":"Huatulco, Mexico","start_date":"2025-06-16","end_date":"2025-06-20","name":"PODC: Symposium on Principles of Distributed Computing"},"ddc":["000"],"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."}],"date_published":"2025-06-13T00:00:00Z","status":"public","month":"06","article_processing_charge":"No","title":"Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols","year":"2025","_id":"20052","oa_version":"Published Version"},{"corr_author":"1","external_id":{"isi":["001525534800030"]},"has_accepted_license":"1","OA_place":"publisher","date_updated":"2026-02-16T11:46:51Z","publication_identifier":{"isbn":["9798400718854"]},"quality_controlled":"1","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"KrCh"},{"_id":"KrPi"}],"date_created":"2025-07-21T08:18:26Z","file_date_updated":"2025-08-05T07:15:31Z","type":"conference","ec_funded":1,"day":"13","publisher":"Association for Computing Machinery","doi":"10.1145/3732772.3733544","page":"241-251","citation":{"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.","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","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.","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.","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.","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.","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"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/745"}],"publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing","ddc":["000"],"conference":{"start_date":"2025-06-16","name":"PODC: Symposium on Principles of Distributed Computing","end_date":"2025-06-20","location":"Huatulco, Mexico"},"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.","OA_type":"hybrid","status":"public","date_published":"2025-06-13T00:00:00Z","abstract":[{"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.","lang":"eng"}],"oa":1,"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"cd628fe54d96e9fc6cc789bb8145422b","success":1,"file_name":"2025_PODC_Chatterjee.pdf","date_updated":"2025-08-05T07:15:31Z","date_created":"2025-08-05T07:15:31Z","creator":"dernst","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_size":783297,"file_id":"20122"}],"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Gilbert","first_name":"Seth","full_name":"Gilbert, Seth"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Svoboda","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub"},{"last_name":"Yeo","orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","full_name":"Yeo, Michelle X","first_name":"Michelle X"}],"publication_status":"published","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"title":"When is liquid democracy possible?: On the manipulation of variance","oa_version":"Published Version","_id":"20053","year":"2025","month":"06","article_processing_charge":"No"},{"status":"public","date_published":"2025-03-03T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"location":"Sevilla, Spain","end_date":"2025-03-07","name":"MATSUS: Materials for Sustainable Development Conference","start_date":"2025-03-03"},"corr_author":"1","date_updated":"2025-09-23T09:04:03Z","article_number":"220","author":[{"last_name":"Horta","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","full_name":"Horta, Sharona","first_name":"Sharona"}],"department":[{"_id":"MaIb"}],"publication_status":"published","date_created":"2025-07-21T08:22:29Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","year":"2025","_id":"20054","citation":{"ieee":"S. Horta, “Solid state diffusion in metal-semiconductors core-shell nanoparticle,” in Proceedings of the MATSUS Spring 2025 Conference, Sevilla, Spain, 2025.","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.","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","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.","short":"S. Horta, in:, Proceedings of the MATSUS Spring 2025 Conference, Fundació de la comunitat valenciana SCITO, 2025.","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.","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"},"title":"Solid state diffusion in metal-semiconductors core-shell nanoparticle","type":"conference_abstract","doi":"10.29363/nanoge.matsusspring.2025.220","publisher":"Fundació de la comunitat valenciana SCITO","day":"03","article_processing_charge":"No","publication":"Proceedings of the MATSUS Spring 2025 Conference","month":"03"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NMR"},{"_id":"LifeSc"}],"project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"date_created":"2025-07-21T08:33:20Z","publication_status":"published","author":[{"last_name":"Lee","orcid":"0000-0002-6962-8598","first_name":"Seungho","full_name":"Lee, Seungho","id":"BB243B88-D767-11E9-B658-BC13E6697425"},{"orcid":"0000-0001-7597-043X","last_name":"Balazs","first_name":"Daniel","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","full_name":"Balazs, Daniel"},{"first_name":"Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","full_name":"Horta, Sharona","last_name":"Horta"},{"last_name":"Rayaroth Puthiyaveettil","first_name":"Aiswarya","full_name":"Rayaroth Puthiyaveettil, Aiswarya","id":"8aceb01b-8972-11ed-ae7b-d5fe53775add"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez"}],"article_number":"173","department":[{"_id":"MaIb"},{"_id":"LifeSc"}],"date_updated":"2026-02-19T09:25:57Z","OA_type":"closed access","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).","conference":{"name":"MATSUS: Materials for Sustainable Development Conference","end_date":"2025-03-07","start_date":"2025-03-03","location":"Sevilla, Spain"},"corr_author":"1","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."}],"quality_controlled":"1","language":[{"iso":"eng"}],"date_published":"2025-03-15T00:00:00Z","status":"public","month":"03","publication":"Proceedings of the MATSUS Spring 2025 Conference","article_processing_charge":"No","publisher":"Fundació de la comunitat valenciana SCITO","doi":"10.29363/nanoge.matsusspring.2025.173","day":"15","title":"Reaction precursor-mediated formation of stable supercrystals in colloidal nanocrystal synthesis: PbTe case","type":"conference","year":"2025","_id":"20055","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","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.","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.","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.","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","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.","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."},"oa_version":"None"},{"date_created":"2025-07-21T08:37:27Z","department":[{"_id":"EdHa"}],"OA_place":"repository","date_updated":"2025-09-30T14:14:43Z","external_id":{"pmid":["40179429"],"isi":["001433250500001"],"arxiv":["2205.02645"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":" 205","publication_identifier":{"eissn":["1537-5323"],"issn":["0003-0147"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2205.02645","open_access":"1"}],"publication":"The American Naturalist","day":"01","doi":"10.1086/734083","publisher":"University of Chicago Press","page":"E100-E117","type":"journal_article","related_material":{"record":[{"status":"public","id":"20121","relation":"software"}]},"citation":{"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.","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","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.","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.","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"},"volume":205,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"oa":1,"article_type":"original","publication_status":"published","project":[{"name":"A mechano-chemical theory for stem cell fate decisions in organoid development","grant_number":"ALTF 343-2022","_id":"34e2a5b5-11ca-11ed-8bc3-b2265616ef0b"}],"author":[{"last_name":"Nabeel","first_name":"Arshed","full_name":"Nabeel, Arshed"},{"first_name":"Ashwin","full_name":"Karichannavar, Ashwin","last_name":"Karichannavar"},{"last_name":"Palathingal","first_name":"Shuaib","full_name":"Palathingal, Shuaib"},{"last_name":"Jhawar","first_name":"Jitesh","full_name":"Jhawar, Jitesh"},{"orcid":"0000-0001-7205-2975","last_name":"Brückner","id":"e1e86031-6537-11eb-953a-f7ab92be508d","full_name":"Brückner, David","first_name":"David"},{"last_name":"Raj M","full_name":"Raj M, Danny","first_name":"Danny"},{"full_name":"Guttal, Vishwesha","first_name":"Vishwesha","last_name":"Guttal"}],"OA_type":"green","arxiv":1,"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","date_published":"2025-04-01T00:00:00Z","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)."}],"status":"public","pmid":1,"month":"04","article_processing_charge":"No","title":"Discovering stochastic dynamical equations from ecological time series data","_id":"20056","issue":"4","year":"2025","oa_version":"Preprint"},{"file":[{"checksum":"f5e059e66803fa54249c1db029aef0f6","success":1,"date_updated":"2025-07-31T09:11:09Z","file_name":"2025_Biology_Rosani.pdf","access_level":"open_access","creator":"dernst","date_created":"2025-07-31T09:11:09Z","content_type":"application/pdf","relation":"main_file","file_size":1885781,"file_id":"20097"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"article_type":"original","publication_status":"published","author":[{"last_name":"Rosani","first_name":"Umberto","full_name":"Rosani, Umberto"},{"last_name":"Altan","full_name":"Altan, Nehir","first_name":"Nehir"},{"last_name":"Venier","full_name":"Venier, Paola","first_name":"Paola"},{"last_name":"Bortoletto","first_name":"Enrico","full_name":"Bortoletto, Enrico"},{"last_name":"Volpi","full_name":"Volpi, Nicola","first_name":"Nicola"},{"orcid":"0000-0003-0893-7036","last_name":"Bernecky","full_name":"Bernecky, Carrie A","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","first_name":"Carrie A"}],"OA_type":"gold","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)).","ddc":["570"],"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."}],"date_published":"2025-07-24T00:00:00Z","status":"public","month":"07","article_processing_charge":"Yes","title":"Ancestral origin and functional expression of a hyaluronic acid pathway complement in mussels","year":"2025","issue":"8","_id":"20077","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file_date_updated":"2025-07-31T09:11:09Z","date_created":"2025-07-25T08:28:26Z","article_number":"930","department":[{"_id":"CaBe"}],"PlanS_conform":"1","date_updated":"2025-09-30T14:10:07Z","has_accepted_license":"1","OA_place":"publisher","external_id":{"isi":["001557922100001"]},"intvolume":" 14","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2079-7737"]},"publication":"Biology","day":"24","doi":"10.3390/biology14080930","publisher":"MDPI","type":"journal_article","DOAJ_listed":"1","citation":{"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.","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","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.","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.","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","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.","short":"U. Rosani, N. Altan, P. Venier, E. Bortoletto, N. Volpi, C. Bernecky, Biology 14 (2025)."},"volume":14},{"author":[{"last_name":"Barańczuk","first_name":"Stefan","full_name":"Barańczuk, Stefan"},{"last_name":"Naskręcki","full_name":"Naskręcki, Bartosz","first_name":"Bartosz"},{"id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","full_name":"Verzobio, Matteo","first_name":"Matteo","last_name":"Verzobio","orcid":"0000-0002-0854-0306"}],"publication_status":"epub_ahead","article_type":"original","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"status":"public","scopus_import":"1","date_published":"2025-07-23T00:00:00Z","abstract":[{"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.","lang":"eng"}],"arxiv":1,"OA_type":"hybrid","article_processing_charge":"Yes (via OA deal)","month":"07","oa_version":"Published Version","year":"2025","_id":"20078","title":"Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve","department":[{"_id":"TiBr"}],"PlanS_conform":"1","date_created":"2025-07-27T22:01:25Z","publication_identifier":{"issn":["0022-314X"]},"intvolume":" 279","quality_controlled":"1","language":[{"iso":"eng"}],"external_id":{"isi":["001541172400002"],"arxiv":["2309.09699"]},"corr_author":"1","date_updated":"2025-09-30T14:09:38Z","OA_place":"publisher","publication":"Journal of Number Theory","main_file_link":[{"url":"https://doi.org/10.1016/j.jnt.2025.06.001","open_access":"1"}],"volume":279,"citation":{"short":"S. Barańczuk, B. Naskręcki, M. Verzobio, Journal of Number Theory 279 (2025) 170–183.","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.","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","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.","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","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."},"type":"journal_article","page":"170-183","day":"23","doi":"10.1016/j.jnt.2025.06.001","publisher":"Elsevier"}]