Publications

A new scheme is proposed to construct a $\mathcal{C}^n\$ function extension for smooth functions defined on a smooth domain $D\in \mathbb{R}^d$. Unlike the PUX scheme, which requires the extrapolation of the volume grid via an expensive ill-conditioned least squares fitting, the scheme relies on an explicit formula consisting of a linear combination of function values in $D,$ which only extends the function along the normal direction. To be more precise, the $\mathcal{C}^n$ extension requires only $n+1$ function values along the normal directions in the original domain and ensures $\mathcal{C}^n$ smoothness by construction. When combined with a shrinking function and a smooth window function, the scheme can be made stable and robust for a broad class of domains with complex smooth boundary.

Both the core collapse of rotating massive stars, and the coalescence of neutron star (NS) binaries, result in the formation of a hot, differentially rotating NS remnant. The timescales over which differential rotation is removed by internal angular-momentum transport processes ("viscosity") has key implications for the remnant's long-term stability and the NS equation-of-state (EOS). Guided by a non-rotating model of a cooling proto-NS, we estimate the dominant sources of viscosity using an externally imposed angular velocity profile Ω(r). Although the magnetorotational instability provides the dominant source of effective viscosity at large radii, convection and/or the Spruit-Tayler dynamo dominate in the core of merger remnants where dΩ/dr≥0. Furthermore, the viscous timescale in the remnant core is sufficiently short that solid body rotation will be enforced faster than matter is accreted from rotationally-supported outer layers. Guided by these results, we develop a toy model for how the merger remnant core grows in mass and angular momentum due to accretion. We find that merger remnants with sufficiently massive and slowly rotating initial cores may collapse to black holes via envelope accretion, even when the total remnant mass is less than the usually considered threshold ≈1.2MTOV for forming a stable solid-body rotating NS remnant (where MTOV is the maximum non-rotating NS mass supported by the EOS). This qualitatively new picture of the post-merger remnant evolution and stability criterion has important implications for the expected electromagnetic counterparts from binary NS mergers and for multi-messenger constraints on the NS EOS.

According to the standard model of cosmology, the arrangement of matter in the cosmos on scales much larger than galaxies is entirely specified by the initial conditions laid down during inflation. But zooming in by dozens of orders of magnitude to microscopic (and human?) scales, quantum randomness reigns, independent of the initial conditions. Where is the boundary of determinism, and how does that interplay with chaos? Here, we make a first attempt at answering this question in an astronomical context, including currently understood processes. The boundary is a function, at least, of length scale, position, and matter type (dark matter being more simply predictable). In intergalactic voids, the primordial pattern of density fluctuations is largely preserved. But we argue that within galaxies, the conditions are at minimum chaotic, and may even be influenced by non-primordial information, or randomness independent of the initial conditions. Randomness could be supplied by events such as supernovae and jets from active galactic nuclei (AGN) and other accretion disks, which, with the help of chaotic dynamics, could broadcast any possible microscopic randomness to larger scales, eventually throughout a galaxy. This may be generated or amplified by a recently investigated process called spontaneous stochasticity, or effective randomness in turbulent systems arising from arbitrarily small perturbations.

In this paper, the random iterative method is introduced to massive multiple-input multiple-output (MIMO) systems for the efficient downlink linear precoding. By adopting the random sampling into the traditional iterative methods, the matrix inversion within the linear precoding schemes can be approximated statistically, which not only achieves a faster exponential convergence with low complexity but also experiences a global convergence without suffering from the various convergence requirements. Specifically, based on the random iterative method, the randomized iterative precoding algorithm (RIPA) is firstly proposed and we show its approximation error decays exponentially and globally along with the number of iterations. Then, with respect to the derived convergence rate, the concept of conditional sampling is introduced, so that further optimization and enhancement are carried out to improve both the convergence and the efficiency of the randomized iterations. After that, based on the equivalent iteration transformation, the modified randomized iterative precoding algorithm (MRIPA) is presented, which achieves a better precoding performance with low-complexity for various scenarios of massive MIMO. Finally, simulation results based on downlink precoding in massive MIMO systems are given to show the system gains of RIPA and MRIPA in terms of performance and complexity.

We present an analytic model for clustered supernovae (SNe) feedback in galaxy disks, incorporating the dynamical evolution of superbubbles formed from spatially overlapping SNe remnants. We propose two realistic outcomes for the evolution of superbubbles in galactic disks: (1) the expansion velocity of the shock front falls below the turbulent velocity dispersion of the ISM in the galaxy disk, whereupon the superbubble stalls and fragments, depositing its momentum entirely within the galaxy disk, or (2) the superbubble grows in size to reach the gas scale height, breaking out of the galaxy disk and driving galactic outflows/fountains. In either case, we find that superbubble breakup/breakout almost always occurs before the last Type-II SN (≲40 Myr) in the recently formed star cluster, assuming a standard high-end IMF slope, and scalings between stellar lifetimes and masses. The threshold between these two cases implies a break in the effective strength of feedback in driving turbulence within galaxies, and a resulting change in the scalings of, e.g., star formation rates with gas surface density (the Kennicutt-Schmidt relation) and the star formation efficiency in galaxy disks.

