Fine-Grained Chaos in AdS2AdS_2 Gravity

Quantum chaos can be characterized by an exponential growth of the thermal out-of-time-order four-point function up to a scrambling time $\widehat{u}_*$. We discuss generalizations of this statement for certain higher-point correlation functions. For concreteness, we study the Schwarzian theory of a one-dimensional time reparametrization mode, which describes $AdS_2$ gravity and the low-energy dynamics of the SYK model. We identify a particular set of $2k$-point functions, characterized as being both "maximally braided" and "k-OTO", which exhibit exponential growth until progressively longer timescales $\widehat{u}^{(k)}_* = (k-1)\widehat{u}_*$. We suggest an interpretation as scrambling of increasingly fine-grained measures of quantum information, which correspondingly take progressively longer time to reach their thermal values.Comment: 8 pages; v2: minor clarifications, typos, added ref

Fundamental Approach to the Cosmological Constant Issue

The issue of the cosmological constant is discussed in details and a solution to the problem is suggested.Comment: 13 pages in LaTeX with 3 figures in eps files, paper presented at the Fifth Friedmann Seminar; the cls file necessary for successful PostScript generation is also attache

Effective Field Theory for Chaotic CFTs

We derive an effective field theory for general chaotic two-dimensional conformal field theories with a large central charge. The theory is a specific and calculable instance of a more general framework recently proposed in [1]. We discuss the gauge symmetries of the model and how they relate to the Lyapunov behaviour of certain correlators. We calculate the out-of-time-ordered correlators diagnosing quantum chaos, as well as certain more fine-grained higher-point generalizations, using our Lorentzian effective field theory. We comment on potential future applications of the effective theory to real-time thermal physics and conformal field theory.Comment: 33 pages, 4 figures; v2: minor improvements, added paragraph on higher spin exchanges; v3: minor improvements, added reference, published versio

Spherically-Symmetric Random Walks in Noninteger Dimension

A previous paper (hep-lat/9311011) proposed a new kind of random walk on a spherically-symmetric lattice in arbitrary noninteger dimension $D$. Such a lattice avoids the problems associated with a hypercubic lattice in noninteger dimension. This paper examines the nature of spherically-symmetric random walks in detail. We perform a large-time asymptotic analysis of these random walks and use the results to determine the Hausdorff dimension of the process. We obtain exact results in terms of Hurwitz functions (incomplete zeta functions) for the probability of a walker going from one region of the spherical lattice to another. Finally, we show that the probability that the paths of $K$ independent random walkers will intersect vanishes in the continuum limit if $D> {{2K}\over{K-1}}$.Comment: 40 pages, 4 figures, plain tex, tared and uuencoded, WU-HEP 9

Extreme(ly) mean(ingful): Sequential formation of a quality group

The present paper studies the limiting behavior of the average score of a sequentially selected group of items or individuals, the underlying distribution of which, $F$, belongs to the Gumbel domain of attraction of extreme value distributions. This class contains the Normal, Lognormal, Gamma, Weibull and many other distributions. The selection rules are the "better than average" ($\beta=1$) and the "$\beta$-better than average" rule, defined as follows. After the first item is selected, another item is admitted into the group if and only if its score is greater than $\beta$ times the average score of those already selected. Denote by $\bar{Y}_k$ the average of the $k$ first selected items, and by $T_k$ the time it takes to amass them. Some of the key results obtained are: under mild conditions, for the better than average rule, $\bar{Y}_k$ less a suitable chosen function of $\log k$ converges almost surely to a finite random variable. When $1-F(x)=e^{-[x^{\alpha}+h(x)]}$, $\alpha>0$ and $h(x)/x^{\alpha}\stackrel{x\rightarrow \infty}{\longrightarrow}0$, then $T_k$ is of approximate order $k^2$. When $\beta>1$, the asymptotic results for $\bar{Y}_k$ are of a completely different order of magnitude. Interestingly, for a class of distributions, $T_k$, suitably normalized, asymptotically approaches 1, almost surely for relatively small $\beta\ge1$, in probability for moderate sized $\beta$ and in distribution when $\beta$ is large.Comment: Published in at http://dx.doi.org/10.1214/10-AAP684 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Robust ultrafast currents in molecular wires through Stark shifts

A novel way to induce ultrafast currents in molecular wires using two incident laser frequencies, $\omega$ and $2\omega$, is demonstrated. The mechanism relies on Stark shifts, instead of photon absorption, to transfer population to the excited states and exploits the temporal profile of the field to generate phase controllable transport. Calculations in a \emph{trans}-polyacetylene oligomer coupled to metallic leads indicate that the mechanism is highly efficient and robust to ultrafast electronic dephasing processes induced by vibronic couplings.Comment: 4 pages, 2 figures, accepted to Physical Review Letter

Clustered Integer 3SUM via Additive Combinatorics

We present a collection of new results on problems related to 3SUM, including: 1. The first truly subquadratic algorithm for $\ \ \ \ \$ 1a. computing the (min,+) convolution for monotone increasing sequences with integer values bounded by $O(n)$, $\ \ \ \ \$1b. solving 3SUM for monotone sets in 2D with integer coordinates bounded by $O(n)$, and $\ \ \ \ \$1c. preprocessing a binary string for histogram indexing (also called jumbled indexing). The running time is: $O(n^{(9+\sqrt{177})/12}\,\textrm{polylog}\,n)=O(n^{1.859})$ with randomization, or $O(n^{1.864})$ deterministically. This greatly improves the previous $n^2/2^{\Omega(\sqrt{\log n})}$ time bound obtained from Williams' recent result on all-pairs shortest paths [STOC'14], and answers an open question raised by several researchers studying the histogram indexing problem. 2. The first algorithm for histogram indexing for any constant alphabet size that achieves truly subquadratic preprocessing time and truly sublinear query time. 3. A truly subquadratic algorithm for integer 3SUM in the case when the given set can be partitioned into $n^{1-\delta}$ clusters each covered by an interval of length $n$, for any constant $\delta>0$. 4. An algorithm to preprocess any set of $n$ integers so that subsequently 3SUM on any given subset can be solved in $O(n^{13/7}\,\textrm{polylog}\,n)$ time. All these results are obtained by a surprising new technique, based on the Balog--Szemer\'edi--Gowers Theorem from additive combinatorics

A monitor for the laboratory evaluation of control integrity in digital control systems operating in harsh electromagnetic environments

This paper presents a strategy for dynamically monitoring digital controllers in the laboratory for susceptibility to electromagnetic disturbances that compromise control integrity. The integrity of digital control systems operating in harsh electromagnetic environments can be compromised by upsets caused by induced transient electrical signals. Digital system upset is a functional error mode that involves no component damage, can occur simultaneously in all channels of a redundant control computer, and is software dependent. The motivation for this work is the need to develop tools and techniques that can be used in the laboratory to validate and/or certify critical aircraft controllers operating in electromagnetically adverse environments that result from lightning, high-intensity radiated fields (HIRF), and nuclear electromagnetic pulses (NEMP). The detection strategy presented in this paper provides dynamic monitoring of a given control computer for degraded functional integrity resulting from redundancy management errors, control calculation errors, and control correctness/effectiveness errors. In particular, this paper discusses the use of Kalman filtering, data fusion, and statistical decision theory in monitoring a given digital controller for control calculation errors