关于模糊严格偏好关系的传递性

给定一个模糊关系,Ovchinnikov和Roubens引进了非常一般的模糊严格偏好关系定义,本文将详细讨论该偏好关系的弱传递性,一致性,强传递性以及非循环性等传递性有关的性质。     

二级传递性与二级传递模糊矩阵

推广传递性概念,给出二级传递性的定义;研究二级传递模糊矩阵的性质,给出其若干等价刻画;证明二级传递模糊矩阵或者收敛或者周期为2,指数不大于n 1;讨论二级传递与强传递、k-传递和泛传递等概念之间的关系,指出二级传递是传递性概念的一种新的推广形式。     

Loose Cover of Graphs

This paper introduces a new definition of embedding a local structure to a given network, called loose cover of graphs. We derive several basic properties on the notion of loose cover, which includes transitivity, maximality, and the computational complexity of finding a loose cover by paths and cycles. In particular, we show that the decision problem is in P if the given local structure is a path with three or less vertices, while it is NP-complete for paths consisting of six or more vertices.     

Fuzzy transitivity and monotonicity of cardinality-based similarity measures

The interrelationship of notions is presented in fuzzy transitivity and monotonicity of fuzzy similarity measures. It is observed that the axiom of fuzzy transitivity may replace that of monotonicity in the definition of fuzzy similarity measures.     

Fuzzy partitions and relations; an axiomatic basis for clustering

In this paper some connections between fuzzy partitions and similarity relations are explored. A new definition of transitivity for fuzzy relations yields a relation-theoretic characterization of the class of all psuedo-metrics on a fixed (finite) data set into the closed unit interval. This notion of transitivity also links the triangle inequality to convex decompositions of fuzzy similarity relations in a manner which may generate new techniques for fuzzy clustering. Finally, we show that every fuzzy c-partition of a finite data set induces a psuedo-metric of the type described above on the data.     

Some dissenting views on the transitivity of individual preference

(1) The transitivity property is not a necessary condition for the rationality of all individual preference relations. (2) A weakened definition of the transitivity is not necessarily relevant. (3) The non-transitivity of fuzzy preference relations is not inconsistent with a fuzzy total preorder structure on the set of alternatives.Deceased.     

Locally 3‐Transitive Graphs of Girth 4

A natural topic of algebraic graph theory is the study of vertex transitive graphs. In the present article, we investigate locally 3‐transitive graphs of girth 4. Taking our former results on locally symmetric graphs of girth 4 as a starting point, we show what properties are retained if we weaken the requirement of local symmetry to local 3‐transitivity.     

Several transitive properties and Devaney’s chaos

The relation among transitivity, indecomposability and Z-transitivity is discussed. It is shown that for a non-wandering system (each point is non-wandering), indecomposability is equivalent to transitivity, and for the dynamical systems without isolated points, Z-transitivity and transitivity are equivalent. Besides, a new transitive level as weak transitivity is introduced and some equivalent conditions of Devaney's chaos are given by weak transitivity. Moreover, it is proved that both d-shadowing property and d-shadowing property imply weak transitivity.     

直觉模糊度量空间上的半群作用

讨论在直觉模糊度量空间上的拓扑半群作用,引入诸如拓扑传递性,点传递性及点稠传递性等概念.考虑非敏感性与传递性,等度连续等动力学性质的相互关系.     

Behavior in Repeated Prisoner's Dilemma Games with Shifted Outcomes Analyzed with a Statistical Learning Model

A fuzzy set theoretical framework is proposed for the analysis of sociometric structure characterized by vagueness of liking between individuals and a person's relative degree of belonging to a social group. Max‐min transitivity of a fuzzy relation is employed as a basic concept to examine the degree of liking and clustering in group structures. A distance model based on min‐max transitivity is also formulated as a special case of transitivity analysis. Other notions of transitivity such as the max‐product and the max‐* are also discussed. An empirical analysis is performed to examine the applicability of the proposed transitivity concepts. It appears that the current methodological construct provides a more appropriate perspective in the analysis of the group structure properties.     

模糊k-强传递阵

推广强传递阵 ,给出 k-强传递阵的概念 ,讨论它的等价刻画、与截阵性质一致问题 ,证明文献中几种传递性概念与强传递的等价性 ,丰富了模糊矩阵传递性的研究内容。     

Transitive Oriented 3 Hypergraphs of Cyclic Orders

