More on Phase Transition and Renyi Entropy

In this paper, we study the scalar field condensation around the hyperbolic black hole solutions in the Einstein and Gauss-Bonnet gravities. We investigate the Renyi entropy and inequalities governing on it under this phase transition. Our numerical computations show that for the positive values of the Gauss-Bonnet coupling and below a critical temperature one of these inequalities is violated. This puts more restrictions on the allowed values of the Gauss-Bonnet coupling.Comment: 27 pages, 12 figures. v2: published versio

Ricci cubic gravity in d dimensions, gravitons and SAdS/Lifshitz black holes

A special class of higher curvature theories of gravity, Ricci Cubic Gravity (RCG), in general d dimensional space-time has been investigated in this paper. We have used two different approaches, the linearized equations of motion and auxiliary field formalism to study the massive and massless graviton propagating modes of the AdS background. Using the auxiliary field formalism, we have found the renormalized boundary stress tensor to compute the mass of Schwarzschild AdS and Lifshitz black holes in RCG theory.Comment: 35 pages. Published versio

Exploiting the Synergy Between Gossiping and Structured Overlays

In this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale distributed systems. Despite the common goals, the two areas have, however, been relatively isolated. We focus on three problem domains where there is an untapped potential of using gossiping combined with SONs. We argue for applying gossip-based membership for ring-based SONs---such as Chord and Bamboo---to make them handle partition mergers and loopy networks. We argue that small world SONs---such as Accordion and Mercury---are specifically well-suited for gossip-based membership management. The benefits would be better graph-theoretic properties. Finally, we argue that gossip-based algorithms could use the overlay constructed by SONs. For example, many unreliable broadcast algorithms for SONs could be augmented with anti-entropy protocols. Similarly, gossip-based aggregation could be used in SONs for network size estimation and load-balancing purposes