cluster longest paths in a graph using R and igraph
I have some undirected graphs which are mostly made up on long strings of vertices. So most vertexes have only two edges, but occasionally these strings of vertices cross/split/merge or loop back on themselves. See example plot:
I'm trying to identify these long strings using R and igraph but no clustering algorithm in igraph gets it quite right.
I want a clustering algorithm that can identify the longest continuous paths. For example, if a path of length 5 and a path length 7 merge and continue as a path length 9. The algorithm would identify two clusters one of length 7 + 9 = 16 and the other of length 5.
r graph igraph
asked Nov 20 '18 at 16:49
falcsfalcs
2461617
add a comment |
I have some undirected graphs which are mostly made up on long strings of vertices. So most vertexes have only two edges, but occasionally these strings of vertices cross/split/merge or loop back on themselves. See example plot:
I'm trying to identify these long strings using R and igraph but no clustering algorithm in igraph gets it quite right.
I want a clustering algorithm that can identify the longest continuous paths. For example, if a path of length 5 and a path length 7 merge and continue as a path length 9. The algorithm would identify two clusters one of length 7 + 9 = 16 and the other of length 5.
r graph igraph
asked Nov 20 '18 at 16:49
falcsfalcs
2461617
1
I'm sure people are more keen to help if you provide a minimal, easily copypasteable example. Cheers
– Henrik
Nov 20 '18 at 19:20
add a comment |
I have some undirected graphs which are mostly made up on long strings of vertices. So most vertexes have only two edges, but occasionally these strings of vertices cross/split/merge or loop back on themselves. See example plot:
I'm trying to identify these long strings using R and igraph but no clustering algorithm in igraph gets it quite right.
I want a clustering algorithm that can identify the longest continuous paths. For example, if a path of length 5 and a path length 7 merge and continue as a path length 9. The algorithm would identify two clusters one of length 7 + 9 = 16 and the other of length 5.
r graph igraph
asked Nov 20 '18 at 16:49
falcsfalcs
2461617
I have some undirected graphs which are mostly made up on long strings of vertices. So most vertexes have only two edges, but occasionally these strings of vertices cross/split/merge or loop back on themselves. See example plot:
I'm trying to identify these long strings using R and igraph but no clustering algorithm in igraph gets it quite right.
I want a clustering algorithm that can identify the longest continuous paths. For example, if a path of length 5 and a path length 7 merge and continue as a path length 9. The algorithm would identify two clusters one of length 7 + 9 = 16 and the other of length 5.
r graph igraph
r graph igraph
asked Nov 20 '18 at 16:49
falcsfalcs
2461617
asked Nov 20 '18 at 16:49
falcsfalcs
2461617
asked Nov 20 '18 at 16:49
falcsfalcs
2461617
asked Nov 20 '18 at 16:49
falcsfalcs
2461617
asked Nov 20 '18 at 16:49
falcsfalcs
2461617
2461617
1
I'm sure people are more keen to help if you provide a minimal, easily copypasteable example. Cheers
– Henrik
Nov 20 '18 at 19:20
add a comment |
1
I'm sure people are more keen to help if you provide a minimal, easily copypasteable example. Cheers
– Henrik
Nov 20 '18 at 19:20
1
1
I'm sure people are more keen to help if you provide a minimal, easily copypasteable example. Cheers
– Henrik
Nov 20 '18 at 19:20
I'm sure people are more keen to help if you provide a minimal, easily copypasteable example. Cheers
– Henrik
Nov 20 '18 at 19:20
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53397749%2fcluster-longest-paths-in-a-graph-using-r-and-igraph%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53397749%2fcluster-longest-paths-in-a-graph-using-r-and-igraph%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
I'm sure people are more keen to help if you provide a minimal, easily copypasteable example. Cheers
– Henrik
Nov 20 '18 at 19:20