@article{21246, abstract = {Stellar astrophysics relies on diverse observational modalities—primarily photometric light curves and spectroscopic data—from which fundamental stellar properties are inferred. While machine learning (ML) has advanced analysis within individual modalities, the complementary information encoded across modalities remains largely underexploited. We present the dual embedding for stellar astronomy (DESA) model, a novel multimodal foundation model that integrates light curves and spectra to learn a unified, physically meaningful latent space for stars. DESA first trains separate modality-specific encoders using a hybrid supervised/self-supervised scheme, and then aligns them through DualFormer, a transformer-based cross-modal integration module tailored for astrophysical data. DualFormer combines cross- and self-attention, a novel dual-projection alignment loss, and a projection-space eigendecomposition that yields physically structured embeddings. We demonstrate that DESA significantly outperforms leading unimodal and self-supervised baselines across a range of tasks. In zero- and few-shot settings, DESA’s learned representations recover stellar color–magnitude and Hertzsprung–Russell diagrams with high fidelity (R2 = 0.92 for photometric regressions). In full fine-tuning, DESA achieves state-of-the-art accuracy for binary star detection (AUC = 0.99, AP = 1.00) and stellar age prediction (RMSE = 0.94 Gyr). As a compelling case, DESA naturally separates synchronized binaries from young stars—two populations with nearly identical light curves—purely from their embedded positions in UMAP space, without requiring external kinematic or luminosity information. DESA thus offers a powerful new framework for multimodal, data-driven stellar population analysis, enabling both accurate prediction and novel discovery.}, author = {Kamai, Ilay and Bronstein, Alexander and Perets, Hagai B.}, issn = {1538-4357}, journal = {The Astrophysical Journal}, publisher = {IOP Publishing}, title = {{Machine Learning inference of stellar properties using integrated photometric and spectroscopic data}}, doi = {10.3847/1538-4357/ae0cbc}, volume = {994}, year = {2025}, } @article{21247, abstract = {Seasonal snowmelt in High Mountain Asia is an important source of river discharge. Therefore, observation of the spatiotemporal variations in snow cover at catchment scales using high-resolution satellites is essential for understanding changes in water supply from headwater catchments. In this study, we adapt an algorithm to automatically detect the snowline altitude (SLA) using the Google Earth Engine platform with available high-resolution multispectral satellite archives that can be readily applied for areas of interest. Here, we applied and evaluated the tool to five glacierized watersheds across the Himalayas to quantify the changes in seasonal and annual snow cover over the past 21 years and analyze climate reanalysis data to assess the meteorological factors influencing the SLA. Our findings revealed substantial variations in the SLA among sites in terms of seasonal patterns, decadal trends, and meteorological controls. We identify positive trends in SLA in Hidden Valley (+11.9 m yr−1), Langtang (+14.4 m yr−1), and Rolwaling (+8.2 m yr−1) in the Nepalese Himalayas but a negative trend in Satopanth (−15.6 m yr−1) in the western Indian Himalayas and no significant trend in Parlung in southeastern Tibet. We suggest that the increase in SLA in Nepal was caused by warmer temperatures during the monsoon season, whereas the decrease in SLA in India was driven by increased winter snowfall and reduced monsoon snowmelt. By integrating the outcomes of these analyses, we found that long-term changes in SLA are primarily driven by shifts in the local climate, whereas seasonal variability may be influenced by geographic features in conjunction with climate.}, author = {Sasaki, Orie and Miles, Evan S. and Pellicciotti, Francesca and Sakai, Akiko and Fujita, Koji}, issn = {1994-0424}, journal = {The Cryosphere}, number = {11}, pages = {5283--5298}, publisher = {Copernicus Publications}, title = {{Contrasting patterns of change in snowline altitude across five Himalayan catchments}}, doi = {10.5194/tc-19-5283-2025}, volume = {19}, year = {2025}, } @article{21248, abstract = {Camera-type eyes in vertebrates and cephalopods are striking examples of parallel evolution of a complex structure. While comparisons have focused on these two groups, camera-type eyes with likely high functionality are also found in other invertebrate phyla with simpler brains. Employing single-cell RNA sequencing, we identify neurogenic cells in the adult eyes and brain of the marine annelid worm Platynereis dumerilii. Distinct neural stem cells in the camera-type adult eyes, located at the edge of the cup-shaped retina, and adjacent to the glass body/lens, produce radial lines of cells, reminiscent of stem cells in ciliary marginal zones of vertebrate eyes exhibiting life-long growth. Normal proliferation in the eye depends on ambient light, a phenomenon that depends on the integrity of the photoreceptor gene c-opsin1, which is present in emerging rhabdomeric photoreceptors, and impacts on their differentiation. During reproductive maturation, proliferation in the eye as well as the entire brain sharply declines, while cells upregulate molecular characteristics of mammalian adult neural stem cell quiescence. Our data provide insights into the development and modulation of annelid head and brain cells, revealing similarities and differences to vertebrate eye development, neurogenesis and brain plasticity.}, author = {Milivojev, Nadja and Scaramuzza, Federico and Brum, Pedro Ozório and Velastegui Gamboa, Camila L and Andreatta, Gabriele and Raible, Florian and Tessmar-Raible, Kristin}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Light-modulated stem cells in the camera-type eye of an annelid model for adult brain plasticity}}, doi = {10.1038/s41467-025-65631-0}, volume = {16}, year = {2025}, } @inproceedings{21250, abstract = {We investigate the step complexity of the Leader Election problem (and implementing the corresponding test-and-set object) in asynchronous shared memory, where processes communicate through registers supporting atomic read and write and must coordinate so that a single process becomes the leader. Determining tight step complexity bounds for solving this problem is one of the key open problems in the theory of shared memory distributed computing. The best known algorithm is a randomized tournament-tree, which has worst-case expected step complexity O(log N) for N processes. There are provably no deterministic wait-free algorithms, and only restricted lower bounds are known for obstruction-free and randomized wait-free algorithms. We introduce a new lower bound that establishes an Ω((log N)/(log log N + log Q)) step complexity for any obstruction-free Leader Election algorithm, where N is the number of processes, and 2 ≤ Q ≤ N is a bound on the value contention, which we define as the maximum number of different values that processes can be simultaneously poised to write to the same register in any execution of the algorithm. Our result is strictly stronger than previous bounds based on write contention. In particular, it implies new lower bounds on step complexity that depend on register size.}, author = {Alistarh, Dan-Adrian and Ellen, Faith and Fedorov, Alexander}, booktitle = {39th International Symposium on Distributed Computing}, location = {Berlin, Germany}, pages = {3:1--3:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{An almost-logarithmic lower bound for leader election with bounded value contention}}, doi = {10.4230/LIPIcs.DISC.2025.3}, volume = {356}, year = {2025}, } @article{21251, abstract = {Cellular membranes differ across the tree of life. In most bacteria and eukaryotes, single-headed lipids self-assemble into flexible bilayer membranes. By contrast, thermophilic archaea tend to possess bilayer lipids together with double-headed, monolayer spanning bolalipids, which are thought to enable cells to survive in harsh environments. Here, using a minimal computational model for bolalipid membranes, we explore the trade-offs at play when forming membranes. We find that flexible bolalipids form membranes that resemble bilayer membranes because they are able to assume a U-shaped conformation. Conversely, rigid bolalipids, which resemble the bolalipids with cyclic groups found in thermophilic archaea, take on a straight conformation and form membranes that are stiff and prone to pore formation when they undergo changes in shape. Strikingly, however, the inclusion of small amounts of bilayer lipids in a bolalipid membrane is enough to achieve fluid bolalipid membranes that are both stable and flexible, resolving this trade-off. Our study suggests a mechanism by which archaea can tune the material properties of their membranes as and when required to enable them to survive in harsh environments and to undergo essential membrane remodelling events like cell division.}, author = {Santana de Freitas Amaral, Miguel and Frey, Felix F and Jiang, Xiuyun and Baum, Buzz and Šarić, Anđela}, issn = {2050-084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{Balancing stability and flexibility when reshaping archaeal membranes}}, doi = {10.7554/elife.105432}, volume = {14}, year = {2025}, } @article{21252, abstract = {Context. Recent observational results from asteroseismic studies show that an important fraction of solar-like stars do not present detectable stochastically excited acoustic oscillations. This non-detectability seems to correlate with a high rotation rate in the convective envelope and a high surface magnetic activity. At the same time, the properties of stellar convection are affected by rotation and magnetism. Aims. We investigate the role of rotation in the excitation of acoustic modes in the convective envelope of solar-like stars, to evaluate its impact on the energy injected in the oscillations. Methods. We derived theoretical prescriptions for the excitation of acoustic waves in the convective envelope of rotating solar-like stars. We adopted the rotating mixing-length Theory to model the influence of rotation on convection. We used the MESA stellar evolution code and the GYRE stellar oscillation code to estimate the power injected in the oscillations from our theoretical prescriptions. Results. We demonstrate that the power injected in the acoustic modes is insensitive to rotation if a Gaussian time-correlation function is assumed, while it can decrease by up to 60% for a Lorentzian time-correlation function, for a 20 Ω⊙ rotation rate. We show that the modification of the excitation rate by rotation depends not only on the rotation rate but also on the radial and angular orders of the considered oscillation mode. This result can allow for better constraints on the properties of stellar convection by studying observationally acoustic mode excitation. Conclusions. These results demonstrate how important it is to take into account the modification of stellar convection by rotation when evaluating the amplitude of the stellar oscillations it stochastically excites. They open the path for understanding the large variety of observed acoustic-mode amplitudes at the surface of solar-like stars as a function of surface rotation rates.}, author = {Bessila, L. and Deckx van Ruys, A. and Buriasco, V. and Mathis, S. and Bugnet, Lisa Annabelle and García, R. A. and Mathur, S.}, issn = {1432-0746}, journal = {Astronomy & Astrophysics}, publisher = {EDP Sciences}, title = {{The impact of rotation on the stochastic excitation of stellar acoustic modes in solar-like pulsators}}, doi = {10.1051/0004-6361/202452093}, volume = {700}, year = {2025}, } @article{21253, abstract = {We solve a problem of Dujmović and Wood (2007) by showing that a complete convex geometric graph on n vertices cannot be decomposed into fewer than n - 1 star-forests, each consisting of noncrossing edges. This bound is clearly tight. We also discuss similar questions for abstract graphs.}, author = {Pach, János and Saghafian, Morteza and Schnider, Patrick}, issn = {0925-7721}, journal = {Computational Geometry}, publisher = {Elsevier}, title = {{Decomposition of geometric graphs into star-forests}}, doi = {10.1016/j.comgeo.2025.102186}, volume = {129}, year = {2025}, } @inbook{21255, abstract = {As an important plant hormone to regulate growth and development, auxin has been investigated for more than a century. It had been clearly demonstrated and well-accepted that the intracellular auxin receptors, TIR1/AFBs, are F-box proteins mediating transcriptional auxin signaling by their E3 ubiquitin ligase activity, which targets and sends for degradation the Aux/IAA transcriptional repressors. The recent discovery of adenylate cyclase (AC) and guanylate cyclase (GC) activities for TIR1/AFBs open entirely new perspectives on how auxin signaling can operate. This chapter traces back the history of how canonical transcriptional auxin signaling was established and introduces the discovery of the TIR1/AFBs-mediated nontranscriptional signaling branch. Finally, the current understanding and open questions of how TIR1/AFBs’ AC and GC activities contribute to the transcriptional and nontranscriptional auxin signaling are discussed, highlighting the possibility that cyclic adenosine monophosphate (cAMP) and cyclic guanosine monophosphate (cGMP) act as second messengers in auxin signal transduction.}, author = {Qi, Linlin and Friml, Jiří}, booktitle = {Cryptic Enzymes and Moonlighting Proteins}, editor = {Irving, Helen and Gehring, Chris and Wong, Aloysius}, isbn = {9780443157196}, pages = {299--322}, publisher = {Elsevier}, title = {{Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling}}, doi = {10.1016/b978-0-443-15719-6.00015-5}, year = {2025}, } @article{21256, abstract = {Collagen IV is one of the main components of the basement membrane, a layer of material that lines the majority of tissues in multicellular organisms. Collagen IV molecules assemble into networks, providing stiffness and elasticity to tissues and informing cell and organ shape, especially during development. In this work, we develop two coarse-grained models for collagen IV molecules that retain biochemical bond specificity and coarse grain at different length scales. Through molecular-dynamics simulations, we test the assembly and mechanics of the resulting networks and measure their response to strain in terms of stress, microscopic alignment, and bond dynamics. Within the basement membrane, collagen IV networks rearrange by molecule turnover, which affects tissue organization and can be linked with enzyme activity. Here we explore network rearrangements via bond remodeling, the process of breaking and remaking of bonds between network molecules. We then investigate the effects of active (enzymatic) bond remodeling. We find that this nonequilibrium remodeling allows a network to keep its integrity under strain, while relaxing fully over a variety of timescales, a dynamic response that is unavailable to networks undergoing equilibrium remodeling.}, author = {Meadowcroft, Billie and Sorichetti, Valerio and Ratajczyk, Eryk and Perez Verdugo, Fernanda L and Khalilgharibi, Nargess and Mao, Yanlan and Palaia, Ivan and Šarić, Anđela}, issn = {2835-8279}, journal = {PRX Life}, publisher = {American Physical Society}, title = {{Nonequilibrium remodeling of collagen IV networks in Silico}}, doi = {10.1103/gdd5-rnh7}, volume = {3}, year = {2025}, } @inbook{21257, abstract = {We investigate the problem of accurate sparse fine-tuning of large language models (LLMs), that is, fine-tuning pre-trained LLMs on specialized tasks, while inducing sparsity in their weights. Our work is motivated by experiments showing that standard loss-based fine-tuning methods are not able to achieve high accuracy in this setting, especially at high sparsity targets. To address this issue, we perform a detailed study of knowledge distillation losses for fine-tuning of sparse models. We determine an L2-based distillation approach that we term ‘SquareHead’, which enables accurate recovery even at higher sparsities. Investigating the question of efficient inference, we show that sparse LLMs can be executed faster by taking advantage of sparsity. Specifically, we exhibit end-to-end results showing speedups enabled by sparsity, while recovering accuracy, on the following models and tasks, respectively: T5 for language translation, Whisper for speech translation, and open GPT-type models such as the Mosaic Pre-Trained Transformer (MPT) and Llama-2 models for text generation. In particular, for popular generative tasks, we show for the first time that sparse fine-tuning can reach 75% sparsity without drops in accuracy, and provide notable end-to-end speedups for inference on CPUs. Moreover, we also highlight that sparsity is compatible with other compression approaches, such as quantization.}, author = {Kurtic, Eldar and Kuznedelev, Denis and Frantar, Elias and Goinv, Michael and Pandit, Shubhra and Agarwalla, Abhinav and Nguyen, Tuan and Marques, Alexandre and Kurtz, Mark and Alistarh, Dan-Adrian}, booktitle = {Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques}, editor = {Passban, Peyman and Way, Andy and Rezagholizadeh, Mehdi}, isbn = {9783031857461}, issn = {2522-803X}, pages = {83--97}, publisher = {Springer Nature}, title = {{Sparse Fine-Tuning for Inference Acceleration of Large Language Models}}, doi = {10.1007/978-3-031-85747-8_6}, year = {2025}, } @article{21260, abstract = {We prove that there does not exist F∈Q[x,y] of degree 4 such that F(Z^2 )=Z ≥0. In particular, this answers a question by John S. Lew and Bjorn Poonen for quartic polynomials.}, author = {Yao Xiao, Stanley and Yamagishi, Shuntaro}, issn = {1435-9863}, journal = {Journal of the European Mathematical Society}, publisher = {EMS Press}, title = {{Quartic polynomials in two variables do not represent all non-negative integers}}, doi = {10.4171/jems/1697}, year = {2025}, } @inproceedings{21262, abstract = {Continuous Group Key Agreement (CGKA) is the primitive underlying secure group messaging. It allows a large group of N users to maintain a shared secret key that is frequently rotated by the group members in order to achieve forward secrecy and post compromise security. The group messaging scheme Messaging Layer Security (MLS) standardized by the IETF makes use of a CGKA called TreeKEM which arranges the N group members in a binary tree. Here, each node is associated with a public-key, each user is assigned one of the leaves, and a user knows the corresponding secret keys from their leaf to the root. To update the key material known to them, a user must just replace keys at log(N) nodes, which requires them to create and upload log(N) ciphertexts. Such updates must be processed sequentially by all users, which for large groups is impractical. To allow for concurrent updates, TreeKEM uses the “propose and commit” paradigm, where multiple users can concurrently propose to update (by just sampling a fresh leaf key), and a single user can then commit to all proposals at once. Unfortunately, this process destroys the binary tree structure as the tree gets pruned and some nodes must be “blanked” at the cost of increasing the in-degree of others, which makes the commit operation, as well as, future commits more costly. In the worst case, the update cost (in terms of uploaded ciphertexts) per user can grow from log(N) to Ω(N). In this work we provide two main contributions. First, we show that MLS’ communication complexity is bad not only in the worst case but also if the proposers and committers are chosen at random: even if there’s just one update proposal for every commit the expected cost is already over √N, and it approaches N as this ratio changes towards more proposals. Our second contribution is a new variant of propose and commit for TreeKEM which for moderate amounts of update proposals per commit provably achieves an update cost of Θ(log(N)) assuming the proposers and committers are chosen at random.}, author = {Auerbach, Benedikt and Cueto Noval, Miguel and Erol, Boran and Pietrzak, Krzysztof Z}, booktitle = {45th Annual International Cryptology Conference}, isbn = {9783032019127}, issn = {1611-3349}, location = {Santa Barbara, CA, United States}, pages = {141--172}, publisher = {Springer Nature}, title = {{Continuous group-key agreement: Concurrent updates without pruning}}, doi = {10.1007/978-3-032-01913-4_5}, volume = {16007}, year = {2025}, } @article{21263, abstract = {Two landmark results in combinatorial random matrix theory, due to Komlós and Costello–Tao–Vu, show that discrete random matrices and symmetric discrete random matrices are typically nonsingular. In particular, in the language of graph theory, when p is a fixed constant, the biadjacency matrix of a random Erdős–Rényi bipartite graph G(n,n,p) and the adjacency matrix of an Erdős–Rényi random graph G(n,p) are both nonsingular with high probability. However, very sparse random graphs (i.e., where p is allowed to decay rapidly with n) are typically singular, due to the presence of “local” dependencies such as isolated vertices and pairs of degree-1 vertices with the same neighbour. In this paper, we give a combinatorial description of the rank of a sparse random graph G(n,n,c/n) or G(n,c/n) in terms of such local dependencies, for all constants c=e (and we present some evidence that the situation is very different for c=e). This gives an essentially complete answer to a question raised by Vu (2014). As applications of our main theorem and its proof, we also determine the asymptotic singularity probability of the 2-core of a sparse random graph, we show that the rank of a sparse random graph is extremely well approximated by its matching number, and we deduce a central limit theorem for the rank of G(n,c/n).}, author = {Glasgow, Margalit and Kwan, Matthew Alan and Sah, Ashwin and Sawhney, Mehtaab}, issn = {1435-9863}, journal = {Journal of the European Mathematical Society}, publisher = {European Mathematical Society Press}, title = {{The exact rank of sparse random graphs}}, doi = {10.4171/jems/1692}, year = {2025}, } @article{21264, abstract = {Rodents' ability to encode the whisking phase has been extensively documented through neuronal recordings from ascending sensory pathways. Yet, while indicating that reafference originates from the mechanoreceptors, the mechanistic underpinnings of the whisking phase encoding within the follicle remain unclear. Here we present anatomical, histological, and biomechanical evidence for the presence of a distinctive elastic segment (ES) within the basal part of the whisker shaft inside the follicle. This ES, composed of immature keratin, is capable of both bending and twisting. Forces generated by whisker movement deform this segment, causing whisker shaft deflections that can stimulate specific mechanoreceptor subsets within the follicle at different phases of the whisking cycle. This mechanism appears to operate during both free‐air whisking and object contact. We propose that the ES enables torsion‐based mechanoreceptor activation, allowing encoding of the whisking phase.}, author = {Haidarliu, Sebastian and Nelinger, Guy and Gantar, Luka and Ahissar, Ehud and Saraf‐Sinik, Inbar}, issn = {1932-8494}, journal = {The Anatomical Record}, publisher = {Wiley}, title = {{An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice}}, doi = {10.1002/ar.70051}, year = {2025}, } @article{21265, abstract = {We explain how the (shifted) Ratios Conjecture for $L(s,\chi )$ would extend a randomization argument of Harper from a conductor-limited range to an unlimited range of “beyond square-root cancellation” for character twists of the Liouville function. As a corollary, the Liouville function would have nontrivial cancellation in arithmetic progressions of modulus just exceeding the well-known square-root barrier. Morally, the paper passes from random matrices to random multiplicative functions.}, author = {Wang, Victor and Xu, Max Wenqiang}, issn = {1687-0247}, journal = {International Mathematics Research Notices}, number = {18}, publisher = {Oxford University Press}, title = {{Harper’s beyond square-root conjecture}}, doi = {10.1093/imrn/rnaf279}, volume = {2025}, year = {2025}, } @article{21266, abstract = {For a given elliptic curve E in short Weierstrass form, we show that almost all quadratic twists E D have no integral points, as D ranges over square-free integers ordered by size. Our result is conditional on a weak form of the Hall–Lang conjecture in the case that E has partial 2-torsion. The proof uses a correspondence of Mordell and the reduction theory of binary quartic forms in order to transfer the problem to counting rational points of bounded height on a certain singular cubic surface, together with extensive use of cancellation in character sum estimates, drawn from Heath-Brown’s analysis of Selmer group statistics for the congruent number curve.}, author = {Browning, Timothy D and Chan, Yik Tung}, issn = {1435-9863}, journal = {Journal of the European Mathematical Society}, publisher = {European Mathematical Society Press}, title = {{Almost all quadratic twists of an elliptic curve have no integral points}}, doi = {10.4171/jems/1704}, year = {2025}, } @inproceedings{21268, abstract = {We consider multiple-environment Markov decision processes (MEMDP), which consist of a finite set of MDPs over the same state space, representing different scenarios of transition structure and probability. The value of a strategy is the probability to satisfy the objective, here a parity objective, in the worst-case scenario, and the value of an MEMDP is the supremum of the values achievable by a strategy. We show that deciding whether the value is 1 is a PSPACE-complete problem, and even in P when the number of environments is fixed, along with new insights to the almost-sure winning problem, which is to decide if there exists a strategy with value 1. Pure strategies are sufficient for theses problems, whereas randomization is necessary in general when the value is smaller than 1. We present an algorithm to approximate the value, running in double exponential space. Our results are in contrast to the related model of partially-observable MDPs where all these problems are known to be undecidable.}, author = {Chatterjee, Krishnendu and Doyen, Laurent and Raskin, Jean-Francois and Sankur, Ocan}, booktitle = {52nd International Colloquium on Automata, Languages, and Programming}, isbn = {9783959773720}, location = {Aarhus, Denmark}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{The value problem for multiple-environment MDPs with parity objective}}, doi = {10.4230/LIPIcs.ICALP.2025.150}, year = {2025}, } @article{21269, abstract = {The spatial organization of chromatin within the nucleus plays a crucial role in gene expression and genome function. However, the quantitative relationship between this organization and nuclear biochemical processes remains under debate. In this study, we present a graph-based generative model, bioSBM, designed to capture long-range chromatin interaction patterns from Hi-C data and, importantly, simultaneously link these patterns to biochemical features. Applying bioSBM to Hi-C maps of the GM12878 lymphoblastoid cell line, we identified a latent structure of chromatin interactions, revealing seven distinct communities that strongly align with known biological annotations. Additionally, we infer a linear transformation that maps biochemical observables, such as histone marks, to the parameters of the generative graph model, enabling accurate genome-wide predictions of chromatin contact maps on out-of-sample data, both within the same cell line and on the completely unseen HCT116 cell line under RAD21 depletion. These findings highlight bioSBM's potential as a powerful tool for elucidating the relationship between biochemistry and chromatin architecture and predicting long-range genome organization from independent biochemical data.}, author = {Zhang, Chen Y and Rosa, Angelo and Sanguinetti, Guido}, issn = {2835-8279}, journal = {PRX Life}, number = {4}, publisher = {American Physical Society}, title = {{bioSBM: A random graph model to integrate epigenomic data in chromatin structure prediction}}, doi = {10.1103/gy1p-4256}, volume = {3}, year = {2025}, } @article{21270, abstract = {The one-dimensional Fröhlich model describing the motion of a single electron interacting with optical phonons is a paradigmatic model of quantum many-body physics. We predict the existence of an arbitrarily large number of bound excited states in the strong-coupling limit and calculate their excitation energies. Numerical simulations of a discretized model demonstrate the complete amelioration of the projector Monte Carlo sign problem by walker annihilation in an infinite Hilbert space. They reveal the threshold for the occurrence of the first bound excited states at a value of 𝛼≈1.73 for the dimensionless coupling constant. This puts the threshold into the regime of intermediate interaction strength. We find a significant spectral weight and increased phonon number of the bound excited state at threshold.}, author = {Taylor, J. and Čufar, M. and Mitrouskas, David Johannes and Seiringer, Robert and Pahl, E. and Brand, J.}, issn = {2469-9969}, journal = {Physical Review B}, number = {18}, publisher = {American Physical Society}, title = {{Bound excited states of Fröhlich polarons in one dimension}}, doi = {10.1103/s9p9-jflq}, volume = {112}, year = {2025}, } @article{21271, abstract = {For general non-Hermitian large random matrices X and deterministic deformation matrices A, we prove that the local eigenvalue statistics of A+X close to the typical edge points of its spectrum are universal. Furthermore, we show that, under natural assumptions, on A the spectrum of A+X does not have outliers at a distance larger than the natural fluctuation scale of the eigenvalues. As a consequence, the number of eigenvalues in each component of Spec(A+X) is deterministic.}, author = {Campbell, Andrew J and Cipolloni, Giorgio and Erdös, László and Ji, Hong Chang}, issn = {2168-894X}, journal = {The Annals of Probability}, number = {6}, pages = {2256--2308}, publisher = {Institute of Mathematical Statistics}, title = {{On the spectral edge of non-Hermitian random matrices}}, doi = {10.1214/25-aop1761}, volume = {53}, year = {2025}, }