相关论文: Black Hole Search in Dynamic Cactus Graph

In recent work, Hollands, Kov\'acs and Reall have built on previous work of Wall to provide a definition of dynamical black hole entropy for gravitational effective field theories (EFTs). This entropy satisfies a second law of black hole…

Mobile ad-hoc networks(MANET) is the collection of mobile nodes which are self organizing and are connected by wireless links where nodes which are not in the direct range communicate with each other relying on the intermediate nodes. As a…

Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element only. We show…

The dynamics of black hole spacetimes play a crucial role in astrophysics, high energy physics and fundamental physics. In this thesis I have investigated the dynamics of black holes in generic spacetimes by extending established numerical…

We consider an agent on a fixed but arbitrary node of a known threshold network, with the task of detecting an unknown missing link/node. We obtain analytic formulas for the probability of success, when the agent's tool is the free…

Astrophysical black hole candidates, although long thought to have a horizon, could be horizonless ultra-compact objects. This intriguing possibility is motivated by the black hole information paradox and a plausible fundamental connection…

A four-dimensional static black hole solution of Einstein equation conformally coupled to a massive and self interacting scalar field is obtained. A nontrivial scalar solution proposes a weak scalar hair. A dressed black hole shows a trace…

The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best algorithms for many dynamic problems whose complexity is not yet well-understood,…

A cactus is a connected graph in which each edge is contained in at most one cycle. We generalize the concept of cactus graphs, i.e., a $k$-cactus is a connected graph in which each edge is contained in at most $k$ cycles where $k\ge 1$. It…

Existing visual tracking methods usually localize a target object with a bounding box, in which the performance of the foreground object trackers or detectors is often affected by the inclusion of background clutter. To handle this problem,…

The recent Event Horizon Telescope (EHT) observations of the M87* have led to a surge of interest in studying the shadow of black holes. Besides, investigation of time evolution and lifetime of black holes helps us to veto/restrict some…

The cosmological black holes are black holes living not in an asymptotically flat universe but in an expanding spacetime. They have a rich dynamics in particular for their mass and horizon. In this article we perform a natural step in…

We consider an Anonymous Multi-Agent Path-Finding (AMAPF) problem where the set of agents is confined to a graph, a set of goal vertices is given and each of these vertices has to be reached by some agent. The problem is to find an…

We study the problem of collective tree exploration in which a team of $k$ mobile agents must collectively visit all nodes of an unknown tree in as few moves as possible. The agents all start from the root and discover adjacent edges as…

A study is made of the behavior of massive black holes in disk galaxies that have received an impulsive kick from a merger or a sustained acceleration from an asymmetric jet. The motion of the gas, stars, dark matter, and massive black hole…

A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph models it is possible to define such algorithms which produce…

Recently, a variational principle has been derived from Einstein-Hilbert and a matter Lagrangian for the spherically symmetric system of a dust shell and a black hole. The so-called physical region of the phase space, which contains all…

This paper addresses the problem of both actively searching and tracking multiple unknown dynamic objects in a known environment with multiple cooperative autonomous agents with partial observability. The tracking of a target ends when the…

A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers certain queries that are specific to the problem under consideration. There has been a lot of research on dynamic algorithms…

In this paper, we have investigated the geodesics of neutral particles near a five-dimensional charged black hole using a comparative approach. The effective potential method is used to determine the location of the horizons and to study…