Related papers: Comment on "Efficient, multiple-range random walk …
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
This is to reply to the comment of Kenigsberg and Mor on our previous work ``Efficient many-party controlled teleportation of multi-qubit quantum information via entanglement''[Phys. Rev. A 70, 022329 (2004)].
Recently, a new and efficient algorithm (the LLR method) has been proposed for computing densities of states in statistical systems and gauge theories. In this talk, we explore whether this novel density of states method can be applied to…
We present modified Wang-Landau algorithm for models with continuous degrees of freedom. We demonstrate this algorithm with the calculation of the joint density of states $g(M,E)$ of ferromagnet Heisenberg models. The joint density of…
D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…
Rejoinder of "Estimating Random Effects via Adjustment for Density Maximization" by C. Morris and R. Tang [arXiv:1108.3234]
The Landau distribution as well as its first and second momenta are well suited for describing the energy loss of charged particles traversing a thin layer of matter. At present, just rational approximations and asymptotic expressions for…
We apply results from Baryshnikov, Brady, Bressler and Pemantle (2008) to compute limiting probability profiles for various quantum random walks in one and two dimensions. Using analytic machinery we show some features of the limit…
Community detection, as well as the identification of other structures like core periphery and disassortative patterns, is an important topic in network analysis. While most methods seek to find the best partition of the network according…
We propose a new model for a measurement of a characteristic of a microscopic quantum state by a large system that selects stochastically the different eigenstates with appropriate quantum weights. Unlike previous works which formulate a…
We revisit the one dimensional discrete time quantum walk with 3 states and the Grover coin. We derive analytic expressions for observed the localization, an long time approximation for the probability density function (PDF). We also…
Comment on F. Wilhelm et al., Phys. Rev. Lett. 87, 207202 (2001)
We show that a histogram maintained throughout the Wang-Landau (WL) sampling for the energy entries visited during the simulation could be used to make the simulated density of states (DOS) converge. The method is easy to be implemented to…
By combining two generalized-ensemble algorithms, Replica-Exchange Wang-Landau (REWL) method and Multicanonical Replica-Exchange Method (MUCAREM), we propose an effective simulation protocol to determine the density of states with high…
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…
Reply to the Comment of Luo, Xiang, and Wang, cond-mat/0212580.
We present a method for estimating the density of states of a classical statistical model. The algorithm successfully combines the Wang-Landau flat histogram method with the N-fold way in order to improve efficiency of the original single…
A comment to the paper by S. Chen, H. B\"uttner, and J. Voit, [Phys. Rev. Lett. {\bf 87}, 087205 (2001)].
With regard to the recently published article, ``Y.-Q. Wang, et al., Physical mechanism of equiprobable exclusion network with heterogeneous interactions in phase transitions: Analytical analyses of steady state evolving from initial state,…
A Comment on the Letter by M. Rupp et al., Phys. Rev. Lett. 108 058301 (2012).