Polymer quantization and the saddle point approximation of partition functions
نویسندگان
چکیده
منابع مشابه
Super- and sub-additive transformations of aggregation functions from the point of view of approximation
The way super- and sub-additive transformations of aggregation functions are introduced involve suprema and infima taken over simplexes whose dimensions may grow arbitrarily. Exact values of such transformations may thus be hard to determine in general. In this note we discuss methods of algorithmic approximation of such transformations.
متن کاملSharp Stability and Approximation Estimates for Symmetric Saddle Point Systems
We establish sharp well-posedness and approximation estimates for variational saddle point systems at the continuous level. The main results of this note have been known to be true only in the finite dimensional case. Known spectral results from the discrete case are reformulated and proved using a functional analysis view, making the proofs in both cases, discrete and continuous, less technica...
متن کاملResonance wave functions located at the Stark saddle point
We calculate quantum-mechanically exact wave functions of resonances in spectra of the hydrogen atom in crossed external fields and prove the existence of long-lived decaying quantum states localized at the Stark saddle point. A spectrum of ground and excited states reproducing the nodal patterns expected from simple quadratic and cubic expansions of the potential in the vicinity of the saddle ...
متن کاملRatios of partition functions for the log-gamma polymer
We introduce a random walk in random environment associated to an underlying directed polymer model in 1+1 dimensions. This walk is the positive temperature counterpart of the competition interface of percolation and arises as the limit of quenched polymer measures. We prove this limit for the exactly solvable log-gamma polymer, as a consequence of almost sure limits of ratios of partition func...
متن کاملAn Eecient Stochastic Approximation Algorithm for Stochastic Saddle Point Problems
We show that Polyak's (1990) stochastic approximation algorithm with averaging originally developed for unconstrained minimization of a smooth strongly convex objective function observed with noise can be naturally modiied to solve convex-concave stochas-tic saddle point problems. We also show that the extended algorithm, considered on general families of stochastic convex-concave saddle point ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review D
سال: 2015
ISSN: 1550-7998,1550-2368
DOI: 10.1103/physrevd.92.104029