Related papers: Renormalization for Discrete Optimization
Global changes of states are of crucial importance in optimization algorithms. We review some heuristic algorithms in which global updates are realized by a sort of real-space renormalization group transformation. Emphasis is on the…
Based on our studies done on two-dimensional autonomous systems, forced non-autonomous systems and time-delayed systems, we propose a unified methodology - that uses renormalization group theory - for finding out existence of periodic…
Perturbative renormalization group theory is developed as a unified tool for global asymptotic analysis. With numerous examples, we illustrate its application to ordinary differential equation problems involving multiple scales, boundary…
We explain an algorithm that approximately but efficiently assesses particular parity-check error-correcting codes of large, but finite, blocklength. This algorithm is based on the ``renormalization-group'' approach from physics: the idea…
A perturbative renormalization group method is used to obtain steady-state density profiles of a particle non-conserving asymmetric simple exclusion process. This method allows us to obtain a globally valid solution for the density profile…
In this brief article I show how the notion of coarse graining and the Renormalization Group enter naturally in the dynamics of genetic systems, in particular in the presence of recombination. I show how the latter induces a dynamics…
Renormalization group method is one of the most powerful tool to obtain approximate solutions to differential equations. We apply the renormalization group method to Hamiltonian systems whose integrable parts linearly depend on action…
Renormalization group (RG) methods, which model the way in which the effective behavior of a system depends on the scale at which it is observed, are key to modern condensed-matter theory and particle physics. We compare the ideas behind…
A method of ``blocking'' triangulations that rests on the self-similarity feature of dynamically triangulated random manifolds is proposed. The method is used to define the renormalization group for random geometries. As an illustration,…
We find an algorithm of numerical renormalization group for spin chain models. The essence of this algorithm is orthogonal transformation of basis states, which is useful for reducing the number of relevant basis states to create effective…
In this thesis we investigate the Renormalization Group (RG) approach in finite-dimensional glassy systems, whose critical features are still not well-established, or simply unknown. We focus on spin and structural-glass models built on…
The renormalization group is a tool that allows one to obtain a reduced description of systems with many degrees of freedom while preserving the relevant features. In the case of quantum systems, in particular, one-dimensional systems…
We introduce a generalization of the conventional renormalization schemes used in dimensional regularization, which illuminates the renormalization scheme and scale ambiguities of pQCD predictions, exposes the general pattern of…
While in the fully-connected limit the solution of the spin-glass model is known, with the existence of a complex transition on a critical line in the temperature-external field phase diagram, in finite dimensions we don't know if a…
The renormalization group (RG) is a powerful theoretical framework developed to consistently transform the description of configurations of systems with many degrees of freedom, along with the associated model parameters and coupling…
The density matrix renormalization group (DMRG) approach is arguably the most successful method to numerically find ground states of quantum spin chains. It amounts to iteratively locally optimizing matrix-product states, aiming at better…
While renormalization groups are fundamental in physics, renormalization of complex networks remains vague in its conceptual definition and methodology. Here, we propose a novel strategy to renormalize complex networks. Rather than…
We show that numerical quasi-one-dimensional renormalization group allows accurate study of weakly coupled chains with modest computational effort. We perform a systematic comparison with exact diagonalization results in two and three-leg…
The renormalization method which is a type of perturbation method is extended to a tool to study weakly nonlinear time-delay systems. For systems with order-one delay, we show that the renormalization method leads to reduced systems without…
Connecting orbits are important invariant structures in the state space of nonlinear systems and various techniques are designed for their computation. However, a uniform analytic approximation of the whole orbit seems rare. Here, based on…