Evolutionary game theory is employed to study topological conditions of scale-free networks for the evolution of cooperation. We show that Apollonian Networks (ANs) are perfect scale-free networks, on which cooperation can spread to all individuals,
even though there are initially only 3 or 4 hubs occupied by cooperators and all the others by defectors. Local topological features such as degree, clustering coefficient, gradient as well as topology potential are adopted to analyze the advantages of ANs in cooperation enhancement. Furthermore, a degree-skeleton underlying ANs is uncovered for understanding the cooperation diffusion. Constructing this kind degree-skeleton for random scale-free networks promotes cooperation level close to that of Barabasi-Albert networks, which gives deeper insights into the origin of the latter on organization and further promotion of cooperation.
In this paper a lattice model for the diffusional transport of particles in the interphase cell nucleus is proposed. The dynamic behaviour of single chains on the lattice is investigated and Rouse scaling is verified. Dynamical dense networks are cre
ated by a combined version of the bond fluctuation method and a Metropolis Monte Carlo algorithm. Semidilute behaviour of the dense chain networks is shown. By comparing diffusion of particles in a static and a dynamical chain network, we demonstrate that chain diffusion does not alter the diffusion process of small particles. However, we prove that a dynamical network facilitates the transport of large particles. By weighting the mean square displacement trajectories of particles in the static chain network data from the dynamical network can be reconstructed. Additionally, it is shown that subdiffusive behaviour of particles on short time scales results from trapping processes in the crowded environment of the chain network. In the presented model a protein with 30 nm diameter has an effective diffusion coefficient of 1.24E-11 m^2/s in a chromatin fiber network.
Via computer simulations, we demonstrate how a densely grafted layer of polymers, a {it brush}, could be turned into an efficient switch through chemical modification of some of its end-monomers. In this way, a surface coating with reversibly switcha
ble properties can be constructed. We analyze the fundamental physical principle behind its function, a recently discovered surface instability, and demonstrate that the combination of a high grafting density, an inflated end-group size and a high degree of monodispersity are conditions for an optimal functionality of the switch.
In this paper a lattice model for diffusional transport of particles in the interphase cell nucleus is proposed. Dense networks of chromatin fibers are created by three different methods: randomly distributed, non-interconnected obstacles, a random w
alk chain model, and a self avoiding random walk chain model with persistence length. By comparing a discrete and a continuous version of the random walk chain model, we demonstrate that lattice discretization does not alter particle diffusion. The influence of the 3D geometry of the fiber network on the particle diffusion is investigated in detail, while varying occupation volume, chain length, persistence length and walker size. It is shown that adjacency of the monomers, the excluded volume effect incorporated in the self avoiding random walk model, and, to a lesser extent, the persistence length, affect particle diffusion. It is demonstrated how the introduction of the effective chain occupancy, which is a convolution of the geometric chain volume with the walker size, eliminates the conformational effects of the network on the diffusion, i.e., when plotting the diffusion coefficient as a function of the effective chain volume, the data fall onto a master curve.
