John C. Wierman

According to our database, John C. Wierman authored at least 20 papers between 1988 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

Perfect Domination Ratios of Archimedean Lattices.

Yunfan Zhao, John C. Wierman, Thomas G. Marge

Electron. J. Comb., 2022

2021

An upper bound for the bond percolation threshold of the cubic lattice by a growth process approach.

Gaoran Yu, John C. Wierman

J. Appl. Probab., 2021

2015

A Disproof of Tsallis' Bond Percolation Threshold Conjecture for the Kagome Lattice.

John C. Wierman, Gaoran Yu, Theodore Huang

Electron. J. Comb., 2015

2011

Self-dual Planar Hypergraphs and Exact Bond Percolation Thresholds.

John C. Wierman, Robert M. Ziff

Electron. J. Comb., 2011

2010

Aperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models.

Klas Markström, John C. Wierman

Electron. J. Comb., 2010

2009

Percolation Thresholds, Exact.

John C. Wierman

Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

2007

The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds.

William D. May, John C. Wierman

Comb. Probab. Comput., 2007

2006

Relative density of the random r.

Elvan Ceyhan, Carey E. Priebe, John C. Wierman

Comput. Stat. Data Anal., 2006

2005

Using Symmetry to Improve Percolation Threshold Bounds.

William D. May, John C. Wierman

Comb. Probab. Comput., 2005

2004

Modeling computer virus prevalence with a susceptible-infected-susceptible model with reintroduction.

John C. Wierman, David J. Marchette

Comput. Stat. Data Anal., 2004

2003

Pairs of graphs with site and bond percolation critical probabilities in opposite orders.

John C. Wierman

Discret. Appl. Math., 2003

Upper And Lower Bounds For The Kagome Lattice Bond Percolation Critical Probability.

John C. Wierman

Comb. Probab. Comput., 2003

2002

Bond percolation critical probability bounds for three Archimedean lattices.

John C. Wierman

Random Struct. Algorithms, 2002

An Improved Upper Bound For The Hexagonal Lattice Site Percolation Critical Probability.

John C. Wierman

Comb. Probab. Comput., 2002

1999

Inequalities For Means Of Restricted First-Passage Times In Percolation Theory.

Sven Erick Alm, John C. Wierman

Comb. Probab. Comput., 1999

1995

Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model.

John C. Wierman

Comb. Probab. Comput., 1995

1992

Equality of the Bond Percolation Critical Exponents for Two Pairs of Dual Lattices.

John C. Wierman

Comb. Probab. Comput., 1992

1989

Optimal and near-optimal broadcast in random graphs.

Edward R. Scheinerman, John C. Wierman

Discret. Appl. Math., 1989

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

Tomasz Luczak, John C. Wierman

Comb., 1989

1988

Subgraph counts in random graphs using incomplete u-statistics methods.

Krzysztof Nowicki, John C. Wierman

Discret. Math., 1988