15,272 research outputs found
Gibbs and Quantum Discrete Spaces
Gibbs measure is one of the central objects of the modern probability,
mathematical statistical physics and euclidean quantum field theory. Here we
define and study its natural generalization for the case when the space, where
the random field is defined is itself random. Moreover, this randomness is not
given apriori and independently of the configuration, but rather they depend on
each other, and both are given by Gibbs procedure; We call the resulting object
a Gibbs family because it parametrizes Gibbs fields on different graphs in the
support of the distribution. We study also quantum (KMS) analog of Gibbs
families. Various applications to discrete quantum gravity are given.Comment: 37 pages, 2 figure
Exchangeable Random Networks
We introduce and study a class of exchangeable random graph ensembles. They
can be used as statistical null models for empirical networks, and as a tool
for theoretical investigations. We provide general theorems that carachterize
the degree distribution of the ensemble graphs, together with some features
that are important for applications, such as subgraph distributions and kernel
of the adjacency matrix. These results are used to compare to other models of
simple and complex networks. A particular case of directed networks with
power-law out--degree is studied in more detail, as an example of the
flexibility of the model in applications.Comment: to appear on "Internet Mathematics
Identifying Security-Critical Cyber-Physical Components in Industrial Control Systems
In recent years, Industrial Control Systems (ICS) have become an appealing
target for cyber attacks, having massive destructive consequences. Security
metrics are therefore essential to assess their security posture. In this
paper, we present a novel ICS security metric based on AND/OR graphs that
represent cyber-physical dependencies among network components. Our metric is
able to efficiently identify sets of critical cyber-physical components, with
minimal cost for an attacker, such that if compromised, the system would enter
into a non-operational state. We address this problem by efficiently
transforming the input AND/OR graph-based model into a weighted logical formula
that is then used to build and solve a Weighted Partial MAX-SAT problem. Our
tool, META4ICS, leverages state-of-the-art techniques from the field of logical
satisfiability optimisation in order to achieve efficient computation times.
Our experimental results indicate that the proposed security metric can
efficiently scale to networks with thousands of nodes and be computed in
seconds. In addition, we present a case study where we have used our system to
analyse the security posture of a realistic water transport network. We discuss
our findings on the plant as well as further security applications of our
metric.Comment: Keywords: Security metrics, industrial control systems,
cyber-physical systems, AND-OR graphs, MAX-SAT resolutio
A walk in the statistical mechanical formulation of neural networks
Neural networks are nowadays both powerful operational tools (e.g., for
pattern recognition, data mining, error correction codes) and complex
theoretical models on the focus of scientific investigation. As for the
research branch, neural networks are handled and studied by psychologists,
neurobiologists, engineers, mathematicians and theoretical physicists. In
particular, in theoretical physics, the key instrument for the quantitative
analysis of neural networks is statistical mechanics. From this perspective,
here, we first review attractor networks: starting from ferromagnets and
spin-glass models, we discuss the underlying philosophy and we recover the
strand paved by Hopfield, Amit-Gutfreund-Sompolinky. One step forward, we
highlight the structural equivalence between Hopfield networks (modeling
retrieval) and Boltzmann machines (modeling learning), hence realizing a deep
bridge linking two inseparable aspects of biological and robotic spontaneous
cognition. As a sideline, in this walk we derive two alternative (with respect
to the original Hebb proposal) ways to recover the Hebbian paradigm, stemming
from ferromagnets and from spin-glasses, respectively. Further, as these notes
are thought of for an Engineering audience, we highlight also the mappings
between ferromagnets and operational amplifiers and between antiferromagnets
and flip-flops (as neural networks -built by op-amp and flip-flops- are
particular spin-glasses and the latter are indeed combinations of ferromagnets
and antiferromagnets), hoping that such a bridge plays as a concrete
prescription to capture the beauty of robotics from the statistical mechanical
perspective.Comment: Contribute to the proceeding of the conference: NCTA 2014. Contains
12 pages,7 figure
Transforming structures by set interpretations
We consider a new kind of interpretation over relational structures: finite
sets interpretations. Those interpretations are defined by weak monadic
second-order (WMSO) formulas with free set variables. They transform a given
structure into a structure with a domain consisting of finite sets of elements
of the orignal structure. The definition of these interpretations directly
implies that they send structures with a decidable WMSO theory to structures
with a decidable first-order theory. In this paper, we investigate the
expressive power of such interpretations applied to infinite deterministic
trees. The results can be used in the study of automatic and tree-automatic
structures.Comment: 36 page
- …