mdh.sePublications

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt166",{id:"formSmash:upper:j_idt166",widgetVar:"widget_formSmash_upper_j_idt166",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt167_j_idt169",{id:"formSmash:upper:j_idt167:j_idt169",widgetVar:"widget_formSmash_upper_j_idt167_j_idt169",target:"formSmash:upper:j_idt167:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

PageRank, Connecting a Line of Nodes with a Complete GraphPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
2016 (English)In: Engineering Mathematics II: Algebraic, Stochastic and Analysis Structures for Networks, Data Classification and Optimization / [ed] Sergei Silvestrov; Milica Rancic, Springer, 2016Chapter in book (Refereed)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Springer, 2016.
##### Series

Springer Proceedings in Mathematics and Statistics, ISSN 2194-1009 ; 179
##### Keywords [en]

PageRank, random walk, graph, linear system, subgraph
##### National Category

Computational Mathematics Discrete Mathematics Probability Theory and Statistics
##### Research subject

Mathematics/Applied Mathematics
##### Identifiers

URN: urn:nbn:se:mdh:diva-33379DOI: 10.1007/978-3-319-42105-6_12Scopus ID: 2-s2.0-85012922095ISBN: 978-3-319-42104-9 (print)ISBN: 978-3-319-42105-6 (print)OAI: oai:DiVA.org:mdh-33379DiVA, id: diva2:1034023
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt477",{id:"formSmash:j_idt477",widgetVar:"widget_formSmash_j_idt477",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt483",{id:"formSmash:j_idt483",widgetVar:"widget_formSmash_j_idt483",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt489",{id:"formSmash:j_idt489",widgetVar:"widget_formSmash_j_idt489",multiple:true}); Available from: 2016-10-11 Created: 2016-10-11 Last updated: 2019-01-28Bibliographically approved
##### In thesis

The focus of this article is the PageRank algorithm originally defined by S. Brin and L. Page as the stationary distribution of a certain random walk on a graph used to rank homepages on the Internet. We will attempt to get a better understanding of how PageRank changes after you make some changes to the graph such as adding or removing edge between otherwise disjoint subgraphs. In particular we will take a look at link structures consisting of a line of nodes or a complete graph where every node links to all others and different ways to combine the two. Both the ordinary normalized version of PageRank as well as a non-normalized version of PageRank found by solving corresponding linear system will be considered. We will see that it is possible to find explicit formulas for the PageRank in some simple link structures and using these formulas take a more in-depth look at the behavior of the ranking as the system changes.

1. PageRank in Evolving Networks and Applications of Graphs in Natural Language Processing and Biology$(function(){PrimeFaces.cw("OverlayPanel","overlay1039463",{id:"formSmash:j_idt777:0:j_idt781",widgetVar:"overlay1039463",target:"formSmash:j_idt777:0:parentLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

doi
isbn
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1243",{id:"formSmash:j_idt1243",widgetVar:"widget_formSmash_j_idt1243",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1296",{id:"formSmash:lower:j_idt1296",widgetVar:"widget_formSmash_lower_j_idt1296",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1297_j_idt1299",{id:"formSmash:lower:j_idt1297:j_idt1299",widgetVar:"widget_formSmash_lower_j_idt1297_j_idt1299",target:"formSmash:lower:j_idt1297:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});