arXiv 0804.29882008-04cond-mat.dis-nncond-mat.soft

Scaling behavior of self-avoiding walks on percolation clusters

Viktoria Blavatska, Wolfhard Janke

备注：: 6 pages
发表信息：: Europhys. Letters 82 (2008) p. 66006
DOI：: 10.1209/0295-5075/82/66006

英文摘要：

The scaling behavior of self-avoiding walks (SAWs) on the backbone of percolation clusters in two, three and four dimensions is studied by Monte Carlo simulations. We apply the pruned-enriched Rosenbluth chain-growth method (PERM). Our numerical results bring about the estimates of critical exponents, governing the scaling laws of disorder averages of the end-to-end distance of SAW configurations. The effects of finite-size scaling are discussed as well.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Walking on fractals: diffusion and self-avoiding walks on percolation clusters

We consider random walks (RWs) and self-avoiding walks (SAWs) on disordered lattices directly at the percolation threshold. Applying numerical simulations, we study the scaling behavior of the models on the incipient percolation cluster in space dimensions d=2, 3, 4. Our analysis yields estimates of universal exponents, governing the scaling laws for configurational properties of RWs and SAWs.

2008-07-24cond-mat.dis-nncond-mat.soft

Multifractality of self-avoiding walks on percolation clusters

We consider self-avoiding walks (SAWs) on the backbone of percolation clusters in space dimensions d=2, 3, 4. Applying numerical simulations, we show that the whole multifractal spectrum of singularities emerges in exploring the peculiarities of the model. We obtain estimates for the set of critical exponents, that govern scaling laws of higher moments of the distribution of percolation cluster sites visited by SAWs, in a good correspondence with an appropriately summed field-theoretical \varepsilon=6-d-expansion (H.-K. Janssen and O. Stenull, Phys. Rev. E 75, 020801(R) (2007)).

2008-07-23cond-mat.dis-nncond-mat.soft

Fractals Meet Fractals: Self-Avoiding Random Walks on Percolation Clusters

The scaling behavior of linear polymers in disordered media, modelled by self-avoiding walks (SAWs) on the backbone of percolation clusters in two, three and four dimensions is studied by numerical simulations. We apply the pruned-enriched Rosenbluth chain-growth method (PERM). Our numerical results yield estimates of critical exponents, governing the scaling laws of disorder averages of the configurational properties of SAWs, and clearly indicate a multifractal spectrum which emerges when two fractals meet each other.

2010-01-11cond-mat.dis-nncond-mat.soft

`Generalized des Cloizeaux' exponent for self-avoiding walks on the incipient percolation cluster

We study the asymptotic shape of self-avoiding random walks (SAW) on the backbone of the incipient percolation cluster in d-dimensional lattices analytically. It is generally accepted that the configurational averaged probability distribution function <P_{\mathrm{B}}(r,N)> for the end-to-end distance r of an N step SAW behaves as a power law for r -> 0. In this work, we determine the corresponding exponent using scaling arguments, and show that our suggested `generalized des Cloizeaux' expression for the exponent is in excellent agreement with exact enumeration results in two and three dimensi…

2001-02-22cond-mat.dis-nn

Bond and site color-avoiding percolation in scale free networks

Recently the problem of classes of vulnerable vertices (represented by colors) in complex networks has been discussed, where all vertices with the same vulnerability are prone to fail together. Utilizing redundant paths each avoiding one vulnerability (color), a robust color-avoiding connectivity is possible. However, many infrastructure networks show the problem of vulnerable classes of \textit{edges} instead of vertices. Here we formulate color-avoiding percolation for colored edges as well. Additionally, we allow for random failures of vertices or edges. The interplay of random failures and…

2018-09-12cond-mat.dis-nncond-mat.stat-mechphysics.soc-ph

Color-avoiding percolation

Many real world networks have groups of similar nodes which are vulnerable to the same failure or adversary. Nodes can be colored in such a way that colors encode the shared vulnerabilities. Using multiple paths to avoid these vulnerabilities can greatly improve network robustness. Color-avoiding percolation provides a theoretical framework for analyzing this scenario, focusing on the maximal set of nodes which can be connected via multiple color-avoiding paths. In this paper we extend the basic theory of color-avoiding percolation that was published in [Krause et. al., Phys. Rev. X 6 (2016) 0…

2016-11-08cond-mat.dis-nncond-mat.stat-mechphysics.soc-ph

更多相关论文收起更多论文

Quantum percolation in quasicrystals using continuous-time quantum walk

We study the percolation of a quantum particle on quasicrystal lattices and compare it with the square lattice. For our study, we have considered quasicrystal lattices modelled on the pentagonally symmetric Penrose tiling and the octagonally symmetric Ammann-Beenker tiling. The dynamics of the quantum particle is modelled using continuous-time quantum walk (CTQW) formalism. We present a comparison of the behaviour of the CTQW on the two aperiodic quasicrystal lattices and the square lattice when all the vertices are connected and when disorder is introduced in the form of disconnections betwee…

2020-01-30cond-mat.dis-nncond-mat.mes-hallquant-ph

Quantum percolation and transition point of a directed discrete-time quantum walk

Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson localisation. Here, we consider a directed discrete-time quantum walk as a model to study quantum percolation of a two-state particle on a two-dimensional lattice. Using numerical analysis we determine the fraction of connected edges required (transition point) in the lattice for the two-state particle to percolate with finite (non-zero) probability for three f…

2014-10-02cond-mat.dis-nncond-mat.othercond-mat.stat-mech

Universality class of epidemic percolation transitions driven by random walks

Inspired by the recent viral epidemic outbreak and its consequent worldwide pandemic, we devise a model to capture the dynamics and the universality of the spread of such infectious diseases. The transition from a pre-critical to the post-critical phase is modeled by a percolation problem driven by random walks on a two-dimensional lattice with an extra average number $ρ$ of nonlocal links per site. Using the finite-size scaling analysis, we find that the effective exponents of the percolation transitions as well as the corresponding time thresholds, extrapolated to the infinite system size, a…

2021-12-09cond-mat.dis-nncond-mat.stat-mechphysics.bio-ph