Pruning Processes and a New Characterization of Convex Geometries

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 characterizatio...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2008-08
Main Authors: Ardila, Federico, Maneva, Elitza
Format: Article
Language:English
Subjects:
Combinatorial analysis
Pruning
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422