Dust plays a pivotal role in determining the observed spectral energy distribution (SED) of galaxies. Yet our understanding of dust attenuation is limited and our observations suffer from the dust-metallicity-age degeneracy in SED fitting (single galaxies), large individual variances (ensemble measurements), and the difficulty in properly dealing with uncertainties (statistical considerations). In this study, we create a population Bayesian model to rigorously account for correlated variables and non-Gaussian error distributions and demonstrate the improvement over a simple Bayesian model. We employ a flexible 5-D linear interpolation model for the parameters that control dust attenuation curves as a function of stellar mass, star formation rate (SFR), metallicity, redshift, and inclination. Our setup allows us to determine the complex relationships between dust attenuation and these galaxy properties simultaneously. Using Prospector fits of nearly 30,000 3D-HST galaxies, we find that the attenuation slope (n) flattens with increasing optical depth (τ), though less so than in previous studies. τ increases strongly with SFR, though when log SFR≲0, τ remains roughly constant over a wide range of stellar masses. Edge-on galaxies tend to have larger τ than face-on galaxies, but only for log M∗≳10, reflecting the lack of triaxiality for low-mass galaxies. Redshift evolution of dust attenuation is strongest for low-mass, low-SFR galaxies, with higher optical depths but flatter curves at high redshift. Finally, n has a complex relationship with stellar mass, highlighting the intricacies of the star-dust geometry. We have publicly released software (this https URL) for users to access our population model.

We present a statistical learning framework for robust identification of differential equations from noisy spatio-temporal data. We address two issues that have so far limited the application of such methods, namely their robustness against noise and the need for manual parameter tuning, by proposing stability-based model selection to determine the level of regularization required for reproducible inference. This avoids manual parameter tuning and improves robustness against noise in the data. Our stability selection approach, termed PDE-STRIDE, can be combined with any sparsity-promoting regression method and provides an interpretable criterion for model component importance. We show that the particular combination of stability selection with the iterative hard-thresholding algorithm from compressed sensing provides a fast and robust framework for equation inference that outperforms previous approaches with respect to accuracy, amount of data required, and robustness. We illustrate the performance of PDE-STRIDE on a range of simulated benchmark problems, and we demonstrate the applicability of PDE-STRIDE on real-world data by considering purely data-driven inference of the protein interaction network for embryonic polarization in Caenorhabditis elegans. Using fluorescence microscopy images of C. elegans zygotes as input data, PDE-STRIDE is able to learn the molecular interactions of the proteins.

We train a neural network model to predict the full phase space evolution of cosmological N-body simulations. Its success implies that the neural network model is accurately approximating the Green's function expansion that relates the initial conditions of the simulations to its outcome at later times in the deeply nonlinear regime. We test the accuracy of this approximation by assessing its performance on well understood simple cases that have either known exact solutions or well understood expansions. These scenarios include spherical configurations, isolated plane waves, and two interacting plane waves: initial conditions that are very different from the Gaussian random fields used for training. We find our model generalizes well to these well understood scenarios, demonstrating that the networks have inferred general physical principles and learned the nonlinear mode couplings from the complex, random Gaussian training data. These tests also provide a useful diagnostic for finding the model's strengths and weaknesses, and identifying strategies for model improvement. We also test the model on initial conditions that contain only transverse modes, a family of modes that differ not only in their phases but also in their evolution from the longitudinal growing modes used in the training set. When the network encounters these initial conditions that are orthogonal to the training set, the model fails completely. In addition to these simple configurations, we evaluate the model's predictions for the density, displacement, and momentum power spectra with standard initial conditions for N-body simulations. We compare these summary statistics against N-body results and an approximate, fast simulation method called COLA. Our model achieves percent level accuracy at nonlinear scales of $$k ∼ 1 Mpc −1 h,$$ representing a significant improvement over COLA.

We present data structures and algorithms for native implementations of discrete convolution operators over Adaptive Particle Representations (APR) of images on parallel computer architectures. The APR is a content-adaptive image representation that locally adapts the sampling resolution to the image signal. It has been developed as an alternative to pixel representations for large, sparse images as they typically occur in fluorescence microscopy. It has been shown to reduce the memory and runtime costs of storing, visualizing, and processing such images. This, however, requires that image processing natively operates on APRs, without intermediately reverting to pixels. Designing efficient and scalable APR-native image processing primitives, however, is complicated by the APR’s irregular memory structure. Here, we provide the algorithmic building blocks required to efficiently and natively process APR images using a wide range of algorithms that can be formulated in terms of discrete convolutions. We show that APR convolution naturally leads to scale-adaptive algorithms that efficiently parallelize on multi-core CPU and GPU architectures. We quantify the speedups in comparison to pixel-based algorithms and convolutions on evenly sampled data. We achieve pixel-equivalent throughputs of up to 1TB/s on a single Nvidia GeForce RTX 2080 gaming GPU, requiring up to two orders of magnitude less memory than a pixel-based implementation.

We present an efficient basis for imaginary time Green's functions based on a low rank decomposition of the spectral Lehmann representation. The basis functions are simply a set of well-chosen exponentials, so the corresponding expansion may be thought of as a discrete form of the Lehmann representation using an effective spectral density which is a sum of δ functions. The basis is determined only by an upper bound on the product βωmax, with β the inverse temperature and ωmax an energy cutoff, and a user-defined error tolerance ϵ. The number r of basis functions scales as (log(βωmax)log(1/ϵ)). The discrete Lehmann representation of a particular imaginary time Green's function can be recovered by interpolation at a set of r imaginary time nodes. Both the basis functions and the interpolation nodes can be obtained rapidly using standard numerical linear algebra routines. Due to the simple form of the basis, the discrete Lehmann representation of a Green's function can be explicitly transformed to the Matsubara frequency domain, or obtained directly by interpolation on a Matsubara frequency grid. We benchmark the efficiency of the representation on simple cases, and with a high precision solution of the Sachdev-Ye-Kitaev equation at low temperature. We compare our approach with the related intermediate representation method, and introduce an improved algorithm to build the intermediate representation basis and a corresponding sampling grid.