Related papers: Black Hole Search in Dynamic Cactus Graph
A mobile ad hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi-hop radio network and maintaining connections in a decentralized manner. Security remains a major challenge for these…
The orbital decay of massive black holes in galaxies in the aftermath of mergers is at the heart of whether massive black holes successfully pair and merge, leading to emission of low-frequency gravitational waves. The role of dynamical…
We investigate the exploration and mapping of anonymous graphs by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the agent halt after the exploration except if the graph is a…
In this paper, we formulate a novel problem for finding blackhole and volcano patterns in a large directed graph. Specifically, a blackhole pattern is a group which is made of a set of nodes in a way such that there are only inlinks to this…
Spatial search is an important problem in quantum computation, which aims to find a marked vertex on a graph. We propose a novel approach for designing deterministic quantum search algorithms on a variety of graphs via alternating quantum…
Dynamical solutions for an evolving multiple network of black holes near a cosmological bounce dominated by a scalar field are investigated. In particular, we consider the class of black hole lattice models in a hyperspherical cosmology,…
We study the problem of multi-agent online graph exploration, in which a team of k agents has to explore a given graph, starting and ending on the same node. The graph is initially unknown. Whenever a node is visited by an agent, its…
Fast scramblers process information in characteristic times scaling logarithmically with the entropy, a behavior which has been conjectured for black hole horizons. In this note we use the AdS/CFT fold to argue that causality bounds on…
We study a pursuit-evasion problem which can be viewed as an extension of the keep-away game. In the game, pursuer(s) will attempt to intersect or catch the evader, while the evader can visit a fixed set of locations, which we denote as the…
Protecting the network layer from malicious attacks is an important and challenging security issue in mobile ad hoc networks (MANETs). In this paper, a security mechanism is proposed to defend against a cooperative gray hole attack on the…
The dynamics of a string near a Kaluza-Klein black hole are studied. Solutions to the classical string equations of motion are obtained using the world sheet velocity of light as an expansion parameter. The electrically and magnetically…
We investigate the problem of finding a static treasure in anonymous graphs using oblivious agents and introduce a novel approach that leverages quantum information. In anonymous graphs, vertices are unlabelled, indistinguishable, and edges…
We consider the problem of searching for an intruder in a geometric domain by utilizing multiple search robots. The domain is a simply connected orthogonal polygon with edges parallel to the cartesian coordinate axes. Each robot has a…
Classical black holes are solutions of the field equations of General Relativity. Many astronomical observations suggest that black holes really exist in nature. However, an unambiguous proof for their existence is still lacking. Neither…
Finding $k$-cores in graphs is a valuable and effective strategy for extracting dense regions of otherwise sparse graphs. We focus on the important problem of maintaining cores on rapidly changing dynamic graphs, where batches of edge…
A black hole has characteristic quasi-normal modes that will be excited when it is formed or when the geometry is perturbed. The state of a black hole when the quasi-normal modes are excited is called the gravitational ringing, and…
The dynamical evidence for black holes (BHs) in galactic nuclei is reviewed, with emphasis on recent improvements in spatial resolution, methods for analyzing galaxy spectra and dynamical modeling. M31, M32 and M87 are discussed in some…
The dynamics of apparent and event horizons of various black hole spacetimes, including those containing distorted, rotating and colliding black holes, are studied. We have developed a powerful and efficient new method for locating the…
Given a dynamic network, where edges appear and disappear over time, we are interested in finding sets of edges that have similar temporal behavior and form a dense subgraph. Formally, we define the problem as the enumeration of the maximal…
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…