Generalized Green Functions and current correlations in the TASEP

We study correlation functions of the totally asymmetric simple exclusion process (TASEP) in discrete time with backward sequential update. We prove a determinantal formula for the generalized Green function which describes transitions between positions of particles at different individual time moments. In particular, the generalized Green function defines a probability measure at staircase lines on the space-time plane. The marginals of this measure are the TASEP correlation functions in the space-time region not covered by the standard Green function approach. As an example, we calculate the current correlation function that is the joint probability distribution of times taken by selected particles to travel given distance. An asymptotic analysis shows that current fluctuations converge to the ${Airy}_2$ process.Comment: 46 pages, 3 figure

Asymptotics of a discrete-time particle system near a reflecting boundary

We examine a discrete-time Markovian particle system on the quarter-plane introduced by M. Defosseux. The vertical boundary acts as a reflecting wall. The particle system lies in the Anisotropic Kardar-Parisi-Zhang with a wall universality class. After projecting to a single horizontal level, we take the longtime asymptotics and obtain the discrete Jacobi and symmetric Pearcey kernels. This is achieved by showing that the particle system is identical to a Markov chain arising from representations of the infinite-dimensional orthogonal group. The fixed-time marginals of this Markov chain are known to be determinantal point processes, allowing us to take the limit of the correlation kernel. We also give a simple example which shows that in the multi-level case, the particle system and the Markov chain evolve differently.Comment: 16 pages, Version 2 improves the expositio

Anisotropic KPZ growth in 2+1 dimensions: fluctuations and covariance structure

In [arXiv:0804.3035] we studied an interacting particle system which can be also interpreted as a stochastic growth model. This model belongs to the anisotropic KPZ class in 2+1 dimensions. In this paper we present the results that are relevant from the perspective of stochastic growth models, in particular: (a) the surface fluctuations are asymptotically Gaussian on a sqrt(ln(t)) scale and (b) the correlation structure of the surface is asymptotically given by the massless field.Comment: 13 pages, 4 figure

Total coloring of 1-toroidal graphs of maximum degree at least 11 and no adjacent triangles

A {\em total coloring} of a graph $G$ is an assignment of colors to the vertices and the edges of $G$ such that every pair of adjacent/incident elements receive distinct colors. The {\em total chromatic number} of a graph $G$, denoted by \chiup''(G), is the minimum number of colors in a total coloring of $G$. The well-known Total Coloring Conjecture (TCC) says that every graph with maximum degree $\Delta$ admits a total coloring with at most $\Delta + 2$ colors. A graph is {\em $1$-toroidal} if it can be drawn in torus such that every edge crosses at most one other edge. In this paper, we investigate the total coloring of $1$-toroidal graphs, and prove that the TCC holds for the $1$-toroidal graphs with maximum degree at least~$11$ and some restrictions on the triangles. Consequently, if $G$ is a $1$-toroidal graph with maximum degree $\Delta$ at least~$11$ and without adjacent triangles, then $G$ admits a total coloring with at most $\Delta + 2$ colors.Comment: 10 page

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization

We study dynamic $(1+\epsilon)$-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected $n$-node $m$-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of $\tilde O(mn/\epsilon)$ and constant query time by Roditty and Zwick [FOCS 2004]. The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach [JACM 1981]; it has a total update time of $O(mn^2)$ and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of $\tilde O(n^{5/2}/\epsilon)$ and constant query time that has an additive error of $2$ in addition to the $1+\epsilon$ multiplicative error. This beats the previous $\tilde O(mn/\epsilon)$ time when $m=\Omega(n^{3/2})$. Note that the additive error is unavoidable since, even in the static case, an $O(n^{3-\delta})$-time (a so-called truly subcubic) combinatorial algorithm with $1+\epsilon$ multiplicative error cannot have an additive error less than $2-\epsilon$, unless we make a major breakthrough for Boolean matrix multiplication [Dor et al. FOCS 1996] and many other long-standing problems [Vassilevska Williams and Williams FOCS 2010]. The algorithm can also be turned into a $(2+\epsilon)$-approximation algorithm (without an additive error) with the same time guarantees, improving the recent $(3+\epsilon)$-approximation algorithm with $\tilde O(n^{5/2+O(\sqrt{\log{(1/\epsilon)}/\log n})})$ running time of Bernstein and Roditty [SODA 2011] in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of $\tilde O(mn/\epsilon)$ and a query time of $O(\log\log n)$. The algorithm has a multiplicative error of $1+\epsilon$ and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein [STOC 2013].Comment: A preliminary version was presented at the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS 2013

