Spine segments in small world networks
โ Scribed by Noah E. Friedkin
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 766 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0378-8733
No coin nor oath required. For personal study only.
โฆ Synopsis
Investigations of small world contact networks, defined as networks with a short characteristic path length and a substantial local clustering of contacts in the neighborhood of each node, have emphasized the process performance of such networks. The argument that large-scale, small world, contact networks are structures with startlingly efficient process performance is premised on the existence of shortcuts, without which the characteristic path lengths of the networks would be substantially larger. No doubt, given a high probability of transmission in each contact of a network, such shortcuts are a potential structural basis of reliable flows of information, influence, material and disease. However, interpersonal contacts are often markedly unreliable transmission conduits, and the average shortcut contact may be a more unreliable, episodic, transmission conduit than the average contact of cliques. With markedly unreliable contacts, fundamental helix substructures, that are parallel-transmission subsystems of the contact network, importantly enter into the analysis of network performance. These substructures of disjoint path redundancies are based on the local clustering of contacts in the neighborhoods of each node. Drawing on network reliability theory, this article presents an approach in which intersecting cliques of contact networks are a theoretically important construct in the specification of the transmission implications of observed contact networks. Clique intersections are a structural basis of path redundancies that enable reliable transmission among the nodes of contact networks consisting of contacts that may or may not be active conduits of transmissions during some period of time. The strong contacts that occur among clique members further enhance the contributions of these path redundancies.
๐ SIMILAR VOLUMES
We consider a firm's profit maximization problem when the demand for the product is created by referrals between consumers connected in a small world network. We generate a small world network by applying the rewiring algorithm of Watts and Strogatz and incorporate it into the profit maximization pr
The dynamics of the blackmail propagation model based on small-world networks is investigated. It is found that for a given transmitting probability l the dynamical behavior of blackmail propagation transits from linear growth type to logistical growth one with the network randomness p increases. Th