Multifractality of self-avoiding walks on percolation clusters

量子逾渗中非厄米无序诱导的增强多重分形性

Enhanced Multifractality Induced by Non-Hermitian Disorder in Quantum Percolation

该研究探究二维量子格点逾渗模型中几何稀释与非厄米无序的相互作用，发现随机增益损耗增强多重分形区且保留量子逾渗相变普适类，非厄米无序会偏移量子逾渗阈值并抑制完全退局域化相。

多标度性、渗透阈值和核反应堆的临界点

Multifractality, percolation threshold and critical point of a nuclear reactor

本文通过多标度模型分析核反应堆中子行为，揭示临界点与渗透阈值的关系，探讨链式反应的临界特性及应用。

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.

Scaling behavior of self-avoiding walks on percolation clusters

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.

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.

`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…

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…

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…

Exact analytical calculation for the percolation crossover in deterministic partially self-avoiding walks in one-dimensional random media

Consider $N$ points randomly distributed along a line segment of unitary length. A walker explores this disordered medium moving according to a partially self-avoiding deterministic walk. The walker, with memory $μ$, leaves from the leftmost point and moves, at each discrete time step, to the nearest point which has not been visited in the preceding $μ$ steps. Using open boundary conditions, we have calculated analytically the probability $P_N(μ) = (1 - 2^{-μ})^{N - μ- 1}$ that all $N$ points are visited, with $N \gg μ\gg 1$. This approximated expression for $P_N(μ)$ is reasonable even for sma…

A simple unified view of branching process statistics: random walks in balanced logarithmic potentials

We revisit the problem of deriving the mean-field values of avalanche critical exponents in systems with absorbing states. These are well-known to coincide with those of an un-biased branching process. Here, we show that for at least 4 different universality classes (directed percolation, dynamical percolation, the voter model or compact directed percolation class, and the Manna class of stochastic sandpiles) this common result can be obtained by mapping the corresponding Langevin equations describing each of these classes into a random walker confined close to the origin by a logarithmic pote…