Search results for "Combinatorics"
showing 10 items of 1770 documents
Relación entre conos de direcciones decrecientes y conos de direcciones de descenso
1984
Let f: N ? R a convex function and x I Ni, where N is a convex set in a real linear space. It is stated that, if Df<(x) is not empty, then Df<(x) is the algebraic interior of Df=(x).
Una solucion bayesiana a la Paradoja de Stein
1982
If we are interested in making inferences about the square norm of the mean in a multivariate normal model, the usual uniform prior for the mean is not sound, as revealed by Stein in his 1959 work. This paper studies in what sense this prior must be modified by using the maximization of missing information procedure (Bernardo, 1979)
Multiple testing of pairs of one-sided hypotheses
1986
Two-sided test procedures fork real parameters should point out in the case of rejection whether the left or the right alternative can be assumed. This sets up a multiple testing problem fork pairs of one-sided hypotheses. Holm's (1979, Scandinavian Journal of Statistics 6:65–70) sequentially rejective test provides a solution the critical levels of which are slightly improved. Considerable improvement is obtained when the hypotheses are redefined to be disjoint in pairs.
On Association Models Defined over Independence Graphs
1998
Conditions on joint distributions are given under which two variables will be conditionally associated whenever an independence graph does not imply a corresponding conditional independence statement. To this end the notions of parametric cancellation, of stable paths and of quasi-linear models are discussed in some detail.
A generalized predictive criterion for model selection
2002
Given a random sample from some unknown model belonging to a finite class of parametric models, assume that the estimate of the density of a future observation is of interest San Martini & Spezzaferri (1984) proposed for this problem a predictive criterion based on the logarithmic utility function. The present authors investigate a generalization of this criterion that uses as a loss function an element of the class of α-divergences discussed by Ali & Silvey (1966) and Csiszar (1967). They also discuss briefly the case in which the class of models considered is not exhaustive. Un critere de prevision generalise pour la selection de modeles Supposons que l'on cherche a estimer la densite d'u…
A Distribution-Free Two-Sample Equivalence Test Allowing for Tied Observations
1999
A new testing procedure is derived which enables to assess the equivalence of two arbitrary noncontinuous distribution functions from which unrelated samples are taken as the data to be analyzed. The equivalence region is defined to consist of all pairs (F, G) of distribution functions such that for independent X ∼F, Y ∼G the conditional probability of {X > Y} given {X ¬= Y} lies in some short interval around 1/2. The test rejects the null hypothesis of nonequivalence if and only if the standardized distance between the U-statistics estimator of P|X > Y | X ¬= Y] and the center of the equivalence interval (1/2 - e 1 , 1/2 + e 2 ) does not exceed a critical upper bound which has to be comput…
Binary distributions of concentric rings
2014
We introduce families of jointly symmetric, binary distributions that are generated over directed star graphs whose nodes represent variables and whose edges indicate positive dependences. The families are parametrized in terms of a single parameter. It is an outstanding feature of these distributions that joint probabilities relate to evenly spaced concentric rings. Kronecker product characterizations make them computationally attractive for a large number of variables. We study the behavior of different measures of dependence and derive maximum likelihood estimates when all nodes are observed and when the inner node is hidden.
A multi-local optimization algorithm
1998
The development of efficient algorithms that provide all the local minima of a function is crucial to solve certain subproblems in many optimization methods. A “multi-local” optimization procedure using inexact line searches is presented, and numerical experiments are also reported. An application of the method to a semi-infinite programming procedure is included.
The rank of random regular digraphs of constant degree
2018
Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .
The Serial Property and Restricted Balanced Contributions in discrete cost sharing problems
2006
We show that the Serial Poperty and Restricted Balanced Contributions characterize the subsidy-free serial cost sharing method (Moulin (1995)) in discrete cost allocation problems.