Geometric Representations of Random Hypergraphs
نویسندگان
چکیده
منابع مشابه
Geometric Representations of Hypergraphs for Prior Specification and Posterior Sampling
Abstract: A parametrization of hypergraphs based on the geometry of points in R is developed. Informative prior distributions on hypergraphs are induced through this parametrization by priors on point configurations via spatial processes. This prior specification is used to infer conditional independence models or Markov structure of multivariate distributions. Specifically, we can recover both...
متن کاملProper Coloring of Geometric Hypergraphs
We study whether for a given planar family F there is an m such that any finite set of points can be 3-colored such that any member of F that contains at least m points contains two points with different colors. We conjecture that if F is a family of pseudo-disks, then m = 3 is sufficient. We prove that when F is the family of all homothetic copies of a given convex polygon, then such an m exis...
متن کاملChoosability in Random Hypergraphs
The choice number of a hypergraph H = (V, E) is the least integer s for which for every family of color lists S = {S(v) : v ∈ V }, satisfying |S(v)| = s for every v ∈ V , there exists a choice function f so that f(v) ∈ S(v) for every v ∈ V , and no edge of H is monochromatic under f . In this paper we consider the asymptotic behavior of the choice number of a random k-uniform hypergraph H(k, n,...
متن کاملExchangeable random hypergraphs
A hypergraph is a generalization of a graph in which an edge may contain more than two vertices. Hereditary hypergraphs are particularly important because they arise in mathematics as the class of monotone subsets, in statistics as the class of factorial models, in topology as simplicial complexes and in algebra as the free distributive lattice. An exchangeable random hypergraph consists of a p...
متن کاملQuasi-random hypergraphs revisited
The quasi-random theory for graphs mainly focuses on a large equivalent class of graph properties each of which can be used as a certificate for randomness. For k-graphs (i.e., k-uniform hypergraphs), an analogous quasi-random class contains various equivalent graph properties including the k-discrepancy property (bounding the number of edges in the generalized induced subgraph determined by an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 2017
ISSN: 0162-1459,1537-274X
DOI: 10.1080/01621459.2016.1141686