相关论文: Reducibility of cocycles under a Brjuno-R\"ussmann…

We analyze renormalization group (RG) flows in two-dimensional quantum field theories in the presence of redundant directions. We use the operator picture in which redundant operators are total derivatives. Our analysis has three levels of…

We study the variational inference problem of minimizing a regularized R\'enyi divergence over an exponential family. We propose to solve this problem with a Bregman proximal gradient algorithm. We propose a sampling-based algorithm to…

Within the framework of simple perturbation theory, recurrence time of quantum fidelity is related to the period of the classical motion. This indicates the possibility of recurrence in near integrable systems. We have studied such…

We consider a special type of Restricted Boltzmann machine (RBM), namely a Gaussian-spherical RBM where the visible units have Gaussian priors while the vector of hidden variables is constrained to stay on an ${\mathbbm L}_2$ sphere. The…

In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…

A cohomological analysis of the renormalization freedom is performed in the Epstein-Glaser scheme on a flat Euclidean space. We study the deviation from commutativity between the renormalization and the action of all linear partial…

Many problems in science and engineering fields require the solution of shifted linear systems. To solve such systems efficiently, the recycling BiCG (RBiCG) algorithm in [SIAM J. SCI. COMPUT, 34 (2012) 1925-1949] is extended in this paper.…

Learning RBMs using standard algorithms such as CD(k) involves gradient descent on the negative log-likelihood. One of the terms in the gradient, which involves expectation w.r.t. the model distribution, is intractable and is obtained…

We study fluctuation fields of orthogonal polynomials in the context of particle systems with duality. We thereby obtain a systematic orthogonal decomposition of the fluctuation fields of local functions, where the order of every term can…

A REDUCE code for the Newman-Janis algorithm is described. This algorithm is intended to include rotation into nonrotating solutions of the Einstein field equations with spherically symmetry or perturbed spherically symmetry and has been…

We propose a numerical method for resummation of perturbative series, which is based on the stochastic perturbative solution of Schwinger-Dyson equations. The method stochastically estimates the coefficients of perturbative series, and…

An analogue of the Cauchy problem for the iterated multidimensional Klein- Gordon-Fock equation with a time-dependent Bessel operator is investigated. Applying the generalized Erdelyi-Kober operator of fractional order, the problem posed is…

A retraction is a homomorphism from a graph $G$ to an induced subgraph $H$ of $G$ that is the identity on $H$. In a long line of research, retractions have been studied under various algorithmic settings. Recently, the problem of…

Approximation theory is a substantial field of mathematical analysis that emerged in the 19th century and has been developed by mathematicians across the globe ever since. Its importance has increased over time, as it provides solutions to…

Quantization techniques have been applied in many challenging finance applications, including pricing claims with path dependence and early exercise features, stochastic optimal control, filtering problems and efficient calibration of large…

We use the theory of arithmetic quotients of the Bruhat-Tits tree developed by Serre and others to obtain Dirichlet-style theorems for Diophantine approximation on global function fields. This approach allows us to find sharp values for the…

We establish stability of random absolutely continuous invariant measures (acims) for cocycles of random Lasota-Yorke maps under a variety of perturbations. Our family of random maps need not be close to a fixed map; thus, our results can…

This article deals with the mathematical derivation and the validation over benchmark examples of a numerical method for the solution of a finite-strain holonomic (rate-independent) Cosserat plasticity problem for materials, possibly with…

Dynamical low-rank algorithms are a class of numerical methods that compute low-rank approximations of dynamical systems. This is accomplished by projecting the dynamics onto a low-dimensional manifold and writing the solution directly in…

We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…