Related papers: Black Hole Search: Dynamics, Distribution, and Eme…
The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper of Gavinsky et. al. [STOC'07], has played an important role in the streaming lower bounds for graph problems such as triangle and subgraph counting, maximum matching,…
Following LIGO results of intermediate mass black holes mergers, the idea that dark matter is composed of Primordial Black Boles (PBH), made a recent comeback. PBHs might be formed in the early Universe through a variety of mechanisms, best…
We investigate the halo occupation distribution (HOD) of black holes within a hydrodynamic cosmological simulation that directly follows black hole growth. Similar to the HOD of galaxies/subhalos, we find that the black hole occupation…
Galaxies observed today are likely to have evolved from density perturbations in the early universe. Perturbations that exceeded some critical threshold are conjectured to have undergone gravitational collapse to form primordial black holes…
By consideration of a Einstein-dilaton non-linear charged gravitating system, it has been shown that this theory is confronted with the problem of indeterminacy. It means that the number of independent differential equations is one less…
A mobile agent navigating along edges of a simple connected graph, either finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task is known as treasure hunt. The agent has no a priori…
Apparent horizon (AH) finders are essential for characterizing black holes and excising their interiors in numerical relativity (NR) simulations. However, open-source AH finders to date are tightly coupled to individual NR codes. We…
Gravitational wave (GW) detections of binary black hole (BH) mergers have begun to sample the cosmic BH mass distribution. The evolution of single stellar cores predicts a gap in the BH mass distribution due to pair-instability supernova…
Wireless sensor networks are vulnerable to several attacks, one of them being the black hole attack. A black hole is a malicious node that attracts all the traffic in the network by advertising that it has the shortest path in the network.…
This resource letter is designed to guide students, educators, and researchers through (some of) the literature on black holes. Both the physics and astrophysics of black holes are discussed. Breadth has been emphasized over depth, and…
The robustness of stellar-dynamical black hole (BH) mass measurements is illustrated using 7 galaxies that have results from independent groups. Derived masses have remained constant to a factor of about 2 as spatial resolution has improved…
Vector databases serve as the retrieval backbone of modern AI applications, yet their security remains largely unexplored. We propose the Black-Hole Attack, a poisoning attack that injects a small number of malicious vectors near the…
[abridged] We investigate the coevolution of galaxies and hosted supermassive black holes throughout the history of the Universe by a statistical approach based on the continuity equation and the abundance matching technique. Specifically,…
Black-hole perturbation theory is a useful tool to investigate issues in astrophysics, high-energy physics, and fundamental problems in gravity. It is often complementary to fully-fledged nonlinear evolutions and instrumental to interpret…
With mass ratio larger than $\sim 5$ (which depends on the black hole spin and the star radius), star disruption is not expected for a black hole merging with a neutron star during the final plunge phase. In the late inspiral stage, the…
There are several on-going projects to search for stars orbiting around an invisible companion. A fraction of such candidates may be a triple, instead of a binary, consisting of an inner binary black hole (BBH) and an outer orbiting star.…
In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search…
Network decontamination is a well-known problem, in which the aim of the mobile agents should be to decontaminate the network (i.e., both nodes and edges). This problem comes with an added constraint, i.e., of \emph{monotonicity}, in which…
We investigate two fundamental problems in mobile computing: exploration and rendezvous, with two distinct mobile agents in an unknown graph. The agents may communicate by reading and writing information on whiteboards that are located at…
Despite the crucial importance of addressing Black Hole failures in Internet backbone networks, effective detection strategies in backbone networks are lacking. This is largely because previous research has been centered on Mobile Ad-hoc…