3,160 research outputs found
The Number of Different Binary Functions Generated by NK-Kauffman Networks and the Emergence of Genetic Robustness
We determine the average number , of \textit{NK}-Kauffman
networks that give rise to the same binary function. We show that, for , there exists a connectivity critical value such that () for and
for . We find that is not a
constant, but scales very slowly with , as . The problem of genetic robustness emerges as a statistical property
of the ensemble of \textit{NK}-Kauffman networks and impose tight constraints
in the average number of epistatic interactions that the genotype-phenotype map
can have.Comment: 4 figures 18 page
The computational complexity of Kauffman nets and the P versus NP problem
Complexity theory as practiced by physicists and computational complexity
theory as practiced by computer scientists both characterize how difficult it
is to solve complex problems. Here it is shown that the parameters of a
specific model can be adjusted so that the problem of finding its global energy
minimum is extremely sensitive to small changes in the problem statement. This
result has implications not only for studies of the physics of random systems
but may also lead to new strategies for resolving the well-known P versus NP
question in computational complexity theory.Comment: 4 pages, no figure
The Omega Dependence of the Evolution of xi(r)
The evolution of the two-point correlation function, xi(r,z), and the
pairwise velocity dispersion, sigma(r,z), for both the matter and halo
population, in three different cosmological models:
(Omega_M,Omega_Lambda)=(1,0), (0.2,0) and (0.2,0.8) are described. If the
evolution of xi is parameterized by xi(r,z)=(1+z)^{-(3+eps)}xi(r,0), where
xi(r,0)=(r/r_0)^{-gamma}, then eps(mass) ranges from 1.04 +/- 0.09 for (1,0) to
0.18 +/- 0.12 for (0.2,0), as measured by the evolution of at 1 Mpc (from z ~ 5
to the present epoch). For halos, eps depends on their mean overdensity. Halos
with a mean overdensity of about 2000 were used to compute the halo two-point
correlation function tested with two different group finding algorithms: the
friends of friends and the spherical overdensity algorithm. It is certainly
believed that the rate of growth of this xihh will give a good estimate of the
evolution of the galaxy two-point correlation function, at least from z ~ 1 to
the present epoch. The values we get for eps(halos) range from 1.54 for (1,0)
to -0.36 for (0.2,0), as measured by the evolution of xi(halos) from z ~ 1.0 to
the present epoch. These values could be used to constrain the cosmological
scenario. The evolution of the pairwise velocity dispersion for the mass and
halo distribution is measured and compared with the evolution predicted by the
Cosmic Virial Theorem (CVT). According to the CVT, sigma(r,z)^2 ~ G Q rho(z)
r^2 xi(r,z) or sigma proportional to (1+z)^{-eps/2}. The values of eps measured
from our simulated velocities differ from those given by the evolution of xi
and the CVT, keeping gamma and Q constant: eps(CVT) = 1.78 +/- 0.13 for (1,0)
or 1.40 +/- 0.28 for (0.2,0).Comment: Accepted for publication in the ApJ. Also available at
http://manaslu.astro.utoronto.ca/~carlberg/cnoc/xiev/xi_evo.ps.g
Attractors in fully asymmetric neural networks
The statistical properties of the length of the cycles and of the weights of
the attraction basins in fully asymmetric neural networks (i.e. with completely
uncorrelated synapses) are computed in the framework of the annealed
approximation which we previously introduced for the study of Kauffman
networks. Our results show that this model behaves essentially as a Random Map
possessing a reversal symmetry. Comparison with numerical results suggests that
the approximation could become exact in the infinite size limit.Comment: 23 pages, 6 figures, Latex, to appear on J. Phys.
On the Robustness of NK-Kauffman Networks Against Changes in their Connections and Boolean Functions
NK-Kauffman networks {\cal L}^N_K are a subset of the Boolean functions on N
Boolean variables to themselves, \Lambda_N = {\xi: \IZ_2^N \to \IZ_2^N}. To
each NK-Kauffman network it is possible to assign a unique Boolean function on
N variables through the function \Psi: {\cal L}^N_K \to \Lambda_N. The
probability {\cal P}_K that \Psi (f) = \Psi (f'), when f' is obtained through f
by a change of one of its K-Boolean functions (b_K: \IZ_2^K \to \IZ_2), and/or
connections; is calculated. The leading term of the asymptotic expansion of
{\cal P}_K, for N \gg 1, turns out to depend on: the probability to extract the
tautology and contradiction Boolean functions, and in the average value of the
distribution of probability of the Boolean functions; the other terms decay as
{\cal O} (1 / N). In order to accomplish this, a classification of the Boolean
functions in terms of what I have called their irreducible degree of
connectivity is established. The mathematical findings are discussed in the
biological context where, \Psi is used to model the genotype-phenotype map.Comment: 17 pages, 1 figure, Accepted in Journal of Mathematical Physic
Teleportation, Braid Group and Temperley--Lieb Algebra
We explore algebraic and topological structures underlying the quantum
teleportation phenomena by applying the braid group and Temperley--Lieb
algebra. We realize the braid teleportation configuration, teleportation
swapping and virtual braid representation in the standard description of the
teleportation. We devise diagrammatic rules for quantum circuits involving
maximally entangled states and apply them to three sorts of descriptions of the
teleportation: the transfer operator, quantum measurements and characteristic
equations, and further propose the Temperley--Lieb algebra under local unitary
transformations to be a mathematical structure underlying the teleportation. We
compare our diagrammatical approach with two known recipes to the quantum
information flow: the teleportation topology and strongly compact closed
category, in order to explain our diagrammatic rules to be a natural
diagrammatic language for the teleportation.Comment: 33 pages, 19 figures, latex. The present article is a short version
of the preprint, quant-ph/0601050, which includes details of calculation,
more topics such as topological diagrammatical operations and entanglement
swapping, and calls the Temperley--Lieb category for the collection of all
the Temperley--Lieb algebra with physical operations like local unitary
transformation
Entwined Paths, Difference Equations and the Dirac Equation
Entwined space-time paths are bound pairs of trajectories which are traversed
in opposite directions with respect to macroscopic time. In this paper we show
that ensembles of entwined paths on a discrete space-time lattice are simply
described by coupled difference equations which are discrete versions of the
Dirac equation. There is no analytic continuation, explicit or forced, involved
in this description. The entwined paths are `self-quantizing'. We also show
that simple classical stochastic processes that generate the difference
equations as ensemble averages are stable numerically and converge at a rate
governed by the details of the stochastic process. This result establishes the
Dirac equation in one dimension as a phenomenological equation describing an
underlying classical stochastic process in the same sense that the Diffusion
and Telegraph equations are phenomenological descriptions of stochastic
processes.Comment: 15 pages, 5 figures Replacement 11/02 contains minor editorial
change
Distinguishing scalar from pseudoscalar Higgs production at the LHC
In this letter we examine the production channels for the scalar or
pseudoscalar Higgs plus two jets at the CERN Large Hadron Collider (LHC). We
identify possible signals for distinguishing between a scalar and a
pseudoscalar Higgs boson.Comment: 7 pages, REVTeX4, 4 eps figures. Figure 1 and 4 replaced. Typos
corrected, additional reference adde
The Asymptotic Number of Attractors in the Random Map Model
The random map model is a deterministic dynamical system in a finite phase
space with n points. The map that establishes the dynamics of the system is
constructed by randomly choosing, for every point, another one as being its
image. We derive here explicit formulas for the statistical distribution of the
number of attractors in the system. As in related results, the number of
operations involved by our formulas increases exponentially with n; therefore,
they are not directly applicable to study the behavior of systems where n is
large. However, our formulas lend themselves to derive useful asymptotic
expressions, as we show.Comment: 16 pages, 1 figure. Minor changes. To be published in Journal of
Physics A: Mathematical and Genera
Relaxation, closing probabilities and transition from oscillatory to chaotic attractors in asymmetric neural networks
Attractors in asymmetric neural networks with deterministic parallel dynamics
were shown to present a "chaotic" regime at symmetry eta < 0.5, where the
average length of the cycles increases exponentially with system size, and an
oscillatory regime at high symmetry, where the typical length of the cycles is
2. We show, both with analytic arguments and numerically, that there is a sharp
transition, at a critical symmetry \e_c=0.33, between a phase where the
typical cycles have length 2 and basins of attraction of vanishing weight and a
phase where the typical cycles are exponentially long with system size, and the
weights of their attraction basins are distributed as in a Random Map with
reversal symmetry. The time-scale after which cycles are reached grows
exponentially with system size , and the exponent vanishes in the symmetric
limit, where . The transition can be related to the dynamics
of the infinite system (where cycles are never reached), using the closing
probabilities as a tool.
We also study the relaxation of the function ,
where is the local field experienced by the neuron . In the symmetric
system, it plays the role of a Ljapunov function which drives the system
towards its minima through steepest descent. This interpretation survives, even
if only on the average, also for small asymmetry. This acts like an effective
temperature: the larger is the asymmetry, the faster is the relaxation of ,
and the higher is the asymptotic value reached. reachs very deep minima in
the fixed points of the dynamics, which are reached with vanishing probability,
and attains a larger value on the typical attractors, which are cycles of
length 2.Comment: 24 pages, 9 figures, accepted on Journal of Physics A: Math. Ge
- …