scholarly journals The dixie cup problem and FKG inequality

2019 ◽  
Vol 2 (3-4) ◽  
pp. 169-174
Author(s):  
Leopold Flatto
Keyword(s):  
1992 ◽  
Vol 29 (01) ◽  
pp. 239-243 ◽  
Author(s):  
J. van den Berg ◽  
A. Gandolfi

Consider a two-level storage system operating with the least recently used (LRU) or the first-in, first-out (FIFO) replacement strategy. Accesses to the main storage are described by the independent reference model (IRM). Using the FKG inequality, we prove that the miss ratio for LRU is smaller than or equal to the miss ratio for FIFO.


1982 ◽  
Vol 19 (3) ◽  
pp. 695-701 ◽  
Author(s):  
Ward Whitt

Karlin and Rinott (1980) introduced and investigated concepts of multivariate total positivity (TP2) and multivariate monotone likelihood ratio (MLR) for probability measures on Rn These TP and MLR concepts are intimately related to supermodularity as discussed in Topkis (1968), (1978) and the FKG inequality of Fortuin, Kasteleyn and Ginibre (1971). This note points out connections between these concepts and uniform conditional stochastic order (ucso) as defined in Whitt (1980). ucso holds for two probability distributions if there is ordinary stochastic order for the corresponding conditional probability distributions obtained by conditioning on subsets from a specified class. The appropriate subsets to condition on for ucso appear to be the sublattices of Rn. Then MLR implies ucso, with the two orderings being equivalent when at least one of the probability measures is TP2.


1996 ◽  
Vol 3 (27) ◽  
Author(s):  
Devdatt P. Dubhashi ◽  
Volker Priebe ◽  
Desh Ranjan

We investigate random variables arising in occupancy problems, and show the variables to be negatively associated, that is, negatively dependent in a strong sense. Our proofs are based on the FKG correlation inequality, and they suggest a useful, general technique for proving negative dependence among random variables. We also show that in the special case of two binary random variables, the notions of negative correlation and negative association coincide.


1979 ◽  
Vol 16 (03) ◽  
pp. 526-540 ◽  
Author(s):  
J. G. Oxley ◽  
D. J. A. Welsh

We examine how much classical percolation theory on lattices can be extended to arbitrary graphs or even clutters of subsets of a finite set. In the process we get new short proofs of some theorems of J. M. Hammersley. The FKG inequality is used to get an upper bound for the percolation probability and we also derive a lower bound. In each case we characterise when these bounds are attained.


Sign in / Sign up

Export Citation Format

Share Document