Related papers: Renormalization for Discrete Optimization
The renormalization group (RG) method is extended for global asymptotic analysis of discrete systems. We show that the RG equation in the discretized form leads to difference equations corresponding to the Stuart-Landau or Ginzburg-Landau…
A new method, called the method of self-similar approximants, and its recent developments are described. The method is based on the ideas of renormalization group theory and optimal control theory. It allows for the effective extrapolation…
A new approach to combinatorial optimization based on systematic move-class deflation is proposed. The algorithm combines heuristics of genetic algorithms and simulated annealing, and is mainly entropy-driven. It is tested on two problems…
We develop renormalization group methods for solving partial and stochastic differential equations on coarse meshes. Renormalization group transformations are used to calculate the precise effect of small scale dynamics on the dynamics at…
Given a renormalization scheme, we show how to formulate a tractable convex relaxation of the set of feasible local density matrices of a many-body quantum system. The relaxation is obtained by introducing a hierarchy of constraints between…
We apply the renormalization group theory to the dynamical systems with the simplest example of basic biological motifs. This includes the interpretation of complex networks as the perturbation to simple network. This is the first step to…
This paper argues that the ideas underlying the renormalization group technique used to characterize phase transitions in condensed matter systems could be useful for distinguishing computational complexity classes. The paper presents a…
A recently introduced real space renormalization group technique, developed for the analysis of processes in the Kardar-Parisi-Zhang universality class, is generalized and tested by applying it to a different family of surface growth…
Some renormalization group approaches have been proposed during the last few years which are close in spirit to the Nightingale phenomenological procedure. In essence, by exploiting the finite size scaling hypothesis, the approximate…
In order to extend the density-matrix renormalization-group (DMRG) method to two-dimensional systems, we formulate two alternative methods to prepare the initial states. We find that the number of states that is needed for accurate energy…
We prove for the first time that, if a linear inverse problem exhibits a group symmetry structure, gradient-based optimizers can be designed to exploit this structure for faster convergence rates. This theoretical finding demonstrates the…
We have developed a very efficient numerical algorithm of the strong disorder renormalization group method to study the critical behaviour of the random transverse-field Ising model, which is a prototype of random quantum magnets. With this…
A genetic algorithm is suitable for exploring large search spaces as it finds an approximate solution. Because of this advantage, genetic algorithm is effective in exploring vast and unknown space such as molecular search space. Though the…
The density-matrix renormalization group (DMRG) is a numerical algorithm for the efficient truncation of the Hilbert space of low-dimensional strongly correlated quantum systems based on a rather general decimation prescription. This…
Complex networks have acquired a great popularity in recent years, since the graph representation of many natural, social and technological systems is often very helpful to characterize and model their phenomenology. Additionally, the…
Discretization of continuous stochastic processes is needed to numerically simulate them or to infer models from experimental time series. However, depending on the nature of the process, the same discretization scheme, if not accurate…
We introduce a tensor renormalization group scheme for coarse-graining a two-dimensional tensor network that can be successfully applied to both classical and quantum systems on and off criticality. The key innovation in our scheme is to…
Spin-glasses are universal models that can capture complex behavior of many-body systems at the interface of statistical physics and computer science including discrete optimization, inference in graphical models, and automated reasoning.…
A more general scale-setting procedure for General Relativity with Renormalization Group corrections is proposed. Theoretical aspects of the scale-setting procedure and the interpretation of the renormalization group running scale are…
The renormalization group is used to improve the effective potential of massive ${\rm O}(N)$ symmetric $\phi^4$ theory. Explicit results are given at the two-loop level.