Related papers: Critical percolation on the kagome hypergraph
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
A necessary and sufficient condition is established for the strict inequality $p_c(G_*)<p_c(G)$ between the critical probabilities of site percolation on a quasi-transitive, plane graph $G$ and on its matching graph $G_*$. It is assumed…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
In our previous work we have shown that critical manifolds of the q-state Potts model can be studied by means of a graph polynomial P_B(q,v), henceforth referred to as the critical polynomial. This polynomial may be defined on any periodic…
We investigate the existence and stability of gap vortices and multi-pole gap solitons in a Kagome lattice with a defocusing nonlinearity both in a discrete case and in a continuum one with periodic external modulation. In particular,…
We study the critical frontiers of the Potts model on two-dimensional bow-tie lattices with fully inhomogeneous coupling constants. Generally, for the Potts critical frontier to be found exactly, the underlying lattice must be a 3-uniform…
We consider the Constrained-degree percolation model on the hypercubic lattice, $\mathbb L^d=(\mathbb Z^d,\mathbb E^d)$ for $d\geq 3$. It is a continuous time percolation model defined by a sequence, $(U_e)_{e\in\mathbb E^d}$, of i.i.d.…
The kagome lattice, a well known example of the geometrically frustrated system, hosts a dispersionless flat band that offers a unique platform for studying correlation-driven quantum phenomena. At appropriate particle concentrations, the…
We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…
We prove up-to-constants bounds on the two-point function (i.e., point-to-point connection probabilities) for critical long-range percolation on the $d$-dimensional hierarchical lattice. More precisely, we prove that if we connect each pair…
We present an "ultimate" proof of Cardy's formula for the critical percolation on the hexagonal lattice \cite{Smirnov01criticalpercolation}, showing the existence of the universal and conformally invariant scaling limit of crossing…
In this paper we introduce a variant of the honeycomb lattice in which we create defects by randomly exchanging adjacent bonds, producing a random tiling with a distribution of polygon edges. We study the percolation properties on these…
We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…
We consider a Kondo-like impurity interacting with fermions on a honeycomb lattice at half-filling, as in the case of graphene. We derive from the lattice model an effective one-dimensional continuum theory which has, in general, four…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
k-core percolation is an extension of the concept of classical percolation and is particularly relevant to understand the resilience of complex networks under random damage. A new analytical formalism has been recently proposed to deal with…
In this paper, we compute the next-nearest-neighboring site percolation (Connections exist not only between nearest-neighboring sites, but also between next-nearest-neighboring sites.) probabilities Pc on the two-dimensional Sierpinski…
The site percolation on the triangular lattice stands out as one of the few exactly solved statistical systems. By initially configuring critical percolation clusters of this model and randomly reassigning the color of each percolation…
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…