@article{13277, abstract = {Recent experimental advances have inspired the development of theoretical tools to describe the non-equilibrium dynamics of quantum systems. Among them an exact representation of quantum spin systems in terms of classical stochastic processes has been proposed. Here we provide first steps towards the extension of this stochastic approach to bosonic systems by considering the one-dimensional quantum quartic oscillator. We show how to exactly parameterize the time evolution of this prototypical model via the dynamics of a set of classical variables. We interpret these variables as stochastic processes, which allows us to propose a novel way to numerically simulate the time evolution of the system. We benchmark our findings by considering analytically solvable limits and providing alternative derivations of known results.}, author = {Tucci, Gennaro and De Nicola, Stefano and Wald, Sascha and Gambassi, Andrea}, issn = {2666-9366}, journal = {SciPost Physics Core}, keywords = {Statistical and Nonlinear Physics, Atomic and Molecular Physics, and Optics, Nuclear and High Energy Physics, Condensed Matter Physics}, number = {2}, publisher = {SciPost Foundation}, title = {{Stochastic representation of the quantum quartic oscillator}}, doi = {10.21468/scipostphyscore.6.2.029}, volume = {6}, year = {2023}, } @article{13278, abstract = {We present a numerical analysis of spin-1/2 fermions in a one-dimensional harmonic potential in the presence of a magnetic point-like impurity at the center of the trap. The model represents a few-body analogue of a magnetic impurity in the vicinity of an s-wave superconductor. Already for a few particles we find a ground-state level crossing between sectors with different fermion parities. We interpret this crossing as a few-body precursor of a quantum phase transition, which occurs when the impurity "breaks" a Cooper pair. This picture is further corroborated by analyzing density-density correlations in momentum space. Finally, we discuss how the system may be realized with existing cold-atoms platforms.}, author = {Rammelmüller, Lukas and Huber, David and Čufar, Matija and Brand, Joachim and Hammer, Hans-Werner and Volosniev, Artem}, issn = {2542-4653}, journal = {SciPost Physics}, keywords = {General Physics and Astronomy}, number = {1}, publisher = {SciPost Foundation}, title = {{Magnetic impurity in a one-dimensional few-fermion system}}, doi = {10.21468/scipostphys.14.1.006}, volume = {14}, year = {2023}, } @inproceedings{13292, abstract = {The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time.}, author = {Henzinger, Thomas A and Kebis, Pavol and Mazzocchi, Nicolas Adrien and Sarac, Naci E}, booktitle = {50th International Colloquium on Automata, Languages, and Programming}, isbn = {9783959772785}, issn = {1868-8969}, location = {Paderborn, Germany}, pages = {129:1----129:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Regular methods for operator precedence languages}}, doi = {10.4230/LIPIcs.ICALP.2023.129}, volume = {261}, year = {2023}, } @inproceedings{13310, abstract = {Machine-learned systems are in widespread use for making decisions about humans, and it is important that they are fair, i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure. We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden. We build monitors that observe a long sequence of events as generated by a given system, and output, after each observation, a quantitative estimate of how fair or biased the system was on that run until that point in time. The estimate is proven to be correct modulo a variable error bound and a given confidence level, where the error bound gets tighter as the observed sequence gets longer. Our monitors are of two types, and use, respectively, frequentist and Bayesian statistical inference techniques. While the frequentist monitors compute estimates that are objectively correct with respect to the ground truth, the Bayesian monitors compute estimates that are correct subject to a given prior belief about the system’s model. Using a prototype implementation, we show how we can monitor if a bank is fair in giving loans to applicants from different social backgrounds, and if a college is fair in admitting students while maintaining a reasonable financial burden on the society. Although they exhibit different theoretical complexities in certain cases, in our experiments, both frequentist and Bayesian monitors took less than a millisecond to update their verdicts after each observation.}, author = {Henzinger, Thomas A and Karimi, Mahyar and Kueffner, Konstantin and Mallik, Kaushik}, booktitle = {Computer Aided Verification}, isbn = {9783031377020}, issn = {1611-3349}, location = {Paris, France}, pages = {358–382}, publisher = {Springer Nature}, title = {{Monitoring algorithmic fairness}}, doi = {10.1007/978-3-031-37703-7_17}, volume = {13965}, year = {2023}, } @article{13315, abstract = {How do statistical dependencies in measurement noise influence high-dimensional inference? To answer this, we study the paradigmatic spiked matrix model of principal components analysis (PCA), where a rank-one matrix is corrupted by additive noise. We go beyond the usual independence assumption on the noise entries, by drawing the noise from a low-order polynomial orthogonal matrix ensemble. The resulting noise correlations make the setting relevant for applications but analytically challenging. We provide characterization of the Bayes optimal limits of inference in this model. If the spike is rotation invariant, we show that standard spectral PCA is optimal. However, for more general priors, both PCA and the existing approximate message-passing algorithm (AMP) fall short of achieving the information-theoretic limits, which we compute using the replica method from statistical physics. We thus propose an AMP, inspired by the theory of adaptive Thouless–Anderson–Palmer equations, which is empirically observed to saturate the conjectured theoretical limit. This AMP comes with a rigorous state evolution analysis tracking its performance. Although we focus on specific noise distributions, our methodology can be generalized to a wide class of trace matrix ensembles at the cost of more involved expressions. Finally, despite the seemingly strong assumption of rotation-invariant noise, our theory empirically predicts algorithmic performance on real data, pointing at strong universality properties.}, author = {Barbier, Jean and Camilli, Francesco and Mondelli, Marco and Sáenz, Manuel}, issn = {1091-6490}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, number = {30}, publisher = {National Academy of Sciences}, title = {{Fundamental limits in structured principal component analysis and how to reach them}}, doi = {10.1073/pnas.2302028120}, volume = {120}, year = {2023}, } @article{13316, abstract = {Although budding yeast has been extensively used as a model organism for studying organelle functions and intracellular vesicle trafficking, whether it possesses an independent endocytic early/sorting compartment that sorts endocytic cargos to the endo-lysosomal pathway or the recycling pathway has long been unclear. The structure and properties of the endocytic early/sorting compartment differ significantly between organisms; in plant cells, the trans-Golgi network (TGN) serves this role, whereas in mammalian cells a separate intracellular structure performs this function. The yeast syntaxin homolog Tlg2p, widely localizing to the TGN and endosomal compartments, is presumed to act as a Q-SNARE for endocytic vesicles, but which compartment is the direct target for endocytic vesicles remained unanswered. Here we demonstrate by high-speed and high-resolution 4D imaging of fluorescently labeled endocytic cargos that the Tlg2p-residing compartment within the TGN functions as the early/sorting compartment. After arriving here, endocytic cargos are recycled to the plasma membrane or transported to the yeast Rab5-residing endosomal compartment through the pathway requiring the clathrin adaptors GGAs. Interestingly, Gga2p predominantly localizes at the Tlg2p-residing compartment, and the deletion of GGAs has little effect on another TGN region where Sec7p is present but suppresses dynamics of the Tlg2-residing early/sorting compartment, indicating that the Tlg2p- and Sec7p-residing regions are discrete entities in the mutant. Thus, the Tlg2p-residing region seems to serve as an early/sorting compartment and function independently of the Sec7p-residing region within the TGN.}, author = {Toshima, Junko Y. and Tsukahara, Ayana and Nagano, Makoto and Tojima, Takuro and Siekhaus, Daria E and Nakano, Akihiko and Toshima, Jiro}, issn = {2050-084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{The yeast endocytic early/sorting compartment exists as an independent sub-compartment within the trans-Golgi network}}, doi = {10.7554/eLife.84850}, volume = {12}, year = {2023}, } @article{13319, abstract = {We prove that the generator of the L2 implementation of a KMS-symmetric quantum Markov semigroup can be expressed as the square of a derivation with values in a Hilbert bimodule, extending earlier results by Cipriani and Sauvageot for tracially symmetric semigroups and the second-named author for GNS-symmetric semigroups. This result hinges on the introduction of a new completely positive map on the algebra of bounded operators on the GNS Hilbert space. This transformation maps symmetric Markov operators to symmetric Markov operators and is essential to obtain the required inner product on the Hilbert bimodule.}, author = {Vernooij, Matthijs and Wirth, Melchior}, issn = {1432-0916}, journal = {Communications in Mathematical Physics}, pages = {381--416}, publisher = {Springer Nature}, title = {{Derivations and KMS-symmetric quantum Markov semigroups}}, doi = {10.1007/s00220-023-04795-6}, volume = {403}, year = {2023}, } @inproceedings{13321, abstract = {We consider the problem of reconstructing the signal and the hidden variables from observations coming from a multi-layer network with rotationally invariant weight matrices. The multi-layer structure models inference from deep generative priors, and the rotational invariance imposed on the weights generalizes the i.i.d. Gaussian assumption by allowing for a complex correlation structure, which is typical in applications. In this work, we present a new class of approximate message passing (AMP) algorithms and give a state evolution recursion which precisely characterizes their performance in the large system limit. In contrast with the existing multi-layer VAMP (ML-VAMP) approach, our proposed AMP – dubbed multilayer rotationally invariant generalized AMP (ML-RI-GAMP) – provides a natural generalization beyond Gaussian designs, in the sense that it recovers the existing Gaussian AMP as a special case. Furthermore, ML-RI-GAMP exhibits a significantly lower complexity than ML-VAMP, as the computationally intensive singular value decomposition is replaced by an estimation of the moments of the design matrices. Finally, our numerical results show that this complexity gain comes at little to no cost in the performance of the algorithm.}, author = {Xu, Yizhou and Hou, Tian Qi and Liang, Shan Suo and Mondelli, Marco}, booktitle = {2023 IEEE Information Theory Workshop}, isbn = {9798350301496}, issn = {2475-4218}, location = {Saint-Malo, France}, pages = {294--298}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{Approximate message passing for multi-layer estimation in rotationally invariant models}}, doi = {10.1109/ITW55543.2023.10160238}, year = {2023}, } @misc{13336, author = {Kleshnina, Maria}, publisher = {Zenodo}, title = {{kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games}}, doi = {10.5281/ZENODO.8059564}, year = {2023}, } @article{13340, abstract = {Photoisomerization of azobenzenes from their stable E isomer to the metastable Z state is the basis of numerous applications of these molecules. However, this reaction typically requires ultraviolet light, which limits applicability. In this study, we introduce disequilibration by sensitization under confinement (DESC), a supramolecular approach to induce the E-to-Z isomerization by using light of a desired color, including red. DESC relies on a combination of a macrocyclic host and a photosensitizer, which act together to selectively bind and sensitize E-azobenzenes for isomerization. The Z isomer lacks strong affinity for and is expelled from the host, which can then convert additional E-azobenzenes to the Z state. In this way, the host–photosensitizer complex converts photon energy into chemical energy in the form of out-of-equilibrium photostationary states, including ones that cannot be accessed through direct photoexcitation.}, author = {Gemen, Julius and Church, Jonathan R. and Ruoko, Tero-Petri and Durandin, Nikita and Białek, Michał J. and Weissenfels, Maren and Feller, Moran and Kazes, Miri and Borin, Veniamin A. and Odaybat, Magdalena and Kalepu, Rishir and Diskin-Posner, Yael and Oron, Dan and Fuchter, Matthew J. and Priimagi, Arri and Schapiro, Igor and Klajn, Rafal}, issn = {1095-9203}, journal = {Science}, number = {6664}, pages = {1357--1363}, publisher = {American Association for the Advancement of Science}, title = {{Disequilibrating azoarenes by visible-light sensitization under confinement}}, doi = {10.1126/science.adh9059}, volume = {381}, year = {2023}, } @article{13342, abstract = {Motile cells moving in multicellular organisms encounter microenvironments of locally heterogeneous mechanochemical composition. Individual compositional parameters like chemotactic signals, adhesiveness, and pore sizes are well known to be sensed by motile cells, providing individual guidance cues for cellular pathfinding. However, motile cells encounter diverse mechanochemical signals at the same time, raising the question of how cells respond to locally diverse and potentially competing signals on their migration routes. Here, we reveal that motile amoeboid cells require nuclear repositioning, termed nucleokinesis, for adaptive pathfinding in heterogeneous mechanochemical microenvironments. Using mammalian immune cells and the amoebaDictyostelium discoideum, we discover that frequent, rapid and long-distance nucleokinesis is a basic component of amoeboid pathfinding, enabling cells to reorientate quickly between locally competing cues. Amoeboid nucleokinesis comprises a two-step cell polarity switch and is driven by myosin II-forces, sliding the nucleus from a ‘losing’ to the ‘winning’ leading edge to re-adjust the nuclear to the cellular path. Impaired nucleokinesis distorts fast path adaptions and causes cellular arrest in the microenvironment. Our findings establish that nucleokinesis is required for amoeboid cell navigation. Given that motile single-cell amoebae, many immune cells, and some cancer cells utilize an amoeboid migration strategy, these results suggest that amoeboid nucleokinesis underlies cellular navigation during unicellular biology, immunity, and disease.}, author = {Kroll, Janina and Hauschild, Robert and Kuznetcov, Arthur and Stefanowski, Kasia and Hermann, Monika D. and Merrin, Jack and Shafeek, Lubuna B and Müller-Taubenberger, Annette and Renkawitz, Jörg}, issn = {1460-2075}, journal = {EMBO Journal}, publisher = {Embo Press}, title = {{Adaptive pathfinding by nucleokinesis during amoeboid migration}}, doi = {10.15252/embj.2023114557}, year = {2023}, } @inbook{19983, abstract = {The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distributed graph algorithms, LOCAL and SLOCAL: the locality of sinkless orientation is Ω(log n) in the deterministic LOCAL model and O(log log n) in the deterministic SLOCAL model. Both of these results are known by prior work, but here we give new simple, self-contained proofs for them.}, author = {Balliu, Alkida and Korhonen, Janne and Kuhn, Fabian and Lievonen, Henrik and Olivetti, Dennis and Pai, Shreyas and Paz, Ami and Rybicki, Joel and Schmid, Stefan and Studený, Jan and Suomela, Jukka and Uitto, Jara}, booktitle = {Symposium on Simplicity in Algorithms}, location = {Florence, Italy}, pages = {175--191}, publisher = {2023 Society for Industrial and Applied Mathematics}, title = {{Sinkless Orientation Made Simple}}, doi = {10.1137/1.9781611977585.ch17}, year = {2023}, } @inproceedings{19985, abstract = {We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how much nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v’s capacity on (u, v) increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is “rechargeable” in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes’ decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1 + E) . (1 + square3) for some arbitrary E>0.}, author = {Schmid, Stefan and Svoboda, Jakub and Yeo, Michelle X}, booktitle = {30th International Colloquium on Structural Information and Communication Complexity}, isbn = {9783031327322}, issn = {1611-3349}, location = {Alcalá de Henares, Spain}, pages = {576--594}, publisher = {Springer Nature}, title = {{Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation}}, doi = {10.1007/978-3-031-32733-9_26}, volume = {13892}, year = {2023}, } @unpublished{20572, abstract = {We present an elementary non-recursive formula for the multivariate moments of the Dirichlet distribution on the standard simplex, in terms of the pattern inventory of the moments' exponents. We obtain analog formulas for the multivariate moments of the Dirichlet-Ferguson and Gamma measures. We further introduce a polychromatic analogue of Ewens sampling formula on colored integer partitions, discuss its relation with suitable extensions of Hoppe's urn model and of the Chinese restaurant process, and prove that it satisfies an adapted notion of consistency in the sense of Kingman.}, author = {Dello Schiavo, Lorenzo and Quattrocchi, Filippo}, booktitle = {arXiv}, keywords = {Dirichlet distribution, Ewens sampling formula, Hoppe urn model, colored partitions}, title = {{Multivariate Dirichlet moments and a polychromatic Ewens sampling formula}}, doi = {10.48550/arXiv.2309.11292}, year = {2023}, } @article{18942, abstract = {Photosynthesis is among the first processes negatively affected by environmental cues and its performance directly determines plant cell fitness and ultimately crop yield. Primarily sites of photosynthesis, chloroplasts are unique sites also for the biosynthesis of precursors of the growth regulator auxin and for sensing environmental stress, but their role in intracellular auxin homeostasis, vital for plant growth and survival in changing environments, remains poorly understood. Here, we identified two ATP-binding cassette (ABC) subfamily B transporters, ABCB28 and ABCB29, which export auxin across the chloroplast envelope to the cytosol in a concerted action in vivo. Moreover, we provide evidence for an auxin biosynthesis pathway in Arabidopsis thaliana chloroplasts. The overexpression of ABCB28 and ABCB29 influenced stomatal regulation and resulted in significantly improved water use efficiency and survival rates during salt and drought stresses. Our results suggest that chloroplast auxin production and transport contribute to stomata regulation for conserving water upon salt stress. ABCB28 and ABCB29 integrate photosynthesis and auxin signals and as such hold great potential to improve the adaptation potential of crops to environmental cues.}, author = {Tamizhselvan, Prashanth and Madhavan, Sharmila and Constan-Aguilar, Christian and Elrefaay, Eman Ryad and Liu, Jie and Pěnčík, Aleš and Novák, Ondřej and Cairó, Albert and Hrtyan, Mónika and Geisler, Markus and Tognetti, Vanesa Beatriz}, issn = {2223-7747}, journal = {Plants}, number = {1}, publisher = {MDPI}, title = {{Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis}}, doi = {10.3390/plants13010007}, volume = {13}, year = {2023}, } @article{18959, abstract = {This workshop continues a series of workshops whose current format originated in 1981 under then-organizers Moser and Zehnder, and whose latest iteration took place in July 2023. The general goal of this series of workshops is to discuss the latest developments in the field of dynamical systems, broadly construed, and its connections with neighboring areas of mathematics such as differential geometry, partial differential equations, and more recently contact and symplectic geometry. We continued this tradition, bringing in new participants working in areas of dynamical systems and its connections with other areas of mathematics that are currently highly active and/or showing great promise for future development. Key focus areas for the 2023 workshop include spectral rigidity for planar domains, chaotic and oscillatory motions in celestial mechanics, conformal symplectic dynamics, and relations between dynamics.he workshop by the grant DMS-2230648, “US Junior Oberwolfach Fellows”.}, author = {Arnaud, Marie-Claude and Hutchings, Michael and Kaloshin, Vadim}, issn = {1660-8941}, journal = {Oberwolfach Reports}, number = {3}, pages = {1671--1730}, publisher = {EMS Press}, title = {{Dynamische Systeme}}, doi = {10.4171/owr/2023/30}, volume = {20}, year = {2023}, } @misc{19308, abstract = {This Dataset contains the raw data from the following publication: "Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: towards improved real-time dual-mode biosensing" (DOI 10.3389/fphy.2023.1202132)}, author = {Hasler, Roger and Polt, Marie-Helene and Reiner-Rozman, Ciril and Fossati, Stefan and Lee, Seungho and Aspermair, Patrik and Kleber, Christoph and Ibáñez, Maria and Dostalek, Jakub and Knoll, Wolfgang}, publisher = {Zenodo}, title = {{Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing}}, doi = {10.5281/ZENODO.7716920}, year = {2023}, } @inproceedings{14744, abstract = {Sharding distributed ledgers is a promising on-chain solution for scaling blockchains but lacks formal grounds, nurturing skepticism on whether such complex systems can scale blockchains securely. We fill this gap by introducing the first formal framework as well as a roadmap to robust sharding. In particular, we first define the properties sharded distributed ledgers should fulfill. We build upon and extend the Bitcoin backbone protocol by defining consistency and scalability. Consistency encompasses the need for atomic execution of cross-shard transactions to preserve safety, whereas scalability encapsulates the speedup a sharded system can gain in comparison to a non-sharded system. Using our model, we explore the limitations of sharding. We show that a sharded ledger with n participants cannot scale under a fully adaptive adversary, but it can scale up to m shards where n=c'm log m, under an epoch-adaptive adversary; the constant c' encompasses the trade-off between security and scalability. This is possible only if the sharded ledgers create succinct proofs of the valid state updates at every epoch. We leverage our results to identify the sufficient components for robust sharding, which we incorporate in a protocol abstraction termed Divide & Scale. To demonstrate the power of our framework, we analyze the most prominent sharded blockchains (Elastico, Monoxide, OmniLedger, RapidChain) and pinpoint where they fail to meet the desired properties.}, author = {Avarikioti, Zeta and Desjardins, Antoine and Kokoris Kogias, Eleftherios and Wattenhofer, Roger}, booktitle = {30th International Colloquium on Structural Information and Communication Complexity}, isbn = {9783031327322}, issn = {1611-3349}, location = {Alcalá de Henares, Spain}, pages = {199--245}, publisher = {Springer Nature}, title = {{Divide & Scale: Formalization and roadmap to robust sharding}}, doi = {10.1007/978-3-031-32733-9_10}, volume = {13892}, year = {2023}, } @inproceedings{14748, author = {Chen, Yi-Lu and Ly, Mickaël and Wojtan, Christopher J}, booktitle = {Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation}, isbn = {9798400702686}, location = {Los Angeles, CA, United States}, publisher = {Association for Computing Machinery}, title = {{Unified treatment of contact, friction and shock-propagation in rigid body animation}}, doi = {10.1145/3606037.3606836}, year = {2023}, } @article{14749, abstract = {We unveil a powerful method for the stabilization of laser injection locking based on sensing variations in the output beam ellipticity of an optically seeded laser. The effect arises due to an interference between the seeding beam and the injected laser output. We demonstrate the method for a commercial semiconductor laser without the need for any internal changes to the readily operational injection locked laser system that was used. The method can also be used to increase the mode-hop free tuning range of lasers, and has the potential to fill a void in the low-noise laser industry.}, author = {Mishra, Umang and Li, Vyacheslav and Wald, Sebastian and Agafonova, Sofya and Diorico, Fritz R and Hosten, Onur}, issn = {1539-4794}, journal = {Optics Letters}, keywords = {Atomic and Molecular Physics, and Optics}, number = {15}, pages = {3973--3976}, publisher = {Optica Publishing Group}, title = {{Monitoring and active stabilization of laser injection locking using beam ellipticity}}, doi = {10.1364/ol.495553}, volume = {48}, year = {2023}, }