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
Posted Content
TL;DR: In this paper, a conceptual analysis based on recent developments in service science, S-D logic and network/systems theory is presented, which helps practitioners to better manage service and to enable efficient behaviour within multiple contexts with multiple actors and optimising inter-systemic relations.
Abstract: The purpose of this paper is to combine service science (service science, management and engineering, and SSME) and service dominant (S-D) logic contributions with the network and systems-based theories of many-to-many marketing proposed by Gummesson and the viable system approach (VSA), proposed by Italian researchers and highly diffused in Italy during the 2000s. This paper is a conceptual analysis based on recent developments in service science, S-D logic and network/systems theory. Being grounded in network theory, systems thinking and value co-creation, many-to-many marketing is found to be particularly supportive to both service science and S-D logic. It is also found that VSA, being broad, interdisciplinary and based on systems theory and resource-based theory, and with strong influences from biology, sociology and mechanics, is a key to the interpretation of complex phenomena. Both many-to-many and VSA embrace the whole and the general while still considering the detail and its contextual dependency. Both theories are highly suitable for analysing and designing service systems. The paper helps practitioners to better manage service and to enable efficient behaviour within multiple contexts with multiple actors and optimising inter-systemic relations.

119 citations

Journal ArticleDOI
TL;DR: In this paper, a new metric, κ-path centrality, and a randomized algorithm for estimating it were proposed, and it was shown empirically that nodes with high path centrality have high node betweenness centrality.
Abstract: This paper proposes an alternative way to identify nodes with high betweenness centrality. It introduces a new metric, κ-path centrality, and a randomized algorithm for estimating it, and shows empirically that nodes with high κ-path centrality have high node betweenness centrality. The randomized algorithm runs in time O(κ3 n 2−2αlog n) and outputs, for each vertex v, an estimate of its κ-path centrality up to additive error of ±n 1/2+α with probability 1 − 1/n 2. Experimental evaluations on real and synthetic social networks show improved accuracy in detecting high betweenness centrality nodes and significantly reduced execution time when compared with existing randomized algorithms.

118 citations

Journal ArticleDOI
31 May 1961
TL;DR: In this paper, the authors present an analysis of some of the significant developments in time-varying network theory which have taken place during the past decade, with the emphasis placed on three topics: 1) characterization of time changing networks, and in particular, transition from the impulsive response to the differential equation; 2) the problem of factorization, with emphasis on the contributions of Darlington, Batkov and Paul Levy; and 3) randomly changing systems and the question of stability of discrete-time systems of this type.
Abstract: This paper presents an analysis of some of the significant developments in time-varying network theory which have taken place during the past decade, with the emphasis placed on three topics: 1) characterization of time-varying networks, and in particular, transition from the impulsive response to the differential equation; 2) the problem of factorization, with emphasis on the contributions of Darlington, Batkov and Paul Levy; and 3) randomly-varying systems and, in particular, the question of stability of discrete-time systems of this type. The identification problem, the analysis of periodically-varying systems, the synthesis problem, and the filtering and prediction of nonstationary processes will be treated in Part II, to be published later.

118 citations

Journal ArticleDOI
18 Sep 2015-EPL
TL;DR: In this article, the authors proposed a quantum network theory of networks, which can open new venues to address interdisciplinary and physics challenges including progress on brain dynamics, new insights into quantum technologies, and quantum gravity.
Abstract: Network theory has unveiled the underlying structure of complex systems such as the Internet or the biological networks in the cell. It has identified universal properties of complex networks, and the interplay between their structure and dynamics. After almost twenty years of the field, new challenges lie ahead. These challenges concern the multilayer structure of most of the networks, the formulation of a network geometry and topology, and the development of a quantum theory of networks. Making progress on these aspects of network theory can open new venues to address interdisciplinary and physics challenges including progress on brain dynamics, new insights into quantum technologies, and quantum gravity.

118 citations

Journal ArticleDOI
TL;DR: EBC is based on the concept of betweenness centrality, which has been first introduced in the context of social network analysis, and measures the ''importance'' of each node in the network, and outperforms the competitor ones in all observed cases.

116 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