Blog
Hawking-Rényi black hole thermodynamics, Kiselev solution, and cosmic censorship
Explicit example, where the Hawking temperature of a black hole horizon is compatible with the black hole’s R\’enyi entropy thermodynamic description, is constructed. It is shown that for every static, spherically symmetric, vacuum black hole space-time, a corresponding black hole solution can...
Sorting as Gradient Flow on the Permutohedron
We investigate how sorting algorithms efficiently overcome the exponential size of the permutation space. Our main contribution is a new continuous-time formulation of sorting as a gradient flow on the permutohedron, yielding an independent proof of the classical $\Omega(n \log n)$ lower...
Detecting Cosmological Phase Transitions with Taiji: Sensitivity Analysis and Parameter Estimation
We investigate the capability of the Taiji space-based gravitational wave observatory to detect stochastic gravitational wave backgrounds produced by first-order phase transitions in the early universe. Using a comprehensive simulation framework that incorporates realistic instrumental noise, galactic double white dwarf confusion noise,...
Mixing Data-Driven and Physics-Based Constitutive Models using Uncertainty-Driven Phase Fields
There is a high interest in accelerating multiscale models using data-driven surrogate modeling techniques. Creating a large training dataset encompassing all relevant load scenarios is essential for a good surrogate, yet the computational cost of producing this data quickly becomes a limiting...
Modeling of Experimentally Observed Two-Dimensional Precursor Solitons in a Dusty Plasma by the forced Kadomtsev-Petviashvili Equation
We compare model solutions of a forced Kadomtsev-Petviashvili (fKP) equation with experimental observations of dust acoustic precursor solitons excited by a supersonically moving charged cylindrical object in a dusty plasma medium. The fKP equation is derived from a three-fluid-Poisson model of the...
Random walks on random networks of cliques: Inferring the network structure
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure — specifically, the distribution of clique size and the abundance...
Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
Quantum computing offers the potential for computational abilities that can go beyond classical machines. However, they are still limited by several challenges such as noise, decoherence, and gate errors. As a result, efficient classical simulation of quantum circuits is vital not only...
From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
Dynamic graph algorithms have seen significant theoretical advancements, but practical evaluations often lag behind. This work bridges the gap between theory and practice by engineering and empirically evaluating recently developed approximation algorithms for dynamically maintaining graph orientations. We comprehensively describe the underlying...
Quantum sensing with spin defects in boron nitride nanotubes
Spin defects in semiconductors are widely investigated for various applications in quantum sensing. Conventional host materials such as diamond and hexagonal boron nitride (hBN) provide bulk or low-dimensional platforms for optically addressable spin systems, but often lack the structural properties needed for...
IRIS: Interactive Research Ideation System for Accelerating Scientific Discovery
The rapid advancement in capabilities of large language models (LLMs) raises a pivotal question: How can LLMs accelerate scientific discovery? This work tackles the crucial first stage of research, generating novel hypotheses. While recent work on automated hypothesis generation focuses on multi-agent...