检索结果-内蒙古大学图书馆

The simulation of spin glass model of neural networks by the wang-landau algorithm

COMPUTER PHYSICS COMMUNICATIONS 2007年第8期177卷 625-630页

作者： Yasar, F. Dilaver, M. Hacettepe Univ Dept Engn Phys Ankara Turkey

In the present work, the Hopfield neural network model with infinite-range interactions was simulated by using the wang-landau algorithm. All simulations and measurements were done in the replica symmetric and broken regions of the model with discrete -/+ 1 values of random variables. The physical quantities such as energy density, specific heat were evaluated at all temperatures. Our results are in good agreement with the replica symmetric mean field solutions. (c) 2007 Elsevier B.V. All rights reserved.

关键词： spin glasses hopfield model neural network wang-landau algorithm

来源：评论

学校读者我要写书评

暂无评论

Folding-unfolding transition in the mini-protein villin headpiece (HP35): An equilibrium study using the wang-landau algorithm

引用

CHEMICAL PHYSICS 2016年 468卷 1-8页

作者： Singh, Priya Sarkar, Subir K. Bandyopadhyay, Pradipta Jawaharlal Nehru Univ Sch Phys Sci New Delhi 110067 India Jawaharlal Nehru Univ Sch Computat & Integrat Sci New Delhi 110067 India

A computational study, using the wang-landau algorithm, is carried out for the 35 residue mini-protein villin headpiece (HP35) to investigate some equilibrium aspects of its folding-unfolding transition in water. The force field used is ECEPP/3 and a solvent-accessible surface area method is used to describe the interaction with water. The density of states and the conditional probabilities of some physically interesting geometrical descriptors of the molecule at various energies are calculated by analyzing the high-statistics data generated by the simulations. All canonical ensemble averages are subsequently calculated by using these data. The computed quantities include specific heat, radius of gyration, number of native contacts, number of helical residues and the potential of mean force for three pairs of geometric descriptors. High precision and a systematic check on the convergence of the computation are the two key points of our methodology. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Protein folding wang-landau algorithm Villin head-piece (HP-35)

来源：评论

学校读者我要写书评

暂无评论

Efficiency of the wang-landau algorithm: A Simple Test Case

引用

APPLIED MATHEMATICS RESEARCH EXPRESS 2014年第2期2014卷 275-311页

作者： Fort, Gersende Jourdain, Benjamin Kuhn, Estelle Lelievre, Tony Stoltz, Gabriel CNRS LTCI 46 Rue Barrault F-75634 Paris 13 France Telecom ParisTech F-75634 Paris 13 France Univ Paris Est CERMICS ENPC INRIA F-77455 Marne La Vallee France INRA Unite MIA F-78352 Jouy En Josas France

We analyze the efficiency of the wang-landau algorithm to sample a multimodal distribution on a prototypical simple test case. We show that the exit time from a metastable state is much smaller for the wang-landau dynamics than for the original standard Metropolis-Hastings algorithm, in some asymptotic regime. Our results are confirmed by numerical experiments on a more realistic test case.

关键词： wang-landau algorithm METASTABLE states DENSITY of states MONTE Carlo method WEIGHT (Physics) PROBABILITY density function DISTRIBUTION (Probability theory) FREE energy (Thermodynamics)

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Interacting wang-landau algorithm for Automatic Density Exploration

引用

JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS 2013年第3期22卷 749-773页

作者： Bornn, Luke Jacob, Pierre E. Del Moral, Pierre Doucet, Arnaud Harvard Univ Dept Stat Cambridge MA 02138 USA Univ Paris 09 CEREMADE F-75775 Paris 16 France INRIA Bordeaux Sud Ouest Bordeaux France Univ Bordeaux Bordeaux France Univ Oxford Dept Stat Oxford OX1 3TG England

