Timeline for Random subgraph properties
Current License: CC BY-SA 4.0
21 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2021 at 10:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 15, 2021 at 20:24 | comment | added | Matthieu Latapy | @dodd I do understand your concern with the concept of real-world graph ;) I tried to give a better formulation. | |
| S Jan 15, 2021 at 19:27 | history | suggested | Matthieu Latapy | CC BY-SA 4.0 |
Made the question more rigorous and clearer (I hope).
|
| Jan 15, 2021 at 18:14 | review | Suggested edits | |||
| S Jan 15, 2021 at 19:27 | |||||
| Dec 27, 2020 at 22:44 | answer | added | Matthieu Latapy | timeline score: 2 | |
| Dec 18, 2020 at 4:39 | comment | added | markvs | It would be interesting to know examples of non-real world graphs. | |
| Dec 15, 2020 at 22:05 | comment | added | lenhhoxung | @dodd I think there are many examples for a real-world graph, like a social network, a citation graph, or a protein graph. | |
| Dec 15, 2020 at 21:28 | comment | added | markvs | It is now less understandable. There is no such thing as real world graph. The other properties hold in a complete graph. | |
| S Dec 15, 2020 at 8:58 | history | suggested | gmvh |
Added top-level tags
|
|
| Dec 15, 2020 at 8:51 | review | Suggested edits | |||
| S Dec 15, 2020 at 8:58 | |||||
| Dec 15, 2020 at 8:48 | comment | added | lenhhoxung | I re-formulated my question (two questions actually). Is it understandable now? @kodlu | |
| Dec 15, 2020 at 8:46 | history | edited | lenhhoxung | CC BY-SA 4.0 |
added 327 characters in body
|
| Dec 15, 2020 at 2:56 | review | Close votes | |||
| Dec 20, 2020 at 8:04 | |||||
| Dec 15, 2020 at 2:33 | comment | added | kodlu | You need to formulate your question precisely to attract interest. | |
| Dec 15, 2020 at 1:36 | comment | added | markvs | My intention was to show that, as formulated, the question does not make sense. | |
| Dec 15, 2020 at 1:17 | comment | added | lenhhoxung | And I think graph G has some properties of a small-world graph: small average path length and high clustering coefficient | |
| Dec 15, 2020 at 1:16 | comment | added | lenhhoxung | I didn't mention, but the graph G is in fact a real-world graph (citation graph), which is not connected, so it is not complete. | |
| Dec 15, 2020 at 1:14 | history | edited | lenhhoxung | CC BY-SA 4.0 |
added 4 characters in body
|
| Dec 15, 2020 at 0:55 | comment | added | markvs | If the graph is complete then any random subgraph is complete. If the graph is a cycle (path) and $n$ is small enough then the subgraph will be empty with positive probability. | |
| Dec 14, 2020 at 23:56 | review | First posts | |||
| Dec 15, 2020 at 2:50 | |||||
| Dec 14, 2020 at 23:55 | history | asked | lenhhoxung | CC BY-SA 4.0 |