This paper is motivated by a small economic literature modelling random trading groups or communication structures as random graphs. It relates this literature to recent work by the author which describes trade infra-structures by means of a "contacting cost-topology". Conditions are found under which a given -- finite or infinite -- countable subset of a pseudo-metric space is almost certainly contained in a connected component of a random graph. In general, the same conditions neither imply nor exclude that the entire pseudo-metric space is almost certainly a connected component of a random graph. Based on these results, the likelihood of core equivalence properties for continuum economies with random communication structures is discussed.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by University of Bonn, Germany in its series Discussion Paper Serie A with number
301.
Length: Date of creation: Jul 1990 Date of revision: Handle: RePEc:bon:bonsfa:301
Contact details of provider: Postal: Bonn Graduate School of Economics, University of Bonn, Adenauerallee 24 - 26, 53113 Bonn, Germany Fax: +49 228 73 9221 Web page: http://www.bgse.uni-bonn.de/index.php?id=517
For technical questions regarding this item, or to correct its listing, contact: (Daniel Park).
Related research
Keywords:
Cited by: (explanations, 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.)