Site-percolation threshold of carbon nanotube fibers--fast inspection of percolation with Markov stochastic theory

DOI10.1016/J.PHYSA.2014.04.013MaRDI QIDQ1782901zbMATH OpenOpenAlexFDO

Authors Fangbo Xu, Zhiping Xu, Boris I. Yakobson

Publication date 20 September 2018

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.2130

zbMATH Keywords

Markov chaincarbon nanotube fibersite percolation

Mathematics Subject Classification ID

Percolation (82B43) Statistical mechanics of nanostructures and nanoparticles (82D80)

Abstract: We present a site-percolation model based on a modified FCC lattice, as well as an efficient algorithm of inspecting percolation which takes advantage of the Markov stochastic theory, in order to study the percolation threshold of carbon nanotube (CNT) fibers. Our Markov-chain based algorithm carries out the inspection of percolation by performing repeated sparse matrix-vector multiplications, which allows parallelized computation to accelerate the inspection for a given configuration. With this approach, we determine that the site-percolation transition of CNT fibers occurs at p_c =0.1533+-0.0013, and analyze the dependence of the effective percolation threshold (corresponding to 0.5 percolation probability) on the length and the aspect ratio of a CNT fiber on a finite-size-scaling basis. We also discuss the aspect ratio dependence of percolation probability with various values of p (not restricted to p_c).

Recommendations

• Exact site-percolation probability on the square lattice
• Exact percolation probabilities for a square lattice: site percolation on a plane, cylinder, and torus
• Topological estimation of percolation thresholds
• The percolation staircase model and its manifestation in composite materials
• Growth, percolation, and correlations in disordered fiber networks

Cites work

• scientific article; zbMATH DE number 54039 (Why is no real title available?)
• scientific article; zbMATH DE number 1776593 (Why is no real title available?)
• A direct parallel implementation of the Hoshen-Kopelman algorithm for distributed memory architectures
• Convolution bootstrap percolation models, Markov-type stochastic processes, and mock theta functions
• Critical percolation in finite geometries
• Disagreement percolation in the study of Markov fields
• Markov Approach to Percolation Theory Based Propagation in Random Media
• On the universality of crossing probabilities in two-dimensional percolation
• Parallel sparse matrix vector multiply software for matrices with data locality
• Proof of crossing formula for 2D percolation
• Quenched invariance principle for simple random walk on percolation clusters
• Rate function of large deviation for a class of nonhomogeneous Markov chains on supercritical percolation network
• Similarity of percolation thresholds on the HCP and FCC lattices
• Simple cubic random-site percolation thresholds for complex neighbourhoods
• Sparse Matrix Computations on Parallel Processor Arrays
• Test of universal finite-size scaling in two-dimensional site percolation
• The Poincaré inequality for Markov random fields proved via disagreement percolation
• Towards a fast parallel sparse symmetric matrix-vector multiplication

Cited in

(3)

• Machine learning approach to percolation transitions: global information
• Field percolation-switching in soft ternary anisotropic system
• The percolation staircase model and its manifestation in composite materials

This page was built for publication: Site-percolation threshold of carbon nanotube fibers--fast inspection of percolation with Markov stochastic theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782901)