Loop-Erasure of Plane Brownian Motion

We use the coupling technique to prove that there exists a loop-erasure of a plane Brownian motion stopped on exiting a simply connected domain, and the loop-erased curve is the reversal of a radial SLE$_2$ curve.Comment: 10 page

Restriction Properties of Annulus SLE

For $\kappa\in(0,4]$, a family of annulus SLE$(\kappa;\Lambda)$ processes were introduced in [14] to prove the reversibility of whole-plane SLE$(\kappa)$. In this paper we prove that those annulus SLE$(\kappa;\Lambda)$ processes satisfy a restriction property, which is similar to that for chordal SLE$(\kappa)$. Using this property, we construct $n\ge 2$ curves crossing an annulus such that, when any $n-1$ curves are given, the last curve is a chordal SLE$(\kappa)$ trace.Comment: 37 page

Computing the Loewner driving process of random curves in the half plane

We simulate several models of random curves in the half plane and numerically compute their stochastic driving process (as given by the Loewner equation). Our models include models whose scaling limit is the Schramm-Loewner evolution (SLE) and models for which it is not. We study several tests of whether the driving process is Brownian motion. We find that just testing the normality of the process at a fixed time is not effective at determining if the process is Brownian motion. Tests that involve the independence of the increments of Brownian motion are much more effective. We also study the zipper algorithm for numerically computing the driving function of a simple curve. We give an implementation of this algorithm which runs in a time O(N^1.35) rather than the usual O(N^2), where N is the number of points on the curve.Comment: 20 pages, 4 figures. Changes to second version: added new paragraph to conclusion section; improved figures cosmeticall

Bridge Decomposition of Restriction Measures

Motivated by Kesten's bridge decomposition for two-dimensional self-avoiding walks in the upper half plane, we show that the conjectured scaling limit of the half-plane SAW, the SLE(8/3) process, also has an appropriately defined bridge decomposition. This continuum decomposition turns out to entirely be a consequence of the restriction property of SLE(8/3), and as a result can be generalized to the wider class of restriction measures. Specifically we show that the restriction hulls with index less than one can be decomposed into a Poisson Point Process of irreducible bridges in a way that is similar to Ito's excursion decomposition of a Brownian motion according to its zeros.Comment: 24 pages, 2 figures. Final version incorporates minor revisions suggested by the referee, to appear in Jour. Stat. Phy

Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams

While in many graph mining applications it is crucial to handle a stream of updates efficiently in terms of {\em both} time and space, not much was known about achieving such type of algorithm. In this paper we study this issue for a problem which lies at the core of many graph mining applications called {\em densest subgraph problem}. We develop an algorithm that achieves time- and space-efficiency for this problem simultaneously. It is one of the first of its kind for graph problems to the best of our knowledge. In a graph $G = (V, E)$, the "density" of a subgraph induced by a subset of nodes $S \subseteq V$ is defined as $|E(S)|/|S|$, where $E(S)$ is the set of edges in $E$ with both endpoints in $S$. In the densest subgraph problem, the goal is to find a subset of nodes that maximizes the density of the corresponding induced subgraph. For any $\epsilon>0$, we present a dynamic algorithm that, with high probability, maintains a $(4+\epsilon)$-approximation to the densest subgraph problem under a sequence of edge insertions and deletions in a graph with $n$ nodes. It uses $\tilde O(n)$ space, and has an amortized update time of $\tilde O(1)$ and a query time of $\tilde O(1)$. Here, $\tilde O$ hides a O(\poly\log_{1+\epsilon} n) term. The approximation ratio can be improved to $(2+\epsilon)$ at the cost of increasing the query time to $\tilde O(n)$. It can be extended to a $(2+\epsilon)$-approximation sublinear-time algorithm and a distributed-streaming algorithm. Our algorithm is the first streaming algorithm that can maintain the densest subgraph in {\em one pass}. The previously best algorithm in this setting required $O(\log n)$ passes [Bahmani, Kumar and Vassilvitskii, VLDB'12]. The space required by our algorithm is tight up to a polylogarithmic factor.Comment: A preliminary version of this paper appeared in STOC 201

Nuevos conceptos sobre las enfermedades de las vías urinarias inferiores felinas

En el presente artículo se describe el concepto de «Enfermedades de las vías urinarias inferiores del gato». A continuación se revisan las posibles causas predisponentes y determinantes y se discuten a la luz de los últimos trabajos publicados.In this report, the concept of «Feline Lower Urinary Tract Diseases»is described. Then,possible, predisponent and determinant causes are reviewed and discussed with regard to the last publísbed reports

Measurement of Holmium Rydberg series through MOT depletion spectroscopy

We report measurements of the absolute excitation frequencies of $^{165}$Ho $4f^{11}6sns$ and $4f^{11}6snd$ odd-parity Rydberg series. The states are detected through depletion of a magneto-optical trap via a two-photon excitation scheme. Measurements of 162 Rydberg levels in the range $n=40-101$ yield quantum defects well described by the Rydberg-Ritz formula. We observe a strong perturbation in the $ns$ series around $n=51$ due to an unidentified interloper at 48515.47(4) cm$^{-1}$. From the series convergence, we determine the first ionization potential $E_\mathrm{IP}=48565.939(4)$ cm$^{-1}$, which is three orders of magnitude more accurate than previous work. This work represents the first time such spectroscopy has been done in Holmium and is an important step towards using Ho atoms for collective encoding of a quantum register.Comment: 6 figure

Monte Carlo Tests of SLE Predictions for the 2D Self-Avoiding Walk

The conjecture that the scaling limit of the two-dimensional self-avoiding walk (SAW) in a half plane is given by the stochastic Loewner evolution (SLE) with $\kappa=8/3$ leads to explicit predictions about the SAW. A remarkable feature of these predictions is that they yield not just critical exponents, but probability distributions for certain random variables associated with the self-avoiding walk. We test two of these predictions with Monte Carlo simulations and find excellent agreement, thus providing numerical support to the conjecture that the scaling limit of the SAW is SLE$_{8/3}$.Comment: TeX file using APS REVTeX 4.0. 10 pages, 5 figures (encapsulated postscript