John C. Wierman

20 papers Journal 19
YearRankTypeTitle / Venue / Authors
2022 J jnl
Perfect Domination Ratios of Archimedean Lattices.
Electron. J. Comb.
Yunfan Zhao, John C. Wierman, Thomas G. Marge
2021 J jnl
An upper bound for the bond percolation threshold of the cubic lattice by a growth process approach.
J. Appl. Probab.
Gaoran Yu, John C. Wierman
2015 J jnl
A Disproof of Tsallis' Bond Percolation Threshold Conjecture for the Kagome Lattice.
Electron. J. Comb.
John C. Wierman, Gaoran Yu, Theodore Huang
2011 J jnl
Self-dual Planar Hypergraphs and Exact Bond Percolation Thresholds.
Electron. J. Comb.
John C. Wierman, Robert M. Ziff
2010 J jnl
Aperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models.
Electron. J. Comb.
Klas Markström, John C. Wierman
2009 — ch.
Percolation Thresholds, Exact.
Encyclopedia of Complexity and Systems Science
John C. Wierman
2007 J jnl
The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds.
Comb. Probab. Comput.
William D. May, John C. Wierman
2006 J jnl
Relative density of the random r.
Comput. Stat. Data Anal.
Elvan Ceyhan, Carey E. Priebe, John C. Wierman
2005 J jnl
Using Symmetry to Improve Percolation Threshold Bounds.
Comb. Probab. Comput.
William D. May, John C. Wierman
2004 J jnl
Modeling computer virus prevalence with a susceptible-infected-susceptible model with reintroduction.
Comput. Stat. Data Anal.
John C. Wierman, David J. Marchette
2003 J jnl
Pairs of graphs with site and bond percolation critical probabilities in opposite orders.
Discret. Appl. Math.
John C. Wierman
2003 J jnl
Upper And Lower Bounds For The Kagome Lattice Bond Percolation Critical Probability.
Comb. Probab. Comput.
John C. Wierman
2002 J jnl
An Improved Upper Bound For The Hexagonal Lattice Site Percolation Critical Probability.
Comb. Probab. Comput.
John C. Wierman
2002 J jnl
Bond percolation critical probability bounds for three Archimedean lattices.
Random Struct. Algorithms
John C. Wierman
1999 J jnl
Inequalities For Means Of Restricted First-Passage Times In Percolation Theory.
Comb. Probab. Comput.
Sven Erick Alm, John C. Wierman
1995 J jnl
Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model.
Comb. Probab. Comput.
John C. Wierman
1992 J jnl
Equality of the Bond Percolation Critical Exponents for Two Pairs of Dual Lattices.
Comb. Probab. Comput.
John C. Wierman
1989 J jnl
Optimal and near-optimal broadcast in random graphs.
Discret. Appl. Math.
Edward R. Scheinerman, John C. Wierman
1989 J jnl
The chromatic number of random graphs at the double jump threshold.
Comb.
Tomasz Luczak, John C. Wierman
1988 J jnl
Subgraph counts in random graphs using incomplete u-statistics methods.
Discret. Math.
Krzysztof Nowicki, John C. Wierman