You must login before you can run this tool.
Stick2D is somewhat similar to NanoNet, but focuses more on the percolation characteristics. It features using high-efficiency algorithms to effectively study large-size stick systems.
In the present version, Stick2D can only study those percolation systems with identical width-less sticks. It includes the following components:
This component produces the spanning probability function of a stick percolation. This function describes how the spanning probability (the probability a stick system contains at least one continuous path connecting its two opposite boundaries) varies with the stick number density (the number of sticks per unit area). The results include both the direct simulation observables (mircocanonical percolation ensemble) and their convolution with Poisson distribution (canonical percolation ensemble). The sub-cell algorithm  and the tree-based algorithm [2,3] are integrated in this component to improve the efficiency.
This component produces the dependence of the system conductivity on the stick number density. The sample standard deviation (relative) is also included in the simulation results. Besides the sub-cell algorithm and tree-based algorithm, this component employs preconditioned conjugate gradient method  to solve the large systems of linear equations.
 M. E. J. Newman and R. M. Ziff, Phys. Rev. Lett. 85, 4104 (2000).
 M. E. J. Newman and R. M. Ziff, Phys. Rev. E 64, 016706 (2001).
Researchers should cite this work as follows:
For the Spanning Probability, please refer to
J. Li and S.-L. Zhang, Physical Review E 80, 040104(R) (2009).
For the Conductivity, please refer to
J. Li and S.-L. Zhang, Physical Review E 81, 021120 (2010).
Please cite this tool as: