Related papers: Black Hole Search: Dynamics, Distribution, and Eme…
A black hole is considered to be a dangerous node present in a graph that disposes of any resources that enter that node. Therefore, it is essential to find such a node in the graph. Let a group of agents be present on a graph $G$. The…
In this paper, we address the challenge of locating a black hole within a dynamic graph using a set of scattered agents, which start from arbitrary positions in the graph. A black hole is defined as a node that silently eliminates any agent…
A black hole is a harmful node in a graph that destroys any agent entering it, making its identification a critical task. In the \emph{Black Hole Search with Verification (BHSV)} problem, a team of agents operates on a graph $G$ with the…
In this paper, we start the investigation of distributed computing by mobile agents in dangerous dynamic networks. The danger is posed by the presence in the network of a black hole BH, a harmful site that destroys all incoming agents…
We study the problem of black hole search by a set of mobile agents, where the underlying graph is a dynamic cactus. A black hole is a dangerous vertex in the graph that eliminates any visiting agent without leaving any trace behind. Key…
We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole is a harmful stationary process residing in a node of the network and…
A Black Hole is an harmful host in a network that destroys incoming agents without leaving any trace of such event. The problem of locating the black hole in a network through a team of agent coordinated by a common protocol is usually…
We investigate the black hole search problem by a set of mobile agents in a dynamic torus. Black hole is defined to be a dangerous stationary node which has the capability to destroy any number of incoming agents without leaving any trace…
We consider the problem of locating a black hole in synchronous anonymous networks using finite state agents. A black hole is a harmful node in the network that destroys any agent visiting that node without leaving any trace. The objective…
Perpetual exploration is a fundamental problem in the domain of mobile agents, where an agent needs to visit each node infinitely often. This issue has received lot of attention, mainly for ring topologies, presence of black holes adds more…
We propose the Wasserstein Black Hole Transformer (WBHT) framework for detecting black hole (BH) anomalies in communication networks. These anomalies cause packet loss without failure notifications, disrupting connectivity and leading to…
We review the motivation and search for supermassive black holes (BHs) in galaxies. Energetic nuclear activity provides indirect but compelling evidence for BH engines. Ground-based dynamical searches for central dark objects are reviewed…
Motivated by recent detections of black hole binary systems through gravitational waves, in this thesis we discuss two complementary channels for the observation of Primordial Black Holes (PBHs) with masses between a few and a hundred solar…
A novel analytical Schwarzschild-like black hole (BH) solution is derived. It exhibits a static BH with a dark matter (DM) halo characterized by a Dehnen-type density profile. This solution could represent an alternative perspective on the…
Black holes (BHs) formed by collapsing and/or merging of magnetized progenitors, have magnetic fields penetrating the event horizon, and there are several possible scenarios. Thus, the no-hair theorem that assumes the outside medium is a…
The detailed feeding and feedback mechanisms of Active Galactic Nuclei (AGN) are not yet well known. For low-luminosity and obscured AGN, as well as late-type galaxies, determining the central black hole (BH) masses is challenging. Our goal…
Black holes are chaotic quantum systems that are expected to exhibit random matrix statistics in their finite energy spectrum. Lin, Maldacena, Rozenberg and Shan (LMRS) have proposed a related characterization of chaos for the ground states…
Accurate and efficient modeling of the dynamics of binary black holes (BBHs) is crucial to their detection through gravitational waves (GWs), with LIGO/Virgo/KAGRA, and LISA in the future. Solving the dynamics of a BBH system with arbitrary…
Graph burning is a process of information spreading through the network by an agent in discrete steps. The problem is to find an optimal sequence of nodes which have to be given information so that the network is covered in least number of…
We study the Cooperative Guarding problem for polygons with holes in a mobile multi-agents setting. Given a set of agents, initially deployed at a point in a polygon with $n$ vertices and $h$ holes, we require the agents to collaboratively…