@article{14441, abstract = {We study the Fröhlich polaron model in R3, and establish the subleading term in the strong coupling asymptotics of its ground state energy, corresponding to the quantum corrections to the classical energy determined by the Pekar approximation.}, author = {Brooks, Morris and Seiringer, Robert}, issn = {1432-0916}, journal = {Communications in Mathematical Physics}, pages = {287--337}, publisher = {Springer Nature}, title = {{The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy}}, doi = {10.1007/s00220-023-04841-3}, volume = {404}, year = {2023}, } @article{14442, abstract = {In the presence of an obstacle, active particles condensate into a surface “wetting” layer due to persistent motion. If the obstacle is asymmetric, a rectification current arises in addition to wetting. Asymmetric geometries are therefore commonly used to concentrate microorganisms like bacteria and sperms. However, most studies neglect the fact that biological active matter is diverse, composed of individuals with distinct self-propulsions. Using simulations, we study a mixture of “fast” and “slow” active Brownian disks in two dimensions interacting with large half-disk obstacles. With this prototypical obstacle geometry, we analyze how the stationary collective behavior depends on the degree of self-propulsion “diversity,” defined as proportional to the difference between the self-propulsion speeds, while keeping the average self-propulsion speed fixed. A wetting layer rich in fast particles arises. The rectification current is amplified by speed diversity due to a superlinear dependence of rectification on self-propulsion speed, which arises from cooperative effects. Thus, the total rectification current cannot be obtained from an effective one-component active fluid with the same average self-propulsion speed, highlighting the importance of considering diversity in active matter.}, author = {Rojas Vega, Mauricio Nicolas and De Castro, Pablo and Soto, Rodrigo}, issn = {1292-895X}, journal = {The European Physical Journal E}, number = {10}, publisher = {Springer Nature}, title = {{Mixtures of self-propelled particles interacting with asymmetric obstacles}}, doi = {10.1140/epje/s10189-023-00354-y}, volume = {46}, year = {2023}, } @article{14443, abstract = {Importance Climate change, pollution, urbanization, socioeconomic inequality, and psychosocial effects of the COVID-19 pandemic have caused massive changes in environmental conditions that affect brain health during the life span, both on a population level as well as on the level of the individual. How these environmental factors influence the brain, behavior, and mental illness is not well known. Observations A research strategy enabling population neuroscience to contribute to identify brain mechanisms underlying environment-related mental illness by leveraging innovative enrichment tools for data federation, geospatial observation, climate and pollution measures, digital health, and novel data integration techniques is described. This strategy can inform innovative treatments that target causal cognitive and molecular mechanisms of mental illness related to the environment. An example is presented of the environMENTAL Project that is leveraging federated cohort data of over 1.5 million European citizens and patients enriched with deep phenotyping data from large-scale behavioral neuroimaging cohorts to identify brain mechanisms related to environmental adversity underlying symptoms of depression, anxiety, stress, and substance misuse. Conclusions and Relevance This research will lead to the development of objective biomarkers and evidence-based interventions that will significantly improve outcomes of environment-related mental illness.}, author = {Schumann, Gunter and Andreassen, Ole A. and Banaschewski, Tobias and Calhoun, Vince D. and Clinton, Nicholas and Desrivieres, Sylvane and Brandlistuen, Ragnhild Eek and Feng, Jianfeng and Hese, Soeren and Hitchen, Esther and Hoffmann, Per and Jia, Tianye and Jirsa, Viktor and Marquand, Andre F. and Nees, Frauke and Nöthen, Markus M. and Novarino, Gaia and Polemiti, Elli and Ralser, Markus and Rapp, Michael and Schepanski, Kerstin and Schikowski, Tamara and Slater, Mel and Sommer, Peter and Stahl, Bernd Carsten and Thompson, Paul M. and Twardziok, Sven and Van Der Meer, Dennis and Walter, Henrik and Westlye, Lars}, issn = {2168-6238}, journal = {JAMA Psychiatry}, number = {10}, pages = {1066--1074}, publisher = {American Medical Association}, title = {{Addressing global environmental challenges to mental health using population neuroscience: A review}}, doi = {10.1001/jamapsychiatry.2023.2996}, volume = {80}, year = {2023}, } @article{14444, abstract = {We prove several results about substructures in Latin squares. First, we explain how to adapt our recent work on high-girth Steiner triple systems to the setting of Latin squares, resolving a conjecture of Linial that there exist Latin squares with arbitrarily high girth. As a consequence, we see that the number of order- n Latin squares with no intercalate (i.e., no 2×2 Latin subsquare) is at least (e−9/4n−o(n))n2. Equivalently, P[N=0]≥e−n2/4−o(n2)=e−(1+o(1))EN , where N is the number of intercalates in a uniformly random order- n Latin square. In fact, extending recent work of Kwan, Sah, and Sawhney, we resolve the general large-deviation problem for intercalates in random Latin squares, up to constant factors in the exponent: for any constant 0<δ≤1 we have P[N≤(1−δ)EN]=exp(−Θ(n2)) and for any constant δ>0 we have P[N≥(1+δ)EN]=exp(−Θ(n4/3logn)). Finally, as an application of some new general tools for studying substructures in random Latin squares, we show that in almost all order- n Latin squares, the number of cuboctahedra (i.e., the number of pairs of possibly degenerate 2×2 submatrices with the same arrangement of symbols) is of order n4, which is the minimum possible. As observed by Gowers and Long, this number can be interpreted as measuring ``how associative'' the quasigroup associated with the Latin square is.}, author = {Kwan, Matthew Alan and Sah, Ashwin and Sawhney, Mehtaab and Simkin, Michael}, issn = {1565-8511}, journal = {Israel Journal of Mathematics}, number = {2}, pages = {363--416}, publisher = {Springer Nature}, title = {{Substructures in Latin squares}}, doi = {10.1007/s11856-023-2513-9}, volume = {256}, year = {2023}, } @article{14445, abstract = {We prove the following quantitative Borsuk–Ulam-type result (an equivariant analogue of Gromov’s Topological Overlap Theorem): Let X be a free ℤ/2-complex of dimension d with coboundary expansion at least ηk in dimension 0 ≤ k < d. Then for every equivariant map F: X →ℤ/2 ℝd, the fraction of d-simplices σ of X with 0 ∈ F (σ) is at least 2−d Π d−1k=0ηk. As an application, we show that for every sufficiently thick d-dimensional spherical building Y and every map f: Y → ℝ2d, we have f(σ) ∩ f(τ) ≠ ∅ for a constant fraction μd > 0 of pairs {σ, τ} of d-simplices of Y. In particular, such complexes are non-embeddable into ℝ2d, which proves a conjecture of Tancer and Vorwerk for sufficiently thick spherical buildings. We complement these results by upper bounds on the coboundary expansion of two families of simplicial complexes; this indicates some limitations to the bounds one can obtain by straighforward applications of the quantitative Borsuk–Ulam theorem. Specifically, we prove • an upper bound of (d + 1)/2d on the normalized (d − 1)-th coboundary expansion constant of complete (d + 1)-partite d-dimensional complexes (under a mild divisibility assumption on the sizes of the parts); and • an upper bound of (d + 1)/2d + ε on the normalized (d − 1)-th coboundary expansion of the d-dimensional spherical building associated with GLd+2(Fq) for any ε > 0 and sufficiently large q. This disproves, in a rather strong sense, a conjecture of Lubotzky, Meshulam and Mozes.}, author = {Wagner, Uli and Wild, Pascal}, issn = {1565-8511}, journal = {Israel Journal of Mathematics}, number = {2}, pages = {675--717}, publisher = {Springer Nature}, title = {{Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes}}, doi = {10.1007/s11856-023-2521-9}, volume = {256}, year = {2023}, } @article{14446, abstract = {Recent work has paid close attention to the first principle of Granger causality, according to which cause precedes effect. In this context, the question may arise whether the detected direction of causality also reverses after the time reversal of unidirectionally coupled data. Recently, it has been shown that for unidirectionally causally connected autoregressive (AR) processes X → Y, after time reversal of data, the opposite causal direction Y → X is indeed detected, although typically as part of the bidirectional X↔ Y link. As we argue here, the answer is different when the measured data are not from AR processes but from linked deterministic systems. When the goal is the usual forward data analysis, cross-mapping-like approaches correctly detect X → Y, while Granger causality-like approaches, which should not be used for deterministic time series, detect causal independence X → Y. The results of backward causal analysis depend on the predictability of the reversed data. Unlike AR processes, observables from deterministic dynamical systems, even complex nonlinear ones, can be predicted well forward, while backward predictions can be difficult (notably when the time reversal of a function leads to one-to-many relations). To address this problem, we propose an approach based on models that provide multiple candidate predictions for the target, combined with a loss function that consideres only the best candidate. The resulting good forward and backward predictability supports the view that unidirectionally causally linked deterministic dynamical systems X → Y can be expected to detect the same link both before and after time reversal.}, author = {Jakubík, Jozef and Bui Thi Mai, Phuong and Chvosteková, Martina and Krakovská, Anna}, issn = {1335-8871}, journal = {Measurement Science Review}, number = {4}, pages = {175--183}, publisher = {Sciendo}, title = {{Against the flow of time with multi-output models}}, doi = {10.2478/msr-2023-0023}, volume = {23}, year = {2023}, } @inproceedings{14448, abstract = {We consider the problem of solving LP relaxations of MAP-MRF inference problems, and in particular the method proposed recently in [16], [35]. As a key computational subroutine, it uses a variant of the Frank-Wolfe (FW) method to minimize a smooth convex function over a combinatorial polytope. We propose an efficient implementation of this subroutine based on in-face Frank-Wolfe directions, introduced in [4] in a different context. More generally, we define an abstract data structure for a combinatorial subproblem that enables in-face FW directions, and describe its specialization for tree-structured MAP-MRF inference subproblems. Experimental results indicate that the resulting method is the current state-of-art LP solver for some classes of problems. Our code is available at pub.ist.ac.at/~vnk/papers/IN-FACE-FW.html.}, author = {Kolmogorov, Vladimir}, booktitle = {Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition}, isbn = {9798350301298}, issn = {1063-6919}, location = {Vancouver, Canada}, pages = {11980--11989}, publisher = {IEEE}, title = {{Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions}}, doi = {10.1109/CVPR52729.2023.01153}, volume = {2023}, year = {2023}, } @article{14449, abstract = {The rapid development of machine learning (ML) techniques has opened up the data-dense field of microbiome research for novel therapeutic, diagnostic, and prognostic applications targeting a wide range of disorders, which could substantially improve healthcare practices in the era of precision medicine. However, several challenges must be addressed to exploit the benefits of ML in this field fully. In particular, there is a need to establish “gold standard” protocols for conducting ML analysis experiments and improve interactions between microbiome researchers and ML experts. The Machine Learning Techniques in Human Microbiome Studies (ML4Microbiome) COST Action CA18131 is a European network established in 2019 to promote collaboration between discovery-oriented microbiome researchers and data-driven ML experts to optimize and standardize ML approaches for microbiome analysis. This perspective paper presents the key achievements of ML4Microbiome, which include identifying predictive and discriminatory ‘omics’ features, improving repeatability and comparability, developing automation procedures, and defining priority areas for the novel development of ML methods targeting the microbiome. The insights gained from ML4Microbiome will help to maximize the potential of ML in microbiome research and pave the way for new and improved healthcare practices.}, author = {D’Elia, Domenica and Truu, Jaak and Lahti, Leo and Berland, Magali and Papoutsoglou, Georgios and Ceci, Michelangelo and Zomer, Aldert and Lopes, Marta B. and Ibrahimi, Eliana and Gruca, Aleksandra and Nechyporenko, Alina and Frohme, Marcus and Klammsteiner, Thomas and Pau, Enrique Carrillo De Santa and Marcos-Zambrano, Laura Judith and Hron, Karel and Pio, Gianvito and Simeon, Andrea and Suharoschi, Ramona and Moreno-Indias, Isabel and Temko, Andriy and Nedyalkova, Miroslava and Apostol, Elena Simona and Truică, Ciprian Octavian and Shigdel, Rajesh and Telalović, Jasminka Hasić and Bongcam-Rudloff, Erik and Przymus, Piotr and Jordamović, Naida Babić and Falquet, Laurent and Tarazona, Sonia and Sampri, Alexia and Isola, Gaetano and Pérez-Serrano, David and Trajkovik, Vladimir and Klucar, Lubos and Loncar-Turukalo, Tatjana and Havulinna, Aki S. and Jansen, Christian and Bertelsen, Randi J. and Claesson, Marcus Joakim}, issn = {1664-302X}, journal = {Frontiers in Microbiology}, publisher = {Frontiers}, title = {{Advancing microbiome research with machine learning: Key findings from the ML4Microbiome COST action}}, doi = {10.3389/fmicb.2023.1257002}, volume = {14}, year = {2023}, } @article{14452, abstract = {The classical infinitesimal model is a simple and robust model for the inheritance of quantitative traits. In this model, a quantitative trait is expressed as the sum of a genetic and an environmental component, and the genetic component of offspring traits within a family follows a normal distribution around the average of the parents’ trait values, and has a variance that is independent of the parental traits. In previous work, we showed that when trait values are determined by the sum of a large number of additive Mendelian factors, each of small effect, one can justify the infinitesimal model as a limit of Mendelian inheritance. In this paper, we show that this result extends to include dominance. We define the model in terms of classical quantities of quantitative genetics, before justifying it as a limit of Mendelian inheritance as the number, M, of underlying loci tends to infinity. As in the additive case, the multivariate normal distribution of trait values across the pedigree can be expressed in terms of variance components in an ancestral population and probabilities of identity by descent determined by the pedigree. Now, with just first-order dominance effects, we require two-, three-, and four-way identities. We also show that, even if we condition on parental trait values, the “shared” and “residual” components of trait values within each family will be asymptotically normally distributed as the number of loci tends to infinity, with an error of order 1/M−−√⁠. We illustrate our results with some numerical examples.}, author = {Barton, Nicholas H and Etheridge, Alison M. and Véber, Amandine}, issn = {1943-2631}, journal = {Genetics}, number = {2}, publisher = {Oxford University Press}, title = {{The infinitesimal model with dominance}}, doi = {10.1093/genetics/iyad133}, volume = {225}, year = {2023}, } @article{14453, abstract = {Squall lines are substantially influenced by the interaction of low-level shear with cold pools associated with convective downdrafts. Beyond an optimal shear amplitude, squall lines tend to orient themselves at an angle with respect to the low-level shear. While the mechanisms behind squall line orientation seem to be increasingly well understood, uncertainties remain on the implications of this orientation. Roca and Fiolleau (2020, https://doi.org/10.1038/s43247-020-00015-4) show that long lived mesoscale convective systems, including squall lines, are disproportionately involved in rainfall extremes in the tropics. This article investigates the influence of the interaction between low-level shear and squall line outflow on squall line generated precipitation extrema in the tropics. Using a cloud resolving model, simulated squall lines in radiative convective equilibrium amid a shear-dominated regime (super optimal), a balanced regime (optimal), and an outflow dominated regime (suboptimal). Our results show that precipitation extremes in squall lines are 40% more intense in the case of optimal shear and remain 30% superior in the superoptimal regime relative to a disorganized case. With a theoretical scaling of precipitation extremes (C. Muller & Takayabu, 2020, https://doi.org/10.1088/1748-9326/ab7130), we show that the condensation rates control the amplification of precipitation extremes in tropical squall lines, mainly due to its change in vertical mass flux (dynamic component). The reduction of dilution by entrainment explains half of this change, consistent with Mulholland et al. (2021, https://doi.org/10.1175/jas-d-20-0299.1). The other half is explained by increased cloud-base velocity intensity in optimal and superoptimal squall lines.}, author = {Abramian, Sophie and Muller, Caroline J and Risi, Camille}, issn = {1942-2466}, journal = {Journal of Advances in Modeling Earth Systems}, number = {10}, publisher = {Wiley}, title = {{Extreme precipitation in tropical squall lines}}, doi = {10.1029/2022MS003477}, volume = {15}, year = {2023}, } @inproceedings{14454, abstract = {As AI and machine-learned software are used increasingly for making decisions that affect humans, it is imperative that they remain fair and unbiased in their decisions. To complement design-time bias mitigation measures, runtime verification techniques have been introduced recently to monitor the algorithmic fairness of deployed systems. Previous monitoring techniques assume full observability of the states of the (unknown) monitored system. Moreover, they can monitor only fairness properties that are specified as arithmetic expressions over the probabilities of different events. In this work, we extend fairness monitoring to systems modeled as partially observed Markov chains (POMC), and to specifications containing arithmetic expressions over the expected values of numerical functions on event sequences. The only assumptions we make are that the underlying POMC is aperiodic and starts in the stationary distribution, with a bound on its mixing time being known. These assumptions enable us to estimate a given property for the entire distribution of possible executions of the monitored POMC, by observing only a single execution. Our monitors observe a long run of the system and, after each new observation, output updated PAC-estimates of how fair or biased the system is. The monitors are computationally lightweight and, using a prototype implementation, we demonstrate their effectiveness on several real-world examples.}, author = {Henzinger, Thomas A and Kueffner, Konstantin and Mallik, Kaushik}, booktitle = {23rd International Conference on Runtime Verification}, isbn = {9783031442667}, issn = {1611-3349}, location = {Thessaloniki, Greece}, pages = {291--311}, publisher = {Springer Nature}, title = {{Monitoring algorithmic fairness under partial observations}}, doi = {10.1007/978-3-031-44267-4_15}, volume = {14245}, year = {2023}, } @article{14455, author = {Narzisi, Antonio and Halladay, Alycia and Masi, Gabriele and Novarino, Gaia and Lord, Catherine}, issn = {1664-0640}, journal = {Frontiers in Psychiatry}, publisher = {Frontiers}, title = {{Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment}}, doi = {10.3389/fpsyt.2023.1287879}, volume = {14}, year = {2023}, } @inproceedings{14456, abstract = {In this paper, we present novel algorithms that efficiently compute a shortest reconfiguration sequence between two given dominating sets in trees and interval graphs under the TOKEN SLIDING model. In this problem, a graph is provided along with its two dominating sets, which can be imagined as tokens placed on vertices. The objective is to find a shortest sequence of dominating sets that transforms one set into the other, with each set in the sequence resulting from sliding a single token in the previous set. While identifying any sequence has been well studied, our work presents the first polynomial algorithms for this optimization variant in the context of dominating sets.}, author = {Křišťan, Jan Matyáš and Svoboda, Jakub}, booktitle = {24th International Symposium on Fundamentals of Computation Theory}, isbn = {9783031435867}, issn = {1611-3349}, location = {Trier, Germany}, pages = {333--347}, publisher = {Springer Nature}, title = {{Shortest dominating set reconfiguration under token sliding}}, doi = {10.1007/978-3-031-43587-4_24}, volume = {14292}, year = {2023}, } @inproceedings{14457, abstract = {Threshold secret sharing allows a dealer to split a secret s into n shares, such that any t shares allow for reconstructing s, but no t-1 shares reveal any information about s. Leakage-resilient secret sharing requires that the secret remains hidden, even when an adversary additionally obtains a limited amount of leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n and conjectured that the same holds for t = c.n for any constant 0≤c≤1. Nielsen and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n). In this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy leakage-resilience, where a random subset of leakages is replaced by uniformly random noise. We prove a lower bound for Shamir’s secret sharing, similar to that of Nielsen and Simkin, which holds even when a constant fraction of leakages is replaced by random noise. To this end, we first prove a lower bound on the share size of any noisy-leakage-resilient sharing scheme. We then use this lower bound to show that there exist universal constants c1, c2, such that for sufficiently large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random noise. }, author = {Hoffmann, Charlotte and Simkin, Mark}, booktitle = {8th International Conference on Cryptology and Information Security in Latin America}, isbn = {9783031444685}, issn = {1611-3349}, location = {Quito, Ecuador}, pages = {215--228}, publisher = {Springer Nature}, title = {{Stronger lower bounds for leakage-resilient secret sharing}}, doi = {10.1007/978-3-031-44469-2_11}, volume = {14168}, year = {2023}, } @inproceedings{14460, abstract = {We provide an efficient implementation of the backpropagation algorithm, specialized to the case where the weights of the neural network being trained are sparse. Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and common layer types (e.g., convolutional or linear). We provide a fast vectorized implementation on commodity CPUs, and show that it can yield speedups in end-to-end runtime experiments, both in transfer learning using already-sparsified networks, and in training sparse networks from scratch. Thus, our results provide the first support for sparse training on commodity hardware.}, author = {Nikdan, Mahdi and Pegolotti, Tommaso and Iofinova, Eugenia B and Kurtic, Eldar and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the 40th International Conference on Machine Learning}, issn = {2640-3498}, location = {Honolulu, Hawaii, HI, United States}, pages = {26215--26227}, publisher = {ML Research Press}, title = {{SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge}}, volume = {202}, year = {2023}, } @inproceedings{14462, abstract = {We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation model. More specifically, we give an explicit factorization for the counting matrix Mcount and upper bound the error explicitly. We also give a fine-grained analysis, specifying the exact constant in the upper bound. Our analysis is based on upper and lower bounds of the completely bounded norm (cb-norm) of Mcount . Along the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large range of the dimension of Mcount. Furthermore, we are the first to give concrete error bounds for various problems under continual observation such as binary counting, maintaining a histogram, releasing an approximately cut-preserving synthetic graph, many graph-based statistics, and substring and episode counting. Finally, we note that our result can be used to get a fine-grained error bound for non-interactive local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private counting under continual observation. Subsequent to this work, Henzinger et al. (SODA, 2023) showed that our factorization also achieves fine-grained mean-squared error.}, author = {Fichtenberger, Hendrik and Henzinger, Monika H and Upadhyay, Jalaj}, booktitle = {Proceedings of the 40th International Conference on Machine Learning}, issn = {2640-3498}, location = {Honolulu, Hawaii, HI, United States}, pages = {10072--10092}, publisher = {ML Research Press}, title = {{Constant matters: Fine-grained error bound on differentially private continual observation}}, volume = {202}, year = {2023}, } @article{14464, abstract = {Given a triangle Δ, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of Δ with respect to area and perimeter. This problem was initially posed by Nandakumar [17, 22] and was first studied by Kiss, Pach, and Somlai [13], who showed that if Δ′ is the smallest area isosceles triangle containing Δ, then Δ′ and Δ share a side and an angle. In the present paper, we prove that for any triangle Δ, every maximum area isosceles triangle embedded in Δ and every maximum perimeter isosceles triangle embedded in Δ shares a side and an angle with Δ. Somewhat surprisingly, the case of minimum perimeter enclosing triangles is different: there are infinite families of triangles Δ whose minimum perimeter isosceles containers do not share a side and an angle with Δ.}, author = {Ambrus, Áron and Csikós, Mónika and Kiss, Gergely and Pach, János and Somlai, Gábor}, issn = {1793-6373}, journal = {International Journal of Foundations of Computer Science}, number = {7}, pages = {737--760}, publisher = {World Scientific Publishing}, title = {{Optimal embedded and enclosing isosceles triangles}}, doi = {10.1142/S012905412342008X}, volume = {34}, year = {2023}, } @misc{14472, abstract = {Data related to the following paper: "Stress granules plug and stabilize damaged endolysosomal membranes" (https://doi.org/10.1038/s41586-023-06726-w) Abstract: Endomembrane damage represents a form of stress that is detrimental for eukaryotic cells. To cope with this threat, cells possess mechanisms that repair the damage and restore cellular homeostasis. Endomembrane damage also results in organelle instability and the mechanisms by which cells stabilize damaged endomembranes to enable membrane repair remains unknown. In this work we use a minimal coarse-grained molecular dynamics system to explore how lipid vesicles undergoing poration in a protein-rich medium can be plugged and stabilised by condensate formation. The solution of proteins in and out of the vesicle is described by beads dispersed in implicit solvent. The membrane is described as a one-bead-thick fluid elastic layer of mechanical properties that mimic biological membranes. We tune the interactions between solution beads in the different compartments to capture the differences between the cytoplasmic and endosomal protein solutions and explore how the system responds to different degrees of membrane poration. We find that, in the right interaction regime, condensates form rapidly at the damage site upon solution mixing and act as a plug that prevents futher mixing and destabilisation of the vesicle. Further, when the condensate can interact with the membrane (wetting interactions) we find that it mediates pore sealing and membrane repair. This research is part of the work published in "Stress granules plug and stabilize damaged endolysosomal membranes", Bussi et al, Nature, 2023 - 10.1038/s41586-023-06726-w.}, author = {Vanhille-Campos, Christian Eduardo and Šarić, Anđela}, publisher = {Institute of Science and Technology Austria}, title = {{Stress granules plug and stabilize damaged endolysosomal membranes}}, doi = {10.15479/AT:ISTA:14472}, year = {2023}, } @inproceedings{14485, abstract = {Batching is a technique that stores multiple keys/values in each node of a data structure. In sequential search data structures, batching reduces latency by reducing the number of cache misses and shortening the chain of pointers to dereference. Applying batching to concurrent data structures is challenging, because it is difficult to maintain the search property and keep contention low in the presence of batching. In this paper, we present a general methodology for leveraging batching in concurrent search data structures, called BatchBoost. BatchBoost builds a search data structure from distinct "data" and "index" layers. The data layer’s purpose is to store a batch of key/value pairs in each of its nodes. The index layer uses an unmodified concurrent search data structure to route operations to a position in the data layer that is "close" to where the corresponding key should exist. The requirements on the index and data layers are low: with minimal effort, we were able to compose three highly scalable concurrent search data structures based on three original data structures as the index layers with a batched version of the Lazy List as the data layer. The resulting BatchBoost data structures provide significant performance improvements over their original counterparts.}, author = {Aksenov, Vitaly and Anoprenko, Michael and Fedorov, Alexander and Spear, Michael}, booktitle = {37th International Symposium on Distributed Computing}, isbn = {9783959773010}, issn = {1868-8969}, location = {L'Aquila, Italy}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Brief announcement: BatchBoost: Universal batching for concurrent data structures}}, doi = {10.4230/LIPIcs.DISC.2023.35}, volume = {281}, year = {2023}, } @article{14486, abstract = {We present a minimal model of ferroelectric large polarons, which are suggested as one of the mechanisms responsible for the unique charge transport properties of hybrid perovskites. We demonstrate that short-ranged charge–rotor interactions lead to long-range ferroelectric ordering of rotors, which strongly affects the carrier mobility. In the nonperturbative regime, where our theory cannot be reduced to any of the earlier models, we reveal that the polaron is characterized by large coherence length and a roughly tenfold increase of the effective mass as compared to the bare mass. These results are in good agreement with other theoretical predictions for ferroelectric polarons. Our model establishes a general phenomenological framework for ferroelectric polarons providing the starting point for future studies of their role in the transport properties of hybrid organic-inorganic perovskites.}, author = {Koutentakis, Georgios and Ghazaryan, Areg and Lemeshko, Mikhail}, issn = {2643-1564}, journal = {Physical Review Research}, number = {4}, publisher = {American Physical Society}, title = {{Rotor lattice model of ferroelectric large polarons}}, doi = {10.1103/PhysRevResearch.5.043016}, volume = {5}, year = {2023}, }