We introduce a model for temporally disordered directed percolation in which the probability of spreading from a vertex (t, x), where t is the time and x is the spatial coordinate, is independent of x but depends on t. Using a very efficient algorithm we calculate low-density series for bond percolation on the directed square lattice. Analysis of the series yields estimates for the critical point pc and various critical exponents which are consistent with a continuous change of the critical parameters as the strength of the disorder is increased. PACS numbers: 05.50.+q, 05.10.−a 1
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattic...
In this paper we study bond percolation on a one-dimensional chain with power-law bond probability C...
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattic...
doi:10.1088/0305-4470/37/27/003 We use very efficient algorithms to calculate low-density series for...
Abstract. A new algorithm for the derivation of low-density series for percolation on directed latti...
We have greatly extended the series expansions for moments of the pair connectedness and the percola...
Abstract. We have derived long-series expansions of the percolation probability for site, bond and s...
AbstracL We have derived long series expansions of the percolation probability for site and bond per...
In this thesis we study various problems in dependent percolation theory. In the first part of this ...
Utilizando uma técnica de matriz de transferência, expandimos em série a probabilidade de percolação...
This is the publisher's version, also available electronically from http://journals.aps.org/pra/abst...
The Hamming graph H(d, n) is the Cartesian product of d complete graphs on n vertices. Let be the de...
We investigate bond- and site-percolation models on several two-dimensional lattices numerically, by...
AbstractA graph G in which each element (vertex or edge) is assigned one of the two states ‘open’ or...
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattic...
In this paper we study bond percolation on a one-dimensional chain with power-law bond probability C...
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattic...
doi:10.1088/0305-4470/37/27/003 We use very efficient algorithms to calculate low-density series for...
Abstract. A new algorithm for the derivation of low-density series for percolation on directed latti...
We have greatly extended the series expansions for moments of the pair connectedness and the percola...
Abstract. We have derived long-series expansions of the percolation probability for site, bond and s...
AbstracL We have derived long series expansions of the percolation probability for site and bond per...
In this thesis we study various problems in dependent percolation theory. In the first part of this ...
Utilizando uma técnica de matriz de transferência, expandimos em série a probabilidade de percolação...
This is the publisher's version, also available electronically from http://journals.aps.org/pra/abst...
The Hamming graph H(d, n) is the Cartesian product of d complete graphs on n vertices. Let be the de...
We investigate bond- and site-percolation models on several two-dimensional lattices numerically, by...
AbstractA graph G in which each element (vertex or edge) is assigned one of the two states ‘open’ or...
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattic...
In this paper we study bond percolation on a one-dimensional chain with power-law bond probability C...
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattic...