Searcharxiv⌕ Search

arXiv subjects

Roberto C. Alamino

Publications and source records attributed to Roberto C. Alamino.

15 recordsLinked to original sources

Explaining the Machine Learning Solution of the Ising Model

As powerful as machine learning (ML) techniques are in solving problems involving data with large dimensionality, explaining the results from the fitted parameters remains a challenging task of utmost importance, especially in physics applications. This work shows how this can be accomplished for the ferromagnetic Ising model, the main target of several ML studies in statistical physics. Here it is demonstrated that the successful unsupervised identification of the phases and order parameter by principal component analysis, a common method in those studies, detects that the magnetization per spin has its greatest variation with the temperature, the actual control parameter of the phase transition. Then, by using a neural network (NN) without hidden layers (the simplest possible) and informed by the symmetry of the Hamiltonian, an explanation is provided for the strategy used in finding the supervised learning solution for the critical temperature of the model's continuous phase transition. This allows the prediction of the minimal extension of the NN to solve the problem when the symmetry is not known, which becomes also explainable. These results pave the way to a physics-informed explainable generalized framework, enabling the extraction of physical laws and principles from the parameters of the models.

cond-mat.dis-nn↗

Unveiling the Link between Complexity and Symmetry: Statistical Asymmetry

The concept of complexity appears in virtually all areas of knowledge. Its intuitive meaning shares similarities across fields, but disagreements between its details hinders a general definition, leading to a plethora of proposed measurements. While each might be appropriated to the problems it addresses, the lack of an underlying fundamental principle prevents the development of a unified theory. Here it is shown that the statistics of the amount of symmetry broken by systems can be used as such unifying principle. A general methodology is outlined and explicit expressions are given for cases in which it can capture the behavior of the two main groups of complexities currently in use. The presented results demonstrate that statistical asymmetry is an appropriate foundation for characterizing the general concept of complexity.

cond-mat.stat-mech↗

Falsifiability of Isolated Spacetime Regions

In this work it is pointed out that some physical theories, even being themselves falsifiable, predict the existence of regions of spacetime which are not falsifiable with relation to each other due to their impossibility of mutually exchanging information as, for instance, before and after the event horizon of black holes. If we require scientific theories to be falsifiable, an isolated region should be discarded from scientific models developed by observers in other regions. Here it is proposed that their existence can satisfy a weaker falsifiability condition, here called conditional asymptotic provability, which extend scientific reasoning through Bayesian inference. Limitations and some epistemic consequences of this proposal are discussed.

physics.hist-ph↗

A Model for Emergence of Multiple Anti-Microbial Resistance in a Petri Torus

This work introduces a new statistical physics lattice model of bacteria interacting with anti-microbial drugs that can reproduce qualitative features of resistance emergence and whose model parameters and outputs can be measured with controlled \textit{in vitro} experiments. The lattice is inhabited by agents modeled by Ising perceptrons. The results show the advantage of mixing drugs among the population compared to other treatment protocols.

q-bio.PE↗

Non-Thermal Transitions in n-th Order Moral Decisions

This work introduces a model in which agents of a network act upon one another according to three different kinds of moral decisions. These decisions are based on an increasing level of sophistication in the empathy capacity of the agent, a hierarchy which we name Piaget's Ladder. The decision strategy of the agents is non-rational, in the sense that it does not minimize model's Hamiltonian, and the model presents quenched disorder given by the distribution of its defining parameters. We obtain an analytical solution for this model in the thermodynamic limit and also a leading order correction for finite sized systems. Using these results, we show that typical realizations develop a rich phase structure with discontinuous non-thermal transitions.

physics.soc-ph↗

Measuring Complexity through Average Symmetry

This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different) complexity to either deterministic or random homogeneous densities and higher complexity to the intermediate cases. This new measure is easily computable, breaks the coarse graining paradigm and can be straightforwardly generalised, including to continuous cases and general networks. By applying this measure to a series of objects, it is shown that it can be consistently used for both small scale structures with exact symmetry breaking and large scale patterns, for which, differently from similar measures, it consistently discriminates between repetitive patterns, random configurations and self-similar structures.

cond-mat.stat-mech↗

Replication-based Inference Algorithms for Hard Computational Problems

Inference algorithms based on evolving interactions between replicated solutions are introduced and analyzed on a prototypical NP-hard problem - the capacity of the binary Ising perceptron. The efficiency of the algorithm is examined numerically against that of the parallel tempering algorithm, showing improved performance in terms of the results obtained, computing requirements and simplicity of implementation.

cond-mat.dis-nn↗

Physical Theories with Average Symmetry

This Letter probes the existence of physical laws invariant only in average when subjected to some transformation. The concept of a symmetry transformation is broadened to include corruption by random noise and average symmetry is introduced by considering functions which are invariant only in average under these transformations. It is then shown that actions with average symmetry obey a modified version of Noether's Theorem with dissipative currents. The relation of this with possible violations of physical symmetries, as for instance Lorentz invariance in some quantum gravity theories, is briefly commented.

hep-th↗

Interacting Non-equilibrium Systems with Two Temperatures

We investigate a simplified model of two fully connected magnetic systems maintained at different temperatures by virtue of being connected to two independent thermal baths while simultaneously being inter-connected with each other. Using generating functional analysis, commonly used in statistical mechanics, we find exactly soluble expressions for their individual magnetisations that define a two-dimensional non-linear map, the equations of which have the same form as those obtained for densely connected equilibrium systems. Steady states correspond to the fixed points of this map, separating the parameter space into a rich set of non-equilibrium phases that we analyse in asymptotically high and low (non-equilibrium) temperature limits. The theoretical formalism is shown to subvert to the classical non-equilibrium steady state problem for two interacting systems with a non-zero heat transfer between them that catalyses a phase transition between ambient non-equilibrium states.

cond-mat.stat-mech↗

A Bayesian Foundation for Physical Theories

Bayesian probability theory is used as a framework to develop a formalism for the scientific method based on principles of inductive reasoning. The formalism allows for precise definitions of the key concepts in theories of physics and also leads to a well-defined procedure to select one or more theories among a family of (well-defined) candidates by ranking them according to their posterior probability distributions, which result from Bayes's theorem by incorporating to an initial prior the information extracted from a dataset, ultimately defined by experimental evidence. Examples with different levels of complexity are given and three main applications to basic cosmological questions are analysed: (i) typicality of human observers, (ii) the multiverse hypothesis and, extremely briefly, some few observations about (iii) the anthropic principle. Finally, it is demonstrated that this formulation can address problems that were out of the scope of scientific research until now by presenting the isolated worlds problem and its resolution via the presented framework.

physics.data-an↗

Typical kernel size and number of sparse random matrices over GF(q) - a statistical physics approach

Using methods of statistical physics, we study the average number and kernel size of general sparse random matrices over GF(q), with a given connectivity profile, in the thermodynamical limit of large matrices. We introduce a mapping of $GF(q)$ matrices onto spin systems using the representation of the cyclic group of order q as the q-th complex roots of unity. This representation facilitates the derivation of the average kernel size of random matrices using the replica approach, under the replica symmetric ansatz, resulting in saddle point equations for general connectivity distributions. Numerical solutions are then obtained for particular cases by population dynamics. Similar techniques also allow us to obtain an expression for the exact and average number of random matrices for any general connectivity profile. We present numerical results for particular distributions.

cond-mat.other↗

Online Learning in Discrete Hidden Markov Models

We present and analyse three online algorithms for learning in discrete Hidden Markov Models (HMMs) and compare them with the Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalisation error we draw learning curves in simplified situations. The performance for learning drifting concepts of one of the presented algorithms is analysed and compared with the Baldi-Chauvin algorithm in the same situations. A brief discussion about learning and symmetry breaking based on our results is also presented.

stat.ML↗

The typical behaviour of relays

The typical behaviour of the relay-without-delay channel and its many-units generalisation, termed the relay array, under LDPC coding, is studied using methods of statistical mechanics. A demodulate-and-forward strategy is analytically solved using the replica symmetric ansatz which is exact in the studied system at the Nishimori's temperature. In particular, the typical level of improvement in communication performance by relaying messages is shown in the case of small and large number of relay units.

cond-mat.stat-mech↗

Statistical Mechanics Analysis of LDPC Coding in MIMO Gaussian Channels

Using analytical methods of statistical mechanics, we analyse the typical behaviour of a multiple-input multiple-output (MIMO) Gaussian channel with binary inputs under LDPC network coding and joint decoding. The saddle point equations for the replica symmetric solution are found in particular realizations of this channel, including a small and large number of transmitters and receivers. In particular, we examine the cases of a single transmitter, a single receiver and the symmetric and asymmetric interference channels. Both dynamical and thermodynamical transitions from the ferromagnetic solution of perfect decoding to a non-ferromagnetic solution are identified for the cases considered, marking the practical and theoretical limits of the system under the current coding scheme. Numerical results are provided, showing the typical level of improvement/deterioration achieved with respect to the single transmitter/receiver result, for the various cases.

cond-mat.stat-mech↗

Some Considerations about the Bouchaud-Cates-Ravi-Edwards model for granular flow

In this paper we discuss some features of the BCRE model. We show that this model can be understood as a mapping from a two-dimensional to a one-dimensional problem, if some conditions are satisfied. We propose some modifications that (a) guarantee mass conservation in the model (what is not assured in its original form) and (b) correct undesired behaviors that appear when there are irregularities in the surface of the static phase. We also show that a similar model can be deduced both from the principle of mass conservation (first equation) and a simple thermodynamic model (from which the exchange equation can be obtained). Finally, we solve the model numerically, using different velocity profiles and studying the influence of the different parameters present in this model.

cond-mat.stat-mech↗