نتایج جستجو برای: rapid mixing
تعداد نتایج: 365824 فیلتر نتایج به سال:
Journal:
:CoRR
2016
Jonathan Hermon
Allan Sly
Yumeng Zhang
We prove that the the mixing time of the Glauber dynamics for sampling independent sets on n-vertex k-uniform hypergraphs is Opn log nq when the maximum degree ∆ satisfies ∆ ď c2k{2, improving on the previous bound [BDK06] of ∆ ď k ́ 2. This result brings the algorithmic bound to within a constant factor of the hardness bound of [BGG`16] which showed that it is NP-hard to approximately count in...
Journal:
:Biochemistry and Molecular Biology Education
2010
Journal:
:Random Structures and Algorithms
2005
Journal:
:The Annals of Applied Probability
2009
Journal:
:International Journal of Modern Physics E
2020
Journal:
:Electronic Communications in Probability
2015
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید