Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNoisy Random Boolean Formulae - a Statistical Physics Perspective
194
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Typical properties of computing circuits composed of noisy logical gates are studied using the statistical physics methodology. A growth model that gives rise to typical random Boolean functions is mapped onto a layered Ising spin system, which facilitates the study of their ability to represent arbitrary formulae with a given level of error, the tolerable level of gate-noise, and its dependence on the formulae depth and complexity, the gates used and properties of the function inputs. Bounds on their performance, derived in the information theory literature via specific gates, are straightforwardly retrieved, generalized and identified as the corresponding typical-case phase transitions. The framework is employed for deriving results on error-rates, function-depth and sensitivity, and their dependence on the gate-type and noise model used that are difficult to obtain via the traditional methods used in this field.
rate research
Read More
Complex macroscopic behaviour can arise in many-body systems with only very simple elements as a consequence of the combination of competition and inhomogeneity. This paper attempts to illustrate how statistical physics has driven this recognition, has contributed new insights and methodologies of wide application influencing many fields of science, and has been stimulated in return.
The cortex exhibits self-sustained highly-irregular activity even under resting conditions, whose origin and function need to be fully understood. It is believed that this can be described as an asynchronous state stemming from the balance between excitation and inhibition, with important consequences for information-processing, though a competing hypothesis claims it stems from critical dynamics. By analyzing a parsimonious neural-network model with excitatory and inhibitory interactions, we elucidate a noise-induced mechanism called Jensens force responsible for the emergence of a novel phase of arbitrarily-low but self-sustained activity, which reproduces all the experimental features of asynchronous states. The simplicity of our framework allows for a deep understanding of asynchronous states from a broad statistical-mechanics perspective and of the phase transitions to other standard phases it exhibits, opening the door to reconcile, asynchronous-state and critical-state hypotheses. We argue that Jensens forces are measurable experimentally and might be relevant in contexts beyond neuroscience.
In this work we study a simple compartmental model for drinking behavior evolution. The population is divided in 3 compartments regarding their alcohol consumption, namely Susceptible individuals $S$ (nonconsumers), Moderate drinkers $M$ and Risk drinkers $R$. The transitions among those states are ruled by probabilities. Despite the simplicity of the model, we observed the occurrence of two distinct nonequilibrium phase transitions to absorbing states. One of these states is composed only by Susceptible individuals $S$, with no drinkers ($M=R=0$). On the other hand, the other absorbing state is composed only by Risk drinkers $R$ ($S=M=0$). Between these two steady states, we have the coexistence of the three subpopulations $S$, $M$ and $R$. Comparison with abusive alcohol consumption data for Brazil shows a good agreement between the models results and the database.
Code Division Multiple Access (CDMA) in which the spreading code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particular attractive as it provides robustness and flexibility in utilising multi-access channels, whilst not making significant sacrifices in terms of transmission power. Random codes are generated from some ensemble, here we consider the possibility of combining two standard paradigms, sparsely and densely spread codes, in a single composite code ensemble. The composite code analysis includes a replica symmetric calculation of performance in the large system limit, and investigation of finite systems through a composite belief propagation algorithm. A variety of codes are examined with a focus on the high multi-access interference regime. In both the large size limit and finite systems we demonstrate scenarios in which the composite code has typical performance exceeding sparse and dense codes at equivalent signal to noise ratio.
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. The topologies of random Boolean networks with one input per node can be seen as graphs of random maps. We introduce an approach to investigating random maps and finding analytical results for attractors in random Boolean networks with the corresponding topology. Approximating some other non-chaotic networks to be of this class, we apply the analytic results to them. For this approximation, we observe a strikingly good agreement on the numbers of attractors of various lengths. We also investigate observables related to the average number of attractors in relation to the typical number of attractors. Here, we find strong differences that highlight the difficulties in making direct comparisons between random Boolean networks and real systems. Furthermore, we demonstrate the power of our approach by deriving some results for random maps. These results include the distribution of the number of components in random maps, along with asymptotic expansions for cumulants up to the 4th order.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
