Related papers: Corner transfer matrix renormalization group metho…
In this paper, we propose a modified Density Matrix Renormalization Group (DMRG) algorithm to preferentially select minimum entropy states (minimally entangled states) in finite systems with asymptotic ground state degeneracy. The algorithm…
In recent years, some interesting investigations of the non-perturbative renormalization group equations for tensorial group field theories have been done in the truncation method, and completely discarding the Ward identities from their…
Continuous time random walks (CTRW) on finite arbitrarily inhomogeneous chains are studied. By introducing a technique of counting all possible trajectories, we derive closed-form solutions in Laplace space for the Green's function and for…
We summarize our recent efforts to develop the Density Matrix Renormalization Group (DMRG) method into a practical truncation strategy for large-scale nuclear shell model calculations. Following an overview of the essential features of the…
The scaling properties of self-avoiding polymerized 2-dimensional membranes are studied via renormalization group methods based on a multilocal operator product expansion. The renormalization group functions are calculated to second order.…
We present a new approach of topology biased random walks for undirected networks. We focus on a one parameter family of biases and by using a formal analogy with perturbation theory in quantum mechanics we investigate the features of…
We solve a model of self-avoiding walks with up to two monomers per site on the Bethe lattice. This model, inspired on the Domb-Joyce model, was recently proposed to describe the collapse transition observed in interacting polymers [J.…
The density matrix renormalization group (DMRG) has been extended to study quantum phase transitions on random graphs of fixed connectivity. As a relevant example, we have analysed the random Ising model in a transverse field. If the…
We have extended the density matrix renormalization group (DMRG) approach to two-fluid open many-fermion systems governed by complex-symmetric Hamiltonians. The applications are carried out for three- and four-nucleon (proton-neutron)…
The Density Matrix Renormalization Group (DMRG) has become a powerful numerical method that can be applied to low-dimensional strongly correlated fermionic and bosonic systems. It allows for a very precise calculation of static, dynamical…
Given a Hamiltonian with a continuous symmetry one can generally factorize that symmetry and consider the dynamics on invariant Hilbert Spaces. In Statistical Mechanics this procedure is known as the vertex-IRF map, and in certain cases,…
The tensor-network renormalization group (TNRG) is an accurate numerical real-space renormalization group method for studying phase transitions in both quantum and classical systems. Continuous phase transitions, as an important class of…
We study self-avoiding walk on graphs whose automorphism group has a transitive nonunimodular subgroup. We prove that self-avoiding walk is ballistic, that the bubble diagram converges at criticality, and that the critical two-point…
Subordinating a random walk to a renewal process yields a continuous time random walk (CTRW) model for diffusion, including the possibility of anomalous diffusion. Transition densities of scaling limits of power law CTRWs have been shown to…
We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topology via sampling and neighborhood exploration in the form of…
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and…
In this paper, we study the fundamental problem of random walk for network embedding. We propose to use non-Markovian random walk, variants of vertex-reinforced random walk (VRRW), to fully use the history of a random walk path. To solve…
We present a real space renormalization-group map for probabilities of random walks on a hierarchical lattice. From this, we study the asymptotic behavior of the end-to-end distance of a weakly self- avoiding random walk (SARW) that…
A density-matrix renormalization group (DMRG) method for highly anisotropic two-dimensional systems is presented. The method consists in applying the usual DMRG in two steps. In the first step, a pure one dimensional calculation along the…
We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices,…