In this paper we introduce the definition of transitivity for oriented 3-hypergraphs in order to study partial and complete cyclic orders. This definition allows us to give sufficient conditions on a partial cyclic order to be totally extendable. Furthermore, we introduce the 3-hypergraph associated to a cyclic permutation and characterize it in terms of cyclic comparability 3-hypergraphs.     

Stability of local transitivity of a generic control system on a surface with boundary

A classification of generic singularities of local transitivity of smooth control systems on surfaces with boundary is obtained. The stability of these singularities and of the entire set of points with identical properties of local transitivity with respect to small perturbations of a generic system is proved.     

Reading dependencies from covariance graphs

The covariance graph (aka bi-directed graph) of a probability distribution p is the undirected graph G where two nodes are adjacent iff their corresponding random variables are marginally dependent in p. (It is worth mentioning that our definition of covariance graph is somewhat non-standard. The standard definition states that the lack of an edge between two nodes of G implies that their corresponding random variables are marginally independent in p. This difference in the definition is important in this paper.) In this paper, we present a graphical criterion for reading dependencies from G, under the assumption that p satisfies the graphoid properties as well as weak transitivity and composition. We prove that the graphical criterion is sound and complete in certain sense. We argue that our assumptions are not too restrictive. For instance, all the regular Gaussian probability distributions satisfy them.     

On homeomorphisms with the two-sided limit shadowing property

We prove that the two-sided limit shadowing property is among the strongest known notions of pseudo-orbit tracing. It implies shadowing, average shadowing, asymptotic average shadowing and specification properties. We also introduce a weaker notion that is called two-sided limit shadowing with a gap and prove that it implies shadowing and transitivity. We show that those two properties allow to characterize topological transitivity and mixing in a class of expansive homeomorphisms and hence they characterize transitive (mixing) shifts of finite type.     

Learning intransitive reciprocal relations with kernel methods

In different fields like decision making, psychology, game theory and biology, it has been observed that paired-comparison data like preference relations defined by humans and animals can be intransitive. Intransitive relations cannot be modeled with existing machine learning methods like ranking models, because these models exhibit strong transitivity properties. More specifically, in a stochastic context, where often the reciprocity property characterizes probabilistic relations such as choice probabilities, it has been formally shown that ranking models always satisfy the well-known strong stochastic transitivity property. Given this limitation of ranking models, we present a new kernel function that together with the regularized least-squares algorithm is capable of inferring intransitive reciprocal relations in problems where transitivity violations cannot be considered as noise. In this approach it is the kernel function that defines the transition from learning transitive to learning intransitive relations, and the Kronecker-product is introduced for representing the latter type of relations. In addition, we empirically demonstrate on two benchmark problems, one in game theory and one in theoretical biology, that our algorithm outperforms methods not capable of learning intransitive reciprocal relations.     

相关系数的传递性

主要研究了相关系数的传递性.首先在区间[-1,1]上引入两个运算和⊕,并讨论了它们的性质.接着利用运算和⊕给出了相关系数的传递性:当Xi与Xk完全相关,Xk与Xj完全相关时,Xi与Xj也完全相关.     

Linear transitivity criteria

We show that different transitivity criteria for strongly continuous semigroups of operators are equivalent. We also give new results concerning the equivalence of transitivity criteria in the case of iterations of a single operator.     

模糊关系的对偶合成及其在传递性中的应用

引入了模糊关系的一种新的合成：对偶合成。这种新的合成使我们十分容易地刻画反向传递性。利用合成和对偶合成,我们建立了传递性、反向传递性、半传递性和Ferrers性质的若干有趣的等价条件。     

Characteristic for reflexive relations

Poincaré characteristic for reflexive relations (oriented graphs) is defined in terms of homology and is not invariant under transitive closure. Formulas for the Poincaré characteristic of products, joins, and bounded products are given. Euler's definition of characteristic extends to certain filtrations of reflexive relations which exist iff there are no oriented loops. Euler characteristic is independent of filtration, agrees with Poincaré characteristic, and is unique. One-sided Möbius characteristic is defined as the sum of all values of a one-sided inverse of the zeta function. Such one-sided inverses exist iff there are no local oriented loops (although there may be global oriented loops). One-sided Möbius characteristic need not be Poincaré characteristic, but it is when a one-sided local transitivity condition is satisfied. A two-sided local transitivity condition insures the existence of the Möbius function but Möbius inversion fails for non-posets.