Short-range spin glasses and Random Overlap Structures

Properties of Random Overlap Structures (ROSt)'s constructed from the Edwards-Anderson (EA) Spin Glass model on $\Z^d$ with periodic boundary conditions are studied. ROSt's are $\N\times\N$ random matrices whose entries are the overlaps of spin configurations sampled from the Gibbs measure. Since the ROSt construction is the same for mean-field models (like the Sherrington-Kirkpatrick model) as for short-range ones (like the EA model), the setup is a good common ground to study the effect of dimensionality on the properties of the Gibbs measure. In this spirit, it is shown, using translation invariance, that the ROSt of the EA model possesses a local stability that is stronger than stochastic stability, a property known to hold at almost all temperatures in many spin glass models with Gaussian couplings. This fact is used to prove stochastic stability for the EA spin glass at all temperatures and for a wide range of coupling distributions. On the way, a theorem of Newman and Stein about the pure state decomposition of the EA model is recovered and extended.Comment: 27 page

A user's manual for the Loaded Microstrip Antenna Code (LMAC)

The use of the Loaded Microstrip Antenna Code is described. The geometry of this antenna is shown and its dimensions are described in terms of the program outputs. The READ statements for the inputs are detailed and typical values are given where applicable. The inputs of four example problems are displayed with the corresponding output of the code given in the appendices

Comparison of interference-free numerical results with sample experimental data for the AEDC wall-interference model at transonic and subsonic flow conditions

Numerical results obtained from two computer programs recently developed with NASA support and now available for use by others are compared with some sample experimental data taken on a rectangular-wing configuration in the AEDC 16-Foot Transonic Tunnel at transonic and subsonic flow conditions. This data was used in an AEDC investigation as reference data to deduce the tunnel-wall interference effects for corresponding data taken in a smaller tunnel. The comparisons were originally intended to see how well a current state-of-the-art transonic flow calculation for a simple 3-D wing agreed with data which was felt by experimentalists to be relatively interference-free. As a result of the discrepancies between the experimental data and computational results at the quoted angle of attack, it was then deduced from an approximate stress analysis that the sting had deflected appreciably. Thus, the comparisons themselves are not so meaningful, since the calculations must be repeated at the proper angle of attack. Of more importance, however, is a demonstration of the utility of currently available computational tools in the analysis and correlation of transonic experimental data

Applications systems verification and transfer project. Volume 7: Cost/benefit analysis for the ASVT on operational applications of satellite snow-cover observations

The results of the OASSO ASVT's were used to estimate the benefits accruing from the added information available from satellite snowcover area measurement. Estimates of the improvement in runoff prediction due to addition of SATSCAM were made by the Colorado ASVT personnel. The improvement estimate is 6-10%. Data were applied to subregions covering the Western States snow area amended by information from the ASVT and other watershed experts to exclude areas which are not impacted by snowmelt runoff. Benefit models were developed for irrigation and hydroenergy uses. The benefit/cost ratio is 72:1. Since only two major benefit contributors were used and since the forecast improvement estimate does not take into account future satellite capabilities these estimates are considered to be conservative. The large magnitude of the benefit/cost ratio supports the utility and applicability of SATSCAM

Recent experiences with three-dimensional transonic potential flow calculations

Some recent experiences with computer programs capable of solving finitie-difference approximations to the full potential equation for the transonic flow past three dimensional swept wings and simple wing-fuselage combinations are discussed. The programs used are a nonconservative program for swept wings, a quasi-conservative finite-volume program capable of treating swept wings mounted on fuselages of slowly varying circular cross section, and a fully conservative finite volume scheme capable of treating swept wings and wing-cylinder combinations. The present capabilities of these codes are reviewed. The relative merits of the conservative and nonconservative formulations are discussed, and the results of calculations including corrections for the boundary-layer displacement effect are presented

Identity and Search in Social Networks

Social networks have the surprising property of being "searchable": Ordinary people are capable of directing messages through their network of acquaintances to reach a specific but distant target person in only a few steps. We present a model that offers an explanation of social network searchability in terms of recognizable personal identities: sets of characteristics measured along a number of social dimensions. Our model defines a class of searchable networks and a method for searching them that may be applicable to many network search problems, including the location of data files in peer-to-peer networks, pages on the World Wide Web, and information in distributed databases.Comment: 4 page, 3 figures, revte

Generating Robust and Efficient Networks Under Targeted Attacks

Much of our commerce and traveling depend on the efficient operation of large scale networks. Some of those, such as electric power grids, transportation systems, communication networks, and others, must maintain their efficiency even after several failures, or malicious attacks. We outline a procedure that modifies any given network to enhance its robustness, defined as the size of its largest connected component after a succession of attacks, whilst keeping a high efficiency, described in terms of the shortest paths among nodes. We also show that this generated set of networks is very similar to networks optimized for robustness in several aspects such as high assortativity and the presence of an onion-like structure

Spectral densities of scale-free networks

The spectral densities of the weighted Laplacian, random walk and weighted adjacency matrices associated with a random complex network are studied using the replica method. The link weights are parametrized by a weight exponent $\beta$. Explicit results are obtained for scale-free networks in the limit of large mean degree after the thermodynamic limit, for arbitrary degree exponent and $\beta$.Comment: 14 pages, two figure

Wang-Landau Algorithm: a Theoretical Analysis of the Saturation of the Error

In this work we present a theoretical analysis of the convergence of the Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] which was introduced years ago to calculate the density of states in statistical models. We study the dynamical behavior of the error in the calculation of the density of states.We conclude that the source of the saturation of the error is due to the decreasing variations of the refinement parameter. To overcome this limitation, we present an analytical treatment in which the refinement parameter is scaled down as a power law instead of exponentially. An extension of the analysis to the N-fold way variation of the method is also discussed.Comment: 7 pages, 5 figure