<--- Back to Details
First PageDocument Content
Networks / Network analysis / Algebraic graph theory / Centrality / Betweenness centrality / Scale-free network / Shortest path problem / Complex network / Small-world network / Graph theory / Mathematics / Network theory
Date: 2012-07-04 07:18:15
Networks
Network analysis
Algebraic graph theory
Centrality
Betweenness centrality
Scale-free network
Shortest path problem
Complex network
Small-world network
Graph theory
Mathematics
Network theory

Paper Diffusion in Networks

Add to Reading List

Source URL: www.nit.eu

Download Document from Source Website

File Size: 1,48 MB

Share Document on Facebook

Similar Documents

A network reduction method inducing scale-free degree distribution Nicolas Martin, Paolo Frasca, Carlos Canudas de Wit To cite this version: Nicolas Martin, Paolo Frasca, Carlos Canudas de Wit. A network reduction method

DocID: 1tVOv - View Document

A Scale-Free Network Model with Arbitrary Clustering Petter Holme Department of Theoretical Physics, Ume˚a University, Sweden 2th August 2001

DocID: 1sCKK - View Document

Network theory / Digital media / Graph theory / Social networks / Technology / New media / Stochastic processes / BarabsiAlbert model / Evolving networks / Scale-free network / Social networking service / Preferential attachment

Growth of the Flickr Social Network Alan Mislove Hema Swetha Koppula Krishna P. Gummadi

DocID: 1rtcC - View Document

Network theory / Academia / Operations research / Mathematics / Time-varying network / Scale-free network / Burstiness / Climate as complex networks / Community structure / Social network / Degree distribution

OPEN SUBJECT AREAS: COMPLEX NETWORKS Activity clocks: spreading dynamics on temporal networks of human contact

DocID: 1rjmg - View Document

Graph theory / Mathematical analysis / Statistics / Probability distributions / Network theory / Exponentials / Power law / Random graph / Logarithm / Pareto distribution / Scale-free network / Degree distribution

i i “imvol2” — — 13:06 — page 431 — #1 i

DocID: 1qMDg - View Document