Related papers: Black Hole Search in Dynamic Cactus Graph
This paper presents a quasi-local method of studying the physics of dynamical black holes in numerical simulations. This is done within the dynamical horizon framework, which extends the earlier work on isolated horizons to time-dependent…
Black holes represent extreme conditions of physical laws. Being predicted about a century ago, they are now accepted as astrophysical reality by most of the scientific community. Only recently more direct evidence of their existence has…
This paper deals with the classical problem of exploring a ring by a cohort of synchronous robots. We focus on the perpetual version of this problem in which it is required that each node of the ring is visited by a robot infinitely often.…
In this chapter I focus on asking and answering the following questions: (1) What is a black hole? Answer: There are three types of black holes, namely mathematical black holes, physical black holes and astrophysical black holes. An…
Black holes are among the most exciting phenomena predicted by General Relativity and play a key role in fundamental physics. Many interesting phenomena involve dynamical black hole configurations in the high curvature regime of gravity. In…
Supermassive black holes have been discovered at the centers of galaxies, and also in globular clusters. The data shows correlations between the black hole mass and the elliptical galaxy mass or globular cluster mass. It is shown that this…
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) by asking an omniscient human questions of the form "Is there a…
A mobile agent, starting from a node $s$ of a simple undirected connected graph $G=(V,E)$, has to explore all nodes and edges of $G$ using the minimum number of edge traversals. To do so, the agent uses a deterministic algorithm that allows…
We study the computability and complexity of the exploration problem in a class of highly dynamic graphs: periodically varying (PV) graphs, where the edges exist only at some (unknown) times defined by the periodic movements of carriers.…
The singularitiy inside a spherical charged black hole, coupled to a spherical, massless scalar field is studied numerically. The profile of the characteristic scalar field was taken to be a power of advanced time with an exponent…
The event horizon of a black hole is arguably the most dramatic manifestation of the fact that in General Relativity, causal structure is dynamical and spacetimes can be separated into distinct regions by causal boundaries. Causal set…
Perturbations around black holes have been an intriguing topic in the last few decades. They are particularly important today, since they relate to the gravitational wave observations which may provide the unique fingerprint of black holes'…
We consider a class of jump games in which agents of different types occupy the nodes of a graph aiming to maximize the variety of types in their neighborhood. In particular, each agent derives a utility equal to the number of types…
The state of the searches for isolated black holes, non-accreting black holes in binary systems and, finally, the accreting black holes in the X-ray binaries is presented. The third category is, by far, the most important source of…
In this paper, we propose a path following replicator dynamic, and investigate its potentials in uncovering the underlying cluster structure of a graph. The proposed dynamic is a generalization of the discrete replicator dynamic. The…
Online motion planning is a challenging problem for intelligent robots moving in dense environments with dynamic obstacles, e.g., crowds. In this work, we propose a novel approach for optimal and safe online motion planning with minimal…
It is shown that there are large static black holes for which all curvature invariants are small near the event horizon, yet any object which falls in experiences enormous tidal forces outside the horizon. These black holes are charged and…
We study the dominating set problem in an online setting. An algorithm is required to guarantee competitiveness against an adversary that reveals the input graph one node at a time. When a node is revealed, the algorithm learns about the…
The Neural Architecture Search (NAS) problem is typically formulated as a graph search problem where the goal is to learn the optimal operations over edges in order to maximise a graph-level global objective. Due to the large architecture…
The multi-agent path finding (MAPF) problem asks to find a set of paths on a graph such that when synchronously following these paths the agents never encounter a conflict. In the most widespread MAPF formulation, the so-called Classical…