Related Experiment Video
Updated: Jun 18, 2026

Detection and Quantification of Tunneling Nanotubes Using 3D Volume View Images
Published on: August 31, 2022
Percolation thresholds on two-dimensional Voronoi networks and Delaunay triangulations
1Department of Physics, University of Michigan, Ann Arbor, Michigan 48109-1040, USA. beckeram@umich.edu
Abstract:
The site percolation threshold for the random Voronoi network is determined numerically, with the result pc=0.714 10+/-0.000,02 , using Monte Carlo simulation on periodic systems of up to 40,000 sites. The result is very close to the recent theoretical estimate pc approximately 0.7151 of Neher For the bond threshold on the Voronoi network, we find pc=0.666, 931+/-0.000,005 implying that, for its dual, the Delaunay triangulation pc=0.333 069+/-0.000 005 . These results rule out the conjecture by Hsu and Huang that the bond thresholds are 2/3 and 1/3, respectively, but support the conjecture of Wierman that, for fully triangulated lattices other than the regular triangular lattice, the bond threshold is less than 2 sin pi/18 approximately 0.3473 .
Related Concept Videos
Uniform Depth Channel Flow: Problem Solving
Divergence and Stokes' Theorems
Design Example: Analyzing Capacity Contours for Flood Risk Assessment
Divergence Theorem in 3D Space
Region of Convergence of Laplace Tarnsform
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This substitution...
Uniform Depth Channel Flow

