Pith. sign in

REVIEW 1 cited by

First passage times in homogeneous nucleation and self-assembly

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 1211.1093 v1 pith:UGG4UI43 submitted 2012-11-06 cond-mat.stat-mech cond-mat.mes-hallq-bio.QM

classification cond-mat.stat-mechcond-mat.mes-hallq-bio.QM
keywords clustertimedistributionfirstself-assemblydetachmentmeannucleation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Motivated by nucleation and molecular aggregation in physical, chemical and biological settings, we present a thorough analysis of the general problem of stochastic self-assembly of a fixed number of identical particles in a finite volume. We derive the Backward Kolmogorov equation (BKE) for the cluster probability distribution. From the BKE we study the distribution of times it takes for a single maximal cluster to be completed, starting from any initial particle configuration. In the limits of slow and fast self-assembly, we develop analytical approaches to calculate the mean cluster formation time and to estimate the first assembly time distribution. We find, both analytically and numerically, that faster detachment can lead to a shorter mean time to first completion of a maximum-sized cluster. This unexpected effect arises from a redistribution of trajectory weights such that upon increasing the detachment rate, paths that take a shorter time to complete a cluster become more likely.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Stochastic model of randomly end-linked polymer network micro-regions

    cond-mat.soft 2019-08 conditional novelty 4.0 of 10

    The paper derives the full probability distribution of free, dangling, and intact strand counts in an end-linked polymer network micro-region over time, including exact variance formulas and a cooperativity parameter.

Pith tools