OK, we can hold off on beating this horse until a more specific and
relevant example arrives on the scene, then we can lead him to water and
hold him under whether he drinks or not.!
On 6/9/17 1:56 PM, gepr ⛧ wrote:
I'm not entirely sure to be honest. But I know they must contain cycles. So DAGs are
inadequate, hence my revulsion at the word "level".
On June 9, 2017 12:37:39 PM PDT, Steven A Smith <sasm...@swcp.com> wrote:
Glen -
At the risk of boring the rest of the crowd silly, I'd be interested in
hearing more about the kinds of graphs you would like to talk about.
I
agree that Partially Ordered Sets are a (relatively) special case.
My interest is in the structure/function duality, more in topological
than geometric structure. I've read D'Arcy Thompson (no relation
Nick?)
but not studied him closely, and I defer for my intuition to
Christopher
Alexander (A Pattern Language) for high-dimensional graph-relations in
a
real-world (human-built environments) context I can relate to.
Perhaps I'm more interested in Networks, though I'd like to ask the
naive question of how folks here distinguish the two... I tend to think
of Networks as Graphs with flows along edges. I think in terms of
multi-graphs (allowing multiple edges between nodes) or more precisely,
edges with multiple strengths/lengths/flows or more precisely yet I
think, with vector properties on edges...
============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
to unsubscribe http://redfish.com/mailman/listinfo/friam_redfish.com
FRIAM-COMIC http://friam-comic.blogspot.com/ by Dr. Strangelove
