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 published on a yearly basis
Papers
More filters
•
TL;DR: To relevant empirical analyses of regional logistics network of Hunan Province, a few optimization suggestions ofHunan Province logistics, such as Chang-Zhu-Tan as central, Hengyang,Huaihua,Yueyang,Changde as core and so on were proposed.
Abstract: Using network theory,network structural relation characteristics of degree centrality,closeness centrality,betweenness centrality,cohesive subgroup and core-periphery structure were put forward to make quantitative method of regional logistics network structural relation analysis.To relevant empirical analyses of regional logistics network of Hunan Province,a few optimization suggestions of Hunan Province logistics,such as Chang-Zhu-Tan as central,Hengyang,Huaihua,Yueyang,Changde as core and so on were proposed.
1 citations
••
TL;DR: In this paper, some major accomplishments in active network theory are summarized, and certain developments in network theory which are relevant to solid-state electronics are reviewed, specific problem areas are identified in which theoretical advances would yield important guidelines for development, as well as optimal utilization, of solid state devices.
Abstract: Some major accomplishments in active network theory are summarized, and certain developments in network theory which are relevant to solid-state electronics are reviewed. Specific problem areas are identified in which theoretical advances would yield important guidelines for development, as well as optimal utilization, of solid-state devices. Detailed suggestions are made for research investigations dealing with distributed networks and integrated circuits, statistical network theory, and multivariable network theory. The last named area is defined as that dealing with methods of combining analytically, in a manner which permits systematic synthesis of prescribed network functions and realization of optimal system performance, the variables at external terminals; the acoustical, electrical, mechanical, optical, and thermal properties of device materials; and arbitrarily imposed constraints.
1 citations
••
08 Sep 2013TL;DR: This paper proposes a novel combination of sub graph matching queries which have been studied extensively in the context of both RDF and social networks, and scoring functions and develops algorithms to compute answers to such queries.
Abstract: Classical centrality measures like betweenness, closeness, eigenvector, and degree centrality are application and user independent. They are also independent of graph semantics. However, in many applications, users have a clear idea of who they consider important in graphs where vertices and edges have properties, and the goal of this paper is to enable them to bring their knowledge to the table in defining centrality in graphs. We propose a novel combination of sub graph matching queries which have been studied extensively in the context of both RDF and social networks, and scoring functions. The resulting SMAC framework allows a user to define what he thinks are central vertices in a network via user-defined sub graph patterns and certain mathematical measures he specifies. We formally define SMAC queries and develop algorithms to compute answers to such queries. We test our algorithms on real-world data sets from CiteSeerX, Flickr, YouTube, and IMDb containing over 6M vertices and 15M edges and show that our algorithms work well in practice.
1 citations
••
01 Jan 2017TL;DR: An overview of the theory of p-modulus on networks that the authors have been developing in recent years is given, in the hope that the rich unfolding theory on network will eventually inform the classical theory on metric measure spaces, Euclidean spaces, and the complex plane.
Abstract: The notion of p-modulus was created, and continues to play a vital role, in complex analysis and geometric function theory. Here we give an overview of the theory of p-modulus on networks that we have been developing in recent years. The hope is not only to develop a flexible tool on networks that can be useful for practical applications, but also that the rich unfolding theory on network will eventually inform the classical theory on metric measure spaces, Euclidean spaces, and the complex plane. We end by offering three open problems that are purely network theory problems. To keep the paper self-contained, we have not included possible applications, both to practical problems and to more theoretic function theoretic problems. We leave those directions for another time.
1 citations
••
15 Sep 1999TL;DR: This paper proposes another minimax realization problem and proposes an algorithm to minimize the differences between capacities between vertex pairs in N, and elements of M.
Abstract: We consider a realization problem of an undirected flow network N from a matrix M We assume that M is not always a terminal capacity matrix In our previous study, we considered a problem to minimize the differences between capacities between vertex pairs in N, and elements of M We called this problem "minimax realization problem" In this paper, we propose another minimax realization problem and propose an algorithm to minimize the differences
1 citations