Related papers: Comment on `Monte Carlo simulation study of the tw…
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…
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…
We perform Monte-Carlo simulations to study the Bernoulli ($p$) bond percolation on the enhanced binary tree which belongs to the class of nonamenable graphs with one end. Our numerical results show that the system has two different…
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.…
We divide the circular boundary of a hyperbolic lattice into four equal intervals, and study the probability of a percolation crossing between an opposite pair, as a function of the bond occupation probability p. We consider the {7,3}…
The Marked Binary Branching Tree (MBBT) is the family tree of a rate one binary branching process, on which points have been generated according to a rate one Poisson point process, with i.i.d. uniformly distributed activation times…
A hyperbolic plane can be modeled by a structure called the enhanced binary tree. We study the ferromagnetic Ising model on top of the enhanced binary tree using the renormalization-group analysis in combination with transfer-matrix…
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…
Recently, the number of non-standard percolation models has proliferated. In all these models, there exists a phase transition at which long range connectivity is established, if local connectedness increases through a threshold $p_c$. In…
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…
The percolation transitions on hyperbolic lattices are investigated numerically using finite-size scaling methods. The existence of two distinct percolation thresholds is verified. At the lower threshold, an unbounded cluster appears and…
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…
Edge detection (ED) remains a fundamental task in computer vision, yet its performance is often hindered by the ambiguous nature of non-edge pixels near object boundaries. The widely adopted Weighted Binary Cross-Entropy (WBCE) loss treats…
We consider loop ensembles on random trees. The loops are induced by a Poisson process of links sampled on the underlying tree interpreted as a metric graph. We allow two types of links, crosses and double bars. The crosses-only case…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…
Network geometry has strong effects on network dynamics. In particular, the underlying hyperbolic geometry of discrete manifolds has recently been shown to affect their critical percolation properties. Here we investigate the properties of…
The elastic backbone is the set of all shortest paths. We found a new phase transition at $p_{eb}$ above the classical percolation threshold at which the elastic backbone becomes dense. At this transition in $2d$ its fractal dimension is…
Despite its fully unitary dynamics, the bosonic Kitaev chain (BKC) displays key hallmarks of non-Hermitian physics including non-reciprocal transport and the non-Hermitian skin effect. Here we demonstrate another remarkable phenomena: the…