The phase transition in random catalytic sets

The notion of (auto) catalytic networks has become a cornerstone in understanding the possibility of a sudden dramatic increase of diversity in biological evolution as well as in the evolution of social and economical systems. Here we study catalytic random networks with respect to the final outcome diversity of products. We show that an analytical treatment of this longstanding problem is possible by mapping the problem onto a set of non-linear recurrence equations. The solution of these equations show a crucial dependence of the final number of products on the initial number of products and the density of catalytic production rules. For a fixed density of rules we can demonstrate the existence of a phase transition from a practically unpopulated regime to a fully populated and diverse one. The order parameter is the number of final products. We are able to further understand the origin of this phase transition as a crossover from one set of solutions from a quadratic equation to the other.Comment: 7 pages, ugly eps files due to arxiv restriction

The Number of Different Binary Functions Generated by NK-Kauffman Networks and the Emergence of Genetic Robustness

We determine the average number $\vartheta (N, K)$, of \textit{NK}-Kauffman networks that give rise to the same binary function. We show that, for $N \gg 1$, there exists a connectivity critical value $K_c$ such that $\vartheta(N,K) \approx e^{\phi N}$ ($\phi > 0$) for $K < K_c$ and $\vartheta(N,K) \approx 1$ for $K > K_c$. We find that $K_c$ is not a constant, but scales very slowly with $N$, as $K_c \approx \log_2 \log_2 (2N / \ln 2)$. 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

Differential Cross Sections for Higgs Production

We review recent theoretical progress in evaluating higher order QCD corrections to Higgs boson differential distributions at hadron-hadron colliders

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

Observables in 3-dimensional quantum gravity and topological invariants

In this paper we report some results on the expectation values of a set of observables introduced for 3-dimensional Riemannian quantum gravity with positive cosmological constant, that is, observables in the Turaev-Viro model. Instead of giving a formal description of the observables, we just formulate the paper by examples. This means that we just show how an idea works with particular cases and give a way to compute 'expectation values' in general by a topological procedure.Comment: 24 pages, 47 figure

Darwinian Selection and Non-existence of Nash Equilibria

We study selection acting on phenotype in a collection of agents playing local games lacking Nash equilibria. After each cycle one of the agents losing most games is replaced by a new agent with new random strategy and game partner. The network generated can be considered critical in the sense that the lifetimes of the agents is power law distributed. The longest surviving agents are those with the lowest absolute score per time step. The emergent ecology is characterized by a broad range of behaviors. Nevertheless, the agents tend to be similar to their opponents in terms of performance.Comment: 4 pages, 5 figure

Adaptive walks on time-dependent fitness landscapes

The idea of adaptive walks on fitness landscapes as a means of studying evolutionary processes on large time scales is extended to fitness landscapes that are slowly changing over time. The influence of ruggedness and of the amount of static fitness contributions are investigated for model landscapes derived from Kauffman's $NK$ landscapes. Depending on the amount of static fitness contributions in the landscape, the evolutionary dynamics can be divided into a percolating and a non-percolating phase. In the percolating phase, the walker performs a random walk over the regions of the landscape with high fitness.Comment: 7 pages, 6 eps-figures, RevTeX, submitted to Phys. Rev.

Stiff knots

We report on the geometry and mechanics of knotted stiff strings. We discuss both closed and open knots. Our two main results are: (i) Their equilibrium energy as well as the equilibrium tension for open knots depend on the type of knot as the square of the bridge number; (ii) Braid localization is found to be a general feature of stiff strings entanglements, while angles and knot localization are forbidden. Moreover, we identify a family of knots for which the equilibrium shape is a circular braid. Two other equilibrium shapes are found from Monte Carlo simulations. These three shapes are confirmed by rudimentary experiments. Our approach is also extended to the problem of the minimization of the length of a knotted string with a maximum allowed curvature.Comment: Submitted to Phys. Rev.

Positivity of Spin Foam Amplitudes

The amplitude for a spin foam in the Barrett-Crane model of Riemannian quantum gravity is given as a product over its vertices, edges and faces, with one factor of the Riemannian 10j symbols appearing for each vertex, and simpler factors for the edges and faces. We prove that these amplitudes are always nonnegative for closed spin foams. As a corollary, all open spin foams going between a fixed pair of spin networks have real amplitudes of the same sign. This means one can use the Metropolis algorithm to compute expectation values of observables in the Riemannian Barrett-Crane model, as in statistical mechanics, even though this theory is based on a real-time (e^{iS}) rather than imaginary-time (e^{-S}) path integral. Our proof uses the fact that when the Riemannian 10j symbols are nonzero, their sign is positive or negative depending on whether the sum of the ten spins is an integer or half-integer. For the product of 10j symbols appearing in the amplitude for a closed spin foam, these signs cancel. We conclude with some numerical evidence suggesting that the Lorentzian 10j symbols are always nonnegative, which would imply similar results for the Lorentzian Barrett-Crane model.Comment: 15 pages LaTeX. v3: Final version, with updated conclusions and other minor changes. To appear in Classical and Quantum Gravity. v4: corrects # of samples in Lorentzian tabl

Competition in Social Networks: Emergence of a Scale-free Leadership Structure and Collective Efficiency

Using the minority game as a model for competition dynamics, we investigate the effects of inter-agent communications on the global evolution of the dynamics of a society characterized by competition for limited resources. The agents communicate across a social network with small-world character that forms the static substrate of a second network, the influence network, which is dynamically coupled to the evolution of the game. The influence network is a directed network, defined by the inter-agent communication links on the substrate along which communicated information is acted upon. We show that the influence network spontaneously develops hubs with a broad distribution of in-degrees, defining a robust leadership structure that is scale-free. Furthermore, in realistic parameter ranges, facilitated by information exchange on the network, agents can generate a high degree of cooperation making the collective almost maximally efficient.Comment: 4 pages, 2 postscript figures include