Sciweavers

363 search results - page 34 / 73
» The SAT Phase Transition
Sort
View
WSC
2004
13 years 9 months ago
Peeking Into the Black Box: Some Art and Science to Visualizing Agent-Based Models
This paper explores current metaphors for visualizing agent-based models. Metaphors include grid, network, ndimensional cubes and landscape visualization techniques. A final secti...
Stephen M. Guerin
CPC
2008
53views more  CPC 2008»
13 years 8 months ago
G-Intersection Theorems for Matchings and Other Graphs
If G is a graph with vertex set [n] then A 2[n] is G-intersecting if for all A, B A either A B = or there exist a A and b B such that a G b. The question of how large a k-un...
J. Robert Johnson, John M. Talbot
CPHYSICS
2008
64views more  CPHYSICS 2008»
13 years 8 months ago
Multibondic cluster algorithm for finite-size scaling studies of critical phenomena
For finite-size scaling studies of second-order phase transitions the critical energy range of interest is usually larger than the energy range covered by a canonical Monte Carlo ...
Bernd A. Berg, Wolfhard Janke
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
13 years 8 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald
CPC
2007
93views more  CPC 2007»
13 years 8 months ago
On a Random Graph Related to Quantum Theory
We show that a random graph studied by Ioffe and Levit is an example of an inhomogeneous random graph of the type studied by Bollob´as, Janson and Riordan, which enables us to gi...
Svante Janson