Jump to content

Talk:Barabási–Albert model

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

page should be moved to Barabási-Albert model

[edit]

To keep it more easily findable like the and keep the naming consistency, i.e. Erdős-Rényi model.

Picture

[edit]

Can someone please upload an image of a (verified!) BA model graph with about 50-100 Vertices? I am implementing one at the moment, and find it very difficult to verify if it's correct. I think in this dimension, a human can see at first glance, if it's the same type of graph or other. --80.136.123.234 15:04, 18 October 2007 (UTC)[reply]


Description of the Algorithm

[edit]

The Algorithm is unsufficiently described: It's not clear whether m is constant throughout the complete algorithm. Also there is no hint, should the pi be updated each time a connection is added, or only after adding a node with all its m connections? —Preceding unsigned comment added by 192.35.241.121 (talk) 19:27, 17 February 2008 (UTC)[reply]

Almost every paper I can find on the topic uses a fixed m throughout the process, the most common being m = 2.

and what the heck is j? —Preceding unsigned comment added by 203.122.247.105 (talk) 11:54, 8 August 2009 (UTC)[reply]

[edit]

Hello fellow Wikipedians,

I have just modified 2 external links on Barabási–Albert model. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 18:07, 25 January 2018 (UTC)[reply]

Value of m0 in caption of figure

[edit]

The example BA network has a caption claiming m0=1. Wouldn't that imply no edges and k_0=0 resulting in P(k_0) = 0? That would mean no edges ever get added. The algorithm as described seems only well defined for m0 > 1. — Preceding unsigned comment added by 73.110.38.161 (talk) 21:15, 14 July 2018 (UTC)[reply]

Little bit confused on the parameterization of this model

[edit]

Compare this page to the https://en.wikipedia.org/wiki/Watts–Strogatz_model, it's not clear what parameterization this model has. In other words, what are the inputs to a graph generator based on the BA model? BAModel(number_nodes, ??, ??, ...). — Preceding unsigned comment added by Orangesherbet0 (talkcontribs) 22:44, 14 February 2020 (UTC)[reply]