Network analysis. Methodological foundations.

DOI10.1007/b106453zbMath1069.68001OpenAlexW4248776151MaRDI QIDQ2388721

No author found.

Publication date: 20 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106453

zbMATH Keywords

combinatorial optimizationconnectivitycomplex systemsgraph algorithmsnetwork designnetwork algorithmsnetwork analysissocial network analysisnetwork robustnessnetwork statisticsevolving networksgraph isomorphismsapplied graph theory

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Proceedings of conferences of miscellaneous specific interest (00B25) Graph theory (including graph drawing) in computer science (68R10) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (57)

Dynamic Competition Networks: Detecting Alliances and Leaders ⋮ Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Structural similarity: spectral methods for relaxed blockmodeling ⋮ Mining hidden links in social networks to achieve equilibrium ⋮ Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings ⋮ Updating and Downdating Techniques for Optimizing Network Communicability ⋮ Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs ⋮ Tree robustness of a graph ⋮ Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications ⋮ TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance ⋮ Evaluation of the evolution of relationships between topics over time ⋮ Spatio-temporal patterns of non-autonomous systems on hypergraphs: Turing and Benjamin–Feir mechanisms ⋮ Matrix functions in network analysis ⋮ On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations ⋮ Re-conceptualizing centrality in social networks ⋮ Ranking hubs and authorities using matrix functions ⋮ Depth-based complexity traces of graphs ⋮ Min-max communities in graphs: complexity and computational properties ⋮ Post-processing hierarchical community structures: quality improvements and multi-scale view ⋮ Axiomatic characterization of PageRank ⋮ Efficient enumeration of the optimal solutions to the correlation clustering problem ⋮ Community detection in attributed networks for global transfer market ⋮ Asymptotic bounds for clustering problems in random graphs ⋮ Ranking of network elements based on functional substructures ⋮ Unnamed Item ⋮ Web page importance ranking ⋮ Twin subgraphs and core-semiperiphery-periphery structures ⋮ Exact epidemic models on graphs using graph-automorphism driven lumping ⋮ Cooperative cross-entropy method for generating entangled networks ⋮ The many faces of graph dynamics ⋮ Average distance is submultiplicative and subadditive with respect to the strong product of graphs ⋮ Creating agent-based energy transition management models that can uncover profitable pathways to climate change mitigation ⋮ Combinatorial network abstraction by trees and distances ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ Drawing colored graphs on colored points ⋮ Weakly linear systems of fuzzy relation inequalities: the heterogeneous case ⋮ Crossing minimization in extended level drawings of graphs ⋮ A variant of the current flow betweenness centrality and its application in urban networks ⋮ On the impact of dispersal asymmetry on metapopulation persistence ⋮ On the Stability of Network Indices Defined by Means of Matrix Functions ⋮ Multi-circular Layout of Micro/Macro Graphs ⋮ LunarVis – Analytic Visualizations of Large Graphs ⋮ Sparse randomized shortest paths routing with Tsallis divergence regularization ⋮ The k-Dense Method to Extract Communities from Complex Networks ⋮ Dynamic Graph Clustering Using Minimum-Cut Trees ⋮ Design and Engineering of External Memory Traversal Algorithms for General Graphs ⋮ Group-Level Analysis and Visualization of Social Networks ⋮ Modeling and Designing Real–World Networks ⋮ Power Indices in Spanning Connectivity Games ⋮ Attachment centrality: measure for connectivity in networks ⋮ A note on the satisfactory partition problem: constant size requirement ⋮ On the Limiting Behavior of Parameter-Dependent Network Centrality Measures ⋮ On decay centrality ⋮ Group centralization of network indices ⋮ A Nash Equilibrium Based Algorithm for Mining Hidden Links in Social Networks ⋮ Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs ⋮ Memetic Graph Clustering

This page was built for publication: Network analysis. Methodological foundations.