Mixing
It is possible for the nodes of a network to have a different total cost. If they have the same value in...
$begingroup$
I do same simulations with randoms networks and for each network and calculates different measures such degree centrality. In the network is likely more than one node to have the highest degree value. For the calculation i used the adjacency matrix.
For these nodes I calculate the total cost and I use the following code.
for n = 1 : num_nodes
% u is the node have the highest degree value
[distanse,~] = dijkstra(treeAdj_from_adj,n,u);
Cost_of_median_tree = Cost_of_median_tree + (distanse * weight_of_vertex(u));
end
This is my results from my simulation of degree centrality :
# RC Time_execuson Total_Cost Posision_of_node Time*Cost
0.250000 0.000399 466.000000 59 0.186120
0.250000 0.000399 471.000000 85 0.188117
0.250000 0.000399 461.000000 164 0.184123
0.250000 0.000399 476.000000 189 0.190114
0.250000 0.000399 472.000000 195 0.188516
0.250000 0.000399 477.000000 198 0.190513
Nobody knows if the nodes have different total cost???
graph-theory algebraic-graph-theory spectral-graph-theory network
asked Jan 17 at 22:21
Giannis AggelisGiannis Aggelis
61
$endgroup$
add a comment |
$begingroup$
I do same simulations with randoms networks and for each network and calculates different measures such degree centrality. In the network is likely more than one node to have the highest degree value. For the calculation i used the adjacency matrix.
For these nodes I calculate the total cost and I use the following code.
for n = 1 : num_nodes
% u is the node have the highest degree value
[distanse,~] = dijkstra(treeAdj_from_adj,n,u);
Cost_of_median_tree = Cost_of_median_tree + (distanse * weight_of_vertex(u));
end
This is my results from my simulation of degree centrality :
# RC Time_execuson Total_Cost Posision_of_node Time*Cost
0.250000 0.000399 466.000000 59 0.186120
0.250000 0.000399 471.000000 85 0.188117
0.250000 0.000399 461.000000 164 0.184123
0.250000 0.000399 476.000000 189 0.190114
0.250000 0.000399 472.000000 195 0.188516
0.250000 0.000399 477.000000 198 0.190513
Nobody knows if the nodes have different total cost???
graph-theory algebraic-graph-theory spectral-graph-theory network
asked Jan 17 at 22:21
Giannis AggelisGiannis Aggelis
61
$endgroup$
$begingroup$
It is quite hard to understand what is the problem you are having and answer your question due to missing context and details.
$endgroup$
– dtldarek
Jan 18 at 9:44
$begingroup$
what I forgot to say that weight_of_vertex is a table who has in all his positions the value 1. Τhen the total cost should not be the same in these nodes (59,85...198)? @dtldarek
$endgroup$
– Giannis Aggelis
Jan 18 at 22:17
add a comment |
$begingroup$
I do same simulations with randoms networks and for each network and calculates different measures such degree centrality. In the network is likely more than one node to have the highest degree value. For the calculation i used the adjacency matrix.
For these nodes I calculate the total cost and I use the following code.
for n = 1 : num_nodes
% u is the node have the highest degree value
[distanse,~] = dijkstra(treeAdj_from_adj,n,u);
Cost_of_median_tree = Cost_of_median_tree + (distanse * weight_of_vertex(u));
end
This is my results from my simulation of degree centrality :
# RC Time_execuson Total_Cost Posision_of_node Time*Cost
0.250000 0.000399 466.000000 59 0.186120
0.250000 0.000399 471.000000 85 0.188117
0.250000 0.000399 461.000000 164 0.184123
0.250000 0.000399 476.000000 189 0.190114
0.250000 0.000399 472.000000 195 0.188516
0.250000 0.000399 477.000000 198 0.190513
Nobody knows if the nodes have different total cost???
graph-theory algebraic-graph-theory spectral-graph-theory network
asked Jan 17 at 22:21
Giannis AggelisGiannis Aggelis
61
$endgroup$
I do same simulations with randoms networks and for each network and calculates different measures such degree centrality. In the network is likely more than one node to have the highest degree value. For the calculation i used the adjacency matrix.
For these nodes I calculate the total cost and I use the following code.
for n = 1 : num_nodes
% u is the node have the highest degree value
[distanse,~] = dijkstra(treeAdj_from_adj,n,u);
Cost_of_median_tree = Cost_of_median_tree + (distanse * weight_of_vertex(u));
end
This is my results from my simulation of degree centrality :
# RC Time_execuson Total_Cost Posision_of_node Time*Cost
0.250000 0.000399 466.000000 59 0.186120
0.250000 0.000399 471.000000 85 0.188117
0.250000 0.000399 461.000000 164 0.184123
0.250000 0.000399 476.000000 189 0.190114
0.250000 0.000399 472.000000 195 0.188516
0.250000 0.000399 477.000000 198 0.190513
Nobody knows if the nodes have different total cost???
graph-theory algebraic-graph-theory spectral-graph-theory network
graph-theory algebraic-graph-theory spectral-graph-theory network
asked Jan 17 at 22:21
Giannis AggelisGiannis Aggelis
61
asked Jan 17 at 22:21
Giannis AggelisGiannis Aggelis
61
asked Jan 17 at 22:21
Giannis AggelisGiannis Aggelis
61
asked Jan 17 at 22:21
Giannis AggelisGiannis Aggelis
61
asked Jan 17 at 22:21
Giannis AggelisGiannis Aggelis
61
61
$begingroup$
It is quite hard to understand what is the problem you are having and answer your question due to missing context and details.
$endgroup$
– dtldarek
Jan 18 at 9:44
$begingroup$
what I forgot to say that weight_of_vertex is a table who has in all his positions the value 1. Τhen the total cost should not be the same in these nodes (59,85...198)? @dtldarek
$endgroup$
– Giannis Aggelis
Jan 18 at 22:17
add a comment |
$begingroup$
It is quite hard to understand what is the problem you are having and answer your question due to missing context and details.
$endgroup$
– dtldarek
Jan 18 at 9:44
$begingroup$
what I forgot to say that weight_of_vertex is a table who has in all his positions the value 1. Τhen the total cost should not be the same in these nodes (59,85...198)? @dtldarek
$endgroup$
– Giannis Aggelis
Jan 18 at 22:17
$begingroup$
It is quite hard to understand what is the problem you are having and answer your question due to missing context and details.
$endgroup$
– dtldarek
Jan 18 at 9:44
$begingroup$
It is quite hard to understand what is the problem you are having and answer your question due to missing context and details.
$endgroup$
– dtldarek
Jan 18 at 9:44
$begingroup$
what I forgot to say that weight_of_vertex is a table who has in all his positions the value 1. Τhen the total cost should not be the same in these nodes (59,85...198)? @dtldarek
$endgroup$
– Giannis Aggelis
Jan 18 at 22:17
$begingroup$
what I forgot to say that weight_of_vertex is a table who has in all his positions the value 1. Τhen the total cost should not be the same in these nodes (59,85...198)? @dtldarek
$endgroup$
– Giannis Aggelis
Jan 18 at 22:17
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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
},
noCode: 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%2fmath.stackexchange.com%2fquestions%2f3077600%2fit-is-possible-for-the-nodes-of-a-network-to-have-a-different-total-cost-if-the%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 Mathematics Stack Exchange!
- 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.
Use MathJax to format equations. MathJax reference.
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%2fmath.stackexchange.com%2fquestions%2f3077600%2fit-is-possible-for-the-nodes-of-a-network-to-have-a-different-total-cost-if-the%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
$begingroup$
It is quite hard to understand what is the problem you are having and answer your question due to missing context and details.
$endgroup$
– dtldarek
Jan 18 at 9:44
$begingroup$
what I forgot to say that weight_of_vertex is a table who has in all his positions the value 1. Τhen the total cost should not be the same in these nodes (59,85...198)? @dtldarek
$endgroup$
– Giannis Aggelis
Jan 18 at 22:17