Feedback between node and network dynamics can produce real-world network properties
AbstractReal-world networks are characterized by common features, including among others a scale-free degree distribution, a high clustering coefficient and a short typical distance between nodes. These properties are usually explained by the dynamics of edge and node addition and deletion.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Physica A: Statistical Mechanics and its Applications.
Volume (Year): 391 (2012)
Issue (Month): 24 ()
Contact details of provider:
Web page: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/
Social networks; Neural networks; Stochastic processes; Scale-free; Hebbian learning;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Robert Axelrod & Will Mitchell & Robert E. Thomas & D. Scott Bennett & Erhard Bruderer, 1995. "Coalition Formation in Standard-Setting Alliances," Management Science, INFORMS, vol. 41(9), pages 1493-1508, September.
- Farkas, I. & Jeong, H. & Vicsek, T. & Barabási, A.-L. & Oltvai, Z.N., 2003. "The topology of the transcription regulatory network in the yeast, Saccharomyces cerevisiae," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 318(3), pages 601-612.
- M. E. J. Newman & D. J. Watts, 1999. "Renormalization Group Analysis of the Small-World Network Model," Working Papers 99-04-029, Santa Fe Institute.
- D. S. Callaway & J. E. Hopcroft & J. M. Kleinberg & M. E. J. Newman & S. H. Strogatz, 2001. "Are Randomly Grown Graphs Really Random?," Working Papers 01-05-025, Santa Fe Institute.
- Barabási, A.L & Jeong, H & Néda, Z & Ravasz, E & Schubert, A & Vicsek, T, 2002. "Evolution of the social network of scientific collaborations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 311(3), pages 590-614.
- Itzhack, Royi & Muchnik, Lev & Erez, Tom & Tsaban, Lea & Goldenberg, Jacob & Solomon, Sorin & Louzoun, Yoram, 2010. "Empirical extraction of mechanisms underlying real world network generation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(22), pages 5308-5318.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.