메뉴 건너뛰기




Volumn 379, Issue 2, 2007, Pages 714-726

Effect of node deleting on network structure

Author keywords

Complex networks; Node deleting; Structure

Indexed keywords

CORRELATION METHODS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; STATISTICAL MECHANICS;

EID: 34247488314     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2007.02.039     Document Type: Article
Times cited : (23)

References (45)
  • 39
    • 34247524541 scopus 로고    scopus 로고
    • S. Maslov, K. Sneppen, A. Zaliznyak, e-print cond-mat/0205379.
  • 44
    • 34247536239 scopus 로고    scopus 로고
    • a. Thus the analysis here is a qualitative one and only suit for the condition of slight node deletion in the model.
  • 45
    • 34247513854 scopus 로고    scopus 로고
    • Another way to represent degree correlation is to calculate the mean degree of the nearest neighbors of a vertex as a function of the degree k of that vertex. Although such a way is explicit to characterize degree correlation for highly heterogeneously organized networks, for less heterogeneous networks (this is the case in the proposed model when the intensity of node deleting increases, see Fig. 2), it may be very nosy and difficult to interpret. So here we adopt the assortativity coefficient r to characterize degree correlation in the model.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.