Networks of coupled dynamical systems have been used to model biological oscillators, Josephson junction arrays, excitable media, neural networks, spatial games, genetic control networks and many other self-organizing systems. Ordinarily, the connection topology is assumed to be either completely regular or completely random. But many biological, technological and social networks lie somewhere between these two extremes. Here we explore simple models of networks that can be tuned through this middle ground: regular networks 'rewired' to introduce increasing amounts of disorder. We find that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. We call them 'small-world' networks, by analogy with the small-world phenomenon (popularly known as six degrees of separation. The neural network of the worm Caenorhabditis elegans, the power grid of the western United States, and the collaboration graph of film actors are shown to be small-world networks. Models of dynamical systems with small-world coupling display enhanced signal-propagation speed, computational power, and synchronizability. In particular, infectious diseases spread more easily in small-world networks than in regular lattices.

/pdf/collective-dynamics-of-small-world-networks-205zhem3gm.pdf

Collective dynamics of small-world networks

The increasing volume of data in modern business and science calls for more complex and sophisticated tools. Although advances in data mining technology have made extensive data collection much easier, it's still always evolving and there is a constant need for new techniques and tools that can help us transform this data into useful information and knowledge. Since the previous edition's publication, great advances have been made in the field of data mining. Not only does the third of edition of Data Mining: Concepts and Techniques continue the tradition of equipping you with an understanding and application of the theory and practice of discovering patterns hidden in large data sets, it also focuses on new, important topics in the field: data warehouses and data cube technology, mining stream, mining social networks, and mining spatial, multimedia and other complex data. Each chapter is a stand-alone guide to a critical topic, presenting proven algorithms and sound implementations ready to be used directly or with strategic modification against live data. This is the resource you need if you want to apply today's most powerful data mining techniques to meet real business challenges. * Presents dozens of algorithms and implementation examples, all in pseudo-code and suitable for use in real-world, large-scale data mining projects. * Addresses advanced topics such as mining object-relational databases, spatial databases, multimedia databases, time-series databases, text databases, the World Wide Web, and applications in several fields. *Provides a comprehensive, practical look at the concepts and techniques you need to get the most out of real business data

/pdf/data-mining-concepts-and-techniques-4dtvdfkvmi.pdf

Data Mining: Concepts and Techniques

The emergence of order in natural systems is a constant source of inspiration for both physical and biological sciences. While the spatial order characterizing for example the crystals has been the basis of many advances in contemporary physics, most complex systems in nature do not offer such high degree of order. Many of these systems form complex networks whose nodes are the elements of the system and edges represent the interactions between them. 
Traditionally complex networks have been described by the random graph theory founded in 1959 by Paul Erdohs and Alfred Renyi. One of the defining features of random graphs is that they are statistically homogeneous, and their degree distribution (characterizing the spread in the number of edges starting from a node) is a Poisson distribution. In contrast, recent empirical studies, including the work of our group, indicate that the topology of real networks is much richer than that of random graphs. In particular, the degree distribution of real networks is a power-law, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network. 
The scale-free topology of real networks has very important consequences on their functioning. For example, we have discovered that scale-free networks are extremely resilient to the random disruption of their nodes. On the other hand, the selective removal of the nodes with highest degree induces a rapid breakdown of the network to isolated subparts that cannot communicate with each other. 
The non-trivial scaling of the degree distribution of real networks is also an indication of their assembly and evolution. Indeed, our modeling studies have shown us that there are general principles governing the evolution of networks. Most networks start from a small seed and grow by the addition of new nodes which attach to the nodes already in the system. This process obeys preferential attachment: the new nodes are more likely to connect to nodes with already high degree. We have proposed a simple model based on these two principles wich was able to reproduce the power-law degree distribution of real networks. Perhaps even more importantly, this model paved the way to a new paradigm of network modeling, trying to capture the evolution of networks, not just their static topology.

/pdf/statistical-mechanics-of-complex-networks-1zfjpvxipu.pdf

Statistical mechanics of complex networks

Scholars of the theory of the firm have begun to emphasize the sources and conditions of what has been described as “the organizational advantage,” rather than focus on the causes and consequences of market failure. Typically, researchers see such organizational advantage as accruing from the particular capabilities organizations have for creating and sharing knowledge. In this article we seek to contribute to this body of work by developing the following arguments: (1) social capital facilitates the creation of new intellectual capital; (2) organizations, as institutional settings, are conducive to the development of high levels of social capital; and (3) it is because of their more dense social capital that firms, within certain limits, have an advantage over markets in creating and sharing intellectual capital. We present a model that incorporates this overall argument in the form of a series of hypothesized relationships between different dimensions of social capital and the main mechanisms and proces...

https://www.jstor.org/stable/pdfplus/259373.pdf

Social Capital, Intellectual Capital, and the Organizational Advantage

Recent developments in the quantitative analysis of complex networks, based largely on graph theory, have been rapidly translated to studies of brain network organization. The brain's structural and functional systems have features of complex networks--such as small-world topology, highly connected hubs and modularity--both at the whole-brain scale of human neuroimaging and at a cellular scale in non-human animals. In this article, we review studies investigating complex brain networks in diverse experimental modalities (including structural and functional MRI, diffusion tensor imaging, magnetoencephalography and electroencephalography in humans) and provide an accessible introduction to the basic principles of graph theory. We also highlight some of the technical challenges and key questions to be addressed by future developments in this rapidly moving field.

Complex brain networks: graph theoretical analysis of structural and functional systems

A puzzle concerning triads in social networks: Graph constraints and the triad census

Blockmodels: Interpretation and evaluation

This paper demonstrates limitations in usefulness o f the triad census for studying similarities among local structural proper ties of social networks. A triad census succinctly summarizes the local stru cture of a network using the frequencies of sixteen isomorphism classes of t riads (sub-graphs of three nodes). The empirical base for this study is a collection of 51 social networks measuring different relational contents (f riendship, advice, agonistic encounters, victories in fights, dominanc e relations, and so on) among a variety of species (humans, chimpanzees, hyenas, monkeys, ponies, cows, and a number of bird species). Results show that, in aggregate, similarities among triad censuses of these empirica l networks are largely explained by nodal and dyadic properties ‐ the dens ity of the network and distributions of mutual, asymmetric, and null dyads . These results remind us that the range of possible network-level propert ies is highly constrained by the size and density of the network and caution should be taken in interpreting higher order structural properties whe n they are largely explained by local network features.

/pdf/comparing-social-networks-size-density-and-local-structure-105529hlwm.pdf

Comparing Social Networks: Size, Density, and Local Structure

https://www.socsci.uci.edu/~kfaust/faust/research/articles/romney_faust_sn_1982.pdf

Predicting the structure of a communications network from recalled data

https://www.socsci.uci.edu/~kfaust/faust/research/articles/faust_positions_sn_1988.pdf

Katherine Faust

Papers

A puzzle concerning triads in social networks: Graph constraints and the triad census

Blockmodels: Interpretation and evaluation

Comparing Social Networks: Size, Density, and Local Structure

Predicting the structure of a communications network from recalled data

Comparison of methods for positional analysis: Structural and general equivalences☆