John C. Wierman

According to our database1, John C. Wierman authored at least 18 papers between 1988 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
A Disproof of Tsallis' Bond Percolation Threshold Conjecture for the Kagome Lattice.
Electr. J. Comb., 2015

2011
Self-dual Planar Hypergraphs and Exact Bond Percolation Thresholds.
Electr. J. Comb., 2011

2010
Aperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models.
Electr. J. Comb., 2010

2009
Percolation Thresholds, Exact.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

2007
The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds.
Combinatorics, Probability & Computing, 2007

2006
Relative density of the random r.
Comput. Stat. Data Anal., 2006

2005
Using Symmetry to Improve Percolation Threshold Bounds.
Combinatorics, Probability & Computing, 2005

2004
Modeling computer virus prevalence with a susceptible-infected-susceptible model with reintroduction.
Comput. Stat. Data Anal., 2004

2003
Pairs of graphs with site and bond percolation critical probabilities in opposite orders.
Discret. Appl. Math., 2003

Upper And Lower Bounds For The Kagome Lattice Bond Percolation Critical Probability.
Combinatorics, Probability & Computing, 2003

2002
Bond percolation critical probability bounds for three Archimedean lattices.
Random Struct. Algorithms, 2002

An Improved Upper Bound For The Hexagonal Lattice Site Percolation Critical Probability.
Combinatorics, Probability & Computing, 2002

1999
Inequalities For Means Of Restricted First-Passage Times In Percolation Theory.
Combinatorics, Probability & Computing, 1999

1995
Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model.
Combinatorics, Probability & Computing, 1995

1992
Equality of the Bond Percolation Critical Exponents for Two Pairs of Dual Lattices.
Combinatorics, Probability & Computing, 1992

1989
Optimal and near-optimal broadcast in random graphs.
Discret. Appl. Math., 1989

The chromatic number of random graphs at the double jump threshold.
Combinatorica, 1989

1988
Subgraph counts in random graphs using incomplete u-statistics methods.
Discret. Math., 1988


  Loading...