Pith. sign in

REVIEW

Connectedness percolation of hard convex polygonal rods and platelets

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1805.05716 v2 pith:ESHLWHIQ submitted 2018-05-15 cond-mat.soft cond-mat.stat-mech

classification cond-mat.softcond-mat.stat-mech
keywords percolationthresholdrodsconnectednessconvexcrossdecreasinghard
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The properties of polymer composites with nanofiller particles change drastically above a critical filler density known as the percolation threshold. Real nanofillers, such as graphene flakes and cellulose nanocrystals, are not idealized disks and rods but are often modeled as such. Here we investigate the effect of the shape of the particle cross section on the geometric percolation threshold. Using connectedness percolation theory and the second-virial approximation, we analytically calculate the percolation threshold of hard convex particles in terms of three single-particle measures. We apply this method to polygonal rods and platelets and find that the universal scaling of the percolation threshold is lowered by decreasing the number of sides of the particle cross section. This is caused by the increase of the surface area to volume ratio with decreasing number of sides.

Discussion (0). Sign in to comment.

Pith tools