Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLocal cluster-size statistics in the critical phase of bond percolation on the Cayley tree
325
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
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 depends 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.
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$.
In this paper, we apply machine learning methods to study phase transitions in certain statistical mechanical models on the two dimensional lattices, whose transitions involve non-local or topological properties, including site and bond percolations, the XY model and the generalized XY model. We find that using just one hidden layer in a fully-connected neural network, the percolation transition can be learned and the data collapse by using the average output layer gives correct estimate of the critical exponent $ u$. We also study the Berezinskii-Kosterlitz-Thouless transition, which involves binding and unbinding of topological defects---vortices and anti-vortices, in the classical XY model. The generalized XY model contains richer phases, such as the nematic phase, the paramagnetic and the quasi-long-range ferromagnetic phases, and we also apply machine learning method to it. We obtain a consistent phase diagram from the network trained with only data along the temperature axis at two particular parameter $Delta$ values, where $Delta$ is the relative weight of pure XY coupling. Besides using the spin configurations (either angles or spin components) as the input information in a convolutional neural network, we devise a feature engineering approach using the histograms of the spin orientations in order to train the network to learn the three phases in the generalized XY model and demonstrate that it indeed works. The trained network by using system size $Ltimes L$ can be used to the phase diagram for other sizes ($Ltimes L$, where $L e L$) without any further training.
A two parameter percolation model with nucleation and growth of finite clusters is developed taking the initial seed concentration rho and a growth parameter g as two tunable parameters. Percolation transition is determined by the final static configuration of spanning clusters. A finite size scaling theory for such transition is developed and numerically verified. The scaling functions are found to depend on both g and rho. The singularities at the critical growth probability gc of a given rho are described by appropriate critical exponents. The values of the critical exponents are found to be same as that of the original percolation at all values of rho at the respective gc . The model then belongs to the same universality class of percolation for the whole range of rho.
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 parameter 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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
