Computer simulations of randomly branching polymers: annealed versus quenched branching structures (Q2822111)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6630125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computer simulations of randomly branching polymers: annealed versus quenched branching structures |
scientific article; zbMATH DE number 6630125 |
Statements
Computer simulations of randomly branching polymers: annealed versus quenched branching structures (English)
0 references
27 September 2016
0 references
branched polymers
0 references
lattice trees
0 references
excluded volume
0 references
computer simulations
0 references
Flory theory
0 references
The paper deals with the simulation of randomly branched polymers with repulsive, short-range interactions between monomers. One first provides some necessary background and definitions on the considered model and then one discusses carefully annealed connectivity, quenched connectivity and randomly quenched connectivity. Then one describes an algorithm to simulate trees with these various types of connectivity in the analysis of branched polymers. As the main contribution of the paper, one provides results about the structure of trees for various statistical ensembles, as well as the critical exponents which characterizes the behaviour of the tree for large-dimensional systems.
0 references
0.7276886701583862
0 references
0.7121109366416931
0 references
0.7026539444923401
0 references
0.6925264000892639
0 references
