Related papers: Corner transfer matrix renormalization group metho…
We study discrete-time quantum walks on a half line by means of spectral analysis. Cantero et al. [1] showed that the CMV matrix, which gives a recurrence relation for the orthogonal Laurent polynomials on the unit circle [2], expresses the…
We embody the density matrix renormalization group (DMRG) method for the 19-vertex model on a square lattice in order to investigate the Berezinskii-Kosterlitz-Thouless transition. Elements of the transfer matrix of the 19-vertex model are…
Dynamic graph representation learning plays a crucial role in understanding evolving behaviors. However, existing methods often struggle with flexibility, adaptability, and the preservation of temporal and structural dynamics. To address…
We present a new finite-size scaling method for the random walks (RW) superseeding a previously widely used renormalization group approach, which is shown here to be inconsistent. The method is valid in any dimension and is based on the…
We show how to extract the scaling behavior of quantum walks using the renormalization group (RG). We introduce the method by efficiently reproducing well-known results on the one-dimensional lattice. As a nontrivial model, we apply this…
An Obstruction Avoidance Generously Mobility (OAGM) model has been introduced for controlling ad-hoc sensor networks and thereby operating emerging fields like military and healthcare services. According to this model, the ability to send a…
The phase diagram for a two-dimensional self-avoiding walk model on the square lattice incorporating attractive short-ranged interactions between parallel sections of walk is derived using numerical transfer matrix techniques. The model…
In applications of the density matrix renormalization group to nonhermitean problems, the choice of the density matrix is not uniquely prescribed by the algorithm. We demonstrate that for the recently introduced stochastic transfer matrix…
We present a dynamic nonlocal hybrid Monte Carlo algorithm consisting of pivot and ``cut-and-permute'' moves. The algorithm is suitable for the study of polymers in semiconfined geometries at the ordinary transition, where the pivot…
Optimal transport (OT) is a powerful tool for measuring the distance between two defined probability distributions. In this paper, we develop a new manifold named the coupling matrix manifold (CMM), where each point on CMM can be regarded…
It is well known that the weak limit of a suitably scaled continuous-time random walk (CTRW) is the Brownian motion. We investigate the convergence of certain patterned random matrices whose entries are independent CTRWs and their…
We apply the density matrix renormalization group (DMRG) method to a non-equilibrium problem: the asymmetric exclusion process in one dimension. We study the stationary state of the process to calculate the particle density profile…
The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…
In this paper we study a two-dimensional directed self-avoiding walk model of a random copolymer in a random emulsion.
We analyze a semi-infinite one-dimensional random walk process with a biased motion that is incremental in one direction and long-range in the other. On a network with a fixed hierarchy of long-range jumps, we find with exact…
We introduce a new framework to analyze quantum algorithms with the renormalization group (RG). To this end, we present a detailed analysis of the real-space RG for discrete-time quantum walks on fractal networks and show how deep insights…
We present a real space renormalization group scheme for the problem of random walks in a random environment on a strip, which includes one-dimensional random walk in random environment with bounded non-nearest-neighbor jumps. We show that…
Critical behavior of the Ising model is investigated at the center of large scale finite size systems, where the lattice is represented as the tiling of pentagons. The system is on the hyperbolic plane, and the recursive structure of the…
A linearized tensor renormalization group (LTRG) algorithm is proposed to calculate the thermodynamic properties of one-dimensional quantum lattice models, that is incorporated with the infinite time-evolving block decimation technique, and…
In this paper recent substantial progress in applying the density-matrix renormalization-group (DMRG) to the simulation of the time-evolution of strongly correlated quantum systems in one dimension is reviewed. Various approaches to…