We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (choose the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of the transition probability matrix). Exploiting symmetry can lead to significant reduction in both number of optimization variables and size of matrices in solving the corresponding ...

We present a terminating tableau system for the modal logic K∗. K∗ extends the basic modal logic K with a reflexive transitive closure operator for relations and is a proper fragment of propositional dynamic logic. We investigate two different approaches to achieve termination, namely chain-based blocking and pattern-based blocking. Pattern based-blocking has not been applied to a modal logic w...

Slovenija Abstract A vertex-transitive graph is said to be 1 2-transitive if its automor-phism group is vertex and edge but not arc-transitive. Some recent results on 1 2-transitive graphs are given, a few open problems proposed , and possible directions in the research of the structure of these graphs discussed. 1 In the beginning Throughout this paper graphs are simple and, unless otherwise s...

BACKGROUND A modified theory of planned behaviour (acronym CASCADA) proposes that Conscious knowledge precedes a change in Attitude, which in turn precedes positive deviations from negative Subjective norms, intention to Change, perception of Agency to change, Discussion of possible action, and Action itself. We used this as a results chain to investigate gender-specific behaviour dynamics in c...

Knowledge of mechanisms is critical for causal reasoning. We contrasted two possible organizations of causal knowledge—an interconnected causal network, where events are causally connected without any boundaries delineating discrete mechanisms; or a set of disparate mechanisms—causal islands—such that events in different mechanisms are not thought to be related even when they belong to the same...

We discuss the dynamics beyond topological hyperbolicity considering homeomorphisms satisfying shadowing property and generalizations of expansivity. It is proved that transitive countably expansive are in set points. This contrast with pseudo-Anosov diffeomorphisms two-dimensional sphere transitive, cw-expansive, satisfy but dynamical ball each point contains a Cantor subset. exhibit examples ...

The Marquis du Condorcet recognized 200 years ago that majority rule can produce intransitive group preferences if the domain of possible (transitive) individual preference orders is unrestricted. We present results on the cardinality and structure of those maximal sets of permutations for which majority rule produces transitive results (consistent sets). Consistent sets that contain a maximal ...

The Marquis du Condorcet recognized 200 years ago that majority rule can produce intransitive group preferences if the domain of possible (transitive) individual preference orders is unrestricted. We present results on the cardinality and structure of those maximal sets of permutations for which majority rule produces transitive results (consistent sets). Consistent sets that contain a maximal ...