On a conjecture of Widom

We prove a conjecture of H.Widom stated in [W] (math/0108008) about the reality of eigenvalues of certain infinite matrices arising in asymptotic analysis of large Toeplitz determinants. As a byproduct we obtain a new proof of A.Okounkov's formula for the (determinantal) correlation functions of the Schur measures on partitions.Comment: 9 page

On the partial connection between random matrices and interacting particle systems

In the last decade there has been increasing interest in the fields of random matrices, interacting particle systems, stochastic growth models, and the connections between these areas. For instance, several objects appearing in the limit of large matrices arise also in the long time limit for interacting particles and growth models. Examples of these are the famous Tracy-Widom distribution functions and the Airy_2 process. The link is however sometimes fragile. For example, the connection between the eigenvalues in the Gaussian Orthogonal Ensembles (GOE) and growth on a flat substrate is restricted to one-point distribution, and the connection breaks down if we consider the joint distributions. In this paper we first discuss known relations between random matrices and the asymmetric exclusion process (and a 2+1 dimensional extension). Then, we show that the correlation functions of the eigenvalues of the matrix minors for beta=2 Dyson's Brownian motion have, when restricted to increasing times and decreasing matrix dimensions, the same correlation kernel as in the 2+1 dimensional interacting particle system under diffusion scaling limit. Finally, we analyze the analogous question for a diffusion on (complex) sample covariance matrices.Comment: 31 pages, LaTeX; Added a section concerning the Markov property on space-like path

Universal exit probabilities in the TASEP

We study the joint exit probabilities of particles in the totally asymmetric simple exclusion process (TASEP) from space-time sets of given form. We extend previous results on the space-time correlation functions of the TASEP, which correspond to exits from the sets bounded by straight vertical or horizontal lines. In particular, our approach allows us to remove ordering of time moments used in previous studies so that only a natural space-like ordering of particle coordinates remains. We consider sequences of general staircase-like boundaries going from the northeast to southwest in the space-time plane. The exit probabilities from the given sets are derived in the form of Fredholm determinant defined on the boundaries of the sets. In the scaling limit, the staircase-like boundaries are treated as approximations of continuous differentiable curves. The exit probabilities with respect to points of these curves belonging to arbitrary space-like path are shown to converge to the universal Airy$_2$ process.Comment: 46 pages, 7 figure

Observation of a rotational transition in trapped and sympathetically cooled molecular ions

We demonstrate rotational excitation of molecular ions that are sympathetically cooled by laser-cooled atomic ions to a temperature as low as ca. 10 mK. The molecular hydrogen ions HD+ and the fundamental rotational transition $(v=0,\, N=0)\rightarrow(v'=0,\, N'=1)$ at 1.3 THz, the most fundamental dipole-allowed rotational transition of any molecule, are used as a test case. This transition is here observed for the first time directly. Rotational laser cooling was employed in order to increase the signal, and resonance-enhanced multiphoton dissociation was used as detection method. The black-body-radiation-induced rotational excitation is also observed. The extension of the method to other molecular species is briefly discussed

Non-intersecting squared Bessel paths: critical time and double scaling limit

We consider the double scaling limit for a model of $n$ non-intersecting squared Bessel processes in the confluent case: all paths start at time $t=0$ at the same positive value $x=a$, remain positive, and are conditioned to end at time $t=1$ at $x=0$. After appropriate rescaling, the paths fill a region in the $tx$--plane as $n\to \infty$ that intersects the hard edge at $x=0$ at a critical time $t=t^{*}$. In a previous paper (arXiv:0712.1333), the scaling limits for the positions of the paths at time $t\neq t^{*}$ were shown to be the usual scaling limits from random matrix theory. Here, we describe the limit as $n\to \infty$ of the correlation kernel at critical time $t^{*}$ and in the double scaling regime. We derive an integral representation for the limit kernel which bears some connections with the Pearcey kernel. The analysis is based on the study of a $3\times 3$ matrix valued Riemann-Hilbert problem by the Deift-Zhou steepest descent method. The main ingredient is the construction of a local parametrix at the origin, out of the solutions of a particular third-order linear differential equation, and its matching with a global parametrix.Comment: 53 pages, 15 figure