Pruning Processes and a New Characterization of Convex Geometries
Combinatorics
2008-08-31 v4 Discrete Mathematics
Probability
Abstract
We provide a new characterization of convex geometries via a multivariate version of an identity that was originally proved by Maneva, Mossel and Wainwright for certain combinatorial objects arising in the context of the k-SAT problem. We thus highlight the connection between various characterizations of convex geometries and a family of removal processes studied in the literature on random structures.
Keywords
Cite
@article{arxiv.0706.3750,
title = {Pruning Processes and a New Characterization of Convex Geometries},
author = {Federico Ardila and Elitza Maneva},
journal= {arXiv preprint arXiv:0706.3750},
year = {2008}
}