“…To understand the influence of the units in the network, we can make a parallel between our document editing network and the structure of trust networks [4] where trust is implicit and represents the fact that each functional unit has to rely on the information produced or processed by other units. With such a network, we could investigate the influence that each functional unit has in this network, in terms of amount of information produced (documents in output) and in terms of amount of information received (documents in input).…”
Section: Understanding How People Influence Iterations During Documenmentioning
confidence: 99%
“…Such a method, however, would not take into consideration the possible flows that information can follow in the network, giving only a rough estimate of influence from and to direct neighbours and underestimating the possibility that a more peripheral unit could also affect a significant portion of the network. Previous research on trust networks showed that eigenvector-based centrality metrics positively correlate with nodes' degree of trust [4,20] and appeared better to describe the position of the nodes than other measures.…”
Section: Understanding How People Influence Iterations During Documenmentioning
Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.
“…To understand the influence of the units in the network, we can make a parallel between our document editing network and the structure of trust networks [4] where trust is implicit and represents the fact that each functional unit has to rely on the information produced or processed by other units. With such a network, we could investigate the influence that each functional unit has in this network, in terms of amount of information produced (documents in output) and in terms of amount of information received (documents in input).…”
Section: Understanding How People Influence Iterations During Documenmentioning
confidence: 99%
“…Such a method, however, would not take into consideration the possible flows that information can follow in the network, giving only a rough estimate of influence from and to direct neighbours and underestimating the possibility that a more peripheral unit could also affect a significant portion of the network. Previous research on trust networks showed that eigenvector-based centrality metrics positively correlate with nodes' degree of trust [4,20] and appeared better to describe the position of the nodes than other measures.…”
Section: Understanding How People Influence Iterations During Documenmentioning
Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.
“…Mutual trust is the main building block for virtual communities and crowdsourcing platforms (Agreste, De Meo, Ferrara, Piccolo, & Provetti, 2015). Research participants (teachers and students) did not express concern for the well-being, learning process and outcomes of their fellows, but concentrated on personal capability growth.…”
To cite this article: Kasperiuniene, J., Zydziunaite, V., & Eriksson, M. (2017). Stroking the net whale: a constructivist grounded theory of selfregulated learning in virtual social spaces.
“…Centrality metrics [1] provide a ubiquitous Network Science tool for the identification of the "important" nodes in a graph. They have been widely applied in a range of domains such as early detection of epidemic outbreaks [2], viral marketing [3], trust assessment in virtual communities [4], preventing catastrophic outage in power grids [5] and analysing heterogeneous networks [6].…”
Centrality metrics are a popular tool in Network Science to identify important nodes within a graph. We introduce the Potential Gain as a centrality measure that unifies many walk-based centrality metrics in graphs and captures the notion of node navigability, interpreted as the property of being reachable from anywhere else (in the graph) through short walks. Two instances of the Potential Gain (called the Geometric and the Exponential Potential Gain) are presented and we describe scalable algorithms for computing them on large graphs. We also give a proof of the relationship between the new measures and established centralities. The geometric potential gain of a node can thus be characterized as the product of its Degree centrality by its Katz centrality scores. At the same time, the exponential potential gain of a node is proved to be the product of Degree centrality by its Communicability index. These formal results connect potential gain to both the "popularity" and "similarity" properties that are captured by the above centralities.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.