Related papers: Upper transition point for percolation on the enha…
We study percolation on self-dual hypergraphs that contain hyperedges with four bounding vertices, or "four-edges", using three different generators, each containing bonds or sites with three distinct probabilities $p$, $r$, and $t$…
Critical phenomena of a second-order percolation transition are known to be independent of cluster merging or pruning process. However, those of a hybrid percolation transition (HPT), mixed properties of both first-order and second-order…
Exceptional points, at which two or more eigenfunctions of a Hamiltonian coalesce, occur in non-Hermitian systems and lead to surprising physical effects. In particular, the behaviour of a system under parameter variation can differ…
A first-order percolation transition, called explosive percolation, was recently discovered in evolution networks with random edge selection under a certain restriction. However, the network percolation with more realistic evolution…
The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $\pi$…
Structural transformations at interfaces are of profound fundamental interest as complex examples of phase transitions in low-dimensional systems. Despite decades of extensive research, no compelling evidence exists for structural…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
Percolation transition (PT) means the formation of a macroscopic-scale large cluster, which exhibits a continuous transition. However, when the growth of large clusters is globally suppressed, the type of PT is changed to a discontinuous…
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…
We obtain new lower bounds on the critical points for various models of oriented percolation. The method is to provide a stochastic domination of the percolation processes by multitype Galton-Watson trees. This can be apply to the classical…
Consider a stationary Poisson process $\eta$ in a $d$-dimensional hyperbolic space of constant curvature $-\varkappa$ and let the points of $\eta$ together with a fixed origin $o$ be the vertices of a graph. Connect each point $x\in\eta$…
The transition constant was introduced in our 1981 paper and denoted as N(14). It is equal to the maximal degree of the ground fields of V-arithmetic connected edge graphs with 4 vertices and of the minimality 14. This constant is…
We report on a possible crossover of a non universal quantity at the upper critical dimensionality in the field of percolation. Plotting recent estimates for site percolation thresholds of hypercubes in dimension 6< d< 13 against…
A new ``Percolation with Clustering'' (PWC) model is introduced, where (the probabilities of) site percolation configurations on the leaf set of a binary tree are rewarded exponentially according to a generic function, which measures the…
It is shown here that the percolation cluster that emerges from the percolation process on infinite perfect binary trees, is genuinely an encoding scheme for an infinite set of symbols. The average codeword length and the entropy of such an…
Defect engineering of two-dimensional materials routinely produces local magnetic moments, yet itinerant half-metallic ferromagnetism remains elusive -- experiments frequently yield paramagnetic insulators. We resolve this paradox for…
The properties of the pure-site clusters of spin models, i.e. the clusters which are obtained by joining nearest-neighbour spins of the same sign, are here investigated. In the Ising model in two dimensions it is known that such clusters…
It is known that any $n$-point set in the $d$-dimensional Euclidean space $\mathbb{R}^d$, for $d = O(1)$, admits: 1) a $(1+\epsilon)$-spanner with maximum degree $\tilde{O}(\epsilon^{-d+1})$ and with lightness $\tilde{O}(\epsilon^{-d})$; 2)…
We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that…
To establish the bond-site duality of explosive percolations in 2 dimension, the site and bond explosive percolation models are carefully defined on a square lattice. By studying the cluster distribution function and the behavior of the…