Related papers: Monte-Carlo simulation study of the two-stage perc…
We discuss the nature of the two-stage percolation transition on the enhanced binary tree in order to explain the disagreement in the estimation of the second transition probability between the one in our recent paper (J. Phys. A:Math.…
The enhanced binary tree (EBT) is a nontransitive graph which has two percolation thresholds $p_{c1}$ and $p_{c2}$ with $p_{c1}<p_{c2}$. Our Monte Carlo study implies that the second threshold $p_{c2}$ is significantly lower than a recent…
Percolation for a planar lattice has a single percolation threshold, whereas percolation for a negatively curved lattice displays two separate thresholds. The enhanced binary tree (EBT) can be viewed as a prototype model displaying two…
A method to treat a N-component percolation model as effective one component model is presented by introducing a scaled control variable $p_{+}$. In Monte Carlo simulations on $16^{3}$, $32^{3}$, $64^{3}$ and $128^{3}$ simple cubic lattices…
We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…
This is a study of percolation in the hyperbolic plane and on regular tilings in the hyperbolic plane. The processes discussed include Bernoulli site and bond percolation on planar hyperbolic graphs, invariant dependent percolations on such…
I consider p-Bernoulli bond percolation on graphs of vertex-transitive tilings of the hyperbolic plane with finite sided faces (or, equivalently, on transitive, nonamenable, planar graphs with one end) and on their duals. It is known…
We extend some of the fundamental results about percolation on unimodular nonamenable graphs to nonunimodular graphs. We show that they cannot have infinitely many infinite clusters at critical Bernoulli percolation. In the case of heavy…
Using Pade approximations and Monte Carlo simulations, we study the phase diagram of the Two-Neighbor Stochastic Cellular Automata, which have two parameters $p_{1}$ and $p_{2}$ and include the mixed site-bond directed percolation (DP) as a…
We study a statistical mechanics model of two species of bosons with mutual statistics $\theta=2\pi/n$ in (2+1) dimensions. This model realizes a fractionalized topological phase of bosons, which is a fractionalized version of the boson…
By studying its subgraphs, it is argued that the lower critical percolation threshold of the enhanced binary tree (EBT) is bounded as $p_{c1} < 0.355059$, while the upper threshold is bounded both from above and below by 1/2 according to…
Hyperbolic structures are obtained by tiling a hyperbolic surface with negative Gaussian curvature. These structures generally exhibit two percolation transitions: a system-wide connection can be established at a certain occupation…
We propose a novel finite size scaling analysis for percolation transition observed in complex networks. While it is known that cooperative systems in growing networks often undergo an infinite order transition with inverted…
The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^\psi$ and the mean number of clusters with size $s$ per node follows a power function $n_s…
We use a large cell Monte Carlo Renormalization procedure, to compute the critical exponents of a system of growing linear polymers. We simulate the growth of non-intersecting chains in large MC cells. Dense regions where chains get in each…
We study the percolation properties of the growing clusters model. In this model, a number of seeds placed on random locations on a lattice are allowed to grow with a constant velocity to form clusters. When two or more clusters eventually…
We consider Bernoulli bond percolation on oriented regular trees, where besides the usual short bonds, all bonds of a certain length are added. Independently, short bonds are open with probability $p$ and long bonds are open with…
We study Bernoulli bond percolation on nonunimodular quasi-transitive graphs, and more generally graphs whose automorphism group has a nonunimodular quasi-transitive subgroup. We prove that percolation on any such graph has a non-empty…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…