Related papers: Comment on "Efficient, multiple-range random walk …

Comment on the Letter ``Polynomial-Time Simulation of Pairing Models on a Quantum Computer'', L. A. Wu, M. S. Byrd and D. A. Lidar, Phys. Rev. Lett. 89, 057904 (2002).

We present a generalization of the classical Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] to quantum systems. The algorithm proceeds by stochastically evaluating the coefficients of a high temperature series expansion or a…

As written by statistician George Box "All models are wrong, but some are useful", standard diffusion derivation or Feynman path ensembles use nonphysical infinite velocity/kinetic energy nowhere differentiable trajectories - what seems…

Comment on ``Demystifying Double Robustness: A Comparison of Alternative Strategies for Estimating a Population Mean from Incomplete Data'' [arXiv:0804.2958]

Comment on ``Demystifying Double Robustness: A Comparison of Alternative Strategies for Estimating a Population Mean from Incomplete Data'' [arXiv:0804.2958]

We present an approximated maximum likelihood method for the multifractal random walk processes of [E. Bacry et al., Phys. Rev. E 64, 026103 (2001)]. The likelihood is computed using a Laplace approximation and a truncation in the…

We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…

Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…

Min et al. (2009) presented two complementary techniques that use the diffusion approximation to allow efficient Monte-Carlo radiation transfer in very optically thick regions: a modified random walk and a partial diffusion approximation.…

We study a random walk driven by a particle system from a generic class, and establish a law of large numbers for the walk for almost all densities of the environment. To do so, we exploit the finite-ranged approximations of the environment…

Finite density quantum field theories have evaded first principle Monte-Carlo simulations due to the notorious sign-problem. The partition function of such theories appears as the Fourier transform of the generalised density-of-states,…

Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited…

This note contains old instead of new results about random walks on groups, which may serve as a small supplement to the author's monograph ``Random Walks on Infinite Graphs and Groups'' (Cambridge Univ. Press 2000/2009). First, we exhibit…

Comment on X.-L. Wang et al., Phys. Rev. Lett. 105, 253602 (2010).

Users of quantum mechanics, both in physics and in the field of quantum information, are familiar with the concept of a statistical mixture as introduced by von Neumann, and with the use of a density operator in that context. A density…

A simple modification of the ``Wang-Landau sampling'' algorithm removes the systematic error that occurs at the boundary of the range of energy over which the random walk takes place in the original algorithm.

We prove a law of large numbers for certain random walks on certain attractive dynamic random environments when initialised from all sites equal to the same state. This result applies to random walks on $\mathbb{Z}^d$ with $d\geq1$. We…

This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.

In this article, we generalize the recent Discrete Time Random Walk (DTRW) algorithm, which was introduced for the computation of probability densities of fractional diffusion. Although it has the same computational complexity and shares…

This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a functions of its summands as their number tends to infinity. The conditioning event is of moderate or…