@article{17474, abstract = {Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective. This gives rise to an objective function that demands the control of systems in a risk-averse manner. We show that the resulting games are determined and, in particular, admit optimal memoryless deterministic strategies. This contrasts risk measures that previously have been considered in the special case of Markov decision processes and that require randomization and/or memory. We provide several results on the decidability and the computational complexity of the threshold problem, i.e. whether the optimal value of ERisk exceeds a given threshold. Furthermore, an approximation algorithm for the optimal value of ERisk is provided.}, author = {Baier, Christel and Chatterjee, Krishnendu and Meggendorfer, Tobias and Piribauer, Jakob}, issn = {1090-2651}, journal = {Information and Computation}, publisher = {Elsevier}, title = {{Entropic risk for turn-based stochastic games}}, doi = {10.1016/j.ic.2024.105214}, volume = {301}, year = {2024}, } @article{17475, abstract = {As a discrete analogue of Kac’s celebrated question on ‘hearing the shape of a drum’ and towards a practical graph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by their spectrum (of their adjacency matrix). A striking conjecture in this area, due to van Dam and Haemers, is that ‘almost all graphs are determined by their spectrum’, meaning that the fraction of unlabelled n-vertex graphs which are determined by their spectrum converges to 1 as n → ∞. In this paper, we make a step towards this conjecture, showing that there are exponentially many n-vertex graphs which are determined by their spectrum. This improves on previous bounds (of shape e c √ n ). We also propose a number of further directions of research. }, author = {Koval, Illya and Kwan, Matthew Alan}, issn = {1464-3847}, journal = {Quarterly Journal of Mathematics}, number = {3}, pages = {869--899}, publisher = {Oxford University Press}, title = {{Exponentially many graphs are determined by their spectrum}}, doi = {10.1093/qmath/haae030}, volume = {75}, year = {2024}, } @article{17476, abstract = {Lead halide perovskites have recently been reported to demonstrate an exceptionally high nonlinear (Kerr) refractive index n2 of up to 10−8cm2/W in CH3⁢NH3⁢PbBr3. Other researchers, however, observe different, substantially more conservative numbers. In order to resolve this disagreement, the nonlinear Kerr index of a bulk sample of lead halide perovskite was measured directly by means of an interferometer. This approach has many advantages as compared to the more standard z-scan technique. In particular, this method allows studying the induced changes to the refractive index in a time-resolved manner, thus enabling to separate the different contributions to 𝑛2. The extracted 𝑛2 values for CsPbBr3 and MAPbBr3 at 𝜆≈1µ⁢m are 𝑛2=+2.1×10−14cm2/W and 𝑛2=+6×10−15cm2/W, respectively. Hence, these values are substantially lower than what has been indicated in most of the previous reports, implying the latter one should be regarded with great care.}, author = {Lorenc, Dusan and Zhumekenov, Ayan and Bakr, Osman M. and Alpichshev, Zhanybek}, issn = {2475-9953}, journal = {Physical Review Materials}, number = {8}, publisher = {American Physical Society}, title = {{No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry}}, doi = {10.1103/PhysRevMaterials.8.085403}, volume = {8}, year = {2024}, } @article{17477, abstract = {Trapped-ion systems are a leading platform for quantum information processing, but they are currently limited to 1D and 2D arrays, which imposes restrictions on both their scalability and their range of applications. Here, we propose a path to overcome this limitation by demonstrating that Penning traps can be used to realize remarkably clean bilayer crystals, wherein hundreds of ions self-organize into two well-defined layers. These bilayer crystals are made possible by the inclusion of an anharmonic trapping potential, which is readily implementable with current technology. We study the normal modes of this system and discover salient differences compared to the modes of single-plane crystals. The bilayer geometry and the unique properties of the normal modes open new opportunities—in particular, in quantum sensing and quantum simulation—that are not straightforward in single-plane crystals. Furthermore, we illustrate that it may be possible to extend the ideas presented here to realize multilayer crystals with more than two layers. Our work increases the dimensionality of trapped-ion systems by efficiently utilizing all three spatial dimensions, and it lays the foundation for a new generation of quantum information processing experiments with multilayer 3D crystals of trapped ions.}, author = {Hawaldar, Samarth and Shahi, Prakriti and Carter, Allison L. and Rey, Ana Maria and Bollinger, John J. and Shankar, Athreya}, issn = {2160-3308}, journal = {Physical Review X}, number = {3}, publisher = {American Physical Society}, title = {{Bilayer crystals of trapped ions for quantum information processing}}, doi = {10.1103/PhysRevX.14.031030}, volume = {14}, year = {2024}, } @article{17478, abstract = {We study the Fröhlich polaron model in R3, and prove a lower bound on its ground state energy as a function of the total momentum. The bound is asymptotically sharp at large coupling. In combination with a corresponding upper bound proved earlier (Mitrouskas et al. in Forum Math. Sigma 11:1–52, 2023), it shows that the energy is approximately parabolic below the continuum threshold, and that the polaron’s effective mass (defined as the semi-latus rectum of the parabola) is given by the celebrated Landau–Pekar formula. In particular, it diverges as α4 for large coupling constant α.}, author = {Brooks, Morris and Seiringer, Robert}, issn = {1618-1913}, journal = {Publications Mathematiques de l'Institut des Hautes Etudes Scientifiques}, pages = {271--309}, publisher = {Springer Nature}, title = {{The Fröhlich polaron at strong coupling: Part II — Energy-momentum relation and effective mass}}, doi = {10.1007/s10240-024-00150-0}, volume = {140}, year = {2024}, } @article{17479, abstract = {Phonon polaritons (PhPs), light coupled to lattice vibrations, in the highly anisotropic polar layered material molybdenum trioxide (α-MoO3) are currently the focus of intense research efforts due to their extreme subwavelength field confinement, directional propagation, and unprecedented low losses. Nevertheless, prior research has primarily concentrated on exploiting the squeezing and steering capabilities of α-MoO3 PhPs, without inquiring much into the dominant microscopic mechanism that determines their long lifetimes, which is key for their implementation in nanophotonic applications. This study delves into the fundamental processes that govern PhP damping in α-MoO3 by combining ab initio calculations with scattering-type scanning near-field optical microscopy (s-SNOM) and Fourier transform infrared (FTIR) spectroscopy measurements across a broad temperature range (8–300 K). The remarkable agreement between our theoretical predictions and experimental observations allows us to identify third-order anharmonic phonon–phonon scattering as the main damping mechanism of α-MoO3 PhPs. These findings shed light on the fundamental limits of low-loss PhPs, which is a crucial factor for assessing their implementation into nanophotonic devices.}, author = {Taboada-Gutiérrez, Javier and Zhou, Yixi and Tresguerres-Mata, Ana I.F. and Lanza, Christian and Martínez-Suárez, Abel and Álvarez-Pérez, Gonzalo and Duan, Jiahua and Martín, José Ignacio and Vélez, María and Prieto Gonzalez, Ivan and Bercher, Adrien and Teyssier, Jérémie and Errea, Ion and Nikitin, Alexey Y. and Martín-Sánchez, Javier and Kuzmenko, Alexey B. and Alonso-González, Pablo}, issn = {2330-4022}, journal = {ACS Photonics}, number = {9}, pages = {3570--3577}, publisher = {American Chemical Society}, title = {{Unveiling the mechanism of phonon-polariton damping in α‑MoO3}}, doi = {10.1021/acsphotonics.4c00485}, volume = {11}, year = {2024}, } @article{17480, abstract = {One of the most promising approaches towards large-scale quantum computation uses devices based on many Josephson junctions. Yet, even today, open questions regarding the single junction remain unsolved, such as the detailed understanding of the quantum phase transitions, the coupling of the Josephson junction to the environment or how to improve the coherence of a superconducting qubit. Here we design and build an engineered on-chip reservoir connected to a Josephson junction that acts as an efficient bolometer for detecting the Josephson radiation under non-equilibrium, that is, biased conditions. The bolometer converts the a.c. Josephson current at microwave frequencies up to about 100 GHz into a temperature rise measured by d.c. thermometry. A circuit model based on realistic parameter values captures both the current–voltage characteristics and the measured power quantitatively. The present experiment demonstrates an efficient, wide-band, thermal detection scheme of microwave photons and provides a sensitive detector of Josephson dynamics beyond the standard conductance measurements.}, author = {Karimi, Bayan and Steffensen, Gorm Ole and Higginbotham, Andrew P and Marcus, Charles M. and Levy Yeyati, Alfredo and Pekola, Jukka P.}, issn = {1748-3395}, journal = {Nature Nanotechnology}, pages = {1613--1618}, publisher = {Springer Nature}, title = {{Bolometric detection of Josephson radiation}}, doi = {10.1038/s41565-024-01770-7}, volume = {19}, year = {2024}, } @article{17481, abstract = {Phase-field models such as the Allen–Cahn equation may give rise to the formation and evolution of geometric shapes, a phenomenon that may be analyzed rigorously in suitable scaling regimes. In its sharp-interface limit, the vectorial Allen–Cahn equation with a potential with N≥3 distinct minima has been conjectured to describe the evolution of branched interfaces by multiphase mean curvature flow. In the present work, we give a rigorous proof for this statement in two and three ambient dimensions and for a suitable class of potentials: as long as a strong solution to multiphase mean curvature flow exists, solutions to the vectorial Allen–Cahn equation with well-prepared initial data converge towards multiphase mean curvature flow in the limit of vanishing interface width parameter ε↘0. We even establish the rate of convergence O(ε 1/2 ). Our approach is based on the gradient-flow structure of the Allen–Cahn equation and its limiting motion: building on the recent concept of “gradient-flow calibrations” for multiphase mean curvature flow, we introduce a notion of relative entropy for the vectorial Allen–Cahn equation with multi-well potential. This enables us to overcome the limitations of other approaches, e.g. avoiding the need for a stability analysis of the Allen–Cahn operator or additional convergence hypotheses for the energy at positive times.}, author = {Fischer, Julian L and Marveggio, Alice}, issn = {1873-1430}, journal = {Annales de l'Institut Henri Poincare C}, number = {5}, pages = {1117--1178}, publisher = {EMS Press}, title = {{Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow}}, doi = {10.4171/AIHPC/109}, volume = {41}, year = {2024}, } @phdthesis{17485, abstract = {Large language models (LLMs) have made tremendous progress in the past few years, from being able to generate coherent text to matching or surpassing humans in a wide variety of creative, knowledge or reasoning tasks. Much of this can be attributed to massively increased scale, both in the size of the model as well as the amount of training data, from 100s of millions to 100s of billions, or even trillions. This trend is expected to continue, which, although exciting, also raises major practical concerns. Already today's 100+ billion parameter LLMs require top-of-the-line hardware just to run. Hence, it is clear that sustaining these developments will require significant efficiency advances. Historically, one of the most practical ways of improving model efficiency has been compression, especially in the form of sparsity or quantization. While this has been studied extensively in the past, existing accurate methods are all designed for models around 100 million parameters; scaling them up to ones literally 1000x larger is highly challenging. In this thesis, we introduce a new unified sparsification and quantization approach OBC, which through additional algorithmic enhancements leads to GPTQ and SparseGPT, the first techniques fast and accurate enough to compress 100+ billion parameter models to 4- or even 3-bit precision and 50% weight-sparsity, respectively. Additionally, we show how weight-only quantizion does not just bring space savings but also up to 4.5x faster generation speed, via custom GPU kernels. In fact, we show for the first time that it is possible to develop an FP16 times INT4 mixed-precision matrix multiplication kernel, called Marlin, which comes close to simultaneously maximizing both memory and compute utilization, making weight-only quantization highly practical even for multi-user serving. Further, we demonstrate that GPTQ can be scaled to widely overparametrized trillion-parameter models, where extreme sub-1-bit compression rates can be achieved without any inference slow-down, by co-designing a bespoke entropy coding scheme together with an efficient kernel. Finally, we also study compression from the perspective of someone with access to massive amounts of compute resources for training large models completely from scratch. Here the key questions evolve around the joint scaling behavior between compression, model size, and amount of training data used. Based on extensive experimental results for both vision and text models, we introduce the first scaling law which accurately captures the relationship between weight-sparsity, number of non-zero weights and data. This further allows us to characterize the optimal sparsity, which we find to increase the longer a fixed cost model is being trained. Overall, this thesis presents contributions to three different angles of large model efficiency: affordable but accurate algorithms, highly efficient systems implementations, and fundamental scaling laws for compressed training.}, author = {Frantar, Elias}, issn = {2663-337X}, pages = {129}, publisher = {Institute of Science and Technology Austria}, title = {{Compressing large neural networks : Algorithms, systems and scaling laws}}, doi = {10.15479/at:ista:17485}, year = {2024}, } @misc{17488, abstract = {Behavioural data for Pokusaeva, Satapathy et al. Relevant information can be found in the 'README.txt' file.}, author = {Satapathy, Roshan K and Jösch, Maximilian A and Symonova, Olga and Pokusaeva, Victoria}, keywords = {drosophila, behaviour, locomotion, gap junctions}, publisher = {Institute of Science and Technology Austria}, title = {{Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies}}, doi = {10.15479/AT:ISTA:17488}, year = {2024}, } @phdthesis{17490, abstract = {Deep learning is essential in numerous applications nowadays, with many recent advancements made possible by training very large models. Despite their broad applicability, training neural networks is often time-intensive, and it is usually impractical to manage large models and datasets on a single machine. To address these issues, distributed deep learning training has become increasingly important. However, distributed training requires synchronization among nodes, and the mini-batch stochastic gradient descent algorithm places a significant load on network connections. A possible solution to tackle the synchronization bottleneck is to reduce a message size by lossy compression. In this thesis, we investigate systems and algorithmic approaches to communication compression during training. From the systems perspective, we demonstrate that a common approach of expensive hardware overprovisioning can be replaced through a thorough system design. We introduce a framework that introduces efficient software support for compressed communication in machine learning applications, applicable to both multi-GPU single-node training and larger-scale multi-node training. Our framework integrates with popular ML frameworks, providing up to 3x speedups for multi-GPU nodes based on commodity hardware and order-of-magnitude improvements in the multi-node setting, with negligible impact on accuracy. Also, we consider an application of our framework to different communication schemes, such as Fully Sharded Data Parallel. We provide strong convergence guarantees for the compression in such a setup. Empirical validation shows that our method preserves model accuracy for GPT-family models with up to 1.3 billion parameters, while completely removing the communication bottlenecks of non-compressed alternatives, providing up to 2.2x speedups end-to-end. From the algorithmic side, we propose a general framework that dynamically adjusts the degree of compression across a model's layers during training. This approach enhances overall compression and results in significant speedups without compromising accuracy. Our algorithm utilizes an adaptive algorithm that automatically selects the optimal compression parameters for model layers, ensuring the best compression ratio while adhering to an error constraint. Our method is effective across all existing families of compression methods. It achieves up to 2.5x faster training and up to a 5x improvement in compression compared to efficient implementations of current approaches. Additionally, LGreCo can complement existing adaptive algorithms. }, author = {Markov, Ilia}, issn = {2663-337X}, pages = {102}, publisher = {Institute of Science and Technology Austria}, title = {{Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective}}, doi = {10.15479/at:ista:17490}, year = {2024}, } @article{17493, abstract = {Estimating global properties of many-body quantum systems such as entropy or bipartite entanglement is a notoriously difficult task, typically requiring a number of measurements or classical postprocessing resources growing exponentially in the system size. In this work, we address the problem of estimating global entropies and mixed-state entanglement via partial-transposed (PT) moments and show that efficient estimation strategies exist under the assumption that all the spatial correlation lengths are finite. Focusing on one-dimensional systems, we identify a set of approximate factorization conditions (AFCs) on the system density matrix, which allow us to reconstruct entropies and PT moments from information on local subsystems. This identification yields a simple and efficient strategy for entropy and entanglement estimation. Our method could be implemented in different ways, depending on how information on local subsystems is extracted. Focusing on randomized measurements providing a practical and common measurement scheme, we prove that our protocol requires only polynomially many measurements and postprocessing operations, assuming that the state to be measured satisfies the AFCs. We prove that the AFCs hold for finite-depth quantum-circuit states and translation-invariant matrix-product density operators and provide numerical evidence that they are satisfied in more general, physically interesting cases, including thermal states of local Hamiltonians. We argue that our method could be practically useful to detect bipartite mixed-state entanglement for large numbers of qubits available in today’s quantum platforms.}, author = {Vermersch, Benoît and Ljubotina, Marko and Cirac, J. Ignacio and Zoller, Peter and Serbyn, Maksym and Piroli, Lorenzo}, issn = {2160-3308}, journal = {Physical Review X}, number = {3}, publisher = {American Physical Society}, title = {{Many-body entropies and entanglement from polynomially many local measurements}}, doi = {10.1103/physrevx.14.031035}, volume = {14}, year = {2024}, } @article{17494, author = {Bravo, Jack Peter Kelly}, issn = {1746-0921}, journal = {Future Microbiology}, number = {15}, pages = {1269--1272}, publisher = {Taylor & Francis}, title = {{Anti-plasmid immunity: A key to pathogen success?}}, doi = {10.1080/17460913.2024.2389720}, volume = {19}, year = {2024}, } @article{17495, abstract = {Rust is a modern systems programming language whose ownership-based type system statically guarantees memory safety, making it particularly well-suited to the domain of safety-critical systems. In recent years, a wellspring of automated deductive verification tools have emerged for establishing functional correctness of Rust code. However, none of the previous tools produce foundational proofs (machine-checkable in a general-purpose proof assistant), and all of them are restricted to the safe fragment of Rust. This is a problem because the vast majority of Rust programs make use of unsafe code at critical points, such as in the implementation of widely-used APIs. We propose RefinedRust, a refinement type system—proven sound in the Coq proof assistant—with the goal of establishing foundational semi-automated functional correctness verification of both safe and unsafe Rust code. We have developed a prototype verification tool implementing RefinedRust. Our tool translates Rust code (with user annotations) into a model of Rust embedded in Coq, and then checks its adherence to the RefinedRust type system using separation logic automation in Coq. All proofs generated by RefinedRust are checked by the Coq proof assistant, so the automation and type system do not have to be trusted. We evaluate the effectiveness of RefinedRust by verifying a variant of Rust’s Vec implementation that involves intricate reasoning about unsafe pointer-manipulating code.}, author = {Gäher, Lennard and Sammler, Michael Joachim and Jung, Ralf and Krebbers, Robbert and Dreyer, Derek}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, number = {PLDI}, pages = {1115--1139}, publisher = {Association for Computing Machinery}, title = {{RefinedRust: A type system for high-assurance verification of rust programs}}, doi = {10.1145/3656422}, volume = {8}, year = {2024}, } @article{17497, abstract = {Over the past two decades, there has been a great deal of progress on verification of full functional correctness of programs using separation logic, sometimes even producing “foundational” proofs in proof assistants like Coq. Unfortunately, even though existing approaches to this problem provide significant support for automated verification, they still incur a significant specification overhead: the user must supply the specification against which the program is verified, and the specification may be long, complex, or tedious to formulate. In this paper, we introduce Quiver, the first technique for inferring functional correctness specifications in separation logic while simultaneously verifying foundationally that they are correct. To guide Quiver towards the final specification, we take hints from the user in the form of a specification sketch, and then complete the sketch using inference. To do so, Quiver introduces a new abductive deductive verification technique, which integrates ideas from abductive inference (for specification inference) together with deductive separation logic automation (for foundational verification). The result is that users have to provide some guidance, but significantly less than with traditional deductive verification techniques based on separation logic. We have evaluated Quiver on a range of case studies, including code from popular open-source libraries.}, author = {Spies, Simon and Gäher, Lennard and Sammler, Michael Joachim and Dreyer, Derek}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, number = {PLDI}, pages = {889--913}, publisher = {Association for Computing Machinery}, title = {{Quiver: Guided abductive inference of separation logic specifications in coq}}, doi = {10.1145/3656413}, volume = {8}, year = {2024}, } @article{17517, abstract = {We present an analysis of NuSTAR X-ray observations of three active galactic nuclei (AGN) that were identified as candidate subparsec binary supermassive black hole (SMBH) systems in the Catalina Real-Time Transient Survey based on apparent periodicity in their optical light curves. Simulations predict that close-separation accreting SMBH binaries will have different X-ray spectra than single accreting SMBHs. We previously observed these AGN with Chandra and found no differences between their low-energy X-ray properties and the larger AGN population. However, some models predict differences to be more prominent at energies higher than probed by Chandra. We find that even at the higher energies probed by NuSTAR, the spectra of these AGN are indistinguishable from the larger AGN population. This could rule out models predicting large differences in the X-ray spectra in the NuSTAR bands. Alternatively, it might mean that these three AGN are not binary SMBHs.}, author = {Saade, M. Lynne and Brightman, Murray and Stern, Daniel and Connor, Thomas and Djorgovski, S. G. and D’Orazio, Daniel J. and Ford, K. E. S. and Graham, Matthew J. and Haiman, Zoltán and Jun, Hyunsung D. and Kammoun, Elias and Kraft, Ralph P. and McKernan, Barry and Vikhlinin, Alexei and Walton, Dominic J.}, issn = {0004-637X}, journal = {The Astrophysical Journal}, number = {1}, publisher = {American Astronomical Society}, title = {{NuSTAR observations of candidate subparsec binary supermassive black holes}}, doi = {10.3847/1538-4357/ad372e}, volume = {966}, year = {2024}, } @article{17531, abstract = {The astrophysical origin of stellar-mass black hole (BH) mergers discovered through gravitational waves (GWs) is widely debated. Mergers in the disks of active galactic nuclei (AGNs) represent promising environments for at least a fraction of these events, with possible observational clues in the GW data. An additional clue to unveil AGN merger environments is provided by possible electromagnetic emission from postmerger accreting BHs. Associated with BH mergers in AGN disks, emission from shocks emerging around jets launched by accreting merger remnants is expected. Here we compute the properties of the emission produced during breakout and the subsequent adiabatic expansion phase of the shocks, and we then apply this model to optical flares suggested to be possibly associated with GW events. We find that the majority of the reported flares can be explained by breakout and shock cooling emission. If the optical flares are produced by shock cooling emission, they would display moderate color evolution, possibly color variations among different events, and a positive correlation between delay time and flare duration and would be preceded by breakout emission in X-rays. If the breakout emission dominates the observed lightcurve, we predict the color to be distributed in a narrow range in the optical band and the delay time from GW to electromagnetic emission to be longer than ∼2 days. Hence, further explorations of delay time distributions, flare color evolution, and associated X-ray emission will be useful to test the proposed emission model for the observed flares.}, author = {Tagawa, Hiromichi and Kimura, Shigeo S and Haiman, Zoltán and Perna, Rosalba and Bartos, Imre}, issn = {0004-637X}, journal = {The Astrophysical Journal}, number = {1}, publisher = {American Astronomical Society}, title = {{Shock cooling and breakout emission for optical flares associated with gravitational-wave events}}, doi = {10.3847/1538-4357/ad2e0b}, volume = {966}, year = {2024}, } @article{17535, abstract = {Supermassive black holes (SMBHs) with masses of ∼109 M⊙ within the first billion year of the universe challenge our conventional understanding of black hole formation and growth. One pathway to these SMBHs proposes that supermassive stars born in pristine atomic cooling haloes yield massive seed BHs evolving to these early SMBHs. This scenario leads to an overly massive BH galaxy (OMBG), in which the BH to stellar mass ratio is initially Mbh/M* ≥ 1, well in excess of the typical values of ∼10−3 at low redshifts. Previously, we have investigated two massive seed BH candidates from the Renaissance simulation and found that they remain outliers on the Mbh–M* relation until the OMBG merges with a much more massive halo at z = 8. In this work, we use Monte-Carlo merger trees to investigate the evolution of the Mbh–M* relation for 50 000 protogalaxies hosting massive BH seeds, across 10 000 trees that merge into a 1012 M⊙ halo at z = 6. We find that up to 60 per cent (depending on growth parameters) of these OMBGs remain strong outliers for several 100 Myr, down to redshifts detectable with JWST and with sensitive X-ray telescopes. This represents a way to diagnose the massive-seed formation pathway for early SMBHs. We expect to find ∼0.1–1 of these objects per JWST Near Infrared Camera (NIRCam) field per unit redshift at z ≳ 6. Recently detected SMBHs with masses of ∼107 M⊙ and low-inferred stellar-mass hosts may be examples of this population.}, author = {Scoggins, Matthew T and Haiman, Zoltán}, issn = {0035-8711}, journal = {Monthly Notices of the Royal Astronomical Society}, number = {4}, pages = {4584--4597}, publisher = {Oxford University Press}, title = {{Diagnosing the massive-seed pathway to high-redshift black holes: statistics of the evolving black hole to host galaxy mass ratio}}, doi = {10.1093/mnras/stae1449}, volume = {531}, year = {2024}, } @article{17545, abstract = {Self-lensing flares (SLFs) are expected to be produced once or twice per orbit by an accreting massive black hole binary (MBHB), if the eclipsing MBHBs are observed close to edge-on. SLFs can provide valuable electromagnetic (EM) signatures to accompany the gravitational waves (GWs) detectable by the upcoming Laser Interferometer Space Antenna (LISA). EM follow-ups are crucial for, e.g., sky-localization, and constraining the Hubble constant and the graviton mass. We use high-resolution two-dimensional viscous hydrodynamical simulations of a circumbinary disk (CBD) embedding a MBHB. We then use very high-cadence output of these hydrodynamical simulation inputs for a general-relativistic ray-tracing code to produce synthetic spectra and phase-folded light curves. Our main results show a significant periodic amplification of the flux with the characteristic shape of a sharp flare with a central dip, as the foreground black hole (BH) transits across the minidisk and shadow of the background BH, respectively. These corroborate previous conclusions based on the microlensing approximation and analytical toy models of the emission geometry. We also find that at lower inclinations, without some occlusion of the minidisk emission by the CBD, shocks from quasi-periodic mass-trading between the minidisks can produce bright flares which can mimic SLFs and could hinder their identification.}, author = {Krauth, Luke Major and Davelaar, Jordy and Haiman, Zoltán and Westernacher-Schneider, John Ryan and Zrake, Jonathan and MacFadyen, Andrew}, issn = {2470-0010}, journal = {Physical Review D}, number = {10}, publisher = {American Physical Society (APS)}, title = {{Self-lensing flares from black hole binaries: General-relativistic ray tracing of circumbinary accretion simulations}}, doi = {10.1103/physrevd.109.103014}, volume = {109}, year = {2024}, } @article{17546, abstract = {We show that gas disks around the components of an orbiting binary system (so-called minidisks) may be susceptible to a resonant instability that causes the minidisks to become significantly eccentric. Eccentricity is injected by, and also induces, regular impacts between the minidisks at roughly the orbital period of the binary. Such eccentric minidisks are seen in vertically integrated, two-dimensional simulations of a circular, equal-mass binary accreting from a circumbinary gas disk with a Γ-law equation of state. Minidisk eccentricity is suppressed by the use of an isothermal equation of state. However, the instability still operates and can be revealed in a minimal disk-binary simulation by removing the circumbinary disk and feeding the minidisks from the component positions. Minidisk eccentricity is also suppressed when the gravitational softening length is large (≳4% of the binary semimajor axis), suggesting that its absence could be an artifact of widely adopted numerical approximations; a follow-up study in three dimensions with well-resolved, geometrically thin minidisks (aspect ratios ≲0.02) may be needed to assess whether eccentric minidisks can occur in real astrophysical environments. If they can, the electromagnetic signature may be important for discriminating between binary and single black hole scenarios for quasiperiodic oscillations in active galactic nuclei; in turn, this might aid in targeted searches with pulsar timing arrays for individual supermassive black hole binary sources of low-frequency gravitational waves.}, author = {Westernacher-Schneider, John Ryan and Zrake, Jonathan and MacFadyen, Andrew and Haiman, Zoltán}, issn = {0004-637X}, journal = {The Astrophysical Journal}, number = {1}, publisher = {American Astronomical Society}, title = {{Eccentric minidisks in accreting binaries}}, doi = {10.3847/1538-4357/ad1a17}, volume = {962}, year = {2024}, }