(Here are his questions.)

I have a problem that deals with coalitions. The basic idea is to have a hypergraph with a bunch of nodes representing actors and edges representing coalitions. Such a hypergraph would have the following properties:

- non-regular (edges can have any number of nodes, and different edges in the same graph can have different numbers of nodes)
- down-set (the existence of an edge implies the existence of all edges that are a subset of that edge)
- finite
- probabilistic EDGES (I had found previous work on probabilistic nodes, but not for edges)

ReplyDeleteSuch a hypergraph would have the following properties: non-regular (edges can have any number of nodes, and different edges in the same graph can have different numbers of nodes) down-set (the existence of an edge implies the existence of all edges that are a subset of that edge)It would be more natural to call this object a random simplicial complex (which is what it is) rather than call it a hypergraph. (Btw, this of course leads to the philosophical question of why call one dimensional complexes "graphs", especially since the word graph is already overloaded in mathematics by its use as in "graph of a map"). Coming back to the original question: I believe that I have seen some work on the expected Betti numbers of such random complexes. In fact its probably worthwhile to check out the following reference:R. Meshulam and N. Wallach, Homological connectivity of

random k-dimensional complexes,

Random Struct. Algorithms 34(2009) 408-417.

any particular reason not to model this situation using (random) bipartite graphs?

ReplyDeleteI agree -- abstract simplicial complexes can be modeled by graphs, although it may well be less technically tricky to just use a hypergraph.

ReplyDeleteHaving used some of both (hypergraphs and simplicial complexes), I would say that the extra structure afforded by the use of simplicial complexes far outweighs any notion that "hypergraphs are simpler." I'm not even sure I agree with that notion, particularly in the case when your hypergraph's edges are explicitly downward closed, which is exactly the condition needed for it to be a simplicial complex.

ReplyDelete--Anon. 2