While statisticians are well-accustomed to performing exploratory analysis in the modeling stage of an analysis, the notion of conducting preliminary general-purpose exploratory analysis in the Monte Carlo stage (or more generally, the model-fitting stage) of an analysis is an area that we feel deserves much further attention. Toward this aim, this article proposes a general-purpose algorithm for automatic density exploration. The proposed exploration algorithm combines and expands upon components from various adaptive Markov chain Monte Carlo methods, with the wang-landau algorithm at its heart. Additionally, the algorithm is run on interacting parallel chains-a feature that both decreases computational cost as well as stabilizes the algorithm, improving its ability to explore the density. Performance of this new parallel adaptive wang-landau algorithm is studied in several applications. Through a Bayesian variable selection example, we demonstrate the convergence gains obtained with interacting chains. The ability of the algorithm's adaptive proposal to induce mode-jumping is illustrated through a Bayesian mixture modeling application. Last, through a two-dimensional Ising model, the authors demonstrate the ability of the algorithm to overcome the high correlations encountered in spatial models. Supplemental materials are available online.

关键词： Adaptive binning Adaptive Markov chain Monte Carlo Parallel chains wang-landau algorithm

来源：评论

学校读者我要写书评

暂无评论

Influence of Initial Guess on the Convergence Rate and the Accuracy of wang-landau algorithm

引用

OPTICAL MEMORY AND NEURAL NETWORKS 2021年第4期30卷 284-290页

作者： Egorov, V Kryzhanovsky, B. Russian Acad Sci Ctr Opt & Neural Technol Sci Res Inst Syst Anal Moscow 117312 Russia

The influence of the initial guess for the density of states on the convergence rate of the wang-landau algorithm was studied. The simulation was carried out for the two-dimensional Ising model. We used two different initial guesses (by the m-vicinity method and by the exact solution). It was found that the stability of the initial guess depends on the value of the initial modification factor. The improvement in the accuracy of the final simulation results is observed only when the exact solution is used as the initial guess with the small initial modification factor. We find that the simulation with the m-vicinity estimation as the initial guess gives more accurate spectral density estimations until the final stages of the simulation process where it becomes identical to the results of the standard algorithm.

关键词： wang-landau algorithm initial guess convergence rate accuracy spectral density Ising model

来源：评论

学校读者我要写书评

暂无评论

A generalized wang-landau algorithm for Monte Carlo computation

引用

JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION 2005年第472期100卷 1311-1327页

作者： Liang, FM Texas A&M Univ Dept Stat College Stn TX 77843 USA

Inference for a complex system with a rough energy landscape is a central topic in Monte Carlo computation. Motivated by the successes of the wang-landau algorithm in discrete systems, we generalize the algorithm to continuous systems. The generalized algorithm has some features that conventional Monte Carlo algorithms do not have. First, it provides a new method for Monte Carlo integration based on stochastic approximation;second, it is an excellent tool for Monte Carlo optimization. In an appropriate setting, the algorithm can lead to a random walk in the energy space, and thus it can sample relevant parts of the sample space, even in the presence of many local energy minima. The generalized algorithm can be conveniently used in many problems of Monte Carlo integration and optimization, for example, normalizing constant estimation, model selection, highest posterior density interval construction, and function optimization. Our numerical results show that the algorithm outperforms simulated annealing and parallel tempering in optimization for the system with a rough energy landscape. Some theoretical results on the convergence of the algorithm are provided.

关键词： 1/k-ensemble sampling importance sampling Markov chain Monte Carlo Monte Carlo integration Monte Carlo optimization multicanonical algorithm wang-landau algorithm

来源：评论

学校读者我要写书评

暂无评论

Accuracy and Performance Analysis of the 1/t wang-landau algorithm in the Joint Density of States Estimation

引用

OPTICAL MEMORY AND NEURAL NETWORKS 2024年第3期33卷 302-307页

作者： Egorov, V. I. Kryzhanovsky, B. V. Russian Acad Sci Sci Res Inst Syst Anal Moscow 117312 Russia

The 1/t wang-landau algorithm is analyzed from the viewpoint of execution time and accuracy when it is used in computations of the density of states of a two-dimensional Ising model. We find that the simulation results have a systematic error, the magnitude of which decreases with increasing the lattice size. The relative error has two maxima: the first one is located near the energy of the ground state, and the second maximum corresponds to the value of the internal energy at the critical point. We demonstrate that it is impossible to estimate the execution time of the 1/t wang-landau algorithm in advance when simulating large lattices. The reason is that when the final value of the modification factor was reached, the criterion for transition to mode 1/t was not met. The simultaneous calculations of the density of states for energy and magnetization are shown to lead to higher accuracy in estimating statistical moments of internal energy.

关键词： wang-landau algorithm the density of states algorithm execution speed critical transition

