Related papers: On the maximum of Cramer's V

We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u,v} of vertices have a distance…

The conditional diagnosability and the 2-extra connectivity are two important parameters to measure ability of diagnosing faulty processors and fault-tolerance in a multiprocessor system. The conditional diagnosability $t_c(G)$ of $G$ is…

We discuss the problem of finding the best measurement strategy for estimating the value of a quantum system parameter. In general the optimum quantum measurement, in the sense that it maximizes the quantum Fisher information and hence…

Estimation of the mean vector and covariance matrix is of central importance in the analysis of multivariate data. In the framework of generalized linear models, usually the variances are certain functions of the means with the normal…

Pairwise comparison matrices are frequently applied in multi-criteria decision making. A weight vector is called efficient if no other weight vector is at least as good in approximating the elements of the pairwise comparison matrix, and…

The crossing number of a graph $G$, $\mathrm{cr}(G)$, is the minimum number of edge crossings arising when drawing a graph on a certain surface. Determining $\mathrm{cr}(G)$ is a problem of great importance in Graph Theory. Its maximum…

We present the conditional value-at-risk (CVaR) in the context of Markov chains and Markov decision processes with reachability and mean-payoff objectives. CVaR quantifies risk by means of the expectation of the worst p-quantile. As such it…

The modeling of risk situations that occur in a space-time framework can be done using max-stable random fields on lattices. Although the summary coefficients for the spatial and temporal behaviour do not characterize the finite-dimensional…

We consider a limit theorem for the distribution of a r.v. $Y_n:=argmax {\{X_i, i= 1,..., n\}},$ where $X_i'$s are independent continuous non-negative random variables. The r.v.'s $\{X_i, i=1,..., n\}$, may be interpreted as the gains of…

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…

We describe an apparently new measure of multivariate goodness-of-fit between sets of quantitative results from a model (simulation, analytical, or multiple regression), paired with those observed under corresponding conditions from the…

An analytical method within the frame of linear stability theory is presented for the normal field instability in magnetic fluids. It allows to calculate the maximal growth rate and the corresponding wave number for any combination of…

Given a graph $G$, a subset $S \subseteq V(G)$ is \textit{cycle convex}, if for any vertex $v \in V(G) \setminus S$, the induced subgraph, $G[S \cup \{v\}]$ cannot form a cycle containing the vertex $v$. The \textit{exchange number} of $G$,…

We employ uncertain parametric CTMCs with parametric transition rates and a prior on the parameter values. The prior encodes uncertainty about the actual transition rates, while the parameters allow dependencies between transition rates.…

Recommendations based on behavioral data may be faced with ambiguous statistical evidence. We consider the case of association rules, relevant e.g.~for query and product recommendations. For example: Suppose that a customer belongs to…

Hypothesis testing of structure in covariance matrices is of significant importance, but faces great challenges in high-dimensional settings. Although consistent frequentist one-sample covariance tests have been proposed, there is a lack of…

The modified eccentric connectivity index of a graph is defined as the sum of the products of eccentricity with the total degree of neighboring vertices, over all vertices of the graph. This is a generalization of eccentric connectivity…

We discuss the emergence of an orthogonality catastrophe in the response of a composite fermion liquid as the filling factor \nu approaches 1/2m, where m=1,2,3.... A tunneling experiment is proposed in which dramatic changes in the I-V…

We present a versatile inequality of uncertainty relations which are useful when one approximates an observable and/or estimates a physical parameter based on the measurement of another observable. It is shown that the optimal choice for…

Determining the number of factors is essential to factor analysis. In this paper, we propose {an efficient cross validation (CV)} method to determine the number of factors in approximate factor models. The method applies CV twice, first…