Towards causal patch physics in dS/CFT

This is a status report on a research program aimed at obtaining quantum-gravitational physics inside a cosmological horizon through dS/CFT, i.e. through a holographic description at past/future infinity of de Sitter space. The program aims to bring together two main elements. The first is the observation by Anninos, Hartman and Strominger that Vasiliev's higher-spin gravity provides a working model for dS/CFT in 3+1 dimensions. The second is the proposal by Parikh, Savonije and Verlinde that dS/CFT may prove more tractable if one works in so-called "elliptic" de Sitter space - a folded-in-half version of global de Sitter where antipodal points have been identified. We review some relevant progress concerning quantum field theory on elliptic de Sitter space, higher-spin gravity and its holographic duality with a free vector model. We present our reasons for optimism that the approach outlined here will lead to a full holographic description of quantum (higher-spin) gravity in the causal patch of a de Sitter observer.Comment: 10 pages, 1 figure. Conference proceedings contribution for ICGAC-13/IK-15 in Ewha Womans University in Seou

On Efficient Distributed Construction of Near Optimal Routing Schemes

Given a distributed network represented by a weighted undirected graph $G=(V,E)$ on $n$ vertices, and a parameter $k$, we devise a distributed algorithm that computes a routing scheme in $(n^{1/2+1/k}+D)\cdot n^{o(1)}$ rounds, where $D$ is the hop-diameter of the network. The running time matches the lower bound of $\tilde{\Omega}(n^{1/2}+D)$ rounds (which holds for any scheme with polynomial stretch), up to lower order terms. The routing tables are of size $\tilde{O}(n^{1/k})$, the labels are of size $O(k\log^2n)$, and every packet is routed on a path suffering stretch at most $4k-5+o(1)$. Our construction nearly matches the state-of-the-art for routing schemes built in a centralized sequential manner. The previous best algorithms for building routing tables in a distributed small messages model were by \cite[STOC 2013]{LP13} and \cite[PODC 2015]{LP15}. The former has similar properties but suffers from substantially larger routing tables of size $O(n^{1/2+1/k})$, while the latter has sub-optimal running time of $\tilde{O}(\min\{(nD)^{1/2}\cdot n^{1/k},n^{2/3+2/(3k)}+D\})$