Search results for "combinatoric"
showing 10 items of 1776 documents
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.
Hores: A timetabling system for Spanish secondary schools
1995
Constructing a timetable is a difficult problem faced by every school every year. A feasible solution has to satisfy many different requirements and constraints. A good solution has to provide compact timetables for classes and teachers. In order to help the schools, we have developed HORES, a robust and flexible timetabling system suited to the needs of Spanish secondary schools. HORES runs on a PC and is fast and user-friendly. It may handle virtually every condition required by the schools and obtains good quality solutions in very short computing times. It also allows the user to modify interactively the solutions. HORES is now being used by schools with satisfactory results.
Comparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitas
1992
En este trabajo se estudia la eficiencia de un conjunto de algoritmos, exactos e iterativos, para el problema de obtener la distribucion estacionaria de una cadena de Markov homogenea, irreducible y finita. Se presentan los resultados computacionales obtenidos al resolver problemas de diferentes tipos y tamanos, aleatoriamente generados, asi como el tratamiento estadistico realizado sobre los mismos. Se ha comparado la estabilidad de estos algoritmos frente a la perdida de irreducibilidad y la existencia de estados transitorios mediante su aplicacion a 26 problemas test. El trabajo concluye con una discusion del comportamiento de los diversos algoritmos.
Estudio bayesiano de los periodos de ocupacion y desocupacion en una cola M/M/1/∞/FIFO en equilibrio
1986
En este articulo, para un modelo de colas M/M/1/8/FIFO en equilibrio, se obtiene la distribucion predictiva del tiempo de duracion de un periodo de ocupacion, y de desocupacion de la cola, asi como la distribucion predictiva final del numero de personas atendidas en un periodo de ocupacion, y la probabilidad de que este sea finito. Finalmente, dichos resultados se aplican en una linea de espera concreta.
Searching for a strong double tracing in a graph
1998
Given a connected graph G, we present a polynomial algorithm which either finds a tour traversing each edge of G exactly two non-consecutive times, one in each direction, or decides that no such tour exists. The main idea of this algorithm is based on the modification of a proof given by Thomassen related to a problem proposed by Ore in 1951.