Finding diverse ways to improve algebraic connectivity through multi-start optimization

DOI10.1093/COMNET/CNAB005MaRDI QIDQ4958813zbMATH OpenOpenAlexFDO

Authors Sarah MacKay, Colin Ponce, Sarah V. Osborn

Publication date 15 September 2021

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comnet/cnab005

zbMATH Keywords

determinantal point process (DPP)Fielder valueGram determinantmulti-start optimization

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Deterministic network models in operations research (90B10)

Recommendations

• Optimizing algebraic connectivity by edge rewiring
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem
• scientific article; zbMATH DE number 1263261
• On algebraic connectivity augmentation
• Upper bounds on algebraic connectivity via convex optimization
• Maximizing algebraic connectivity for certain families of graphs
• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• Connectedness of efficient solutions in multiple objective combinatorial optimization
• Maximizing Algebraic Connectivity Over Unicyclic Graphs

Cited in

(3)

• A new method optimizing the subgraph centrality of large networks
• Optimizing algebraic connectivity by edge rewiring
• Hypergraph analysis based on a compatible tensor product structure

This page was built for publication: Finding diverse ways to improve algebraic connectivity through multi-start optimization

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