percolation on trees
Recently Published Documents


TOTAL DOCUMENTS

11
(FIVE YEARS 1)

H-INDEX

6
(FIVE YEARS 0)

Author(s):  
Robert A. Beeler ◽  
Rodney Keaton ◽  
Frederick Norwood




2016 ◽  
Vol 30 (4) ◽  
pp. 2217-2242 ◽  
Author(s):  
Mustazee Rahman
Keyword(s):  


2012 ◽  
Vol 122 (3) ◽  
pp. 1129-1153 ◽  
Author(s):  
Pierre Mathieu ◽  
Christoph Temmel
Keyword(s):  




1997 ◽  
Vol 25 (3) ◽  
pp. 1423-1436 ◽  
Author(s):  
Olle Häggström


1997 ◽  
Vol 6 (1) ◽  
pp. 27-38 ◽  
Author(s):  
LAURENT DECREUSEFOND ◽  
GILLES ZÉMOR

We are interested in a function f(p) that represents the probability that a random subset of edges of a Δ-regular graph G contains half the edges of some cycle of G. f(p) is also the probability that a codeword is corrupted beyond recognition when words of the cycle code of G are submitted to the binary symmetric channel. We derive a precise upper bound on the largest p for which f(p) can vanish when the number of edges of G goes to infinity. To this end, we introduce the notion of fractional percolation on trees, and calculate the related critical probabilities.



1992 ◽  
Vol 20 (4) ◽  
pp. 2043-2088 ◽  
Author(s):  
Russell Lyons




1990 ◽  
Vol 18 (3) ◽  
pp. 931-958 ◽  
Author(s):  
Russell Lyons


Sign in / Sign up

Export Citation Format

Share Document