Related papers: Tensor renormalization group analysis of CP(N-1) m…
We describe a method to compute renormalized coupling constants in a Monte Carlo renormalization group calculation. It can be used, e.g., for lattice spin or gauge models. The basic idea is to simulate a joint system of block spins and…
The generalized CP transformations can only be consistently defined in the context of $\Delta(3n^2)$ lepton symmetry if a certain subset of irreducible representations are present in a model. We perform a comprehensive analysis of the…
We show a way to perform the canonical renormalization group (RG) prescription in tensor space: write down the tensor RG equation, linearize it around a fixed-point tensor, and diagonalize the resulting linearized RG equation to obtain…
We compute, both explicitly up to next-to-leading order and in a proof by induction for all loop levels, the critical exponents for thermal Lorentz-violating O($N$) self-interacting scalar field theory. They are evaluated in a massless…
We elaborate on a previous attempt to prove the irreversibility of the renormalization group flow above two dimensions. This involves the construction of a monotonically decreasing $c$-function using a spectral representation. The missing…
We propose a second renormalization group method to handle the tensor-network states or models. This method reduces dramatically the truncation error of the tensor renormalization group. It allows physical quantities of classical…
The CP(N-1) model in 2D is an interesting toy model for 4D QCD as it possesses confinement, asymptotic freedom and a non-trivial vacuum structure. Due to the lower dimensionality and the absence of fermions, the computational cost for…
It is possible to extract values for critical couplings and gamma_string in matrix models by deriving a renormalization group equation for the variation of the of the free energy as the size N of the matrices in the theory is varied. In…
We investigate a novel approach to approximate tensor-network contraction via the exact, matrix-free decomposition of full tensor-networks. We study this method as a means to eliminate the propagation of error in the approximation of…
In autoregressive modeling for tensor-valued time series, Tucker decomposition, when applied to the coefficient tensor, provides a clear interpretation of supervised factor modeling but loses its efficiency rapidly with increasing tensor…
This paper proposes a new Threshold Tensor Factor Model in Canonical Polyadic (CP) form for tensor time series. By integrating a thresholding autoregressive structure for the latent factor process into the tensor factor model in CP form,…
We explain that the supersymmetric $CP^{n-1}$ sigma model is directly related to the level-zero chiral Gross-Neveu (cGN) model. In particular, beta functions of the two theories should coincide. This is consistent with the…
Dimension reduction techniques are often used when the high-dimensional tensor has relatively low intrinsic rank compared to the ambient dimension of the tensor. The CANDECOMP/PARAFAC (CP) tensor completion is a widely used approach to find…
Currently, existing tensor recovery methods fail to recognize the impact of tensor scale variations on their structural characteristics. Furthermore, existing studies face prohibitive computational costs when dealing with large-scale…
The CP(N-1) model in 2D is an interesting toy model for 4D QCD as it possesses confinement, asymptotic freedom and a non-trivial vacuum structure. Due to the lower dimensionality and the absence of fermions, the computational cost for…
We study elastic systems such as interfaces or lattices, pinned by quenched disorder. To escape triviality as a result of ``dimensional reduction'', we use the functional renormalization group. Difficulties arise in the calculation of the…
We propose a method to construct a tensor network representation of partition functions without singular value decompositions nor series expansions. The approach is demonstrated for one- and two-dimensional Ising models and we study the…
The tensor rank decomposition, also known as canonical polyadic(CP) or simply tensor decomposition, has a long history in multilinear algebra. However, computing a rank decomposition becomes particularly challenging when the rank lies…
The $(1+1)$-dimensional two-color lattice QCD is studied with the Grassmann tensor renormalization group. We construct tensor network representations of theories with the staggered fermion and the Wilson fermion and show that Grassmann…
The consistency of Matrix theory with supergravity requires that in the large N_c limit terms of order v^4 in the SU(N_c) Matrix effective potential are not renormalized beyond one loop in perturbation theory. For SU(2) gauge group, the…