Timeline for Expected Value for a Connected Graph
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 5, 2013 at 17:08 | answer | added | Ilya Bogdanov | timeline score: 1 | |
| Dec 5, 2013 at 16:21 | comment | added | heartwork | An undirected graph. | |
| Dec 5, 2013 at 16:10 | comment | added | heartwork | For the complete graph no matter how you label the nodes (N! cases) indeed the set contains exactly one value and the expected value is 1 (the worst case). I am looking for an upper bound. For example when N=2 this is 1 and for N=3 maximum expected value that can be obtained is 5/3. | |
| Dec 5, 2013 at 16:02 | comment | added | Waldemar | What are the connectivity assumptions of the graph? If I understand you correctly for a complete (fully connected) graph the cardinality of this set is equal to 1. | |
| Dec 5, 2013 at 15:58 | history | edited | heartwork | CC BY-SA 3.0 |
added 1 characters in body
|
| Dec 5, 2013 at 15:32 | history | edited | heartwork | CC BY-SA 3.0 |
deleted 1 characters in body
|
| Dec 5, 2013 at 11:27 | history | asked | heartwork | CC BY-SA 3.0 |