Network theory

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

Topology of Networks in Generalized Musical Spaces

Abstract: The abstraction of musical structures (notes, melodies, chords, harmonic or rhythmic progressions, etc.) as mathematical objects in a geometrical space is one of the great accomplishments of contemporary music theory. Building on this foundation, I generalize the concept of musical spaces as networks and derive functional principles of compositional design 15 by the direct analysis of the network topology. This approach provides a novel framework for the analysis and quantification of similarity of musical objects and structures, and suggests a way to relate such measures to the human perception of different musical entities. Finally, the analysis of a single work or a corpus of compositions as complex networks provides alternative ways of interpreting the compositional process of a composer by quantifying emergent behaviors with 20 well-established statistical mechanics techniques. Interpreting the latter as probabilistic randomness in the network, I develop novel compositional design frameworks that are central to my own artistic research. One Sentence Summary: Network theory is an innovative tool for the classification of generalized musical spaces and provides a framework for the discovery or generation of functional 25 principles of compositional design.

On the measures for ranking software components

Abstract: Large software systems consist of many components some of which are more significant than others. A component is deemed significant if it plays an important role and can have a significant impact on the rest of the system when modified. Identifying such core components is important since change is inevitable as a normal course of evolution in any system and core components must be designed to minimize their impact of change. Several different graph-based strategies exist for ranking software components that can be used to identify the core components within a software system. However, each ranking strategy behaves differently and most fail to pick up all of the significant core components among their top tier of highly ranked components. In this paper, we propose a component ranking approach that models the component graph of a system as a Discrete-Time Markov Chain and uses it as a basis for component ranking. Using this approach produces results that are superior to ranking strategies based on centrality measures such as closeness, betweenness and eigenvector centrality. We demonstrate the utility of the metric and compare it against existing graph-based measures, in the analysis of Kona and JUnit, two published systems with documented architectures.

An Empirical Examination of Service Dominant Logic: The Theory of the Network

Abstract: Marketing scholars question the ability of the 4Ps to explain higher order phenomena in modern marketing. Scholars contend that marketing's historical framework, based in product centric economic theory, constrains the 4Ps ability to form a foundation for a general theory of marketing. The focus on value embedded in product fails to explain knowledge-based intangible sources of competitive advantage. In response to this concern a new dominant logic for marketing called service-dominant logic (S-D Logic) has been proposed. However, not all scholars are supportive of S-D Logic. Still nescient, S-D Logic lacks a theoretic model, operationalized constructs, and relationships between those constructs. This study addresses those deficiencies by: (1) generation of a grounded theory of a performance-oriented network; (2) empirical assessment of the S-D Logic literature; and (3) development of an inductively generated theory of S-D Logic to include constructs, relationships, outcomes, and hypothesis. This investigation provides an important set of research findings. The resultant service-oriented network theory suggests a theoretic structure for S-D Logic. Use of grounded theory provides a strong empirical foundation based in a leading edge multi-national market segment composed corporations and programs worth hundreds of billions of dollars. The analysis drew upon 44 field interviews and follow-up exchanges. Multiple member checking sessions generated practitioner confirmation of the research conclusions. The work provides actionable theoretical and practical implications. This investigation provides a link between S-D Logic as a foundation for a general theory of marketing and initial model of suggestive of such theory. For the practitioner the service-oriented network model provides actionable constructs. The antecedents identified are largely influencable by inter-firm leadership and provides them a mechanism to tailor the specific service-oriented strategy to support the desired network value propositions.

Basic network theory : with computer applications

Abstract: Basic network theory: with computer applications , Basic network theory: with computer applications , مرکز فناوری اطلاعات و اطلاع رسانی کشاورزی

Algorithm for Producing Rankings Based on Expert Surveys

Abstract: This paper develops an automated algorithm to process input data for segmented string relative rankings (SSRRs). The purpose of the SSRR methodology is to create rankings of countries, companies, or any other units based on surveys of expert opinion. This is done without the use of grading systems, which can distort the results due to varying degrees of strictness among experts. However, the original SSRR approach relies on manual application, which is highly laborious and also carries a risk of human error. This paper seeks to solve this problem by further developing the SSRR approach by employing link analysis, which is based on network theory and is similar to the PageRank algorithm used by the Google search engine. The ranking data are treated as part of a linear, hierarchical network and each unit receives a score according to how many units are positioned below it in the network. This approach makes it possible to efficiently resolve contradictions among experts providing input for a ranking. A hypertext preprocessor (PHP) script for the algorithm is included in the article’s appendix. The proposed methodology is suitable for use across a range of social science disciplines, especially economics, sociology, and political science.