English
Related papers

Related papers: Spectral asymptotics for Metropolis algorithm on s…

200 papers

Metropolis algorithms for approximate sampling of probability measures on infinite dimensional Hilbert spaces are considered and a generalization of the preconditioned Crank-Nicolson (pCN) proposal is introduced. The new proposal is able to…

Computation · Statistics 2016-11-23 Daniel Rudolf , Björn Sprungk

In this paper we study the ergodicity properties of some adaptive Markov chain Monte Carlo algorithms (MCMC) that have been recently proposed in the literature. We prove that under a set of verifiable conditions, ergodic averages calculated…

Probability · Mathematics 2016-08-16 Christophe Andrieu , Éric Moulines

We consider the problem of sampling from a density of the form $p(x) \propto \exp(-f(x)- g(x))$, where $f: \mathbb{R}^d \rightarrow \mathbb{R}$ is a smooth and strongly convex function and $g: \mathbb{R}^d \rightarrow \mathbb{R}$ is a…

Machine Learning · Statistics 2019-10-02 Wenlong Mou , Nicolas Flammarion , Martin J. Wainwright , Peter L. Bartlett

The general applicability and ease of use of the pseudo-marginal Metropolis--Hastings (PMMH) algorithm, and particle Metropolis--Hastings in particular, makes it a popular method for inference on discretely observed Markovian stochastic…

Statistics Theory · Mathematics 2024-11-19 Chris Sherlock

In this paper we extend classical criteria for determining lower bounds for the least point of the essential spectrum of second-order elliptic differential operators on domains $\Omega\subset\R^n$ allowing for degeneracy of the coefficients…

Spectral Theory · Mathematics 2011-03-08 Roger T. Lewis

We study a non-local optimal control problem involving a linear, bond-based peridynamics model. In addition to existence and uniqueness of solutions to our problem, we investigate their behavior as the horizon parameter $\delta$, which…

Optimization and Control · Mathematics 2023-04-20 Tadele Mengesha , Abner J. Salgado , Joshua M. Siktar

We study the approximation properties of a harmonic function $u \in H\sp{1-k}(\Omega)$, $k > 0$, on relatively compact sub-domain $A$ of $\Omega$, using the Generalized Finite Element Method. For smooth, bounded domains $\Omega$, we obtain…

Numerical Analysis · Mathematics 2007-05-23 Ivo Babuska , Victor Nistor

The Metropolis process (MP) and Simulated Annealing (SA) are stochastic local search heuristics that are often used in solving combinatorial optimization problems. Despite significant interest, there are very few theoretical results…

Data Structures and Algorithms · Computer Science 2023-12-22 Zongchen Chen , Dan Mikulincer , Daniel Reichman , Alexander S. Wein

Let $n\geq2$ and $ \Omega\subset \mathbb{R}^{n+1}$ be a Lipschitz wedge- like domain . We construct positive weak solutions of the problem $$\Delta u + u^p = 0 \quad\hbox{in}\, \Omega,$$ which vanish in a suitable trace sense on…

Analysis of PDEs · Mathematics 2017-03-28 Konstantinos T. Gkikas

We establish semiclassical asymptotics and estimates for the $e_h(x,x;\tau)$ where $e_h(x,y,\tau)$ is the Schwartz kernel of the spectral projector for a second order elliptic operator inside domain with power singularity in the origin.…

Spectral Theory · Mathematics 2023-06-27 Victor Ivrii

We propose a quantum algorithm to compute low-energy expectation values of a quantum Hamiltonian by sampling a partition function associated with the average energy of that Hamiltonian. For any given quantum circuit-Hamiltonian pair, there…

Quantum Physics · Physics 2022-03-14 Judah F. Unmuth-Yockey

Spectral singularities are among generic mathematical features of complex scattering potentials. Physically they correspond to scattering states that behave like zero-width resonances. For a simple optical system, we show that a spectral…

Optics · Physics 2011-10-18 Ali Mostafazadeh

We study the behaviour of the spectrum of a family of one-dimensional operators with periodic high-contrast coefficients as the period goes to zero, which may represent e.g. the elastic or electromagnetic response of a two-component…

Analysis of PDEs · Mathematics 2015-11-19 K. D. Cherednichenko , S. Cooper , S. Guenneau

A new algorithm for one-dimensional minimization is described in detail and the results of some tests on practical cases are reported and illustrated. The method requires only punctual computation of the function, and is suitable to be…

Optimization and Control · Mathematics 2017-08-24 Glauco Masotti

We consider the 2D incompressible Euler equation on a bounded simply connected domain $\Omega$. We give sufficient conditions on the domain $\Omega$ so that for all initial vorticity $\omega_0 \in L^{\infty}(\Omega)$ the weak solutions are…

Analysis of PDEs · Mathematics 2023-08-25 Siddhant Agrawal , Andrea R. Nahmod

The complexity of urban street networks is well accepted to reside in the information space where roads map to nodes and junctions to links between nodes. Assuming that information networks preserve their amount of surprisal on average…

Physics and Society · Physics 2019-12-05 Jerome Benoit , Saif Eddin Jabari

Let $\Omega$ be a smooth, bounded domain of $\mathbb{R}^{N}$, $\omega$ be a positive, $L^{1}$-normalized function, and $0<s<1<p.$ We study the asymptotic behavior, as $p\rightarrow\infty,$ of the pair $\left( \sqrt[p]{\Lambda_{p}%…

Analysis of PDEs · Mathematics 2020-04-07 Grey Ercole , Gilberto Assis Pereira , Rémy Sanchis

We consider the problem of embedding unweighted, directed k-nearest neighbor graphs in low-dimensional Euclidean space. The k-nearest neighbors of each vertex provides ordinal information on the distances between points, but not the…

Machine Learning · Statistics 2015-11-06 Mihai Cucuringu , Joseph Woodworth

In the present paper we investigate the following semilinear singular elliptic problem: \begin{equation*} (\rm P)\qquad \left \{\begin{array}{l} -\Delta u = \dfrac{p(x)}{u^{\alpha}}\quad \text{in} \Omega \\ u = 0\ \text{on} \Omega,\ u>0…

Analysis of PDEs · Mathematics 2015-10-06 Brahim Bougherara , Jacques Giacomoni , Jesus Hernandez

Spectral independence is a recently-developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal $O(n \log n)$ sampling algorithms on bounded-degree graphs…

Data Structures and Algorithms · Computer Science 2023-10-16 Ivona Bezáková , Andreas Galanis , Leslie Ann Goldberg , Daniel Štefankovič