
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>On Exchangeability in Network Models</dc:title>
  <dc:title>Special Volume in honor of memory of S.E.Fienberg</dc:title>
  <dc:subject>de Finetti’s theorem</dc:subject>
  <dc:subject>graphons</dc:subject>
  <dc:subject>M ?obius simplex</dc:subject>
  <dc:subject>finite exchangeability</dc:subject>
  <dc:subject>positive semidefinite functions</dc:subject>
  <dc:description>We derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric and graph-theoretic concepts. Our results elucidate some of the key differences, and their implications, between statistical network models that are finitely exchangeable and models that define a consistent sequence of probability distributions on graphs of increasing size.</dc:description>
  <dc:contributor>Lauritzen, Steffen</dc:contributor>
  <dc:contributor>Rinaldo, Alessandro</dc:contributor>
  <dc:contributor>Sadeghi, Kayvan</dc:contributor>
  <dc:date>2019</dc:date>
  <dc:date>2019-04-12</dc:date>
  <dc:type>Article</dc:type>
  <dc:format></dc:format>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>islandora:1007794</dc:identifier>
  <dc:identifier>http://hdl.handle.net/10560/islandora:1007794</dc:identifier>
  <dc:source>MATH / Applied Mathematics</dc:source>
  <dc:source>Illinois Institute of Technology</dc:source>
  <dc:source>Journal of Algebraic Statistics</dc:source>
  <dc:language>en</dc:language>
  <dc:rights>Open Access</dc:rights>
</oai_dc:dc>
