Searcharxiv⌕ Search

arXiv subjects

Damjana Kokol Bukovšek

Publications and source records attributed to Damjana Kokol Bukovšek.

At least 19 recordsLinked to original sources

The relation between non-exchangeability and radial asymmetry of copulas

Non-exchangeability and radial asymmetry have got substantial attention in the literature, but relation between the two has not been studied yet. We propose the question: if a copula has a given degree of radial asymmetry, what is the range of possible values of the measure of non-exhangeability. We determine the set of all points whose first coordinate is the radial asymmetry of a copula and the second coordinate is its non-exchangeability. We show that this set is a non-convex hexagon.

math.ST↗

On diagonal sections of Markov products of copulas

Given a bivariate copula $C$, the bivariate copula $Ψ(C)$ is defined as the Markov product of $C^T$ and $C$. In this paper we consider the diagonal section of $Ψ(C)$ under the additional assumption that its value at a single point is known. We determine the exact upper and lower bounds for the diagonal section of $Ψ(C)$, given that $Ψ(C)(a,a)=d \in [a^2,a]$, where $a \in [0,1]$ is a fixed point. Furthermore, we describe some additional properties of the transformation $Ψ$, such as its behavior under ordinal sums and the survival operation. We also study checkerboard copulas in the range of $Ψ$ and matrices associated to them.

math.ST↗

How far are $d$-dimensional copulas with uniform $(d-1)$-marginals from (total) independence?

