Related papers: Black Hole Search in Dynamic Cactus Graph
We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given…
In recent years, the proposal that there is a large population of primordial black holes living in dense clusters has been gaining popularity. One natural consequence of these dense clusters will be that the black holes inside will…
Recently, B\"ockenhauer, Frei, Unger, and Wehner (SIROCCO 2023) introduced a novel variant of the graph exploration problem in which a single memoryless agent must visit all nodes of an unknown, undirected, and connected graph before…
Given a graph $G$, guards are placed on vertices of $G$. Then vertices are subject to an infinite sequence of attacks so that each attack must be defended by a guard moving from a neighboring vertex. The m-eternal domination number is the…
Treasure hunt and rendezvous are fundamental tasks performed by mobile agents in graphs. In treasure hunt, an agent has to find an inert target (called treasure) situated at an unknown node of the graph. In rendezvous, two agents, initially…
We consider quantum search on graphs. Recently, it has been shown that the graph properties like connectivity, global symmetry, or regularity cannot serve as a reliable criteria that must be satisfied by a graph to allow a successful…
Our understanding of space and time is probed to its depths by black holes. These objects, which appear as a natural consequence of general relativity, provide a powerful analytical tool able to examine macroscopic and microscopic…
Temporal graphs are graphs where the edge set can change in each time step, and the vertex set stays the same. Exploration of temporal graphs whose snapshot in each time step is a connected graph, called connected temporal graphs, has been…
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…
Black holes are by definition black, and therefore cannot be directly observed by using electromagnetic radiations. Convincing identification of black holes must necessarily depend on the identification of a very specially behaving matter…
In this paper we study the dynamics of $ n-1$ dimensional domain wall universe embedded in a $n$ dimensional charged dilaton black hole bulk with the non-asymptotically flat and non-asymptotically (A)dS characters. We find that domain wall…
A general formulation of the basic conflict of the information problem is given, encapsulated in a "black hole theorem." This is framed in a more general context than the usual one of quantum field theory on a background, and is based on…
In this work a robust and scalable cooperative multi-agent searching and tracking framework is proposed. Specifically, we study the problem of cooperative searching and tracking of multiple moving targets by a group of autonomous mobile…
Spherically symmetric (1D) black-hole spacetimes are considered as a test for numerical relativity. A finite difference code, based in the hyperbolic structure of Einstein's equations with the harmonic slicing condition is presented.…
Local search is a powerful heuristic in optimization and computer science, the complexity of which has been studied in the white box and black box models. In the black box model, we are given a graph $G = (V,E)$ and oracle access to a…
Spatial search occurs in a connected graph if a continuous-time quantum walk on the adjacency matrix of the graph, suitably scaled, plus a rank-one perturbation induced by any vertex will unitarily map the principal eigenvector of the graph…
This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions for the gossip problem, where agents may…
With the evolution of wireless technology and use of mobile devices, Mobile Ad-hoc Network has become popular among researchers to explore. A mobile ad-hoc network (MANET) is a self-configuring network of mobile routers (and associated…
Black holes are real astrophysical objects, but their interiors are hidden and can only be "observed" through mathematics. The structure of rotating black holes is typically illustrated with the help of special coordinates. But any such…
We numerically construct static localized black holes in five and six spacetime dimensions which are solutions to Einstein's vacuum field equations with one compact periodic dimension. In particular, we investigate the critical regime in…