The path-integral analysis of an associative memory model storing an infinite number of finite limit cycles

It is shown that an exact solution of the transient dynamics of an associative memory model storing an infinite number of limit cycles with l finite steps by means of the path-integral analysis. Assuming the Maxwell construction ansatz, we have succeeded in deriving the stationary state equations of the order parameters from the macroscopic recursive equations with respect to the finite-step sequence processing model which has retarded self-interactions. We have also derived the stationary state equations by means of the signal-to-noise analysis (SCSNA). The signal-to-noise analysis must assume that crosstalk noise of an input to spins obeys a Gaussian distribution. On the other hand, the path-integral method does not require such a Gaussian approximation of crosstalk noise. We have found that both the signal-to-noise analysis and the path-integral analysis give the completely same result with respect to the stationary state in the case where the dynamics is deterministic, when we assume the Maxwell construction ansatz. We have shown the dependence of storage capacity (alpha_c) on the number of patterns per one limit cycle (l). Storage capacity monotonously increases with the number of steps, and converges to alpha_c=0.269 at l ~= 10. The original properties of the finite-step sequence processing model appear as long as the number of steps of the limit cycle has order l=O(1).Comment: 24 pages, 3 figure

Generating functional analysis of CDMA detection dynamics

We investigate the detection dynamics of the parallel interference canceller (PIC) for code-division multiple-access (CDMA) multiuser detection, applied to a randomly spread, fully syncronous base-band uncoded CDMA channel model with additive white Gaussian noise (AWGN) under perfect power control in the large-system limit. It is known that the predictions of the density evolution (DE) can fairly explain the detection dynamics only in the case where the detection dynamics converge. At transients, though, the predictions of DE systematically deviate from computer simulation results. Furthermore, when the detection dynamics fail to convergence, the deviation of the predictions of DE from the results of numerical experiments becomes large. As an alternative, generating functional analysis (GFA) can take into account the effect of the Onsager reaction term exactly and does not need the Gaussian assumption of the local field. We present GFA to evaluate the detection dynamics of PIC for CDMA multiuser detection. The predictions of GFA exhibits good consistency with the computer simulation result for any condition, even if the dynamics fail to convergence.Comment: 14 pages, 3 figure

Modification of the Unitarity Relation for sin2beta-Vub in Supersymmetric Models

Recently, a more than 2sigma discrepancy has been observed between the well measured inclusive value of Vub and the predicted value of Vub from the unitarity triangle fit using the world average value of sin2beta. We attempt to resolve this tension in the context of grand unified SO(10) and SU(5) models where the neutrino mixing matrix is responsible for flavor changing neutral current at the weak scale and the models with non-proportional A-terms (can be realized simply in the context of intersecting D-brane models) and investigate the interplay between the constraints arising from B_{s,d}-\bar B_{s,d} mixings, epsilon_K, Br(tau -> mu gamma), Br(mu -> e gamma) and a fit of this new discrepancy. We also show that the ongoing measurement of the phase of Bs mixing will be able to identify the grand unified model. The measurement of Br(tau -> e gamma) will also be able to test these scenarios, especially the models with non-proportional A-terms.Comment: 20 pages, 4 figures. Minor corrections, references adde

Correlation between direct dark matter detection and Br(B_s -> mu mu) with a large phase of B_s - anti-B_s mixing

We combine the analyses for flavor changing neutral current processes and dark matter solutions in minimal-type supersymmetric grand unified theory (GUT) models, SO(10) and SU(5), with a large B_s - anti-B_s mixing phase and large tan beta. For large tan beta, the double penguin diagram dominates the SUSY contribution to the B_s - anti-B_s mixing amplitude. Also, the Br(B_s -> mu mu) constraint becomes important as it grows as tan^6 beta, although it can still be suppressed by large pseudoscalar Higgs mass m_A. We investigate the correlation between B_s -> mu mu and the dark matter direct detection cross-section through their dependence on m_A. In the minimal-type of SU(5) with type I seesaw, the large mixing in neutrino Dirac couplings results in large lepton flavor violating decay process tau to mu gamma, which in turn sets upper bound on m_A. In the SO(10) case, the large mixing can be chosen to be in the Majorana couplings instead, and the constraint from Br(tau -> mu gamma) can be avoided. The heavy Higgs funnel region turns out to be an interesting possibility in both cases and the direct dark matter detection should be possible in the near future in these scenarios.Comment: 19 pages, 8 figure

Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources

A lossy compression algorithm for binary redundant memoryless sources is presented. The proposed scheme is based on sparse graph codes. By introducing a nonlinear function, redundant memoryless sequences can be compressed. We propose a linear complexity compressor based on the extended belief propagation, into which an inertia term is heuristically introduced, and show that it has near-optimal performance for moderate block lengths.Comment: 4 pages, 1 figur

Statistical mechanics of lossy compression using multilayer perceptrons

Statistical mechanics is applied to lossy compression using multilayer perceptrons for unbiased Boolean messages. We utilize a tree-like committee machine (committee tree) and tree-like parity machine (parity tree) whose transfer functions are monotonic. For compression using committee tree, a lower bound of achievable distortion becomes small as the number of hidden units K increases. However, it cannot reach the Shannon bound even where K -> infty. For a compression using a parity tree with K >= 2 hidden units, the rate distortion function, which is known as the theoretical limit for compression, is derived where the code length becomes infinity.Comment: 12 pages, 5 figure

Synapse efficiency diverges due to synaptic pruning following over-growth

In the development of the brain, it is known that synapses are pruned following over-growth. This pruning following over-growth seems to be a universal phenomenon that occurs in almost all areas -- visual cortex, motor area, association area, and so on. It has been shown numerically that the synapse efficiency is increased by systematic deletion. We discuss the synapse efficiency to evaluate the effect of pruning following over-growth, and analytically show that the synapse efficiency diverges as O(log c) at the limit where connecting rate c is extremely small. Under a fixed synapse number criterion, the optimal connecting rate, which maximize memory performance, exists.Comment: 15 pages, 16 figure