메뉴 건너뛰기




Volumn 66, Issue 1, 2002, Pages

Scaling exponents and clustering coefficients of a growing random network

Author keywords

[No Author keywords available]

Indexed keywords

DIFFUSION; EIGENVALUES AND EIGENFUNCTIONS; INTEGRAL EQUATIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES; SET THEORY; THERMODYNAMICS;

EID: 41349104838     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.66.016125     Document Type: Article
Times cited : (12)

References (16)
  • 3
    • 85036432869 scopus 로고    scopus 로고
    • If the node-degree distribution looks like a power law with the exponent lesser than (Formula presented), its tail must have a different exponent or have some sort of cutoff, since the average number of edges connected to one node should be finite. A cutoff in the distribution is observed in the present work
    • If the node-degree distribution looks like a power law with the exponent lesser than (Formula presented), its tail must have a different exponent or have some sort of cutoff, since the average number of edges connected to one node should be finite. A cutoff in the distribution is observed in the present work.
  • 13
    • 85036379037 scopus 로고    scopus 로고
    • B. Stroustrup, (Formula presented) Programming Language, 3rd ed. (Addison-Wesley, Reading, MA, 1997)
    • B. Stroustrup, (Formula presented) Programming Language, 3rd ed. (Addison-Wesley, Reading, MA, 1997).


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