scispace - formally typeset
Search or ask a question
Topic

Network theory

About: Network theory is a research topic. Over the lifetime, 2257 publications have been published within this topic receiving 109864 citations.


Papers
More filters
Dissertation
20 May 2011
TL;DR: The main focus will be on the dominant eigenpair of the adjacency matrix representing a graph, as many different centrality measures for networks are cast in terms of eigenvalue problems.
Abstract: The purpose of this paper is to investigate methods for analyzing networks from an algebraic perspective. The main focus will be on the dominant eigenpair of the adjacency matrix representing a graph, as many different centrality measures for networks are cast in terms of eigenvalue problems. We will see how it is affected by small perturbations to the graph and also propose methods for estimating these changes. This analysis will be justified from the ground up, only assuming basic elements of linear algebra.

5 citations

Journal ArticleDOI
TL;DR: This article suggests that the standard reference model that places backbones at the center of the architecture should be replaced with a radically different vision: a stack of centralized star networks, each centered on one of the leading content providers.
Abstract: Paul Baran’s seminal 1964 article “On Distributed Communications Networks” that first proposed packet switching also advanced an underappreciated vision of network architecture: a lattice-like, distributed network, in which each node of the Internet would be homogeneous and equal in status to all other nodes. Scholars who have subsequently embraced the concept of a lattice-like network approach have largely overlooked the extent to which it is both inconsistent with network theory (associated with the work of Duncan Watts and Albert-Laszlo Barabasi), which emphasizes the importance of short cuts and hubs in enabling networks to scale, and the actual way, the Internet initially deployed, which relied on a three-tiered, hierarchical architecture that was actually what Baran called a decentralized network. However, empirical studies reveal that the Internet’s architecture is changing: it is in the process of becoming flatter and less hierarchical, as large content providers build extensive wide area networks and undersea cables to connect directly to last-mile networks. This change is making the network more centralized rather than becoming more distributed. As a result, this article suggests that the standard reference model that places backbones at the center of the architecture should be replaced with a radically different vision: a stack of centralized star networks, each centered on one of the leading content providers.

5 citations

Journal ArticleDOI
TL;DR: In this paper, a study of a large financial services provider showed that a sudden and substantial reduction in the number of formal positions affects an organization's voluntary ideation network in unexpected ways and that the network of relations maintained to voluntarily (informally) exchange new ideas within a firm is more resilient to exogenous restructuring than the current literature suggests.

5 citations

Journal ArticleDOI
TL;DR: The results of computer simulations for some examples of networks, in particular, for the popular social network "VKontakte", as well as the comparing with the PageRank method are presented.
Abstract: The betweenness centrality is one of the basic concepts in the analysis of the social networks. Initial definition for the betweenness of a node in the graph is based on the fraction of the number of geodesics (shortest paths) between any two nodes that given node lies on, to the total number of the shortest paths connecting these nodes. This method has polynomial complexity. We propose a new concept of the betweenness centrality for weighted graphs using the methods of cooperative game theory. The characteristic function is determined by special way for different coalitions (subsets of the graph). Two approaches are used to determine the characteristic function. In the first approach the characteristic function is determined via the number of direct and indirect weighted connecting paths in the coalition. In the second approach the coalition is considered as an electric network and the characteristic function is determined as a total current in this network. We use the Kirchhoff's law. After that the betweenness centrality is determined as the Myerson value. The results of computer simulations for some examples of networks, in particular, for the popular social network "VKontakte", as well as the comparing with the PageRank method are presented.

5 citations


Network Information
Related Topics (5)
Empirical research
51.3K papers, 1.9M citations
73% related
Competitive advantage
46.6K papers, 1.5M citations
71% related
Supply chain
84.1K papers, 1.7M citations
71% related
Organizational learning
32.6K papers, 1.6M citations
70% related
Cluster analysis
146.5K papers, 2.9M citations
70% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202319
202240
202175
2020109
201989
2018115