Threshold-induced phase transitions in perceptrons

Error rates of a Boolean perceptron with threshold and either spherical or Ising constraint on the weight vector are calculated for storing patterns from biased input and output distributions derived within a one-step replica symmetry breaking (RSB) treatment. For unbiased output distribution and non-zero stability of the patterns, we find a critical load, α p, above which two solutions to the saddlepoint equations appear; one with higher free energy and zero threshold and a dominant solution with non-zero threshold. We examine this second-order phase transition and the dependence of α p on the required pattern stability, κ, for both one-step RSB and replica symmetry (RS) in the spherical case and for one-step RSB in the Ising case.

Phase transitions and memory effects in the dynamics of Boolean networks

The generating functional method is employed to investigate the synchronous dynamics of Boolean networks, providing an exact result for the system dynamics via a set of macroscopic order parameters. The topology of the networks studied and its constituent Boolean functions represent the system's quenched disorder and are sampled from a given distribution. The framework accommodates a variety of topologies and Boolean function distributions and can be used to study both the noisy and noiseless regimes; it enables one to calculate correlation functions at different times that are inaccessible via commonly used approximations. It is also used to determine conditions for the annealed approximation to be valid, explore phases of the system under different levels of noise and obtain results for models with strong memory effects, where existing approximations break down. Links between Boolean networks and general Boolean formulas are identified and results common to both system types are highlighted. © 2012 Copyright Taylor and Francis Group, LLC.

Computing with noise: phase transitions in Boolean formulas

Computing circuits composed of noisy logical gates and their ability to represent arbitrary Boolean functions with a given level of error are investigated within a statistical mechanics setting. Existing bounds on their performance are straightforwardly retrieved, generalized, and identified as the corresponding typical-case phase transitions. Results on error rates, function depth, and sensitivity, and their dependence on the gate-type and noise model used are also obtained.

Phase transitions in wave turbulence

We consider turbulence within the Gross-Pitaevsky model and look into the creation of a coherent condensate via an inverse cascade originating at small scales. The growth of the condensate leads to a spontaneous breakdown of statistical symmetries of overcondensate fluctuations: First, isotropy is broken, then a series of phase transitions marks the changing symmetry from twofold to threefold to fourfold. We describe respective anisotropic flux flows in the k space. At the highest level reached, we observe a short-range positional and long-range orientational order (as in a hexatic phase). In other words, the more one pumps the system, the more ordered the system becomes. The phase transitions happen when the system is pumped by an instability term and does not occur when pumped by a random force. We thus demonstrate nonuniversality of an inverse-cascade turbulence with respect to the nature of small-scale forcing.

A hierarchy of phase transitions in optimal neuronal coding:from binary to M-ary discrete optimal codes

We have investigated how optimal coding for neural systems changes with the time available for decoding. Optimization was in terms of maximizing information transmission. We have estimated the parameters for Poisson neurons that optimize Shannon transinformation with the assumption of rate coding. We observed a hierarchy of phase transitions from binary coding, for small decoding times, toward discrete (M-ary) coding with two, three and more quantization levels for larger decoding times. We postulate that the presence of subpopulations with specific neural characteristics could be a signiture of an optimal population coding scheme and we use the mammalian auditory system as an example.

Noisy random Boolean formulae:a statistical physics perspective

Properties of computing Boolean circuits composed of noisy logical gates are studied using the statistical physics methodology. A formula-growth model that gives rise to random Boolean functions is mapped onto a spin system, which facilitates the study of their typical behavior in the presence of noise. Bounds on their performance, derived in the information theory literature for specific gates, are straightforwardly retrieved, generalized and identified as the corresponding macroscopic phase transitions. The framework is employed for deriving results on error-rates at various function-depths and function sensitivity, and their dependence on the gate-type and noise model used. These are difficult to obtain via the traditional methods used in this field.

On the robustness of random Boolean formulae

Random Boolean formulae, generated by a growth process of noisy logical gates are analyzed using the generating functional methodology of statistical physics. We study the type of functions generated for different input distributions, their robustness for a given level of gate error and its dependence on the formulae depth and complexity and the gates used. Bounds on their performance, derived in the information theory literature for specific gates, are straightforwardly retrieved, generalized and identified as the corresponding typical-case phase transitions. Results for error-rates, function-depth and sensitivity of the generated functions are obtained for various gate-type and noise models. © 2010 IOP Publishing Ltd.

