Timeline for Graphs with dangling edges
Current License: CC BY-SA 3.0
15 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 20, 2021 at 7:30 | answer | added | Wlod AA | timeline score: 2 | |
Jul 6, 2021 at 18:16 | answer | added | Hao Chen | timeline score: 2 | |
Feb 22, 2014 at 21:25 | comment | added | darij grinberg | If I understand correctly, Feynman diagrams (e. g., §III.2 of Dominique Manchon's arXiv:0408405v2) are graphs like you want, Mirco. I've never fully understood their definition, which is perhaps unsurprising for a notion that mostly physicists care about. If you want to know more, papers by Alessandra Frabetti and Kurusch Ebrahimi-Fard might be a good place to start. | |
Feb 21, 2014 at 21:40 | answer | added | matthias beck | timeline score: 3 | |
Feb 21, 2014 at 21:03 | vote | accept | Mirco A. Mannucci | ||
Feb 21, 2014 at 19:05 | answer | added | Andrej Bauer | timeline score: 6 | |
Feb 21, 2014 at 18:36 | vote | accept | Mirco A. Mannucci | ||
Feb 21, 2014 at 18:36 | |||||
Feb 21, 2014 at 18:32 | review | Close votes | |||
Feb 22, 2014 at 15:22 | |||||
Feb 21, 2014 at 18:00 | answer | added | The Masked Avenger | timeline score: 0 | |
Feb 21, 2014 at 17:49 | comment | added | Mirco A. Mannucci | LOL! Believe it or not, you are on the right track, but allow me to keep a little secret here. What I can share has been already caught by your savvy comment: yes, I am after some kind of dynamics of graphs, say evolving graphs in which nodes attempts to find matches, by spawning "sensor-edges". These edges carry some qualifier, a type, and matches (ie real edge generation) happens only for the right sensor-edges types (at a more sophisticated level, one could assign probabilities of matching, thereby having a new theory of random graphs growth) | |
Feb 21, 2014 at 17:42 | comment | added | Noah Stein | This sounds like a fishing expedition. What questions about "standard" graphs are you hoping to generalize and answer? What sort of results are you looking for? You allude to some sort of dynamics regarding partial edges joining -- can you elaborate on this? | |
Feb 21, 2014 at 17:17 | answer | added | Arno | timeline score: 3 | |
Feb 21, 2014 at 17:03 | comment | added | Mirco A. Mannucci | Dear Alex, let me tell you the truth (albeit partial truth). This question of mine is motivated by data modeling, I have something very precise in mind which requires a few ingredients, one being these partial graphs. Now, if there is nothing there already, I can of course try to develop the math and then move to my real end, but I have learned both as a mathematician and as a data modeler that it is always a bad idea to re-invent the wheel, hence my question. If you have thought of something already, do elaborate. I am curious as to which path led you there | |
Feb 21, 2014 at 16:59 | comment | added | Alex Degtyarev | Do you really expect something drastically new out of such a theory? What about assigning types to monovalent edges (one of which being the type "missing")? Or, personally, I studies dessins d'enfants with all white vertices $1$- or $2$-valent, and tried to erase such vertices by introducing solid and hanging edges. But I gave up as I saw no advantages in this approach. | |
Feb 21, 2014 at 16:55 | history | asked | Mirco A. Mannucci | CC BY-SA 3.0 |