Searcharxiv⌕ Search

arXiv subjects

Jerzy Blawzdziewicz

Publications and source records attributed to Jerzy Blawzdziewicz.

22 records · Page 2Linked to original sources

The jamming transition and new percolation universality classes in particulate systems with attraction

We numerically study the jamming transition in particulate systems with attraction by investigating their mechanical response at zero temperature. We find three regimes of mechanical behavior separated by two critical transitions--connectivity and rigidity percolation. The transitions belong to different universality classes than their lattice counterparts, due to force balance constraints. We also find that these transitions are unchanged at low temperatures and resemble gelation transitions in experiments on colloidal and silica gels.

cond-mat.soft↗

Understanding the Frequency Distribution of Mechanically Stable Disk Packings

Relative frequencies of mechanically stable (MS) packings of frictionless bidisperse disks are studied numerically in small systems. The packings are created by successively compressing or decompressing a system of soft purely repulsive disks, followed by energy minimization, until only infinitesimal particle overlaps remain. For systems of up to 14 particles most of the MS packings were generated. We find that the packings are not equally probable as has been assumed in recent thermodynamic descriptions of granular systems. Instead, the frequency distribution, averaged over each packing-fraction interval $Δϕ$, grows exponentially with increasing $ϕ$. Moreover, within each packing-fraction interval MS packings occur with frequencies $f_k$ that differ by many orders of magnitude. Also, key features of the frequency distribution do not change when we significantly alter the packing-generation algorithm--for example frequent packings remain frequent and rare ones remain rare. These results indicate that the frequency distribution of MS packings is strongly influenced by geometrical properties of the multidimensional configuration space. By adding thermal fluctuations to a set of the MS packings, we were able to examine a number of local features of configuration space near each packing including the time required for a given packing to break to a distinct one, which enabled us to estimate the energy barriers that separate one packing from another. We found a positive correlation between the packing frequencies and the heights of the lowest energy barriers $ε_0$. We also examined displacement fluctuations away from the MS packings to correlate the size and shape of the local basins near each packing to the packing frequencies.

cond-mat.stat-mech↗

Enumeration of distinct mechanically stable disk packings in small systems

We create mechanically stable (MS) packings of bidisperse disks using an algorithm in which we successively grow or shrink soft repulsive disks followed by energy minimization until the overlaps are vanishingly small. We focus on small systems because this enables us to enumerate nearly all distinct MS packings. We measure the probability to obtain a MS packing at packing fraction $ϕ$ and find several notable results. First, the probability is highly nonuniform. When averaged over narrow packing fraction intervals, the most probable MS packing occurs at the highest $ϕ$ and the probability decays exponentially with decreasing $ϕ$. Even more striking, within each packing-fraction interval, the probability can vary by many orders of magnitude. By using two different packing-generation protocols, we show that these results are robust and the packing frequencies do not change qualitatively with different protocols.

cond-mat.stat-mech↗

Random close packing revisited: How many ways can we pack frictionless disks?

We create collectively jammed (CJ) packings of 50-50 bidisperse mixtures of smooth disks in 2d using an algorithm in which we successively compress or expand soft particles and minimize the total energy at each step until the particles are just at contact. We focus on small systems in 2d and thus are able to find nearly all of the collectively jammed states at each system size. We decompose the probability $P(ϕ)$ for obtaining a collectively jammed state at a particular packing fraction $ϕ$ into two composite functions: 1) the density of CJ packing fractions $ρ(ϕ)$, which only depends on geometry and 2) the frequency distribution $β(ϕ)$, which depends on the particular algorithm used to create them. We find that the function $ρ(ϕ)$ is sharply peaked and that $β(ϕ)$ depends exponentially on $ϕ$. We predict that in the infinite system-size limit the behavior of $P(ϕ)$ in these systems is controlled by the density of CJ packing fractions--not the frequency distribution. These results suggest that the location of the peak in $P(ϕ)$ when $N \to \infty$ can be used as a protocol-independent definition of random close packing.

cond-mat.stat-mech↗