相关论文: Black Hole Search in Dynamic Tori

This paper is concerned with several not-quantum aspects of black holes, with emphasis on theoretical and mathematical issues related to numerical modeling of black hole space-times. Part of the material has a review character, but some new…

Event Horizon, a null hypersurface defining the boundary of the black hole region of a spacetime, is not particularly useful for evolving black holes since it is non-local in time. Instead, one uses the more tangible concept of Apparent…

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.…

In this short review we describe some of the latest endeavours to understand the activity around Black Holes. First, it has been possible to demonstrate that a large part of the electromagnetic emission observed can be interpreted as…

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…

For a rotating black hole to be nonsingular, it means that there are no spacetime singularities at its center. The destruction of the event horizon of such a rotating black hole is not constrained by the weak cosmic censorship conjecture,…

We introduce a search problem called ``mutual search'' where $k$ \agents, arbitrarily distributed over $n$ sites, are required to locate one another by posing queries of the form ``Anybody at site $i$?''. We ask for the least number of…

Four and five dimensional extremal black holes with nonzero entropy have simple presentations in M-theory as gravitational waves bound to configurations of intersecting M-branes. We discuss realizations of these objects in matrix models of…

Under the assumption that a dynamical scalar field is responsible for the current acceleration of the Universe, we explore the possibility of probing its physics in black hole merger processes with gravitational wave interferometers.…

We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node $v$ of degree $deg(v)$ are labeled arbitrarily as $0,1,\ldots, deg(v)-1$. A mobile agent, starting from a…

We study the instability of higher-dimensional rotating anti-de Sitter black holes through fragmentation. Fragmentation occurs when black holes rotate too fast to sustain their horizon, and then the black holes are broken into small pieces.…

Configurations of multiple concentric black rings play an important role in determining the pattern of branchings, connections and mergers between different phases of higher-dimensional black holes. We examine them using both approximate…

In this paper, we consider charged accelerating AdS black holes with nonlinear electromagnetic source. The metric chosen by us is of a regular black hole which shows regular nature at poles and a conical effect which corresponds to a cosmic…

We examine the problem of gathering $k \geq 2$ agents (or multi-agent rendezvous) in dynamic graphs which may change in every synchronous round but remain always connected ($1$-interval connectivity) [KLO10]. The agents are identical and…

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…

Many applications involve agents sharing a resource, such as networks or services. When agents are honest, the system functions well and there is a net profit. Unfortunately, some agents may be malicious, but it may be hard to detect them.…

Astronomers have discovered many candidate black holes in X-ray binaries and in the nuclei of galaxies. The candidate objects are too massive to be neutron stars, and for this reason they are considered to be black holes. While the evidence…

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…

(Abbrev.) We analyze the topology, lifetime, and emissions of a torus around a black hole formed in hypernovae and black hole-neutron star coalescence. The torus is ab initio uniformly magnetized, represented by two counter oriented…

A communication network is said to be "anonymous" if its agents are indistinguishable from each other; it is "dynamic" if its communication links may appear or disappear unpredictably over time. Assuming that each of the $n$ agents of an…