8,155 research outputs found

    Brownian motion on disconnected sets, basic hypergeometric functions, and some continued fractions of Ramanujan

    Full text link
    Motivated by L\'{e}vy's characterization of Brownian motion on the line, we propose an analogue of Brownian motion that has as its state space an arbitrary closed subset of the line that is unbounded above and below: such a process will be a martingale, will have the identity function as its quadratic variation process, and will be ``continuous'' in the sense that its sample paths don't skip over points. We show that there is a unique such process, which turns out to be automatically a reversible Feller-Dynkin Markov process. We find its generator, which is a natural generalization of the operator f1/2ff\mapsto{1/2}f''. We then consider the special case where the state space is the self-similar set {±qk:kZ}{0}\{\pm q^k:k\in \mathbb{Z}\}\cup\{0\} for some q>1q>1. Using the scaling properties of the process, we represent the Laplace transforms of various hitting times as certain continued fractions that appear in Ramanujan's ``lost'' notebook and evaluate these continued fractions in terms of basic hypergeometric functions (that is, qq-analogues of classical hypergeometric functions). The process has 0 as a regular instantaneous point, and hence its sample paths can be decomposed into a Poisson process of excursions from 0 using the associated continuous local time. Using the reversibility of the process with respect to the natural measure on the state space, we find the entrance laws of the corresponding It\^{o} excursion measure and the Laplace exponent of the inverse local time -- both again in terms of basic hypergeometric functions. By combining these ingredients, we obtain explicit formulae for the resolvent of the process. We also compute the moments of the process in closed form. Some of our results involve qq-analogues of classical distributions such as the Poisson distribution that have appeared elsewhere in the literature.Comment: Published in at http://dx.doi.org/10.1214/193940307000000383 the IMS Collections (http://www.imstat.org/publications/imscollections.htm) by the Institute of Mathematical Statistics (http://www.imstat.org

    Storing images in warm atomic vapor

    Full text link
    Reversible and coherent storage of light in atomic medium is a key-stone of future quantum information applications. In this work, arbitrary two-dimensional images are slowed and stored in warm atomic vapor for up to 30 μ\mus, utilizing electromagnetically induced transparency. Both the intensity and the phase patterns of the optical field are maintained. The main limitation on the storage resolution and duration is found to be the diffusion of atoms. A techniqueanalogous to phase-shift lithography is employed to diminish the effect of diffusion on the visibility of the reconstructed image

    A User''s Guide to Solving Dynamic Stochastic Games Using the Homotopy Method

    Get PDF
    This paper provides a step-by-step guide to solving dynamic stochastic games using the homotopy method. The homotopy method facilitates exploring the equilibrium correspondence in a systematic fashion; it is especially useful in games that have multiple equilibria. We discuss the theory of the homotopy method and its implementation and present two detailed examples of dynamic stochastic games that are solved using this method.

    Helly-Type Theorems in Property Testing

    Full text link
    Helly's theorem is a fundamental result in discrete geometry, describing the ways in which convex sets intersect with each other. If SS is a set of nn points in RdR^d, we say that SS is (k,G)(k,G)-clusterable if it can be partitioned into kk clusters (subsets) such that each cluster can be contained in a translated copy of a geometric object GG. In this paper, as an application of Helly's theorem, by taking a constant size sample from SS, we present a testing algorithm for (k,G)(k,G)-clustering, i.e., to distinguish between two cases: when SS is (k,G)(k,G)-clusterable, and when it is ϵ\epsilon-far from being (k,G)(k,G)-clusterable. A set SS is ϵ\epsilon-far (0<ϵ1)(0<\epsilon\leq1) from being (k,G)(k,G)-clusterable if at least ϵn\epsilon n points need to be removed from SS to make it (k,G)(k,G)-clusterable. We solve this problem for k=1k=1 and when GG is a symmetric convex object. For k>1k>1, we solve a weaker version of this problem. Finally, as an application of our testing result, in clustering with outliers, we show that one can find the approximate clusters by querying a constant size sample, with high probability

    Theory of Dicke narrowing in coherent population trapping

    Get PDF
    The Doppler effect is one of the dominant broadening mechanisms in thermal vapor spectroscopy. For two-photon transitions one would naively expect the Doppler effect to cause a residual broadening, proportional to the wave-vector difference. In coherent population trapping (CPT), which is a narrow-band phenomenon, such broadening was not observed experimentally. This has been commonly attributed to frequent velocity-changing collisions, known to narrow Doppler-broadened one-photon absorption lines (Dicke narrowing). Here we show theoretically that such a narrowing mechanism indeed exists for CPT resonances. The narrowing factor is the ratio between the atom's mean free path and the wavelength associated with the wave-vector difference of the two radiation fields. A possible experiment to verify the theory is suggested.Comment: 6 pages, 2 figures; Introduction revise

    Deriving Epistemic Conclusions from Agent Architecture

    Get PDF
    One of our most resilient intuitions is that causality is a precondition for information flow: where there are no causal connections, we expect there to be no flow of information. In this paper, we study this idea as it arises in the computer science notion of systems architectures, which are high level designs that describe the coarse structure of a system in terms of its high-level components and their permitted causal interactions.Engineering and Applied Science

    Response of discrete nonlinear systems with many degrees of freedom

    Get PDF
    We study the response of a large array of coupled nonlinear oscillators to parametric excitation, motivated by the growing interest in the nonlinear dynamics of microelectromechanical and nanoelectromechanical systems (MEMS and NEMS). Using a multiscale analysis, we derive an amplitude equation that captures the slow dynamics of the coupled oscillators just above the onset of parametric oscillations. The amplitude equation that we derive here from first principles exhibits a wavenumber dependent bifurcation similar in character to the behavior known to exist in fluids undergoing the Faraday wave instability. We confirm this behavior numerically and make suggestions for testing it experimentally with MEMS and NEMS resonators.Comment: Version 2 is an expanded version of the article, containing detailed steps of the derivation that were left out in version 1, but no additional result
    corecore