The hull-gradient method is used to determine the critical threshold for bond percolation on the two-dimensional Kagomé lattice (and its dual, the dice lattice). For this system, the hull walk is represented as a self-avoiding trail, or mirror-model trajectory, on the (3,4,6,4)-Archimedean tiling lattice. The result (one standard deviation of error) is not consistent with previously conjectured values.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/48835/2/a71510.pd
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...
We introduce a class of discrete-continuous percolation models and an efficient Monte Carlo algorith...
We give a conditional derivation of the inhomogeneous critical percolation manifold of the bow-tie l...
In this dissertation we introduce and apply a new growth process methodology that provides rigorous ...
The frontier in gradient percolation is generated directly by a type of self-avoiding random walk. T...
The problem of percolation on Archimedean and 2-uniform lattices is investigated. An empirical formu...
A one-dimensional lattice percolation model is constructed for the bond problem at flowing along non...
We investigate bond- and site-percolation models on several two-dimensional lattices numerically, by...
Using a star-triangle substitution we derive the kagomé lattice from a modified honeycomb lattice. W...
Site and bond percolation of k-mers of different structures and forms deposited on 2-D regular latti...
We give a short proof of the fundamental result that the critical probability for bond percolation i...
We study the percolation transition on a two-dimensional substrate with long-range self-affine corre...
Extensive Monte Carlo simulations were performed in order to determine the precise values of the cri...
We investigate the percolation thresholds of both random and invasion percolation in two and three d...
abstract: We collect results for bond percolation on various lattices from two to fourteen dimension...
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...
We introduce a class of discrete-continuous percolation models and an efficient Monte Carlo algorith...
We give a conditional derivation of the inhomogeneous critical percolation manifold of the bow-tie l...
In this dissertation we introduce and apply a new growth process methodology that provides rigorous ...
The frontier in gradient percolation is generated directly by a type of self-avoiding random walk. T...
The problem of percolation on Archimedean and 2-uniform lattices is investigated. An empirical formu...
A one-dimensional lattice percolation model is constructed for the bond problem at flowing along non...
We investigate bond- and site-percolation models on several two-dimensional lattices numerically, by...
Using a star-triangle substitution we derive the kagomé lattice from a modified honeycomb lattice. W...
Site and bond percolation of k-mers of different structures and forms deposited on 2-D regular latti...
We give a short proof of the fundamental result that the critical probability for bond percolation i...
We study the percolation transition on a two-dimensional substrate with long-range self-affine corre...
Extensive Monte Carlo simulations were performed in order to determine the precise values of the cri...
We investigate the percolation thresholds of both random and invasion percolation in two and three d...
abstract: We collect results for bond percolation on various lattices from two to fourteen dimension...
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...
We introduce a class of discrete-continuous percolation models and an efficient Monte Carlo algorith...
We give a conditional derivation of the inhomogeneous critical percolation manifold of the bow-tie l...