25 research outputs found

    Distribution theory for Schr\"odinger's integral equation

    Get PDF
    Much of the literature on point interactions in quantum mechanics has focused on the differential form of Schr\"odinger's equation. This paper, in contrast, investigates the integral form of Schr\"odinger's equation. While both forms are known to be equivalent for smooth potentials, this is not true for distributional potentials. Here, we assume that the potential is given by a distribution defined on the space of discontinuous test functions. First, by using Schr\"odinger's integral equation, we confirm a seminal result by Kurasov, which was originally obtained in the context of Schr\"odinger's differential equation. This hints at a possible deeper connection between both forms of the equation. We also sketch a generalisation of Kurasov's result to hypersurfaces. Second, we derive a new closed-form solution to Schr\"odinger's integral equation with a delta prime potential. This potential has attracted considerable attention, including some controversy. Interestingly, the derived propagator satisfies boundary conditions that were previously derived using Schr\"odinger's differential equation. Third, we derive boundary conditions for `super-singular' potentials given by higher-order derivatives of the delta potential. These boundary conditions cannot be incorporated into the normal framework of self-adjoint extensions. We show that the boundary conditions depend on the energy of the solution, and that probability is conserved. This paper thereby confirms several seminal results and derives some new ones. In sum, it shows that Schr\"odinger's integral equation is viable tool for studying singular interactions in quantum mechanics.Comment: 23 page

    When Is Information Sufficient for Action? Search with Unreliable yet Informative Intelligence

    Get PDF
    We analyze a variant of the whereabouts search problem, in which a searcher looks for a target hiding in one of n possible locations. Unlike in the classic version, our searcher does not pursue the target by actively moving from one location to the next. Instead, the searcher receives a stream of intelligence about the location of the target. At any time, the searcher can engage the location he thinks contains the target or wait for more intelligence. The searcher incurs costs when he engages the wrong location, based on insufficient intelligence, or waits too long in the hopes of gaining better situational awareness, which allows the target to either execute his plot or disappear. We formulate the searcher’s decision as an optimal stopping problem and establish conditions for optimally executing this search-and-interdict mission

    Can Google search Data help predict macroeconomic series?

    Get PDF
    We make use of Google search data in an attempt to predict unemployment, CPI and consumer confidence for the US, UK, Canada, Germany and Japan. Google search queries have previously proven valuable in predicting macroeconomic variables in an in-sample context. However, to the best of our knowledge, the more challenging question of whether such data have out-of-sample predictive value has not yet been answered satisfactorily. We focus on out-of-sample nowcasting, and extend the Bayesian structural time series model using the Hamiltonian sampler for variable selection. We find that the search data retain their value in an out-of-sample predictive context for unemployment, but not for CPI or consumer confidence. It is possible that online search behaviours are a relatively reliable gauge of an individual’s personal situation (employment status), but less reliable when it comes to variables that are unknown to the individual (CPI) or too general to be linked to specific search terms (consumer confidence)

    When is Information Sufficient for Action? Search with Unreliable Yet Informative Intelligence

    Get PDF
    The article of record may be found at: http://dx.doi.org/10.1287/opre.2016.1488We analyze a variant of the whereabouts search problem, in which a searcher looks for a target hiding in one of n possible locations. Unlike in the classic version, our searcher does not pursue the target by actively moving from one location to the next. Instead, the searcher receives a stream of intelligence about the location of the target. At any time, the searcher can engage the location he thinks contains the target or wait for more intelligence. The searcher incurs costs when he engages the wrong location, based on insufficient intelligence, or waits too long in the hopes of gaining better situational awareness, which allows the target to either execute his plot or disappear. We formulate the searcher’s decision as an optimal stopping problem and establish conditions for optimally executing this search-and-interdict mission
    corecore