Searcharxiv⌕ Search

arXiv subjects

Juyong Lee

Publications and source records attributed to Juyong Lee.

23 records · Page 2Linked to original sources

Finding dominant transition pathways via global optimization of action

We present a new computational approach, Action-CSA, to sample multiple reaction pathways with fixed initial and final states through global optimization of the Onsager-Machlup action using the conformational space annealing method. This approach successfully samples not only the most dominant pathway but also many other possible paths without initial guesses on reaction pathways. Pathway space is efficiently sampled by crossover operations of a set of paths and preserving the diversity of sampled pathways. The sampling ability of the approach is assessed by finding pathways for the conformational changes of alanine dipeptide and hexane. The benchmarks demonstrate that the rank order and the transition time distribution of multiple pathways identified by the new approach are in good agreement with those of long molecular dynamics simulations. We also show that the lowest action folding pathway of the mini-protein FSD-1 identified by the new approach is consistent with previous molecular dynamics simulations and experiments.

physics.chem-ph↗

Link community detection through global optimization and the inverse resolution limit of partition density

We investigate the possibility of global optimization-based overlapping community detection, using link community framework. We first show that partition density, the original quality function used in link community detection method, is not suitable as a quality function for global optimization because it prefers breaking communities into triangles except in highly limited conditions. We analytically derive those conditions and confirm it with computational results on direct optimization of various synthetic and real-world networks. To overcome this limitation, we propose alternative approaches combining the weighted line graph transformation and existing quality functions for node-based communities. We suggest a new line graph weighting scheme, a normalized Jaccard index. Computational results show that community detection using the weighted line graphs generated with the normalized Jaccard index leads to a more accurate community structure.

physics.soc-ph↗

Extraction of hidden information by efficient community detection in networks

Currently, we are overwhelmed by a deluge of experimental data, and network physics has the potential to become an invaluable method to increase our understanding of large interacting datasets. However, this potential is often unrealized for two reasons: uncovering the hidden community structure of a network, known as community detection, is difficult, and further, even if one has an idea of this community structure, it is not a priori obvious how to efficiently use this information. Here, to address both of these issues, we, first, identify optimal community structure of given networks in terms of modularity by utilizing a recently introduced community detection method. Second, we develop an approach to use this community information to extract hidden information from a network. When applied to a protein-protein interaction network, the proposed method outperforms current state-of-the-art methods that use only the local information of a network. The method is generally applicable to networks from many areas.

physics.data-an↗

MOCSA: multiobjective optimization by conformational space annealing

We introduce a novel multiobjective optimization algorithm based on the conformational space annealing (CSA) algorithm, MOCSA. It has three characteristic features: (a) Dominance relationship and distance between solutions in the objective space are used as the fitness measure, (b) update rules are based on the fitness as well as the distance between solutions in the decision space and (c) it uses a constrained local minimizer. We have tested MOCSA on 12 test problems, consisting of ZDT and DTLZ test suites. Benchmark results show that solutions obtained by MOCSA are closer to the Pareto front and covers a wider range of the objective space than those by the elitist non-dominated sorting genetic system (NSGA2).

physics.comp-ph↗

Mod-CSA: Modularity optimization by conformational space annealing

We propose a new modularity optimization method, Mod-CSA, based on stochastic global optimization algorithm, conformational space annealing (CSA). Our method outperforms simulated annealing in terms of both efficiency and accuracy, finding higher modularity partitions with less computational resources required. The high modularity values found by our method are higher than, or equal to, the largest values previously reported. In addition, the method can be combined with other heuristic methods, and implemented in parallel fashion, allowing it to be applicable to large graphs with more than 10000 nodes.

physics.comp-ph↗