Search PubMed⌕ Search

Biomedical subjects

Beom Jun Kim

Publications and source records attributed to Beom Jun Kim.

At least 19 recordsLinked to original sources
PubMed2006

Dynamic behaviors in directed networks.

Motivated by the abundance of directed synaptic couplings in a real biological neuronal network, we investigate the synchronization behavior of the Hodgkin-Huxley model in a directed network. We start from the standard model of the Watts-Strogatz undirected network and then change undirected edges to directed arcs with a given probability, still preserving the connectivity of the network. A generalized clustering coefficient for directed networks is defined and used to investigate the interplay between the synchronization behavior and underlying structural properties of directed networks. We observe that the directedness of complex networks plays an important role in emerging dynamical behaviors, which is also confirmed by a numerical study of the sociological game theoretic voter model on directed networks.

Journal Article↗
PubMed2005

Instability of defensive alliances in the predator-prey model on complex networks.

A model of six-species food web is studied in the viewpoint of spatial interaction structures. Each species has two predators and two preys, and it was previously known that the defensive alliances of three cyclically predating species self-organize in two dimensions. The alliance-breaking transition occurs as either the mutation rate is increased or interaction topology is randomized in the scheme of the Watts-Strogatz model. In the former case of temporal disorder, via the finite-size scaling analysis, the transition is clearly shown to belong to the two-dimensional Ising universality class. In contrast, the geometric or spatial randomness for the latter case yields a discontinuous phase transition. The mean-field limit of the model is analytically solved and then compared with numerical results. The dynamic universality and the temporally periodic behaviors are also discussed.

Animals↗
PubMed2005

Universality class of the fiber bundle model on complex networks.

We investigate the failure characteristics of complex networks within the framework of the fiber bundle model subject to the local load sharing rule in which the load of the broken fiber is transferred only to its neighbor fibers. Although the load sharing is strictly local, it is found that the critical behavior belongs to the universality class of global load sharing where the load is transferred equally to all fibers in the system. From the numerical simulations and the analytical approach applied to the microscopic behavior, it is revealed that the emergence of a single dominant hub cluster of broken fibers causes the global load sharing effect in the failure process.

Journal Article↗
PubMed2004

Geographical coarse graining of complex networks.

We perform a renormalization-grouplike numerical analysis of geographically embedded complex networks on a two-dimensional square lattice. At each step of the coarse-graining procedure, the four vertices on each 2x2 square box are merged to a single vertex, resulting in a coarse-grained system of smaller size. Repetition of the process leads to the observation that the coarse-graining procedure does not alter the qualitative characteristics of the original scale-free network, which opens the possibility of subtracting a smaller network from the original network without destroying the important structural properties. The implication of the result is also suggested in the context of the recent study of the human brain functional network.

Animals↗
PubMed2004

Factors that predict better synchronizability on complex networks.

While shorter characteristic path length has in general been believed to enhance synchronizability of a coupled oscillator system on a complex network, the suppressing tendency of the heterogeneity of the degree distribution, even for shorter characteristic path length, has also been reported. To see this, we investigate the effects of various factors such as the degree, characteristic path length, heterogeneity, and betweenness centrality on synchronization, and find a consistent trend between the synchronization and the betweenness centrality. The betweenness centrality is thus proposed as a good indicator for synchronizability.

Computer Simulation↗
PubMed2004

Performance of networks of artificial neurons: the role of clustering.

The performance of the Hopfield neural network model is numerically studied on various complex networks, such as the Watts-Strogatz network, the Barabási-Albert network, and the neuronal network of Caenorhabditis elegans. Through the use of a systematic way of controlling the clustering coefficient, with the degree of each neuron kept unchanged, we find that the networks with the lower clustering exhibit much better performance. The results are discussed in the practical viewpoint of application, and the biological implications are also suggested.

Journal Article↗
PubMed2003

Network bipartivity.

Systems with two types of agents with a preference for heterophilous interaction produce networks that are more or less close to bipartite. We propose two measures quantifying the notion of bipartivity. The two measures-one well known and natural, but computationally intractable, and the other computationally less complex, but also less intuitive-are examined on model networks that continuously interpolate between bipartite graphs and graphs with many odd circuits. We find that the bipartivity measures increase as we tune the control parameters of the test networks to intuitively increase the bipartivity, and thus conclude that the measures are quite relevant. We also measure and discuss the values of our bipartivity measures for empirical social networks (constructed from professional collaborations, Internet communities, and field surveys). Here we find, as expected, that networks arising from romantic online interaction have high, and professional collaboration networks have low, bipartivity values. In some other cases, probably due to low average degree of the network, the bipartivity measures cannot distinguish between romantic and friendship oriented interaction.

Journal Article↗
PubMed2003

Prisoners' dilemma in real-world acquaintance networks: spikes and quasiequilibria induced by the interplay between structure and dynamics.

We study Nowak and May's spatial prisoners' dilemma game driven by mutations (random choices of suboptimal strategies) on empirical social networks. The time evolution of the cooperation level is highly complex containing spikes and steps between quasistable levels. A statistical characterization of the quasistable states and a study of the mechanisms behind the steps are given. We argue that the crucial structural ingredients causing the observed behavior is an inhomogeneous degree distribution and that the connections within vertices of highest degree are rather sparse. Based on these observations we construct model networks with a similar complex time evolution of the cooperation level.

Journal Article↗
PubMed2003

Phase transition in the Ising model on a small-world network with distance-dependent interactions.

