Related papers: Comment on "Efficient, multiple-range random walk …
Particle swarm optimization comes under lot of changes after James Kennedy and Russell Eberhart first proposes the idea in 1995. The changes has been done mainly on Inertia parameters in velocity updating equation so that the convergence…
We respond to the recent article by S. Goldstein, R. Tumulka, and N. Zangh\`i [arXiv:2309.11835] concerning the spin-dependent arrival-time distributions reported in [S. Das and D. D\"urr, Sci. Rep. 9: 2242 (2019)].
This is a Comment on the Article ``Aging, phase ordering and conformal invariance'' by M.Henkel, M.Pleimling, C.Godr\`eche and J.M.Luck [Phys.Rev.Lett. 87, 265701 (2001)].
This paper considers the optimal scaling problem for high-dimensional random walk Metropolis algorithms for densities which are differentiable in Lp mean but which may be irregular at some points (like the Laplace density for example)…
A Comment on the Letter by B. Kraus {\it Phys. Rev. Lett.}{\bf 104}, 020504 (2010).
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
Using Wang-landau algorithm combined with analytic method, the density of states of two dimensional XY model on square lattices of sizes $16\times16$, $24\times24$ and $32\times32$ is accurately calculated. Thermodynamic quantities, such as…
The goal of this note is to prove a law of large numbers for the empirical speed of a green particle that performs a random walk on top of a field of red particles which themselves perform independent simple random walks on $\Z^d$, $d \geq…
A discussion on the robustness of continuous-variable entangled states under noisy environment is briefly given in direct relation to Phys. Rev. Lett. 105, 100503 (2010).
For certain materials science scenarios arising in rubber technology, one-dimensional moving boundary problems (MBPs) with kinetic boundary conditions are capable of unveiling the large-time behavior of the diffusants penetration front,…
Predicting links in complex networks has been one of the essential topics within the realm of data mining and science discovery over the past few years. This problem remains an attempt to identify future, deleted, and redundant links using…
A functional approach for the study of the random walks in random sceneries (RWRS) is proposed. Under fairly general assumptions on the random walk and on the random scenery, functional limit theorems are proved. The method allows to study…
This short note provides a new and simple proof of the convergence rate for Peng's law of large numbers under sublinear expectations, which improves the corresponding results in Song [15] and Fang et al. [3].
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…
We review recent advances in the analysis of the Wang--Landau algorithm, which is designed for the direct Monte Carlo estimation of the density of states (DOS). In the case of a discrete energy spectrum, we present an approach based on…
Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…
The phase space measure proposed by Lee and Jeong [PRL 106, 220401 (2011)] is shown to be closely related to a well-studied measure in the literature. For pure states, the newly proposed measure is equivalent to an old measure; for mixed…
We revisit an algorithm for distributed consensus optimization proposed in 2010 by J. Wang and N. Elia. By means of a Lyapunov-based analysis, we prove input-to-state stability of the algorithm relative to a closed invariant set composed of…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
A response to a letter to the editor by Schilling regarding Bartroff, Lorden, and Wang ("Optimal and fast confidence intervals for hypergeometric successes" 2022, arXiv:2109.05624)