74 research outputs found
Convex Rank Tests and Semigraphoids
Convex rank tests are partitions of the symmetric group which have desirable
geometric properties. The statistical tests defined by such partitions involve
counting all permutations in the equivalence classes. Each class consists of
the linear extensions of a partially ordered set specified by data. Our methods
refine existing rank tests of non-parametric statistics, such as the sign test
and the runs test, and are useful for exploratory analysis of ordinal data. We
establish a bijection between convex rank tests and probabilistic conditional
independence structures known as semigraphoids. The subclass of submodular rank
tests is derived from faces of the cone of submodular functions, or from
Minkowski summands of the permutohedron. We enumerate all small instances of
such rank tests. Of particular interest are graphical tests, which correspond
to both graphical models and to graph associahedra
Entropy Distance: New Quantum Phenomena
We study a curve of Gibbsian families of complex 3x3-matrices and point out
new features, absent in commutative finite-dimensional algebras: a
discontinuous maximum-entropy inference, a discontinuous entropy distance and
non-exposed faces of the mean value set. We analyze these problems from various
aspects including convex geometry, topology and information geometry. This
research is motivated by a theory of info-max principles, where we contribute
by computing first order optimality conditions of the entropy distance.Comment: 34 pages, 5 figure
A Homological Approach to Belief Propagation and Bethe Approximations
We introduce a differential complex of local observables given a
decomposition of a global set of random variables into subsets. Its boundary
operator allows us to define a transport equation equivalent to Belief
Propagation. This definition reveals a set of conserved quantities under Belief
Propagation and gives new insight on the relationship of its equilibria with
the critical points of Bethe free energy.Comment: 14 pages, submitted for the 2019 Geometric Science of Information
colloquiu
Ideal hierarchical secret sharing schemes
Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention from the invention of secret sharing until nowadays. Several constructions of ideal hierarchical secret sharing schemes have been proposed, but it was not known what access structures admit such a scheme. We solve this problem by providing a natural definition for the family of the hierarchical access structures and, more importantly, by presenting a complete characterization of the ideal hierarchical access structures, that is, the ones admitting an ideal secret sharing scheme. Our characterization deals with the properties of the hierarchically minimal sets of the access structure, which are the minimal qualified sets whose participants are in the lowest possible levels in the hierarchy. By using our characterization, it can be efficiently checked whether any given hierarchical access structure that is defined by its hierarchically minimal sets is ideal. We use the well known connection between ideal secret sharing and matroids and, in particular, the fact that every ideal access structure is a matroid port. In addition, we use recent results on ideal multipartite access structures and the connection between multipartite matroids and integer polymatroids. We prove that every ideal hierarchical access structure is the port of a representable matroid and, more specifically, we prove that every ideal structure in this family admits ideal linear secret sharing schemes over fields of all characteristics. In addition, methods to construct such ideal schemes can be derived from the results in this paper and the aforementioned ones on ideal multipartite secret sharing. Finally, we use our results to find a new proof for the characterization of the ideal weighted threshold access structures that is simpler than the existing one.Peer ReviewedPostprint (author's final draft
On the optimization of bipartite secret sharing schemes
Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this paper, we study it for bipartite access structures, in which the set of participants
is divided in two parts, and all participants in each part play an equivalent role. We focus on the search of lower bounds by using a special class of polymatroids that is introduced here, the bipartite ones. We present a method based on linear programming to compute, for every given bipartite access structure, the best lower bound that can be obtained by this combinatorial method. In addition, we obtain some general lower bounds that improve the previously known ones, and we construct optimal secret sharing schemes for a family of bipartite access structures.Postprint (author’s final draft
Emergence of scale-free leadership structure in social recommender systems
The study of the organization of social networks is important for
understanding of opinion formation, rumor spreading, and the emergence of
trends and fashion. This paper reports empirical analysis of networks extracted
from four leading sites with social functionality (Delicious, Flickr, Twitter
and YouTube) and shows that they all display a scale-free leadership structure.
To reproduce this feature, we propose an adaptive network model driven by
social recommending. Artificial agent-based simulations of this model highlight
a "good get richer" mechanism where users with broad interests and good
judgments are likely to become popular leaders for the others. Simulations also
indicate that the studied social recommendation mechanism can gradually improve
the user experience by adapting to tastes of its users. Finally we outline
implications for real online resource-sharing systems
BioHackathon series in 2011 and 2012: penetration of ontology and linked data in life science domains
The application of semantic technologies to the integration of biological data and the interoperability of bioinformatics analysis and visualization tools has been the common theme of a series of annual BioHackathons hosted in Japan for the past five years. Here we provide a review of the activities and outcomes from the BioHackathons held in 2011 in Kyoto and 2012 in Toyama. In order to efficiently implement semantic technologies in the life sciences, participants formed various sub-groups and worked on the following topics: Resource Description Framework (RDF) models for specific domains, text mining of the literature, ontology development, essential metadata for biological databases, platforms to enable efficient Semantic Web technology development and interoperability, and the development of applications for Semantic Web data. In this review, we briefly introduce the themes covered by these sub-groups. The observations made, conclusions drawn, and software development projects that emerged from these activities are discussed
Crowdsourcing hypothesis tests: Making transparent how design choices shape research results
To what extent are research results influenced by subjective decisions that scientists make as they design studies? Fifteen research teams independently designed studies to answer fiveoriginal research questions related to moral judgments, negotiations, and implicit cognition. Participants from two separate large samples (total N > 15,000) were then randomly assigned to complete one version of each study. Effect sizes varied dramatically across different sets of materials designed to test the same hypothesis: materials from different teams renderedstatistically significant effects in opposite directions for four out of five hypotheses, with the narrowest range in estimates being d = -0.37 to +0.26. Meta-analysis and a Bayesian perspective on the results revealed overall support for two hypotheses, and a lack of support for three hypotheses. Overall, practically none of the variability in effect sizes was attributable to the skill of the research team in designing materials, while considerable variability was attributable to the hypothesis being tested. In a forecasting survey, predictions of other scientists were significantly correlated with study results, both across and within hypotheses. Crowdsourced testing of research hypotheses helps reveal the true consistency of empirical support for a scientific claim.</div
- …