来源：评论

学校读者我要写书评

暂无评论

Joint Density of States Calculation Employing wang-landau algorithm

引用

JOURNAL OF STATISTICAL PHYSICS 2016年第1期163卷 197-209页

作者： Kalyan, M. Suman Bharath, R. Sastry, V. S. S. Murthy, K. P. N. Manipal Univ MCNS Manipal 576104 Karnataka India Indian Inst Technol Dept Chem Engn Bombay 400076 Maharashtra India Univ Hyderabad Sch Phys Hyderabad 500046 Andhra Pradesh India

Joint density of states (JDoS), which depends both on energy and another variable like order parameter provides more information than the conventional density of states (DoS) which depend only on energy. Calculation of JDoS requires huge computational time. In this paper we employ two level method to calculate JDoS which requires relatively much less computational time. We demonstrate this method on a two dimensional Ising spin system, lattice spin model of double strand DNA (dsDNA) and Heisenberg ferromagnet.

关键词： Monte Carlo methods wang-landau algorithm Joint density of states Ising model DNA Heisenberg ferromagnet

来源：评论

学校读者我要写书评

暂无评论

THE wang-landau algorithm REACHES THE FLAT HISTOGRAM CRITERION IN FINITE TIME

引用

ANNALS OF APPLIED PROBABILITY 2014年第1期24卷 34-53页

作者： Jacob, Pierre E. Ryder, Robin J. Natl Univ Singapore Dept Stat & Appl Probabil Singapore 117548 Singapore Univ Paris 09 Ctr Rech Econ & Stat F-75016 Paris France Univ Paris 09 CEREMADE F-75016 Paris France

The wang-landau algorithm aims at sampling from a probability distribution, while penalizing some regions of the state space and favoring others. It is widely used, but its convergence properties are still unknown. We show that for some variations of the algorithm, the wang-landau algorithm reaches the so-called flat histogram criterion in finite time, and that this criterion can be never reached for other variations. The arguments are shown in a simple context-compact spaces, density functions bounded from both sides-for the sake of clarity, and could be extended to more general contexts.

关键词： Markov chain Monte Carlo wang-landau algorithm flat histogram

来源：评论

学校读者我要写书评

暂无评论

Dynamical large deviations of the fractional Ornstein-Uhlenbeck process

引用

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL 2025年第9期58卷 095002-095002页

作者： Valov, Alexander Meerson, Baruch Hebrew Univ Jerusalem Racah Inst Phys IL-91904 Jerusalem Israel

The fractional Ornstein-Uhleneck (fOU) process is described by the overdamped Langevin equation x(t)+gamma x = 2D xi(t), where xi(t) is the fractional Gaussian noise with the Hurst exponent 01/2) spectral density at zero frequency. For H>1/2, the fOU is long-correlated. Here we study dynamical large deviations of the fOU process and focus on the area A(n)= integral(T)(-T)x(n)(t)dt, n = 1,2,... over a long time window 2T. Employing the optimal fluctuation method, we determine the optimal path of the conditioned process, which dominates the large-A(n) tail of the probability distribution of the area, P(A(n),T)similar to exp[-S(A(n),T)]. We uncover a nontrivial phase diagram of scaling behaviors of the optimal paths and of the action S(A(n) equivalent to 2a(n)T,T)similar to T(alpha(H,n))a(n)(2/n) on the (H, n) plane. The phase diagram includes three distinct regions: (i) H > 1-1/n, where alpha(H,n) = 2-2H, and the optimal paths are delocalized in time, (ii) n = 2 and H <= 1/2, where alpha(H,n)=1, and the optimal paths oscillate with an H-dependent frequency, and (iii) H <= 1-1/n and n > 2, where alpha(H,n)=2/n, and the optimal paths are strongly localized. We verify our theoretical predictions in large-deviation simulations of the fOU process. By combining the wang-landau Monte-Carlo algorithm with the circulant embedding method of generation of stationary Gaussian fields, we were able to measure probability densities as small as 10(-170). We also generalize our findings to other stationary Gaussian processes with either divergent, or vanishing spectral density at zero frequency.

关键词： fractional Ornstein-Uhlenbeck process fractional Gaussian noise dynamical large deviations optimal fluctuation method wang-landau algorithm circulant embedding method

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：