778 research outputs found
Self-Attracting Walk on Lattices
We have studied a model of self-attracting walk proposed by Sapozhnikov using
Monte Carlo method. The mean square displacement
and the mean number of visited sites are calculated for
one-, two- and three-dimensional lattice. In one dimension, the walk shows
diffusive behaviour with . However, in two and three dimension, we
observed a non-universal behaviour, i.e., the exponent varies
continuously with the strength of the attracting interaction.Comment: 6 pages, latex, 6 postscript figures, Submitted J.Phys.
The unconstrained evolution of fast and efficient antibiotic-resistant bacterial genomes
PublishedThis is the author accepted manuscript. The final version is available from Nature Publishing Group via the DOI in this record.-The rrn knockout strains derived from E. coli MG1655 were gifted by T. Bollenbach,
strain AG100 was provided by S. Levy and Candida strains were a gift from S. Bates, who
are sincerely thanked for their help
Structural Properties of Self-Attracting Walks
Self-attracting walks (SATW) with attractive interaction u > 0 display a
swelling-collapse transition at a critical u_{\mathrm{c}} for dimensions d >=
2, analogous to the \Theta transition of polymers. We are interested in the
structure of the clusters generated by SATW below u_{\mathrm{c}} (swollen
walk), above u_{\mathrm{c}} (collapsed walk), and at u_{\mathrm{c}}, which can
be characterized by the fractal dimensions of the clusters d_{\mathrm{f}} and
their interface d_{\mathrm{I}}. Using scaling arguments and Monte Carlo
simulations, we find that for u<u_{\mathrm{c}}, the structures are in the
universality class of clusters generated by simple random walks. For
u>u_{\mathrm{c}}, the clusters are compact, i.e. d_{\mathrm{f}}=d and
d_{\mathrm{I}}=d-1. At u_{\mathrm{c}}, the SATW is in a new universality class.
The clusters are compact in both d=2 and d=3, but their interface is fractal:
d_{\mathrm{I}}=1.50\pm0.01 and 2.73\pm0.03 in d=2 and d=3, respectively. In
d=1, where the walk is collapsed for all u and no swelling-collapse transition
exists, we derive analytical expressions for the average number of visited
sites and the mean time to visit S sites.Comment: 15 pages, 8 postscript figures, submitted to Phys. Rev.
Fast Algorithms For Josephson Junction Arrays : Bus--bars and Defects
We critically review the fast algorithms for the numerical study of
two--dimensional Josephson junction arrays and develop the analogy of such
systems with electrostatics. We extend these procedures to arrays with
bus--bars and defects in the form of missing bonds. The role of boundaries and
of the guage choice in determing the Green's function of the system is
clarified. The extension of the Green's function approach to other situations
is also discussed.Comment: Uuencoded 1 Revtex file (11 Pages), 3 Figures : Postscript Uuencode
Stressed backbone and elasticity of random central-force systems
We use a new algorithm to find the stress-carrying backbone of ``generic''
site-diluted triangular lattices of up to 10^6 sites. Generic lattices can be
made by randomly displacing the sites of a regular lattice. The percolation
threshold is Pc=0.6975 +/- 0.0003, the correlation length exponent \nu =1.16
+/- 0.03 and the fractal dimension of the backbone Db=1.78 +/- 0.02. The number
of ``critical bonds'' (if you remove them rigidity is lost) on the backbone
scales as L^{x}, with x=0.85 +/- 0.05. The Young's modulus is also calculated.Comment: 5 pages, 5 figures, uses epsfi
Interfacial fluctuations near the critical filling transition
We propose a method to describe the short-distance behavior of an interface
fluctuating in the presence of the wedge-shaped substrate near the critical
filling transition. Two different length scales determined by the average
height of the interface at the wedge center can be identified. On one length
scale the one-dimensional approximation of Parry et al. \cite{Parry} which
allows to find the interfacial critical exponents is extracted from the full
description. On the other scale the short-distance fluctuations are analyzed by
the mean-field theory.Comment: 13 pages, 3 figure
Infinite-cluster geometry in central-force networks
We show that the infinite percolating cluster (with density P_inf) of
central-force networks is composed of: a fractal stress-bearing backbone (Pb)
and; rigid but unstressed ``dangling ends'' which occupy a finite
volume-fraction of the lattice (Pd). Near the rigidity threshold pc, there is
then a first-order transition in P_inf = Pd + Pb, while Pb is second-order with
exponent Beta'. A new mean field theory shows Beta'(mf)=1/2, while simulations
of triangular lattices give Beta'_tr = 0.255 +/- 0.03.Comment: 6 pages, 4 figures, uses epsfig. Accepted for publication in Physical
Review Letter
Permeability and conductivity of platelet-reinforced membranes and composites
We present large scale simulations of the diffusion constant of a random
composite consisting of aligned platelets with aspect ratio in a
matrix (with diffusion constant ) and find that , where and is the platelet volume fraction. We
demonstrate that for large aspect ratio platelets the pair term ()
dominates suggesting large property enhancements for these materials. However a
small amount of face-to-face ordering of the platelets markedly degrades the
efficiency of platelet reinforcement.Comment: RevTeX, 5 pages, 4 figures, submitted to PR
- …