Biomedical subjects

Jae Dong Noh

Publications and source records attributed to Jae Dong Noh.

7 recordsLinked to original sources

PubMed2004

Scale-free trees: the skeletons of complex networks.

We investigate the properties of the spanning trees of various real-world and model networks. The spanning tree representing the communication kernel of the original network is determined by maximizing the total weight of the edges, whose weights are given by the edge betweenness centralities. We find that a scale-free tree and shortcuts organize a complex network. Especially, in ubiquitous scale-free networks, it is found that the scale-free spanning tree shows very robust betweenness centrality distributions and the remaining shortcuts characterize the properties of the original network, such as the clustering coefficient and the classification of scale-free networks by the betweenness centrality distribution.

Journal Article↗

PubMed2004

Constrained spin-dynamics description of random walks on hierarchical scale-free networks.

We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule, which allows an analytic approach. We show analytically that the characteristic relaxation time scale grows algebraically with the total number of nodes N as T--N(z). From a scaling argument, we also show the power-law decay of the autocorrelation function C(sigma)(t)--t(-alpha), which is the probability to find the Ising spins in the initial state sigma after t time steps, with the state-dependent nonuniversal exponent alpha. It turns out that the power-law scaling behavior has its origin in a quasiultrametric structure of the configuration space.

Journal Article↗

PubMed2004

Random walks on complex networks.

We investigate random walks on complex networks and derive an exact expression for the mean first-passage time (MFPT) between two nodes. We introduce for each node the random walk centrality C, which is the ratio between its coordination number and a characteristic relaxation time, and show that it determines essentially the MFPT. The centrality of a node determines the relative speed by which a node can receive and spread information over the network in a random process. Numerical simulations of an ensemble of random walkers moving on paradigmatic network models confirm this analytical prediction.

Internet↗

PubMed2004

Universality class of absorbing transitions with continuously varying critical exponents.

The well-established universality classes of absorbing critical phenomena are directed percolation (DP) and directed Ising (DI) classes. Recently, the pair contact process with diffusion (PCPD) has been investigated extensively and claimed to exhibit a different type of critical phenomenon distinct from both DP and DI classes. Noticing that the PCPD possesses a long-term memory effect, we introduce a generalized version of the PCPD (GPCPD) with a parameter controlling the memory strength. The GPCPD connects the DP fixed point to the PCPD point continuously. Monte Carlo simulations strongly suggest that the GPCPD displays, to our knowledge, novel critical phenomena which are characterized by continuously varying critical exponents. The same critical behaviors are also observed in models where two species of particles are coupled cyclically. We present one possible scenario that the long-term memory may serve as a marginal perturbation to the ordinary DP fixed point.

Journal Article↗

PubMed2003

Exact scaling properties of a hierarchical network model.

We report on the exact results for the degree K, the diameter D, the clustering coefficient C, and the betweenness centrality B of a hierarchical network model with a replication factor M. Such quantities are calculated exactly with the help of recursion relations. Using the results, we show that (i). the degree distribution follows a power law P(K) approximately K-gamma with gamma=1+ln M/ln(M-1), (ii). the diameter grows logarithmically as D approximately ln N with the number of nodes N, (iii). the clustering coefficient of each node is inversely proportional to its degree, C proportional, variant 1/K, and the average clustering coefficient is nonzero in the infinite N limit, and (iv). the betweenness centrality distribution follows a power law P(B) approximately B-2. We discuss a classification scheme of scale-free networks into the universality class with the clustering property and the betweenness centrality distribution.

Journal Article↗

PubMed2002

Stability of shortest paths in complex networks with random edge weights.

We study shortest paths and spanning trees of complex networks with random edge weights. Edges which do not belong to the spanning tree are inactive in a transport process within the network. The introduction of quenched disorder modifies the spanning tree such that some edges are activated and the network diameter is increased. With analytic random-walk mappings and numerical analysis, we find that the spanning tree is unstable to the introduction of disorder and displays a phase-transitionlike behavior at zero disorder strength epsilon =0. In the infinite network-size limit (N--> infinity ), we obtain a continuous transition with the density of activated edges Phi growing like Phi approximately epsilon (1) and with the diameter-expansion coefficient Upsilon growing like Upsilon approximately epsilon (2) in the regular network, and first-order transitions with discontinuous jumps in Phi and Upsilon at epsilon=0 for the small-world (SW) network and the Barabási-Albert scale-free (SF) network. The asymptotic scaling behavior sets in when N>>N(c), where the crossover size scales as N(c) approximately epsilon (-2) for the regular network, N(c) approximately exp(alpha epsilon (-2)) for the SW network, and N(c) approximately exp(alpha|ln epsilon | epsilon (-2)) for the SF network. In a transient regime with N<<N(c), there is an infinite-order transition with Phi approximately Upsilon approximately exp[-alpha/(epsilon (2)ln N)] for the SW network and approximately exp[-alpha/(epsilon (2)ln N/ln ln N)] for the SF network. It shows that the transport pattern is practically most stable in the SF network.

Journal Article↗

PubMed2002

Numerical study of the disorder-driven roughening transition in an elastic manifold in a periodic potential.

We study the roughening transition of a (3+1)-dimensional elastic manifold, which is driven by the competition between a periodic pinning potential and a random impurity potential. The elastic manifold is modeled by a solid-on-solid-type interface model, and the universal properties of the transition from a flat phase (for strong periodic potential) to a rough phase (for strong random potential) are investigated at zero temperature using a combinatorial optimization algorithm technique. We find that the transition is a continuous one. Critical exponents are estimated numerically, and compared with analytic results and those for a periodic elastic medium.

Journal Article↗