This paper describes an ongoing study which applies the concept of transitivity to news discourse for text processing tasks. The complex notion of transitivity is defined and the relationship between transi-tivity and information foregrounding is explained. A sample corpus of news articles has been coded for transitivity. The corpus is being used in two text processing experiments .

The main goal of this paper is the investigation of a relevant property which appears in the various definition of deterministic topological chaos for discrete time dynamical system: transitivity. Starting from the standard Devaney’s notion of topological chaos based on regularity, transitivity, and sensitivity to the initial conditions, the critique formulated by Knudsen is taken into account ...

The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity. We describe the logical relationships between the different notions of rationalizability involving, for example, the transitivity, quasi-transitivity, or acyclicity of t...

A general framework for studying the transitivity of reciprocal relations is presented. The key feature is the cyclic evaluation of transitivity: triangles (i.e. any three points) are visited in a cyclic manner. An upper bound function acting upon the ordered weights encountered provides an upper bound for the ‘sum minus 1’ of these weights. Commutative quasi-copulas allow to translate a genera...

Recent progress in symbolic dynamics of cellular automata (CA) shows that many CA exhibit rich and complicated Bernoulli-shift properties, such as positive topological entropy, topological transitivity and even mixing. Noticeably, some CA are only transitive, but not mixing on their subsystems. Yet, for one-dimensional CA, this paper proves that not only the shift transitivity guarantees the CA...

The technique of lumping of Markov chains is one of the main tools for recovering from state explosion in the quantitative analysis of large probabilistic systems. Useful results regarding relational properties of general, ordinary and exact lumpability, in particular transitivity and strict confluence, are rather scattered or implicit in the literature. These are collected and reformulated her...

With the expansion of the Internet, Trust has attracted the attention of more and more researchers. This paper focuses on the trust transitivity problem and proposes a trust transitivity model based on Dempster-Shafer Theory. In our model, we show two types of trust relationship: Identity Trust and Behavior Trust based on Directness Trust and Recommendation Trust. Then we build the trust transi...