Exact dynamics of the critical Kauffman model with connectivity one

The critical Kauffman model with connectivity one is the simplest class of critical Boolean networks. Nevertheless, it exhibits intricate behavior at the boundary of order and chaos. We introduce a formalism for expressing the dynamics of multiple loops as a product of the dynamics of individual loops. Using it, we prove that the number of attractors scales as $2^m$, where $m$ is the number of nodes in loops - as fast as possible, and much faster than previously believed

Properties of the recursive divisor function and the number of ordered factorizations

We recently introduced the recursive divisor function $\kappa_x(n)$, a recursive analogue of the usual divisor function. Here we calculate its Dirichlet series, which is ${\zeta(s-x)}/(2 - \zeta(s))$. We show that $\kappa_x(n)$ is related to the ordinary divisor function by $\kappa_x * \sigma_y = \kappa_y * \sigma_x$, where * denotes the Dirichlet convolution. Using this, we derive several identities relating $\kappa_x$ and some standard arithmetic functions. We also clarify the relation between $\kappa_0$ and the much-studied number of ordered factorizations $K(n)$, namely, $\kappa_0 = {\bf 1} * K$

On arithmetic and asymptotic properties of up-down numbers

Let $\sigma=(\sigma_1,..., \sigma_N)$, where $\sigma_i =\pm 1$, and let $C(\sigma)$ denote the number of permutations $\pi$ of $1,2,..., N+1,$ whose up-down signature $\mathrm{sign}(\pi(i+1)-\pi(i))=\sigma_i$, for $i=1,...,N$. We prove that the set of all up-down numbers $C(\sigma)$ can be expressed by a single universal polynomial $\Phi$, whose coefficients are products of numbers from the Taylor series of the hyperbolic tangent function. We prove that $\Phi$ is a modified exponential, and deduce some remarkable congruence properties for the set of all numbers $C(\sigma)$, for fixed $N$. We prove a concise upper-bound for $C(\sigma)$, which describes the asymptotic behaviour of the up-down function $C(\sigma)$ in the limit $C(\sigma) \ll (N+1)!$.Comment: Recommended for publication in Discrete Mathematics subject to revision

Change of quasiparticle dispersion in crossing T_c in the underdoped cuprates

One of the most remarkable properties of the high-temperature superconductors is a pseudogap regime appearing in the underdoped cuprates above the superconducting transition temperature T_c. The pseudogap continously develops out of the superconducting gap. In this paper, we demonstrate by means of a detailed comparison between theory and experiment that the characteristic change of quasiparticle dispersion in crossing T_c in the underdoped cuprates can be understood as being due to phase fluctuations of the superconducting order parameter. In particular, we show that within a phase fluctuation model the characteristic back-turning BCS bands disappear above T_c whereas the gap remains open. Furthermore, the pseudogap rather has a U-shape instead of the characteristic V-shape of a d_{x^2-y^2}-wave pairing symmetry and starts closing from the nodal k=(pi/2,pi/2) directions, whereas it rather fills in at the anti-nodal k=(pi,0) regions, yielding further support to the phase fluctuation scenario.Comment: 6 pages, 4 eps-figure

Applying weighted network measures to microarray distance matrices

In recent work we presented a new approach to the analysis of weighted networks, by providing a straightforward generalization of any network measure defined on unweighted networks. This approach is based on the translation of a weighted network into an ensemble of edges, and is particularly suited to the analysis of fully connected weighted networks. Here we apply our method to several such networks including distance matrices, and show that the clustering coefficient, constructed by using the ensemble approach, provides meaningful insights into the systems studied. In the particular case of two data sets from microarray experiments the clustering coefficient identifies a number of biologically significant genes, outperforming existing identification approaches.Comment: Accepted for publication in J. Phys.

An ensemble approach to the analysis of weighted networks

We present a new approach to the calculation of measures in weighted networks, based on the translation of a weighted network into an ensemble of edges. This leads to a straightforward generalization of any measure defined on unweighted networks, such as the average degree of the nearest neighbours, the clustering coefficient, the `betweenness', the distance between two nodes and the diameter of a network. All these measures are well established for unweighted networks but have hitherto proven difficult to define for weighted networks. Further to introducing this approach we demonstrate its advantages by applying the clustering coefficient constructed in this way to two real-world weighted networks.Comment: 4 pages 3 figure

A simple solution of the critical Kauffman model with connectivity one

The Kauffman model is a model of genetic computation that highlights the importance of criticality at the border of order and chaos. But our understanding of its behavior is incomplete, and much of what we do know relies on intricate arguments. We give a simple proof that the number of attractors for the critical Kauffman model with connectivity one grows faster than previously believed. Our approach relies on a link between the critical dynamics and number theory.Comment: 2 page

MAGIC sensitivity to millisecond-duration optical pulses

The MAGIC telescopes are a system of two Imaging Atmospheric Cherenkov Telescopes (IACTs) designed to observe very high energy (VHE) gamma rays above ~50 GeV. However, as IACTs are sensitive to Cherenkov light in the UV/blue and use photo-detectors with a time response well below the ms scale, MAGIC is also able to perform simultaneous optical observations. Through an alternative system installed in the central PMT of MAGIC II camera, the so-called central pixel, MAGIC is sensitive to short (1ms - 1s) optical pulses. Periodic signals from the Crab pulsar are regularly monitored. Here we report for the first time the experimental determination of the sensitivity of the central pixel to isolated 1-10 ms long optical pulses. The result of this study is relevant for searches of fast transients such as Fast Radio Bursts (FRBs).Comment: Proceedings of the 35th International Cosmic Ray Conference (ICRC 2017), Bexco, Busan, Korea (arXiv:1708.05153