We consider the family ${\mathcal{C}}_d^{Π_{d-1}}$ of all $d$-dimensional copulas whose $(d-1)$-dimensional marginals are all equal to the $(d-1)$-dimensional product copula $Π_{d-1}$ and tackle the natural question, `how far away' from the $d$-dimensional product copula $Π_d$ elements in ${\mathcal{C}}_d^{Π_{d-1}}$ can be. We provide definitive answers for both, the uniform metric $d_\infty$ as well as the stronger, conditioning-based metric $D_1$. The established results clearly indicate that the family ${\mathcal{C}}_d^{Π_{d-1}}$ is larger than one might expect.

math.ST↗

Random discrete copulas

We introduce the notion of a bivariate random discrete copula on an equidistant mesh and explore its stochastic properties. A random discrete copula is a discrete random field, hence, its value at a given point on the mesh is a random variable. We determine the distribution of this random variable and calculate its expected value and variance. We also consider bilinear extension of a random discrete copula to a random field over the whole unit square.

math.ST↗

Optimization problem for star covers of graphs without four cycles

This work presents a study of star covers on graphs. Unlike traditional formulations that minimize the number of stars, our aim is to optimize the number of bipartite components used in the cover. This problem, motivated by a symmetric nonnegative trifactorization of matrices and the SNT-rank of graphs, is in general hard to solve. We consider a family of graphs that do not contain four cycles, and develop an algorithm to determine the SNT-rank of such graphs.

math.CO↗

Unital compressed commuting graph of $3 \times 3$ matrices over a finite prime field

In this paper we completely describe the unital compressed commuting graph of the ring $\mathcal{M}_3(\mathrm{GF}(p))$ of $3 \times 3$ matrices over the finite prime field $\mathrm{GF}(p)$. To achieve this we combine methods from linear algebra, field theory, projective geometry and combinatorics. We first partition the set of vertices into types based on the Jordan form and describe the neighborhood of each vertex. The key part of the graph, i.e., the subgraph that corresponds to non-scalar derogatory matrices, is then determined using a bijective correspondence between its vertices and point-line pairs in the projective plane over $\mathrm{GF}(p)$. At the end we explain how the remaining vertices are attached to the key part. We also give an algorithm to construct the whole graph. As a consequence, we describe the usual commuting graph $Γ(\mathcal{M}_3(\mathrm{GF}(p)))$, whose structure was an open problem for several years.

math.RA↗

The exact region determined by Spearman's footrule, Gini's gamma and Kendall's tau

Concordance measures are used to express the degree of association between random variables. Practitioners may use several distinct concordance measures to narrow the space of possible dependence structures. Consequently, the relations between different (weak) concordance measures have been extensively studied in recent years. The goal of this paper is to study the relation between Kendall's tau, Gini's gamma and Spearman's footrule. In particular, we describe the exact region determined by these three measures, using shuffles of $M$ and ordinal sums of copulas. We also provide the formulas for five main (weak) concordance measures and Chatterjee's xi of ordinal sums of copulas.

math.ST↗

When does an infinite ring have a finite compressed commuting graph?

We show that any infinite ring has an infinite nonunital compressed commuting graph. We classify all infinite unital rings with finite unital compressed commuting graph, using semidirect product of rings as our main tool. As a consequence we also classify infinite unital rings with only finitely many unital subrings.

math.RA↗

Compressed commuting graphs of matrix rings

In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression is chosen in such a way that it induces a functor from the category of rings to the category of graphs, which means that our graph takes into account not only the commutativity relation in the ring, but also the commutativity relation in all of its homomorphic images. Furthermore, we show that this compression is best possible for matrix algebras over finite fields, i.e., it compresses as much as possible while still inducing a functor. We compute the compressed commuting graphs of finite fields and rings of $2 \times 2$ matrices over finite fields.

math.RA↗

Exact upper bound for copulas with a given diagonal section

We answer a 15-year-old open question about the exact upper bound for bivariate copulas with a given diagonal section by giving an explicit formula for this bound. As an application, we determine the maximal asymmetry of bivariate copulas with a given diagonal section and construct a copula that attains it. We derive a formula for the maximal asymmetry that is simple enough to be used by practitioners.

math.PR↗

Coherence and avoidance of sure loss for standardized functions and semicopulas

We discuss avoidance of sure loss and coherence results for semicopulas and standardized functions, i.e., for grounded, 1-increasing functions with value $1$ at $(1,1,\ldots, 1)$. We characterize the existence of a $k$-increasing $n$-variate function $C$ fulfilling $A\leq C\leq B$ for standardized $n$-variate functions $A,B$ and discuss the method for constructing this function. Our proofs also include procedures for extending functions on some countably infinite mesh to functions on the unit box. We provide a characterization when $A$ respectively $B$ coincides with the pointwise infimum respectively supremum of the set of all $k$-increasing $n$-variate functions $C$ fulfilling $A\leq C\leq B$.

math.ST↗

Extending multivariate sub-quasi-copulas

In this paper, we introduce patchwork constructions for multivariate quasi-copulas. These results appear to be new since the kind of approach has been limited to either copulas or only bivariate quasi-copulas so far. It seems that the multivariate case is much more involved since we are able to prove that some of the known methods of bivariate constructions cannot be extended to higher dimensions. Our main result is to present the necessary and sufficient conditions both on the patch and the values of it for the desired multivariate quasi-copula to exist. We also give all possible solutions.

math.ST↗

Symmetric Nonnegative Trifactorization of Pattern Matrices

A factorization of an $n \times n$ nonnegative symmetric matrix $A$ of the form $BCB^T$, where $C$ is a $k \times k$ symmetric matrix, and both $B$ and $C$ are required to be nonnegative, is called the Symmetric Nonnegative Matrix Trifactorization (SN-Trifactorization). The SNT-rank of $A$ is the minimal $k$ for which such factorization exists. The SNT-rank of a simple graph $G$ that allows loops is defined to be the minimal possible SNT-rank of all symmetric nonnegative matrices whose zero-nonzero pattern is prescribed by a given graph. We define set-join covers of graphs, and show that finding the SNT-rank of $G$ is equivalent to finding the minimal order of a set-join cover of $G$. Using this insight we develop basic properties of the SNT-rank for graphs and compute it for trees and cycles without loops. We show the equivalence between the SNT-rank for complete graphs and the Katona problem, and discuss uniqueness of patterns of matrices in the factorization.

math.CO↗

On the exact region determined by Spearman's rho and Spearman's footrule

We determine the lower bound for possible values of Spearman's rho of a bivariate copula given that the value of its Spearman's footrule is known and show that this bound is always attained. We also give an estimate for the exact upper bound and prove that the estimate is attained for some but not all values of Spearman's footrule. Nevertheless, we show that the estimate is quite tight.

math.ST↗

Symmetric Nonnegative Matrix Trifactorization

The Symmetric Nonnegative Matrix Trifactorization (SN-Trifactorization) is a factorization of an $n \times n$ nonnegative symmetric matrix $A$ of the form $BCB^T$, where $C$ is a $k \times k$ symmetric matrix, and both $B$ and $C$ are required to be nonnegative. This work introduces the SNT-rank of $A$, as the minimal $k$, for which such factorization exists. After listing basic properties and exploring SNT-rank of low rank matrices, the class of nonnegative symmetric matrices with SNT-rank equal to rank is studied. The paper concludes with a completion problem, that asks for matrices with the smallest possible SNT-rank among all nonnegative symmetric matrices with given diagonal blocks.

math.OC↗

Spearman's footrule and Gini's gamma: Local bounds for bivariate copulas and the exact region with respect to Blomqvist's beta

Copulas are becoming an essential tool in analyzing data thus encouraging interest in related questions. In the early stage of exploratory data analysis, say, it is helpful to know local copula bounds with a fixed value of a given measure of association. These bounds have been computed for Spearman's rho, Kendall's tau, and Blomqvist's beta. The importance of another two measures of association, Spearman's footrule and Gini's gamma, has been reconfirmed recently. It is the main purpose of this paper to fill in the gap and present the mentioned local bounds for these two measures as well. It turns out that this is a quite non-trivial endeavor as the bounds are quasi-copulas that are not copulas for certain values of the two measures. We also give relations between these two measures of association and Blomqvist's beta.

math.ST↗

Some multivariate imprecise shock model copulas

Bivariate imprecise copulas have recently attracted substantial attention. However, the multivariate case seems still to be a "blank slate". It is then natural that this idea be tested first on shock model induced copulas, a family which might be the most useful in various applications. We investigate a model in which some of the shocks are assumed imprecise and develop the corresponding set of copulas. In the Marshall's case we get a coherent set of distributions and a coherent set of copulas, where the bounds are naturally corresponding to each other. The situation with the other two groups of multivariate imprecise shock model induced copulas, i.e., the maxmin and the the reflected maxmin (RMM) copulas, is substantially more involved, but we are still able to produce their properties. These are the main results of the paper that serves as the first step into a theory that should develop in this direction. In addition, we unfold the theory of bivariate imprecise RMM copulas that has not yet been done before.

math.PR↗

Relation between non-exchangeability and measures of concordance of copulas

An investigation is presented of how a comprehensive choice of five most important measures of concordance (namely Spearman's rho, Kendall's tau, Gini's gamma, Blomqvist's beta, and their weaker counterpart Spearman's footrule) relate to non-exchangeability, i.e., asymmetry on copulas. Besides these results, the method proposed also seems to be new and may serve as a raw model for exploration of the relationship between a specific property of a copula and some of its measures of dependence structure, or perhaps the relationship between various measures of dependence structure themselves.

math.ST↗