Models, Algorithms and Technologies for Network Analysis - Info and Reading Options

Open Data:

Preface; Contents; A Method of Static and Dynamic Pattern Analysisof Innovative Development of Russian Regions in the Long Run; 1 Introduction; 2 Method Description; 2.1 Basic System of Indicators; 2.2 Description of the Pattern Construction; 3 Results; References; Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering; 1 Introduction; 2 Mathematical Programming-Based Clustering Refinement; 2.1 A MIQP Mathematical Programming Model; 2.2 Splitting and Merging Clusters; 2.3 Fixing Integer Variables; 3 Computational Results; 4 Conclusions; References ; Market Graph Construction Using the Performance Measure of Similarity1 Introduction; 2 Stock Market Graph Models and Their Modification; 3 Data of the Russian and US Stock Markets; 4 The Comparative Analysis of the Russian and US Stock Markets Models; 4.1 Distribution of Performance Measure Values; 4.2 Edge Density and Degree Distribution; 4.3 Clustering Coefficient; 5 Conclusions; References; The Flatness Theorem for Some Class of Polytopesand Searching an Integer Point; 1 Introduction; 2 Results; References; How Independent Are Stocks in an Independent Setof a Market Graph; 1 Introduction ; 2 Statement of the Problem3 Two Tests of Independence; 3.1 Simple Test of Independence; 3.2 Classical Test of Independence; 4 Comparison Analysis; 5 Numerical Results; 6 Conclusion; References; Analysis of Russian Industries in the Stock Market; 1 Introduction; 2 General Concepts and Definitions; 3 Analysis of Industries in the Russian Market; 3.1 Electricity, Gas and Water Supply Branch; 3.2 Mining and Quarrying Branch; 3.3 Chemicals and Chemical Products Branch; 4 Cluster Analysis of the Russian Market; 5 Conclusion; Appendix; References ; A Particle Swarm Optimization Algorithm for the Multicast Routing Problem1 Introduction; 2 The Multicast Routing Problem; 3 Evolutionary Algorithms for the Multicast Routing Problem; 4 Particle Swarm Optimization with Combined Local and Global Expanding Neighborhood Topology (PSOLGENT); 4.1 Path Representation; 4.2 Variable Neighborhood Search; 5 Results and Discussion; 6 Conclusions; References; König Graphs for 4-Paths; 1 Introduction; 2 Some Basic Properties; 3 4-Widening; 4 Forbidden Subgraphs; 5 Widened Subdivisions of Bipartite Graph; References ; A Hybrid Metaheuristic for Routing on Multicast Networks1 Introduction; 2 Delay-Constrained Multicast Routing; 2.1 MIP Model for the DCMRP; 2.2 DCMRP and the Steiner Problem; 3 GRASP Approach for DCMRP; 3.1 GRASP Constructor; 3.2 Speeding Up the GRASP Constructor; 3.3 GRASP Construction Phase for DCMRC; 3.4 Variable Neighborhood Search; 3.5 Path Relinking; 4 Computational Results; 5 Concluding Remarks; References; Possible Ways of Applying Citations Network Analysisto a Scientific Writing Assistant; 1 Introduction; 1.1 Related Work; 2 Methodology; 2.1 Data Description; 3 Analysis ; This volume compiles the major results of conference participants from the "Third International Conference in Network Analysis" held at the Higher School of Economics, Nizhny Novgorod in May 2013, with the aim to initiate further joint research among different groups. The contributions in this book cover a broad range of topics relevant to the theory and practice of network analysis, including the reliability of complex networks, software, theory, methodology, and applications. Network analysis has become a major research topic over the last several years. The broad range of applications

Search for “Models, Algorithms and Technologies for Network Analysis” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Models, Algorithms and Technologies for Network Analysis” in Libraries Near You:

Read or borrow “Models, Algorithms and Technologies for Network Analysis” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Models, Algorithms and Technologies for Network Analysis” at a library near you.