SearcharxivSearch

arXiv subjects

Christopher Coscia

Publications and source records attributed to Christopher Coscia.

3 recordsLinked to original sources

Sets that Support a Joint Distribution

Given probability distributions $\mu$ and $\nu$ on measure spaces $X$ and $Y$, and a closed set $S \subseteq X \times Y$, when is there a probability distribution on $X \times Y$ whose marginals are $\mu$ and $\nu$, and whose support is precisely $S$? We answer the question when the marginals are discrete, and when the marginals are continuous distributions on the real line. Of special interest is the case where $S \subseteq [0,1]^2$ and $\mu$ and $\nu$ are Lebesgue measure; then the above question is tantamount to ``when is $S$ the support of a doubly stochastic measure?". The discrete case is generalized to determine when a (possibly infinite) edge-capacitated, node-weighted graph supports a full, nowhere-zero flow; for the continuous case we provide a particularly straightforward characterization when the set in question is regular (i.e., is the closure of its interior).

math.PR

Best and worst case permutations for random online domination of the path

We study a randomized algorithm for graph domination, by which, according to a uniformly chosen permutation, vertices are revealed and added to the dominating set if not already dominated. We determine the expected size of the dominating set produced by the algorithm for the path graph $P_n$ and use this to derive the expected size for some related families of graphs. We then provide a much-refined analysis of the worst and best cases of this algorithm on $P_n$ and enumerate the permutations for which the algorithm has the worst-possible performance and best-possible performance. The case of dominating the path graph has connections to previous work of Bouwer and Star, and of Gessel on greedily coloring the path.

math.CO

Locally Convex Words and Permutations

We introduce some new classes of words and permutations characterized by the second difference condition $π(i-1) + π(i+1) - 2π(i) \leq k$, which we call the $k$-convexity condition. We demonstrate that for any sized alphabet and convexity parameter $k$, we may find a generating function which counts $k$-convex words of length $n$. We also determine a formula for the number of 0-convex words on any fixed-size alphabet for sufficiently large $n$ by exhibiting a connection to integer partitions. For permutations, we give an explicit solution in the case $k = 0$ and show that the number of 1-convex and 2-convex permutations of length $n$ are $Θ(C_1^n)$ and $Θ(C_2^n)$, respectively, and use the transfer matrix method to give tight bounds on the constants $C_1$ and $C_2$. We also providing generating functions similar to the the continued fraction generating functions studied by Odlyzko and Wilf in the "coins in a fountain" problem.

math.CO