相关论文: Corner transfer matrix renormalization group metho…
Multifractal properties of the distribution of topological invariants for a model of trajectories randomly entangled with a nonsymmetric lattice of obstacles are investigated. Using the equivalence of the model to random walks on a locally…
A formulation of the Ginzburg-Landau-Wilson version of the partition function of a system with a continuously varying order parameter as a transfer matrix calculation allows for the application of methods based on the Density Matrix…
We present the first rigorous quantitative analysis of once-reinforced random walks (ORRW) on general graphs, based on a novel change of measure formula.~This enables us to prove large deviations estimates for the range of the walk to have…
We present a renormalization group (RG) procedure which works naturally on a wide class of interacting one-dimension models based on perturbed (possibly strongly) continuum conformal and integrable models. This procedure integrates Kenneth…
The renormalization group (RG) method is one of the singular perturbation methods which is used in search for asymptotic behavior of solutions of differential equations. In this article, time-independent vector fields and time (almost)…
This book provides an introduction to a renormalisation group method in the spirit of that of Wilson. It starts with a concise overview of the theory of critical phenomena and the introduction of several tools required in the…
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…
We give an algorithm for counting self-avoiding walks or self-avoiding polygons that runs in time $\exp(C\sqrt{n\log n})$ on 2-dimensional lattices and time $\exp(C_dn^{(d-1)/d}\log n)$ on $d$-dimensional lattices for $d>2$.
Random walk sampling methods have been widely used in graph sampling in recent years, while it has bias towards higher degree nodes in the sample. To overcome this deficiency, classical methods such as MHRW design weighted walking by…
We show that the classical Rosenbluth method for sampling self-avoiding walks can be extended to a general algorithm for sampling many families of objects, including self-avoiding polygons. The implementation relies on an elementary move…
A new class of one-dimensional, discrete time random walk model with memory, termed "Random walk with $n$ memory channels" (RW$n$MC) is proposed. In this model the information of $n$ ($n\in \mathbb{Z}$) previous steps from the walker's…
We summarize our recent results on the large N renormalization group (RG) approach to matrix models for discretized two-dimensional quantum gravity. We derive exact RG equations by solving the reparametrization identities, which reduce…
We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly sublinear in the number of vertices. In this…
The corner transfer matrix renormalization group method is an efficient method for evaluating physical quantities in statistical mechanical models. It originates from Baxter's corner transfer matrix equations and method, and was developed…
The density matrix renormalization group (DMRG) algorithm is a popular alternating minimization scheme for solving high-dimensional optimization problems in the tensor train format. Classical DMRG, however, is based on sequential…
We first give a comprehensive review of the renormalization group method for global and asymptotic analysis, putting an emphasis on the relevance to the classical theory of envelopes and on the importance of the existence of invariant…
In this work, Transition Probability Matrix (TPM) is proposed as a new method for extracting the features of nodes in the graph. The proposed method uses random walks to capture the connectivity structure of a node's close neighborhood. The…
We discuss the Tensor Renormalization Group (TRG) method for the O(2) model with a chemical potential in 1+1 dimensions with emphasis on near gapless/conformal situations. We emphasize the role played by the late Leo Kadanoff in the…
This paper treats absorption problems for the one-dimensional quantum walk determined by a 2 times 2 unitary matrix U on a state space {0,1,...,N} where N is finite or infinite by using a new path integral approach based on an orthonormal…
Two closely related models of oriented self-avoiding walks (OSAWs) on a square lattice are studied. We use the pruned-enriched Rosenbluth method to determine numerically the phase diagram. Both models have three phases: a tight-spiral phase…