Neural population coding is optimized by discrete tuning curves

The sigmoidal tuning curve that maximizes the mutual information for a Poisson neuron, or population of Poisson neurons, is obtained. The optimal tuning curve is found to have a discrete structure that results in a quantization of the input signal. The number of quantization levels undergoes a hierarchy of phase transitions as the length of the coding window is varied. We postulate, using the mammalian auditory system as an example, that the presence of a subpopulation structure within a neural population is consistent with an optimal neural code.

Dielectric and electro-optical properties of some cyanobiphenyl liquid-crystals

A variety of methods have been reviewed for obtaining parallel or perpendicular alignment in liquid-crystal cells. Some of these methods have been selected and developed and were used in polarised spectroscopy, dielectric and electro-optic studies. Also, novel dielectric and electro-optic cells were constructed for use over a range of temperature. Dielectric response of thin layers of E7 and E8 (eutectic mixture liquid-crystals) have been measured in the frequency range (12 Hz-100 kHz) and over a range of temperature (183-337K). Dielectric spectra were also obtained for supercooled E7 and E8 in the Hz and kHz range. When the measuring electric field was parallel to the nematic director, one loss peak (low-frequency relaxation process) was observed for E7 and for E8, that exhibits a Debye-type behaviour in the supercooled systems. When the measuring electric field was perpendicular to the nematic director, two resolved dielectric processes have been observed. The phase transitions, effective molecular polarisabilities, anisotropy of polarisabilities and order parameters of three liquid crystal homologs (5CB, 6CB, and 7CB), 60CB and three eutectic nematic mixtures E7, E8, and E607 were calculated using optical and density data measured at several temperatures. The order parameters calculated using the different methods of Vuks, Neugebauer, Saupe-Maier, and Palffy-Muhoray are nearly the same for the liquid crystals considered in the present study. Also, the interrelationship between density and refractive index and the molecular structure of these liquid crystals were established. Accurate dielectric and dipole results of a range of liquid-crystal forming molecules at several temperatures have reported. The role of the cyano-end group, biphenyl core, and flexible tail in molecular association, were investigated using the dielectric method for some molecules which have a structural relationship to the nematogens. Analysis of the dielectric data for solution of the liquid-crystals indicated a high molecular association, comparable to that observed in the nematic or isotropic phases. Electro-optic Kerr effect were investigated for some alkyl cyanobiphenyls, their nematic mixtures and the eutectic mixture liquid-crystals E7 and E8 in the isotropic phase and solution. The Kerr constant of these liquid crystals found to be very high at the nematic-isotropic transition temperatures as the molecules are expected to be highly ordered close to phase transition temperatures. Dynamic Kerr effect behaviour and transient molecular reorientation were also observed in thin layers of some alkyl cyanobiphenyls. Dichroic ratio R and order parameters of solutions containing some azo and anthraquinone dyes in the nematic solvent (E7 and E8), were investigated by the measurement of the intensity of the absorption bands in the visible region of parallel aligned samples. The effective factors on the dichroic ratio of the dyes dissolved in the nematic solvents were determined and discussed.

Statistical physics of error-correcting codes

In this thesis we use statistical physics techniques to study the typical performance of four families of error-correcting codes based on very sparse linear transformations: Sourlas codes, Gallager codes, MacKay-Neal codes and Kanter-Saad codes. We map the decoding problem onto an Ising spin system with many-spins interactions. We then employ the replica method to calculate averages over the quenched disorder represented by the code constructions, the arbitrary messages and the random noise vectors. We find, as the noise level increases, a phase transition between successful decoding and failure phases. This phase transition coincides with upper bounds derived in the information theory literature in most of the cases. We connect the practical decoding algorithm known as probability propagation with the task of finding local minima of the related Bethe free-energy. We show that the practical decoding thresholds correspond to noise levels where suboptimal minima of the free-energy emerge. Simulations of practical decoding scenarios using probability propagation agree with theoretical predictions of the replica symmetric theory. The typical performance predicted by the thermodynamic phase transitions is shown to be attainable in computation times that grow exponentially with the system size. We use the insights obtained to design a method to calculate the performance and optimise parameters of the high performance codes proposed by Kanter and Saad.

From the physics of interacting polymers to optimizing routes on the London Underground

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii ) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise.