咨询与建议

限定检索结果

文献类型

  • 614 篇 期刊文献
  • 26 篇 会议
  • 7 篇 学位论文
  • 1 册 图书
  • 1 篇 资讯

馆藏范围

  • 649 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 563 篇 理学
    • 378 篇 物理学
    • 121 篇 统计学(可授理学、...
    • 96 篇 数学
    • 38 篇 天文学
    • 30 篇 生物学
    • 8 篇 化学
    • 5 篇 地球物理学
    • 3 篇 生态学
  • 238 篇 工学
    • 115 篇 材料科学与工程(可...
    • 80 篇 电气工程
    • 69 篇 计算机科学与技术...
    • 65 篇 电子科学与技术(可...
    • 14 篇 软件工程
    • 13 篇 环境科学与工程(可...
    • 11 篇 水利工程
    • 7 篇 核科学与技术
    • 6 篇 控制科学与工程
    • 5 篇 交通运输工程
    • 4 篇 土木工程
    • 4 篇 安全科学与工程
    • 3 篇 力学(可授工学、理...
    • 3 篇 机械工程
    • 3 篇 信息与通信工程
    • 3 篇 石油与天然气工程
  • 60 篇 经济学
    • 53 篇 应用经济学
    • 9 篇 理论经济学
  • 17 篇 管理学
    • 15 篇 管理科学与工程(可...
  • 16 篇 农学
  • 10 篇 医学
    • 5 篇 临床医学
    • 3 篇 基础医学(可授医学...
  • 3 篇 法学
    • 2 篇 社会学
  • 1 篇 教育学

主题

  • 649 篇 metropolis algor...
  • 151 篇 monte carlo meth...
  • 62 篇 ising model
  • 51 篇 phase transition...
  • 49 篇 classical statis...
  • 38 篇 simulated anneal...
  • 37 篇 gibbs sampler
  • 35 篇 finite-size scal...
  • 31 篇 markov chain mon...
  • 30 篇 phase diagrams
  • 27 篇 classical spin m...
  • 26 篇 magnetic phase t...
  • 25 篇 critical phenome...
  • 24 篇 lattice models i...
  • 23 篇 monte carlo simu...
  • 23 篇 gibbs sampling
  • 22 篇 2-dimensional sy...
  • 21 篇 magnetism
  • 20 篇 xy model
  • 18 篇 equilibrium latt...

机构

  • 9 篇 presidency univ ...
  • 7 篇 univ connecticut...
  • 5 篇 banaras hindu un...
  • 5 篇 department of ph...
  • 5 篇 banaras hindu un...
  • 5 篇 institut für the...
  • 4 篇 institute of phy...
  • 4 篇 research center ...
  • 4 篇 department of in...
  • 4 篇 department of ph...
  • 4 篇 institut für the...
  • 4 篇 univ toronto dep...
  • 4 篇 institut für phy...
  • 3 篇 center for compu...
  • 3 篇 department of ph...
  • 3 篇 department of ph...
  • 3 篇 international ce...
  • 3 篇 centre for model...
  • 3 篇 department of ph...
  • 3 篇 school of physic...

作者

  • 11 篇 acharyya muktish
  • 7 篇 milan žukovič
  • 7 篇 alexander k. har...
  • 5 篇 wolfhard janke
  • 5 篇 satoru hayami
  • 5 篇 hendrik schawe
  • 5 篇 kuo l
  • 5 篇 mallick olivia
  • 5 篇 dey dk
  • 4 篇 v. v. mazurenko
  • 4 篇 yuan-yao he
  • 4 篇 scott lawrence
  • 4 篇 rosenthal jeffre...
  • 4 篇 gerard t. barkem...
  • 4 篇 sudholt dirk
  • 4 篇 oliveto pietro s...
  • 4 篇 vihola matti
  • 4 篇 upadhyay s. k.
  • 4 篇 philipp ströker
  • 4 篇 karsten meier

语言

  • 608 篇 英文
  • 39 篇 其他
  • 2 篇 中文
检索条件"主题词=Metropolis algorithm"
649 条 记 录,以下是31-40 订阅
排序:
Geometric convergence and central limit theorems for multidimensional Hastings and metropolis algorithms
收藏 引用
BIOMETRIKA 1996年 第1期83卷 95-110页
作者: Roberts, GO Tweedie, RL COLORADO STATE UNIV DEPT STATFT COLLINSCO 80523
We develop results on geometric ergodicity of Markov chains and apply these and other recent results in Markov chain theory to multidimensional Hastings and metropolis algorithms. For those based on random walk candid... 详细信息
来源: 评论
WEAK CONVERGENCE AND OPTIMAL SCALING OF RANDOM WALK metropolis algorithmS
收藏 引用
ANNALS OF APPLIED PROBABILITY 1997年 第1期7卷 110-120页
作者: Roberts, G. O. Gelman, A. Gilks, W. R. Univ Cambridge Stat Lab Cambridge CB2 1SB England Columbia Univ Dept Stat New York NY 10027 USA Inst Publ Hlth MRC Biostat Unit Cambridge CB2 2SR England
This paper considers the problem of scaling the proposal distribution of a multidimensional random walk metropolis algorithm in order to maximize the efficiency of the algorithm. The main result is a weak convergence ... 详细信息
来源: 评论
Syzygies for metropolis base chains
收藏 引用
LINEAR ALGEBRA AND ITS APPLICATIONS 2011年 第10期434卷 2176-2186页
作者: Dinwoodie, Ian H. Portland State Univ Fariborz Maseeh Dept Math & Stat Portland OR 97207 USA
It is shown that Markov chains for sampling from combinatorial sets in the form of experimental designs can be made more efficient by using syzygies on gradient vectors. Examples are presented. (C) 2011 Elsevier Inc. ... 详细信息
来源: 评论
ERROR BOUNDS FOR metropolis-HASTINGS algorithmS APPLIED TO PERTURBATIONS OF GAUSSIAN MEASURES IN HIGH DIMENSIONS
收藏 引用
ANNALS OF APPLIED PROBABILITY 2014年 第1期24卷 337-377页
作者: Eberle, Andreas Univ Bonn Inst Angew Math D-53115 Bonn Germany
The metropolis-adjusted Langevin algorithm (MALA) is a metropolis Hastings method for approximate sampling from continuous distributions. We derive upper bounds for the contraction rate in Kantorovich-Rubinstein-Wasse... 详细信息
来源: 评论
Harris recurrence of metropolis-within-Gibbs and trans-dimensional Markov chains
收藏 引用
ANNALS OF APPLIED PROBABILITY 2006年 第4期16卷 2123-2139页
作者: Roberts, Gareth O. Rosenthal, Jeffrey S. Univ Lancaster Dept Math & Stat Fylde Coll Lancaster LA1 4YF England Univ Toronto Dept Stat Toronto ON M5S 3G3 Canada
A phi-irreducible and aperiodic Markov chain with stationary probability distribution will converge to its stationary distribution from almost all starting points. The property of Harris recurrence allows us to replac... 详细信息
来源: 评论
MIXING TIME OF metropolis CHAIN BASED ON RANDOM TRANSPOSITION WALK CONVERGING TO MULTIVARIATE EWENS DISTRIBUTION
收藏 引用
ANNALS OF APPLIED PROBABILITY 2015年 第3期25卷 1581-1615页
作者: Jiang, Yunjiang Stanford Univ Dept Math Stanford CA 94305 USA
We prove sharp rates of convergence to the Ewens equilibrium distribution for a family of metropolis algorithms based on the random transposition shuffle on the symmetric group, with starting point at the identity. Th... 详细信息
来源: 评论
On equilibrium metropolis simulations on self-organized urban street networks
收藏 引用
APPLIED NETWORK SCIENCE 2021年 第1期6卷 1-30页
作者: Benoit, Jerome G. M. Jabari, Saif Eddin G. New York Univ Abu Dhabi POB 129188 Abu Dhabi U Arab Emirates Ronin Inst Montclair NJ 07043 USA NYU Tandon Sch Engn Brooklyn NY 11201 USA
Urban street networks of unplanned or self-organized cities typically exhibit astonishing scale-free patterns. This scale-freeness can be shown, within the maximum entropy formalism (MaxEnt), as the manifestation of a... 详细信息
来源: 评论
Simulated annealing versus metropolis for a TSP instance
收藏 引用
INFORMATION PROCESSING LETTERS 2007年 第6期104卷 216-219页
作者: Meer, Klaus Syddansk Univ Odense Dept Math & Comp Sci DK-5230 Odense M Denmark
In a recent paper [I. Wegener, Simulated Annealing beats metropolis in combinatorial optimization, in: L. Caires, G.F. Italiano, L. Monteiro, C. Palamidessi, M. Yung (Eds.), Proc. ICALP 2005, in: LNCS, vol. 3580, 2005... 详细信息
来源: 评论
Convergence of metropolis-type algorithms for a large canonical ensemble
收藏 引用
MATHEMATICAL NOTES 2007年 第3-4期82卷 464-468页
作者: Vabishchevich, N. P. Moscow MV Lomonosov State Univ Moscow Russia
In this paper, we study the convergence of metropolis-type algorithms used in modeling statistical systems with a fluctuating number of particles located in a finite volume. We justify the use of metropolis algorithms... 详细信息
来源: 评论
On constrained simulation and optimization by metropolis chains
收藏 引用
STATISTICS & PROBABILITY LETTERS 2000年 第2期46卷 187-193页
作者: Yao, J Univ Paris 01 CNRS UMR 8595 MATISSE SAMOS F-75634 Paris 13 France
Given an everywhere positive probability measure pi on a finite state space E and the associated energy function H, this note gives convergence results for time-inhomogeneous metropolis chains which are used to simula... 详细信息
来源: 评论