首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   32篇
  免费   1篇
  国内免费   1篇
数学   34篇
  2020年   2篇
  2017年   1篇
  2016年   2篇
  2015年   2篇
  2014年   1篇
  2013年   3篇
  2012年   6篇
  2011年   1篇
  2010年   2篇
  2009年   2篇
  2006年   2篇
  2005年   4篇
  2004年   1篇
  2003年   2篇
  2001年   1篇
  2000年   1篇
  1998年   1篇
排序方式: 共有34条查询结果,搜索用时 0 毫秒
31.
We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with n vertices and of bounded degree. We show that the relaxation time (defined as the reciprocal of the spectral gap |12|) for the dynamics on trees and on planar hyperbolic graphs, is polynomial in n. For these hyperbolic graphs, this yields a general polynomial sampling algorithm for random configurations. We then show that for general graphs, if the relaxation time 2 satisfies 2=O(1), then the correlation coefficient, and the mutual information, between any local function (which depends only on the configuration in a fixed window) and the boundary conditions, decays exponentially in the distance between the window and the boundary. For the Ising model on a regular tree, this condition is sharp.Research supported by Microsoft graduate fellowship.Supported by a visiting position at INRIA and a PostDoc at Microsoft research.Research supported by NSF Grants DMS-0104073, CCR-0121555 and a Miller Professorship at UC Berkeley.Acknowledgement We are grateful to David Aldous, David Levin, Laurent Saloff-Coste and Peter Winkler for useful discussions. We thank Dror Weitz for helpful comments on [19].  相似文献   
32.
We study the notion of reverse hypercontractivity. We show that reverse hypercontractive inequalities are implied by standard hypercontractive inequalities as well as by the modified log-Sobolev inequality. Our proof is based on a new comparison lemma for Dirichlet forms and an extension of the Stroock–Varopoulos inequality. A consequence of our analysis is that all simple operators ${L = Id - \mathbb{E}}$ as well as their tensors satisfy uniform reverse hypercontractive inequalities. That is, for all q < p < 1 and every positive valued function f for ${t \geq \log \frac{1-q}{1-p}}$ we have ${\| e^{-tL}f\|_{q} \geq \| f\|_{p}}$ . This should be contrasted with the case of hypercontractive inequalities for simple operators where t is known to depend not only on p and q but also on the underlying space. The new reverse hypercontractive inequalities established here imply new mixing and isoperimetric results for short random walks in product spaces, for certain card-shufflings, for Glauber dynamics in high-temperatures spin systems as well as for queueing processes. The inequalities further imply a quantitative Arrow impossibility theorem for general product distributions and inverse polynomial bounds in the number of players for the non-interactive correlation distillation problem with m-sided dice.  相似文献   
33.
    
Consider the following method of card shuffling. Start with a deck of cards numbered 1 through . Fix a parameter between 0 and 1. In this model a ``shuffle' consists of uniformly selecting a pair of adjacent cards and then flipping a coin that is heads with probability . If the coin comes up heads, then we arrange the two cards so that the lower-numbered card comes before the higher-numbered card. If the coin comes up tails, then we arrange the cards with the higher-numbered card first. In this paper we prove that for all , the mixing time of this card shuffling is , as conjectured by Diaconis and Ram (2000). Our result is a rare case of an exact estimate for the convergence rate of the Metropolis algorithm. A novel feature of our proof is that the analysis of an infinite (asymmetric exclusion) process plays an essential role in bounding the mixing time of a finite process.

  相似文献   

34.
         下载免费PDF全文
We apply the theory of Markov random fields on trees to derive a phase transition in the number of samples needed in order to reconstruct phylogenies.

We consider the Cavender-Farris-Neyman model of evolution on trees, where all the inner nodes have degree at least , and the net transition on each edge is bounded by . Motivated by a conjecture by M. Steel, we show that if 1$\">, then for balanced trees, the topology of the underlying tree, having leaves, can be reconstructed from samples (characters) at the leaves. On the other hand, we show that if , then there exist topologies which require at least samples for reconstruction.

Our results are the first rigorous results to establish the role of phase transitions for Markov random fields on trees, as studied in probability, statistical physics and information theory, for the study of phylogenies in mathematical biology.

  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号