Charles M. Newman

According to our database, Charles M. Newman authored at least 6 papers between 1988 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2015

Absence of site percolation at criticality in ℤ2×{0, 1}.

Michael Damron, Charles M. Newman, Vladas Sidoravicius

Random Struct. Algorithms, 2015

2011

Spin Glasses: Old and New Complexity.

Daniel L. Stein, Charles M. Newman

Complex Syst., 2011

1999

Random nearest neighbor and influence graphs on Z^d.

S. Nanda, Charles M. Newman

Random Struct. Algorithms, 1999

Scaling limits for minimal and random spanning trees in two dimensions.

Michael Aizenman, Almut Burchard, Charles M. Newman, David Bruce Wilson

Random Struct. Algorithms, 1999

1992

Chain Lengths in Certain Random Directed Graphs.

Charles M. Newman

Random Struct. Algorithms, 1992

1988

Memory capacity in neural network models: Rigorous lower bounds.

Charles M. Newman

Neural Networks, 1988