The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Constructing families of symmetric dependence functions”

On a problem by Schweizer and Sklar

Fabrizio Durante (2012)

Kybernetika

Similarity:

We give a representation of the class of all n -dimensional copulas such that, for a fixed m ∈ ℕ , 2 ≤ m < n , all their m -dimensional margins are equal to the independence copula. Such an investigation originated from an open problem posed by Schweizer and Sklar.

Construction of multivariate copulas in n -boxes

José M. González-Barrios, María M. Hernández-Cedillo (2013)

Kybernetika

Similarity:

In this paper we give an alternative proof of the construction of n -dimensional ordinal sums given in Mesiar and Sempi [17], we also provide a new methodology to construct n -copulas extending the patchwork methodology of Durante, Saminger-Platz and Sarkoci in [6] and [7]. Finally, we use the gluing method of Siburg and Stoimenov [20] and its generalization in Mesiar et al. [15] to give an alternative method of patchwork construction of n -copulas, which can be also used in composition...

Equivalence of compositional expressions and independence relations in compositional models

Francesco M. Malvestuto (2014)

Kybernetika

Similarity:

We generalize Jiroušek’s (right) composition operator in such a way that it can be applied to distribution functions with values in a “semifield“, and introduce (parenthesized) compositional expressions, which in some sense generalize Jiroušek’s “generating sequences” of compositional models. We say that two compositional expressions are equivalent if their evaluations always produce the same results whenever they are defined. Our first result is that a set system ℋ is star-like with...

On an algorithm for testing T4 solvability of max-plus interval systems

Helena Myšková (2012)

Kybernetika

Similarity:

In this paper, we shall deal with the solvability of interval systems of linear equations in max-plus algebra. Max-plus algebra is an algebraic structure in which classical addition and multiplication are replaced by ⊕ and ⊗ , where a ⊕ b = max { a , b } , a ⊗ b = a + b . The notation 𝔸 ⊗ x = 𝕓 represents an interval system of linear equations, where 𝔸 = [ b ¯ , A ¯ ] and 𝕓 = [ b ̲ , b ¯ ] are given interval matrix and interval vector, respectively. We can define several types of solvability of interval systems. In this paper, we define the T4 solvability and...

Entropy and growth of expanding periodic orbits for one-dimensional maps

A. Katok, A. Mezhirov (1998)

Fundamenta Mathematicae

Similarity:

Let f be a continuous map of the circle S 1 or the interval I into itself, piecewise C 1 , piecewise monotone with finitely many intervals of monotonicity and having positive entropy h. For any ε > 0 we prove the existence of at least e ( h - ε ) n k periodic points of period n k with large derivative along the period, | ( f n k ) ' | > e ( h - ε ) n k for some subsequence n k of natural numbers. For a strictly monotone map f without critical points we show the existence of at least ( 1 - ε ) e h n such points.

Inessentiality with respect to subspaces

Michael Levin (1995)

Fundamenta Mathematicae

Similarity:

Let X be a compactum and let A = ( A i , B i ) : i = 1 , 2 , . . . be a countable family of pairs of disjoint subsets of X. Then A is said to be essential on Y ⊂ X if for every closed F i separating A i and B i the intersection ( ∩ F i ) ∩ Y is not empty. So A is inessential on Y if there exist closed F i separating A i and B i such that ∩ F i does not intersect Y. Properties of inessentiality are studied and applied to prove:  Theorem. For every countable family of pairs of disjoint open subsets of a compactum X there exists an open set G ∩ X on...