Premium
On the mean cluster size of a network of cracks
Author(s) -
Dienes John K.
Publication year - 2006
Publication title -
structural control and health monitoring
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.587
H-Index - 62
eISSN - 1545-2263
pISSN - 1545-2255
DOI - 10.1002/stc.126
Subject(s) - coalescence (physics) , mathematics , laplace transform , monte carlo method , uniqueness , cluster (spacecraft) , brittleness , statistical physics , simple (philosophy) , percolation (cognitive psychology) , percolation threshold , mathematical analysis , statistics , physics , computer science , quantum mechanics , philosophy , epistemology , neuroscience , astrobiology , biology , thermodynamics , programming language , electrical resistivity and conductivity
Abstract Brittle polycrystalline materials such as rocks, ceramics, and certain metals contain microcracks that can grow and coalesce under sufficiently high stress, resulting in failure and, possibly, fragmentation. Such processes are idealized in this paper by treating the cracks as circular disks whose coalescence forms clusters and can terminate growth after a number of intersections. A non‐linear recurrence relation for the probability of cluster size is developed and solved by means of a generating function, providing information on the mean size of the crack clusters and the standard deviation. This solution leads to a simple expression for the percolation threshold. The probability of clusters of size n is also determined. Above the percolation threshold the probabilities of finite and infinite clusters are treated separately. Explicit expressions for the probabilities can be approximated by taking a Laplace transform in a simple case, thus clarifying the behaviour of the solution. Appendices show the relation of the theory to practical problems, Monte Carlo approaches, the probability of infinite clusters, and discuss the uniqueness of solutions to such geometrical problems, i.e. Bertrand's Paradox. Copyright © 2005 John Wiley & Sons, Ltd.