相关论文: Site Percolation on Planar $\Phi^{3}$ Random Graph…
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…
We study site percolation on uniform quadrangulations of the upper half plane. The main contribution is a method for applying Angel's peeling process, in particular for analyzing an evolving boundary condition during the peeling. Our method…
Herein, we propose a site random cluster model by introducing an additional cluster weight in the partition function of the traditional site percolation. To simulate the model on a square lattice, we combine the color-assignation and the…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph…
In this paper we study statistical methods of parameters estimation of the site percolation model. Advantages of the proposed method is demonstrated for the computing of the confidence interval of mass fractal dimension of a percolation…
We determine thresholds $p_c$ for random site percolation on a triangular lattice for neighbourhoods containing nearest (NN), next-nearest (2NN), next-next-nearest (3NN), next-next-next-nearest (4NN) and next-next-next-next-nearest (5NN)…
We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…
We consider a percolation model on square lattices with sites weighted by beta-distributed random variables $S\sim \mathrm{Beta}(a,b)$ with a positive real parameters $a>0$ and $b>0$. Using the Monte Carlo method, we estimate the…
We study infinite ``$+$'' or ``$-$'' clusters for an Ising model on an connected, transitive, non-amenable, planar, one-ended graph $G$ with finite vertex degree. If the critical percolation probability $p_c^{site}$ for the i.i.d.~Bernoulli…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
Percolation on a plane is usually associated with clusters spanning two opposite sides of a rectangular system. Here we investigate three-leg clusters generated on a square lattice and spanning the three sides of equilateral triangles. If…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
In this paper, robustness of planar trivalent random graphs to targeted attacks of highest connected nodes is investigated using numerical simulations. It is shown that these graphs are relatively robust. The nonrandom node removal process…
In this paper we examine the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree). Our…
Percolation phenomena of homopolymer brushes on a planar substrate are simulated using the molecular Monte Carlo method in 3 dimensions. The grafted polymers are isolated from each other at extremely low grafting density, whereas a…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
The main purpose of percolation theory is to model phase transitions in a variety of random systems, which is highly valuable in fields related to materials physics, biology, or otherwise unrelated areas like oil extraction or even quantum…