Network structure optimization for social networks by minimizing the average path length

DOI10.1007/S00607-022-01061-WMaRDI QIDQ2674429zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 12 September 2022

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-022-01061-w

zbMATH Keywords

memetic algorithmnetwork structureoptimization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Social networks; opinion dynamics (91D30)

Recommendations

• Optimization of the critical diameter and average path length of social networks
• A low complexity method for the optimization of network path length in spatially embedded networks
• Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition
• A new method optimizing the subgraph centrality of large networks
• Finding community structure in networks using a shortest-path-based k-means algorithm

Cites work

• A new method optimizing the subgraph centrality of large networks
• A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
• Collective dynamics of `small-world' networks
• Community detection in degree-corrected block models
• Community structure in social and biological networks
• Computing optimal shortcuts for networks
• Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition
• Emergence of Scaling in Random Networks
• Fast computing global structural balance in signed networks based on memetic algorithm
• Local rewiring algorithms to increase clustering and grow a small world
• Minimizing Average Shortest Path Distances via Shortcut Edge Addition
• Optimization of the critical diameter and average path length of social networks
• Reduction of Average Path Length in Binary Decision Diagrams by Spectral Methods
• Statistical mechanics of complex networks
• THE HEIDER BALANCE: A CONTINUOUS APPROACH

Cited in

(5)

• A new method optimizing the subgraph centrality of large networks
• Optimization of the critical diameter and average path length of social networks
• On the complexity of average path length for biological networks and patterns
• A low complexity method for the optimization of network path length in spatially embedded networks
• Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition

This page was built for publication: Network structure optimization for social networks by minimizing the average path length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674429)