English
Related papers

Related papers: Black Hole Search in Dynamic Cactus Graph

200 papers

We extend previous work on 3D black hole excision to the case of distorted black holes, with a variety of dynamic gauge conditions that are able to respond naturally to the spacetime dynamics. We show that the combination of excision and…

General Relativity and Quantum Cosmology · Physics 2008-11-26 Miguel Alcubierre , Bernd Bruegmann , Denis Pollney , Edward Seidel , Ryoji Takahashi

The problem of search by multiple agents to find and localize objects arises in many important applications. In this paper, we study a class of multi-agent search problems in which each agent can access only a subset of a discrete search…

Optimization and Control · Mathematics 2017-09-13 Huanyu Ding , David Castanon

An edge-colored directed graph is \emph{observable} if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge colors. When the agent is able to determine his…

Multiagent Systems · Computer Science 2007-05-23 Raphael M. Jungers , Vincent D. Blondel

This paper investigates the metric of previously proposed regular black holes, calculates their effective potentials, and plots the curves of the effective potentials. By determining the conserved quantities, the dynamical equations for…

General Relativity and Quantum Cosmology · Physics 2025-10-17 Zihan Xi , Chen Wu , Wenjun Guo

Black holes in matrix theory may consist of interacting clusters (correlated domains) which saturate the uncertainty principle. We show that this assumption qualitatively accounts for the thermodynamic properties of both charged and neutral…

High Energy Physics - Theory · Physics 2007-05-23 Miao Li , Emil Martinec

We construct dynamical black ring solutions in the five dimensional Einstein-Maxwell system with a positive cosmological constant and investigate the geometrical structure. The solutions describe the physical process such that a thin black…

General Relativity and Quantum Cosmology · Physics 2009-11-19 Masashi Kimura

A hole is a chordless cycle with at least four vertices. A hole is odd if it has an odd number of vertices. A dart is a graph which vertices $a, b, c, d, e$ and edges $ab, bc, bd, be, cd, de$. Dart-free graphs have been actively studied in…

Combinatorics · Mathematics 2025-04-30 Chính T. Hoàng

We examine the problem of rendezvous, i.e., having multiple mobile agents gather in a single node of the network. Unlike previous studies, we need to achieve rendezvous in presence of a very powerful adversary, a malicious agent that moves…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-02-09 Shantanu Das , Flaminia L. Luccio , Euripides Markou

The possible existence of black holes has fascinated scientists at least since Michell and Laplace's proposal that a gravitating object could exist from which light could not escape. In the 20th century, in light of the general theory of…

General Relativity and Quantum Cosmology · Physics 2008-11-15 A. DeBenedictis

The role of the wandering null geodesic is studied in a black hole spacetime. Based on the continuity of the solution of the geodesic equation, the wandering null geodesics commonly exist and explain the typical phenomena of the optical…

General Relativity and Quantum Cosmology · Physics 2022-08-31 Masaru Siino

The central challenge in trying to resolve the firewall paradox is to identify excitations in the near-horizon zone of a black hole that can carry information without injuring a freely falling observer. By analyzing the problem from the…

High Energy Physics - Theory · Physics 2015-06-18 Ben Freivogel

Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics that asks us to compute collision-free paths for a team of agents, all moving across a shared map. Although many works appear on this topic, all current algorithms…

Artificial Intelligence · Computer Science 2024-02-01 Zhe Chen , Daniel Harabor , Jiaoyang Li , Peter J. Stuckey

We study the problem of exploring all vertices of an undirected weighted graph that is initially unknown to the searcher. An edge of the graph is only revealed when the searcher visits one of its endpoints. Beginning at some start node, the…

Data Structures and Algorithms · Computer Science 2023-10-30 Robin Fritsch

In this paper, we investigate a class of $5$-dimensional black holes in the presence of Gauss-Bonnet gravity with dyonic charges. At first step, thermodynamical quantities of the black holes and their behaviors are explored for different…

General Relativity and Quantum Cosmology · Physics 2018-02-20 S. Panahiyan , S. H. Hendi , N. Riazi

The collapse of astrophysically significant bodies generates, under suitable conditions, black holes. Since one expects the generator of the black hole to be a rotating body, the black hole will also rotate. The existence of inner…

General Relativity and Quantum Cosmology · Physics 2026-01-30 Ramón Torres

We examine the causal and geometric horizons of dynamical black holes in Lemaitre-Tolman-Bondi collapsing dust spacetimes. Marginally trapped tubes in these spacetimes may be spacelike, timelike or null and may also be sourced from or…

General Relativity and Quantum Cosmology · Physics 2014-10-22 Benjamin K. Tippett , Ivan Booth

Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…

Combinatorics · Mathematics 2025-07-30 Alexander Grigoriev , Katherine Faulkner

Black holes are among the most well-known astrophysical objects, yet their physical realisation remains conceptually subtle. We analyse physical black holes -- light-trapping regions that form in finite time as seen by a distant observer --…

General Relativity and Quantum Cosmology · Physics 2025-12-02 Ioannis Soranidis , Daniel R. Terno

Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-order formula over evolving subgraphs of a fixed maximal…

Computational Complexity · Computer Science 2017-02-20 Patricia Bouyer-Decitre , Vincent Jugé , Nicolas Markey

The problem of quickest detection of dynamic events in networks is studied. At some unknown time, an event occurs, and a number of nodes in the network are affected by the event, in that they undergo a change in the statistics of their…

Signal Processing · Electrical Eng. & Systems 2018-07-18 Shaofeng Zou , Venugopal V. Veeravalli , Jian Li , Don Towsley
‹ Prev 1 8 9 10 Next ›