Related papers: Statistical properties of worm algorithms for two …
The aim of this paper is to deepen the analysis of the asymptotic behavior of the so-called minimal random walk (MRW) using a new martingale approach. The MRW is a discrete-time random walk with infinite memory that has three regimes…
We introduce the Peierls substitution to a two-dimensional discrete-time quantum walk on a square lattice to examine the spreading dynamics and the coin-position entanglement in the presence of an artificial gauge field. We use the ratio of…
We design an irreversible worm algorithm for the zero-field ferromagnetic Ising model by using the lifting technique. We study the dynamic critical behavior of an energy estimator on both the complete graph and toroidal grids, and compare…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…
We study the ferromagnetic transverse-field Ising model with quenched disorder at $T = 0$ in one and two dimensions by means of stochastic series expansion quantum Monte Carlo simulations using a rigorous zero-temperature scheme. Using a…
Motivated by renewed interest in the physics of branched polymers, we present here a complete characterization of the connectivity and spatial properties of $2$ and $3$-dimensional single-chain conformations of randomly branching polymers…
The energy landscape for the random-field Ising model (RFIM) is complex, yet algorithms such as the push-relabel algorithm exist for computing the exact ground state of an RFIM sample in time polynomial in the sample volume. Simulations…
The self-organized Monte Carlo simulations of 2D Ising ferromagnet on the square lattice are performed. The essence of devised simulation method is the artificial dynamics consisting of the single-spin-flip algorithm of Metropolis…
We introduce an alternative thermal diffusive dynamics for the spin-S Ising ferromagnet realized by means of a random walker. The latter hops across the sites of the lattice and flips the relevant spins according to a probability depending…
Hysteresis is studied for a two-dimensional, spin-1/2, nearest-neighbor, kinetic Ising ferromagnet in an oscillating field, using Monte Carlo simulations and analytical theory. Attention is focused on large systems and strong field…
Random walk in a dynamic i.i.d. beta random environment, conditioned to escape at an atypical velocity, converges to a Doob transform of the original walk. The Doob-transformed environment is correlated in time, i.i.d. in space, and its…
The effect of the correlations in the diluteness pattern in the systems with non-integral dimensionality, on $\nu=\frac{4}{5}$ superdiffusion process is considered in this paper. These spatial correlations have proved to be very effective…
We study the critical relaxation of the two-dimensional Ising model from a fully ordered configuration by series expansion in time t and by Monte Carlo simulation. Both the magnetization (m) and energy series are obtained up to 12-th order.…
The dynamics of the survival probability of quantum walkers on a one-dimensional lattice with random distribution of absorbing immobile traps are investigated. The survival probability of quantum walkers is compared with that of classical…
Animal behavior is often quantified through subjective, incomplete variables that may mask essential dynamics. Here, we develop a behavioral state space in which the full instantaneous state is smoothly unfolded as a combination of…
Nonreversible Markov chains can outperform reversible chains in the Markov chain Monte Carlo method. Lifting is a versatile approach to introducing net stochastic flow in state space and constructing a nonreversible Markov chain. We present…
The reptation Monte Carlo algorithm is a simple, physically motivated and efficient method for equilibrating semi-dilute solutions of linear polymers. Here we propose two simple generalizations for the analogue {\it Amoeba} algorithm for…
A mated-CRT map is a random planar map obtained as a discretized mating of correlated continuum random trees. Mated-CRT maps provide a coarse-grained approximation of many other natural random planar map models (e.g., uniform triangulations…
We develop an approach for performing scaling analysis of $N$-step Random Walks (RWs). The mean square end-to-end distance, $\langle\vec{R}_{N}^{2}\rangle$, is written in terms of inner persistence lengths (IPLs), which we define by the…
The nature of the zero temperature ordering transition in the 3D Gaussian random field Ising magnet is studied numerically, aided by scaling analyses. In the ferromagnetic phase the scaling of the roughness of the domain walls, $w\sim…