JEANNETTE JANSSEN, Dalhousie University, Halifax, Nova Scotia Infinite limits of random graph models for self-organizing networks Self-organizing networks are real or virtual networks that are formed by the actions of a

First Page		Document Content
Date: 2006-07-10 21:18:21 Networks Random graphs Graph Social network Erdős–Rényi model Exponential random graph models Graph theory Mathematics Network theory		JEANNETTE JANSSEN, Dalhousie University, Halifax, Nova Scotia Infinite limits of random graph models for self-organizing networks Self-organizing networks are real or virtual networks that are formed by the actions of a Add to Reading List Source URL: cms.math.ca Download Document from Source Website File Size: 21,43 KB Share Document on Facebook

	Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook DocID: 1xVkB - View Document
	PDF Document DocID: 1xkJU - View Document
	Graph theory Po-Shen Loh June DocID: 1vmTo - View Document
	Graph theory Po-Shen Loh June DocID: 1vhpu - View Document
	Graph theory Po-Shen Loh June DocID: 1v8nl - View Document