اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSome Exact Results on Bond Percolation
101
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present some exact results on bond percolation. We derive a relation that specifies the consequences for bond percolation quantities of replacing each bond of a lattice $Lambda$ by $ell$ bonds connecting the same adjacent vertices, thereby yielding the lattice $Lambda_ell$. This relation is used to calculate the bond percolation threshold on $Lambda_ell$. We show that this bond inflation leaves the universality class of the percolation transition invariant on a lattice of dimensionality $d ge 2$ but changes it on a one-dimensional lattice and quasi-one-dimensional infinite-length strips. We also present analytic expressions for the average cluster number per vertex and correlation length for the bond percolation problem on the $N to infty$ limits of several families of $N$-vertex graphs. Finally, we explore the effect of bond vacancies on families of graphs with the property of bounded diameter as $N to infty$.
قيم البحث
اقرأ أيضاً
We study bond percolation of the Cayley tree (CT) by focusing on the probability distribution function (PDF) of a local variable, namely, the size of the cluster including a selected vertex. Because the CT does not have a dominant bulk region, which
is free from the boundary effect, even in the large-size limit, the phase of the system on it is not well defined. We herein show that local observation is useful to define the phase of such a system in association with the well-defined phase of the system on the Bethe lattice, that is, an infinite regular tree without boundary. Above the percolation threshold, the PDFs of the vertex at the center of the CT (the origin) and of the vertices near the boundary of the CT (the leaves) have different forms, which are also dissimilar to the PDF observed in the ordinary percolating phase of a Euclidean lattice. The PDF for the origin of the CT is bimodal: a decaying exponential function and a system-size-dependent asymmetric peak, which obeys a finite-size-scaling law with a fractal exponent. These modes are respectively related to the PDFs of the finite and infinite clusters in the nonuniqueness phase of the Bethe lattice. On the other hand, the PDF for the leaf of the CT is a decaying power function. This is similar to the PDF observed at a critical point of a Euclidean lattice but is attributed to the nesting structure of the CT around the boundary.
We study the singularity of the order parameter at the transition between a critical phase and an ordered phase of bond percolation on pointed hierarchical graphs. In pointed hierarchical graphs, the renormalization group (RG) equation explicitly dep
ends on the bare parameter, which causes the phase transitions that correspond to the bifurcation of the RG fixed point. We derive the relation between the type of this bifurcation and the type of the singularity of the order parameter. In the case of a saddle node bifurcation, the singularity of the order parameter is power-law or essential one depending on the fundamental local structure of the graph. In the case of pitchfork and transcritical bifurcations, the singularity is essential and power-law ones, respectively. These becomes power-law and discontinuous ones, respectively, in the absence of the first-order perturbation to the largest eigenvalue of the combining matrix, which gives the growth rate of the cluster size. We also show that the first-order perturbation vanishes if the relevant RG parameter is unique and the backbone of the pointed hierarchical graph is simply connected via nesting subunits.
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of unlike type
. Such bipartite graphs appear in many social networks, for instance in affiliation networks and in sexual contact networks in which both types of nodes show the scale-free characteristic for the degree distribution. During the depreciation process, an edge between nodes with degrees k and q is retained with probability proportional to (kq)^(-alpha), where alpha is positive so that links between hubs are more prone to failure. The removal process is studied analytically by introducing a generating functions theory. We deduce exact self-consistent equations describing the system at a macroscopic level and discuss the percolation transition. Critical exponents are obtained by exploiting the Fortuin-Kasteleyn construction which provides a link between our model and a limit of the Potts model.
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a network in wh
ich the probability for an edge between nodes $i$ and $j$ to be retained is proportional to $(k_ik_j)^{-alpha}$ with $k_i$ and $k_j$ the degrees of the nodes. We discuss two methods of network reconstruction, sequential and simultaneous, and investigate their properties by analytical and numerical means. The system is examined away from the percolation transition, where the size of the giant cluster is obtained, and close to the transition, where nonuniversal critical exponents are extracted using the generating functions method. The theory is found to agree quite well with simulations. By introducing an extension of the Fortuin-Kasteleyn construction, we find that biased percolation is well described by the $qto 1$ limit of the $q$-state Potts model with inhomogeneous couplings.
We study bond percolation on a one-parameter family of hierarchical small-world network, and find a meta-transition between the inverted BKT transition and the abrupt transition driven by changing the network topology. It is found that the order para
meter is continuous and fractal exponent is discontinuous in the inverted BKT transition, and oppositely, the former is discontinuous and the latter is continuous in the abrupt transition. The gaps of the order parameter and fractal exponent in each transition go to vanish as approaching the meta-transition point. This point corresponds to a marginal power-law transition. In the renormalization group formalism, this meta-transition corresponds to the transition between transcritical and saddle-node bifurcations of the fixed point via a pitchfork bifurcation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
