Assortative Mixing in Networks
M. Newman.
Physical Review Letters 89 (20): 208701 (Октябрь 2002)

A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. Here we measure mixing patterns in a variety of networks and find that social networks are mostly assortatively mixed, but that technological and biological networks tend to be disassortative. We propose a model of an assortatively mixed network, which we study both analytically and numerically. Within this model we find that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.

URL

http://link.aps.org/doi/10.1103/PhysRevLett.89.208701

искать в

К этой публикации ещё не было создано рецензий.

распределение оценок

средняя оценка пользователей0,0 из 5.0 на основе 0 рецензий

Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)

@article{newman2002assortative,
  abstract = {A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. Here we measure mixing patterns in a variety of networks and find that social networks are mostly assortatively mixed, but that technological and biological networks tend to be disassortative. We propose a model of an assortatively mixed network, which we study both analytically and numerically. Within this model we find that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.},
  added-at = {2009-06-10T10:14:02.000+0200},
  author = {Newman, M. E. J.},
  biburl = {https://puma.uni-kassel.de/bibtex/23ba2913f29e817d122b41e8d78aeeecf/jaeschke},
  doi = {10.1103/PhysRevLett.89.208701},
  interhash = {7265c6dc287861591f52e46b17404a08},
  intrahash = {3ba2913f29e817d122b41e8d78aeeecf},
  journal = {Physical Review Letters},
  keywords = {assortative author graph mixing newman sna analysis network social},
  month = oct,
  number = 20,
  pages = 208701,
  publisher = {American Physical Society},
  timestamp = {2011-12-22T07:55:10.000+0100},
  title = {Assortative Mixing in Networks},
  url = {http://link.aps.org/doi/10.1103/PhysRevLett.89.208701},
  volume = 89,
  year = 2002
}

%0 Journal Article
%1 newman2002assortative
%A Newman, M. E. J.
%D 2002
%I American Physical Society
%J Physical Review Letters
%K assortative author graph mixing newman sna analysis network social
%N 20
%P 208701
%R 10.1103/PhysRevLett.89.208701
%T Assortative Mixing in Networks
%U http://link.aps.org/doi/10.1103/PhysRevLett.89.208701
%V 89
%X A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. Here we measure mixing patterns in a variety of networks and find that social networks are mostly assortatively mixed, but that technological and biological networks tend to be disassortative. We propose a model of an assortatively mixed network, which we study both analytically and numerically. Within this model we find that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.

PUMA

Assortative Mixing in Networks
M. Newman.
Physical Review Letters 89 (20): 208701 (Октябрь 2002)

Tags

Пользователи данного ресурса

Комментарии и рецензии

Цитировать эту публикацию

PUMA

Assortative Mixing in NetworksM. Newman. Physical Review Letters 89 (20): 208701 (Октябрь 2002)

Tags

Пользователи данного ресурса

Комментарии и рецензии

Цитировать эту публикацию

Assortative Mixing in Networks
M. Newman.
Physical Review Letters 89 (20): 208701 (Октябрь 2002)