Related papers: Monte Carlo Renormalization Group for Entanglement…
Due to the complex characteristics of bottle-brush polymers, it became a challenge to develop an efficient algorithm for studying such macromolecules under various solvent conditions or some constraints in the space by using computer…
With the developed "extended Monte Calro" (EMC) algorithm, we have studied the depinning transition in Ising-type lattice models by extensive numerical simulations, taking the random-field Ising model with a driving field and the driven…
The scaling behaviour of randomly branched polymers in a good solvent is studied in two to nine dimensions, using as microscopic models lattice animals and lattice trees on simple hypercubic lattices. As a stochastic sampling method we use…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
A grand canonical Monte Carlo (MC) algorithm is presented for studying the lattice gas model (LGM) of multiple protein sequence alignment, which coherently combines long-range interactions and variable-length insertions. MC simulations are…
We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same…
In the thesis we take the split chain approach to analyzing Markov chains and use it to establish fixed-width results for estimators obtained via Markov chain Monte Carlo procedures (MCMC). Theoretical results include necessary and…
We apply Monte Carlo Renormalization group to the crumpling transition in random surface models of fixed connectivity. This transition is notoriously difficult to treat numerically. We employ here a Fourier accelerated Langevin algorithm in…
We extend to quenched disordered systems the variational scheme for real space renormalization group calculations that we recently introduced for homogeneous spin Hamiltonians. When disorder is present our approach gives access to the flow…
We investigate the principal chiral model between two and four dimensions by means of a non perturbative Wilson-like renormalization group equation. We are thus able to follow the evolution of the effective coupling constants within this…
A kinetic Monte Carlo method was used to simulate the diffusion of reptating polymer chains across the interface. A time-resolved fluorescence technique conjunction with direct energy transfer method was used to measure the extend of…
Monte Carlo Renormalization Group (MCRG) methods were designed to study the non-perturbative phase structure and critical behavior of statistical systems and quantum field theories. I adopt the 2-lattice matching method used extensively in…
We introduce a method based on the finite size scaling assumption which allows to determine numerically the critical point and critical exponents related to observables in an infinite system starting from the knowledge of the observables in…
In cluster tomography, we propose measuring the number of clusters $N$ intersected by a line segment of length $\ell$ across a finite sample. As expected, the leading order of $N(\ell)$ scales as $a\ell$, where $a$ depends on microscopic…
Techniques for approximately contracting tensor networks are limited in how efficiently they can make use of parallel computing resources. In this work we demonstrate and characterize a Monte Carlo approach to the tensor network…
We study non-uniform percolation in a two-dimensional cluster growth model with multiple seeds. With increasing concentration of seeds, the percolation threshold is found to increase monotonically, while the exponents for correlation…
We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices with up to 80,000 sites which are linked together according to the Voronoi/Delaunay prescription. In one set of…
The major difference between percolation and other phase transition models is the absence of an Hamiltonian and of a partition function. For this reason it is not straightforward to identify the corresponding field theory to be used as…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…