Dilution of Ferromagnets via a Random Graph-Based Strategy

&
Complexity 2018:1-11 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1155/2018/2845031

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Random generations of the countable random graph.Su Gao & A. Vershik - 2006 - Annals of Pure and Applied Logic 143 (1-3):79-86.
The conjugacy problem for the automorphism group of the random graph.Samuel Coskey, Paul Ellis & Scott Schneider - 2011 - Archive for Mathematical Logic 50 (1-2):215-221.
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
The cofinality of the saturated uncountable random graph.Steve Warner - 2004 - Archive for Mathematical Logic 43 (5):665-679.
Local dependence in random graph models: Characterization, properties and statistical inference.M. Schweinberger & M. S. Handcock - unknown
Reducts of the Random Bipartite Graph.Yun Lu - 2013 - Notre Dame Journal of Formal Logic 54 (1):33-46.
Phase transitions in associative memory networks.Ben Goertzel - 1993 - Minds and Machines 3 (3):313-317.
Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
A separable model for dynamic networks.P. N. Krivitsky & M. S. Handcock - unknown
Estimating within-school contact networks to understand influenza transmission.G. E. Potter, M. S. Handcock, I. M. Longini & M. Elizabeth Halloran - unknown
Infinitary Logics and Very Sparse Random Graphs.James Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Adjusting for network size and composition effects in exponential-family random graph models.P. N. Krivitsky, M. S. Handcock & M. Morris - unknown
A diagrammatic representation for entities and mereotopological relations in ontologies.José M. Parente de Oliveira & Barry Smith - 2017 - In CEUR, vol. 1908.
On best transitive approximations to simple graphs.Leon Horsten - unknown

Analytics

Added to PP
2018-04-17

Downloads
8 (#1,287,956)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references