We study the collective behavior of an Ising system on a small-world network with the interaction J(r) proportional to r(-alpha), where r represents the Euclidean distance between two nodes. In the case of alpha=0 corresponding to the uniform interaction, the system is known to possess a phase transition of the mean-field nature, while the system with the short-range interaction (alpha-->infinity) does not exhibit long-range order at any finite temperature. The Monte Carlo simulations are performed at various values of alpha, and the critical value alpha(c) beyond which the long-range order does not emerge is estimated to be 0. Thus, concluded is the absence of a phase transition in the system with the algebraically decaying interaction r(-alpha) for any nonzero positive value of alpha.

Journal Article↗
PubMed2003

Optimal size of a complex network.

We investigate the response behavior of an Ising system, driven by an oscillating field, on a small-world network, with particular attention to the effects of the system size. The responses of the magnetization to the driving field are probed by means of Monte Carlo dynamic simulations with the varied rewiring probability. It is found that at low and high temperatures the occupancy ratio, measuring how many spins follow the driving field, behaves monotonically with the system size. At intermediate temperatures, on the other hand, the occupancy ratio first grows and then reduces as the size is increased, displaying a resonancelike peak at a finite value of the system size. In all cases, further increase of the size eventually leads to saturation to finite values; the size at which saturation emerges is observed to depend on the temperature, similarly to the correlation length of the system.

Journal Article↗
PubMed2003

Dynamic critical behavior of the XY model in small-world networks.

The critical behavior of the XY model on small-world network is investigated by means of dynamic Monte Carlo simulations. We use the short-time relaxation scheme, i.e., the critical behavior is studied from the nonequilibrium relaxation to equilibrium. Static and dynamic critical exponents are extracted through the use of the dynamic finite-size scaling analysis. It is concluded that the dynamic universality class at the transition is of the mean-field nature. We also confirm numerically that the value of dynamic critical exponent is independent of the rewiring probability P for P greater, similar 0.03.

Journal Article↗
PubMed2002

Dynamic instabilities induced by asymmetric influence: prisoners' dilemma game in small-world networks.

A two-dimensional small-world-type network, subject to spatial prisoners' dilemma dynamics and containing an influential node defined as a special node, with a finite density of directed random links to the other nodes in the network, is numerically investigated. It is shown that the degree of cooperation does not remain at a steady state level but displays a punctuated equilibrium-type behavior manifested by the existence of sudden breakdowns of cooperation. The breakdown of cooperation is linked to an imitation of a successful selfish strategy of the influential node. It is also found that while the breakdown of cooperation occurs suddenly, its recovery requires longer time. This recovery time may, depending on the degree of steady state cooperation, either increase or decrease with an increasing number of long-range connections.

Behavior↗
PubMed2002

Comment on "Ising model on a small world network".

In the recent study of the Ising model on a small world network by Pekalski [Phys. Rev. E 64, 057104 (2001)], a surprisingly small value of the critical exponent beta approximately 0.0001 has been obtained for the temperature dependence of the magnetization. We perform extensive Monte Carlo simulations of the same model and conclude, via the standard finite-size scaling of various quantities, that the phase transition in the model is of the mean-field nature, in contrast to the work by Pekalski, but in accordance with other existing studies.

Comment↗
PubMed2002

Stochastic resonance in the driven Ising model on small-world networks.

We investigate the stochastic resonance phenomena in the field-driven Ising model on small-world networks. The response of the magnetization to an oscillating magnetic field is examined by means of Monte Carlo dynamic simulations, with the rewiring probability varied. At any finite value of the rewiring probability, the system is found to undergo a dynamic phase transition at a finite temperature, giving rise to double resonance peaks. While the peak in the ferromagnetic phase grows with the rewiring probability, which in the paramagnetic phase tends to reduce, indicating opposite effects of the long-range interactions on the resonance in the two phases.

Journal Article↗
PubMed2002

Vertex overload breakdown in evolving networks.

We study evolving networks based on the Barabási-Albert scale-free network model with vertices sensitive to overload breakdown. The load of a vertex is defined as the betweenness centrality of the vertex. Two cases of load limitation are considered, corresponding to the fact that the average number of connections per vertex is increasing with the network's size ("extrinsic communication activity"), or that it is constant ("intrinsic communication activity"). Avalanchelike breakdowns for both load limitations are observed. In order to avoid such avalanches we argue that the capacity of the vertices has to grow with the size of the system. An interesting irregular dynamics of the formation of the giant component (for the intrinsic communication activity case) is also studied. Implications on the growth of the Internet are discussed.

Journal Article↗
PubMed2002

Attack vulnerability of complex networks.

We study the response of complex networks subject to attacks on vertices and edges. Several existing complex network models as well as real-world networks of scientific collaborations and Internet traffic are numerically investigated, and the network performance is quantitatively measured by the average inverse geodesic length and the size of the largest connected subgraph. For each case of attacks on vertices and edges, four different attacking strategies are used: removals by the descending order of the degree and the betweenness centrality, calculated for either the initial network or the current network during the removal procedure. It is found that the removals by the recalculated degrees and betweenness centralities are often more harmful than the attack strategies based on the initial network, suggesting that the network structure changes as important vertices or edges are removed. Furthermore, the correlation between the betweenness centrality and the degree in complex networks is studied.

Journal Article↗
PubMed2002

Phase ordering on small-world networks with nearest-neighbor edges.

We investigate global phase coherence in a system of coupled oscillators on small-world networks constructed from a ring with nearest-neighbor edges. The effects of both thermal noise and quenched randomness on phase ordering are examined and compared with the global coherence in the corresponding XY model without quenched randomness. It is found that in the appropriate regime phase ordering emerges at finite temperatures, even for a tiny fraction of shortcuts. The nature of the phase transition is also discussed.

Journal Article↗