Timeline for Why not have many edges instead of one edge connecting to many nodes (in hypergraphs)
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 25, 2018 at 23:38 | vote | accept | Lance Pollard | ||
| Feb 25, 2018 at 20:36 | comment | added | Peter Heinig | Let us continue this discussion in chat. | |
| Feb 25, 2018 at 20:34 | comment | added | Lance Pollard | That helps, I guess in programming there is a lot of extra implicit information you have available that may make an ordinary graph into a hypergraph. | |
| Feb 25, 2018 at 20:21 | comment | added | Peter Heinig | @lancejpollard: sorry, I believed that writing this would automatically open up a link to a chat. Actually, I have never used the chat and don't know how to do this. So I try to clarify this briefly here: what you say is very relevant: you say "if you use the time information...you would be able"; indeed, but an ordinary graph, i.e. 'symmetric irreflexive relation on a set' does *not offer any possibility to 'store' the time-information'. All information contained in a graph is who is connected with whom. Does that help? | |
| Feb 25, 2018 at 20:16 | comment | added | Peter Heinig | @lancejpollard: Let us continue this discussion in chat. | |
| Feb 25, 2018 at 20:15 | comment | added | Lance Pollard | @PeterHeinig but if you use the time information and also the paper information (which paper was collaborated on), you would be able to figure it out. I am still confused. | |
| Feb 25, 2018 at 20:12 | comment | added | Lance Pollard | @Charles I'm thinking about this from a programming perspective. You could have Larry-Paper1, Curly-Paper1, Moe-Paper1 as well as Larry-Paper2, Curly-Paper2, Curly-Paper3, Moe-Paper3... Then you would just combine the information from all the edges and figure out what you're saying, it seems like the same information. Not sure what I'm missing. | |
| Feb 25, 2018 at 19:57 | comment | added | Peter Heinig | @lancejpollard: no, one cannot possiblly do this with an ordinary graph. To do what Charles explained to you, one would have to use edgecolored graphs. The essence is this: you propose to encode the information 'Persons X,Y,Z simultaneously collaborated (in doing something)' by putting the three edges XY, YZ, ZX into the graph. So far so good. But the rule you propose would create the exact same graph in the following genuinely distinct scenario: 'Persons X and Y collaborated at time t_0', 'Persons Y and Z collaborated at time t_1>t_0', 'Persons Z and X collaborated at time t_2>t_1>t_0'. | |
| Feb 25, 2018 at 19:56 | comment | added | Charles | @lancejpollard In the graph you’d have the same 3 edges either way: Larry—Curly, Curly—Moe, and Larry—Moe. With the hypergraph you could have these edges, a Larry-Curly-Moe edge/tentacle, or any combination thereof. | |
| Feb 25, 2018 at 19:31 | comment | added | Lance Pollard | You could still do that with a basic graph, please explain how you can't do that with a basic graph. Not sure what I'm missing (coming from a programming perspective). | |
| Feb 25, 2018 at 19:24 | history | edited | Charles | CC BY-SA 3.0 |
Fix spelling
|
| Feb 25, 2018 at 19:19 | history | answered | Charles | CC BY-SA 3.0 |