Connectivity strategies to enhance the capacity of weight-bearing networks

The connectivity properties of a weight-bearing network are exploited to enhance it's capacity. We study a 2-d network of sites where the weight-bearing capacity of a given site depends on the capacities of the sites connected to it in the layers above. The network consists of clusters viz. a set of sites connected with each other with the largest such collection of sites being denoted as the maximal cluster. New connections are made between sites in successive layers using two distinct strategies. The key element of our strategies consists of adding as many disjoint clusters as possible to the sites on the trunk $T$ of the maximal cluster. The new networks can bear much higher weights than the original networks and have much lower failure rates. The first strategy leads to a greater enhancement of stability whereas the second leads to a greater enhancement of capacity compared to the original networks. The original network used here is a typical example of the branching hierarchical class. However the application of strategies similar to ours can yield useful results in other types of networks as well.Comment: 17 pages, 3 EPS files, 5 PS files, Phys. Rev. E (to appear

Boukunsskatte van die Vrystaat/Free State heritage

No abstract available

Evolution of community structure in the world trade web

In this note we study the bilateral merchandise trade flows between 186 countries over the 1948-2005 period using data from the International Monetary Fund. We use Pajek to identify network structure and behavior across thresholds and over time. In particular, we focus on the evolution of trade "islands" in the a world trade network in which countries are linked with directed edges weighted according to fraction of total dollars sent from one country to another. We find mixed evidence for globalization.Comment: To be submitted to APFA 6 Proceedings, 8 pages, 3 Figure

Properties of Random Graphs with Hidden Color

We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub-coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global structural properties of graphs from the resulting ensembles is demonstrated. Cluster size statistics are derived with generating function techniques, yielding a well-defined percolation threshold. Explicit rules are derived for the enumeration of small subgraphs. Duality and redundancy is discussed, and subclasses corresponding to commonly studied models are identified.Comment: 14 pages, LaTeX, no figure

Search for Fragmented M1 Strength in 48-Ca

This research was sponsored by the National Science Foundation Grant NSF PHY-931478

Statistical mechanics of transcription-factor binding site discovery using Hidden Markov Models

Hidden Markov Models (HMMs) are a commonly used tool for inference of transcription factor (TF) binding sites from DNA sequence data. We exploit the mathematical equivalence between HMMs for TF binding and the "inverse" statistical mechanics of hard rods in a one-dimensional disordered potential to investigate learning in HMMs. We derive analytic expressions for the Fisher information, a commonly employed measure of confidence in learned parameters, in the biologically relevant limit where the density of binding sites is low. We then use techniques from statistical mechanics to derive a scaling principle relating the specificity (binding energy) of a TF to the minimum amount of training data necessary to learn it.Comment: 25 pages, 2 figures, 1 table V2 - typos fixed and new references adde