Searcharxiv⌕ Search

arXiv subjects

D. -H. Kim

Publications and source records attributed to D. -H. Kim.

22 records · Page 2Linked to original sources

Spin Glass Phase Transition on Scale-Free Networks

We study the Ising spin glass model on scale-free networks generated by the static model using the replica method. Based on the replica-symmetric solution, we derive the phase diagram consisting of the paramagnetic (P), ferromagnetic (F), and spin glass (SG) phases as well as the Almeida-Thouless line as functions of the degree exponent $λ$, the mean degree $K$, and the fraction of ferromagnetic interactions $r$. To reflect the inhomogeneity of vertices, we modify the magnetization $m$ and the spin glass order parameter $q$ with vertex-weights. The transition temperature $T_c$ ($T_g$) between the P-F (P-SG) phases and the critical behaviors of the order parameters are found analytically. When $2 < λ< 3$, $T_c$ and $T_g$ are infinite, and the system is in the F phase or the mixed phase for $r > 1/2$, while it is in the SG phase at $r=1/2$. $m$ and $q$ decay as power-laws with increasing temperature with different $λ$-dependent exponents. When $λ> 3$, the $T_c$ and $T_g$ are finite and related to the percolation threshold. The critical exponents associated with $m$ and $q$ depend on $λ$ for $3 < λ< 5$ ($3 < λ< 4$) at the P-F (P-SG) boundary.

cond-mat.stat-mech↗

Towards unified understanding of conductance of stretched monatomic contacts

When monatomic contacts are stretched, their conductance behaves in qualitatively different ways depending on their constituent atomic elements. Under a single assumption of resonance formation, we show that various conductance behavior can be understood in a unified way in terms of the response of the resonance to stretching. This analysis clarifies the crucial roles played by the number of valence electrons, charge neutrality, and orbital shapes.

cond-mat.mes-hall↗

Self-organized Model for Modular Complex Networks : Division and Independence

We introduce a minimal network model which generates a modular structure in a self-organized way. To this end, we modify the Barabasi-Albert model into the one evolving under the principle of division and independence as well as growth and preferential attachment (PA). A newly added vertex chooses one of the modules composed of existing vertices, and attaches edges to vertices belonging to that module following the PA rule. When the module size reaches a proper size, the module is divided into two, and a new module is created. The karate club network studied by Zachary is a prototypical example. We find that the model can reproduce successfully the behavior of the hierarchical clustering coefficient of a vertex with degree k, C(k), in good agreement with empirical measurements of real world networks.

cond-mat.stat-mech↗

The q-component static model : modeling social networks

We generalize the static model by assigning a q-component weight on each vertex. We first choose a component $(μ)$ among the q components at random and a pair of vertices is linked with a color $μ$ according to their weights of the component $(μ)$ as in the static model. A (1-f) fraction of the entire edges is connected following this way. The remaining fraction f is added with (q+1)-th color as in the static model but using the maximum weights among the q components each individual has. This model is motivated by social networks. It exhibits similar topological features to real social networks in that: (i) the degree distribution has a highly skewed form, (ii) the diameter is as small as and (iii) the assortativity coefficient r is as positive and large as those in real social networks with r reaching a maximum around $f \approx 0.2$.

cond-mat.stat-mech↗