activity
19982010
most citedBetweenness centrality correlation in social networks

324 citations · 2.1k across the 23 of their papers we have counts for

collaborators

23 papers

physics.soc-ph2010★ 61 cited

Complete trails of co-authorship network evolution

Deokjae Lee, K. -I. Goh, B. Kahng +1

The rise and fall of a research field is the cumulative outcome of its intrinsic scientific value and social coordination among scientists. The structure of the social component is…

cond-mat.stat-mech2010★ 63 cited

Spectral dimensions of hierarchical scale-free networks with shortcuts

S. Hwang, C. -K Yun, D. -S. Lee +2

The spectral dimension has been widely used to understand transport properties on regular and fractal lattices. Nevertheless, it has been little studied for complex networks such a…

cond-mat.stat-mech2009★ 103 cited

Cluster aggregation model for discontinuous percolation transition

Y. S. Cho, B. Kahng, D. Kim

The evolution of the Erdős-Rényi (ER) network by adding edges can be viewed as a cluster aggregation process. Such ER processes can be described by a rate equation for the evolutio…

cond-mat.stat-mech2009★ 176 cited

Percolation Transitions in Scale-Free Networks under Achlioptas Process

Y. S. Cho, J. S. Kim, J. Park +2

It has been recently shown that the percolation transition is discontinuous in Erdős-Rényi networks and square lattices in two dimensions under the Achlioptas Process (AP). Here, w…

cond-mat.stat-mech2009★ 3 cited

Disassortativity of random critical branching trees

J. S. Kim, B. Kahng, D. Kim

Random critical branching trees (CBTs) are generated by the multiplicative branching process, where the branching number is determined stochastically, independent of the degree of…

cond-mat.stat-mech2007

Spectral densities of scale-free networks

D. Kim, B. Kahng

The spectral densities of the weighted Laplacian, random walk and weighted adjacency matrices associated with a random complex network are studied using the replica method. The lin…