## ANALYSIS OF LAYERED SOCIAL NETWORKS (2006)

Citations: | 1 - 0 self |

### BibTeX

@MISC{Hamill06analysisof,

author = {Jonathan T. Hamill and Major Usaf and Richard F. Deckro (chairman and Robert F. Mills (member},

title = {ANALYSIS OF LAYERED SOCIAL NETWORKS},

year = {2006}

}

### OpenURL

### Abstract

contained in this dissertation are those of the author and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the

### Citations

2089 | Emergence of scaling in random networks - Barabási, Albert - 1999 |

1842 | On the evolution of random graphs - Erdős, Rényi - 1960 |

1726 |
The Strength of Weak Ties
- Granovetter
- 1973
(Show Context)
Citation Context ...ned the strength of a tie as “a (probably linear) combination of the amount of time, the emotional intensity, the intimacy (mutual confiding), and the reciprocal services which characterize the tie” [=-=Granovetter, 1973-=-, pg. 1361]. Interestingly, the converse of strong ties, weak ties, are composed of casual or intermittent relationships and are potentially strong themselves. The strength of a weak tie lies in its a... |

1651 | Social Network Analysis: Methods and applications - Wasserman, Faust - 1994 |

1407 |
Network Flows: Theory, Algorithms, and Applications
- Ahuja, Magnanti, et al.
- 1993
(Show Context)
Citation Context ... research deal with network flow formulations, spanning trees in general are clearly of interest due to the relationship between rooted spanning trees and non-singular bases in network flow programs [=-=Ahuja et al., 1993-=-, pg. 450] [Nemhauser and Wolsey, 1999, pg. 77]. Renfro also posited the use of spanning trees, from either a minimum or maximum perspective, to ascertain the social connectivity of members within a n... |

1405 | The structure and function of complex networks - Newman - 2003 |

1259 |
Decisions with Multiple Objectives: Preferences and value tradeoffs
- Keeney, Raiffa
- 1976
(Show Context)
Citation Context ...arley, 2005, np] . . . . . 39 2.8 Needs Hierarchy [Costley et al., 1994, pg. 219] . . . . . . . . 44 2.9 Assumptions [Slade, 1995, pg. 126-7] . . . . . . . . . . . . . . 50 2.10 Attribute Properties [=-=Keeney and Raiffa, 1993-=-, pg. 50-3] . . . 77 2.11 Weight Normalization . . . . . . . . . . . . . . . . . . . . . . 81 2.12 Consequence of Normalized Weights . . . . . . . . . . . . . . 81 2.13 Weighting Taxonomy [von Winterf... |

1122 |
Statistical Analysis with Missing Data
- Little, Rubin
- 1987
(Show Context)
Citation Context ...chniques exist to test hypotheses regarding the statistical significance of such traits, means to deal with missing data, and other methods to gain new insight into the data and the organization [cf. =-=Little and Rubin, 1987-=-]. Finally, the incorporation of gains into a generalized network flow model of a social network is a logical and relatively straightforward extension of the centrality measure developed by Freeman et... |

1038 |
Integer and Combinatorial Optimization
- Nemhauser, Wolsey
- 1988
(Show Context)
Citation Context ...ns) used within the heuristic can account for directed arcs. Variations and applications of classical covering, partitioning, and p-median problems, discussed later, address some of these issues [cf. =-=Nemhauser and Wolsey, 1999-=-]. The end 31sproduct is that, as opposed to the heuristic approach currently in use, the application of mathematical programming techniques are guaranteed to provide the optimal solution or solutions... |

614 |
Small Worlds: The Dynamics of Networks Between Order and Randomness
- Watts
- 1999
(Show Context)
Citation Context ... his book, Small Worlds, Watts compares and contrasts the properties of both random and small-world graphs, often referred to within the literature as exponential and scale-free graphs, respectively [=-=Watts, 1999-=-]. Watts details the formal definition 15sof random graphs, which are essentially “...a vertex set, consisting of n vertices, and an edge set that is generated in some random fashion” [Watts, 1999, pg... |

511 | Error and attack tolerance of complex networks - Albert, Jeong, et al. - 2000 |

466 | Maximizing the Spread of Influence through a Social Network
- Kempe, Kleinberg, et al.
(Show Context)
Citation Context ...y, giving them free samples of the product–we can trigger a cascade of influence by which friends will recommend the product to other friends, and many individuals will ultimately try [the product]” [=-=Kempe et al., 2003-=-, pg. 137]. Determining which individuals serve as ideal initial targets in the context of marketing has been studied by Domingos and Richardson [2001], among others. For example, comparing the market... |

352 |
Linked : the new science of networks
- Barabási
- 2002
(Show Context)
Citation Context ... variation of the polynomial in Figure 4.6, and would result in dramatically reduced computational requirements as illustrated in Figure 4.7. Related works have popularized this small-world property [=-=Barabási, 2002-=-; Buchanan, 2002; Watts, 1999]. Numerous connections between real-world, emergent networks and small-world network behavior have been made. Examples include cellular metabolism, Holly145swood movie-st... |

327 | Mining the network value of customers
- Domingos, Richardson
- 2001
(Show Context)
Citation Context ...cted profit from the sales to other customers she may influence to buy, the customers those may influence, and so on recursively” would facilitate the cost-effective 160sselection of key individuals [=-=Domingos and Richardson, 2001-=-, pg. 57]. Extending similar problem aspects within the setting of an influence campaign, such as cost to access, surveil, or turn a specific individual to do another’s bidding, offers an opportunity ... |

320 |
Threshold models of collective behavior
- Granovetter
- 1978
(Show Context)
Citation Context ...-vis the rest of the network” [Freeman, 1980, pg. 586]. Another view of thresholds is due to Granovetter, who suggests that “an actor has two distinct and mutually exclusive behavioral alternatives” [=-=Granovetter, 1978-=-, pg. 1422]. The alternative ultimately chosen is dependent upon the costs and benefits of that choice, the values of which are derived by the number of others observed making the same choice [Granove... |

299 | Graphs over time: densification laws, shrinking diameters and possible explanations - Leskovec, Kleinberg, et al. - 2005 |

281 | An Introduction to Operations Research - Hiller, Lieberman - 1995 |

263 | Power and Centrality: A Family of Measures - Bonacich - 1987 |

226 |
A new status index derived from sociometric analysis,” Psychometrika
- Katz
- 1953
(Show Context)
Citation Context ...rman et al., 2001, pg. 4] . . . . 53 2.6 Meta-Reasoning Module [Silverman et al., 2001, pg. 5] . . . . 55 2.7 Goals for Terrorist A [Johns and Silverman, 2001, pg. 6] . . . 57 2.8 Katz Choice Matrix [=-=Katz, 1953-=-, pg. 40] . . . . . . . . . . . . 64 2.9 Hypothetical Network [Bonacich and Lloyd, 2001, pg. 192] . . 70 2.10 Notional Hypergraph [Bonacich et al., 2004, pg. 190] . . . . . 71 2.11 Improper Multiplex ... |

202 | Making Hard Decisions: An Introduction to Decision Analysis - Clemen - 1996 |

175 |
Linear Programming and Network Flows
- Bazarra, Jarvis, et al.
- 1990
(Show Context)
Citation Context ...man and Faust, 1994, pg. 105]. Additionally, given a digraph, the term path also implies that the direction of the arcs within the path also follow the direction of the path; otherwise it is a chain [=-=Bazaraa et al., 1990-=-, pg. 422]. The length of a walk, trail, path, or chain is determined simply by the summation of the lengths of each of its arcs. Paths, directed walks with unique arcs and nodes, are taken advantage ... |

174 |
Theories of communication networks
- Monge, Contractor
- 2003
(Show Context)
Citation Context ... shared experience, and so forth). Current developments attempting to overcome this limiting assumption include the computational modeling, essentially an agent-based simulation approach proposed by [=-=Monge and Contractor, 2003-=-, Chapter 4], and the dynamic network analyses techniques proposed by [Carley, 2003; Marsili et al., 2004]. Unsurprisingly, dynamic analysis is almost certainly more representative of real-world socia... |

162 | Ucinet for Windows: Software for Social Network Analysis - Borgatti, Everett, et al. - 2002 |

140 | Random graph models of social networks - Newman, Watts, et al. - 2002 |

139 |
Mathematical Analysis
- Apostol
- 1974
(Show Context)
Citation Context ...alled the metric of the space) satisfying the following four properties for all points x, y, z in M: 1. d (x, x) =0 22s2. d (x, y) > 0 if x �= y 3. d (x, y) =d (y, x) 4. d (x, y) ≤ d (x, z)+d (z, y) [=-=Apostol, 1974-=-, pg. 60-1]. If the sociomatrix and its constituent relationships are symmetric, the values within X form a discrete metric space [Apostol, 1974, pg. 61]. However, if the relationships are asymmetric,... |

126 |
The small world problem. Psychology today
- Milgram
- 1967
(Show Context)
Citation Context ...s to an unknown individual via known contacts. By tracing the paths taken by the correspondence, the famous ‘six degrees of separation’ between ostensibly distant and unconnected actors was observed [=-=Milgram, 1967-=-]. Such networks are generally contrasted with the random graphs concept developed by Erdos and Renyi [1959] due to the underlying processes that form the links between nodes. However, random and smal... |

122 |
Graph Theory, an Algorithmic Approach
- Christofides
- 1975
(Show Context)
Citation Context ...ver is (MCP) Min {z = cx : Ax ≥ 1,xi ∈{0, 1} , ∀i} . (5.2) When the constraint matrix A in Equation 5.2 is simply replaced with R1, the MCP solution provides the minimum dominating set for the graph [=-=Christofides, 1975-=-]. Note that this approach also lends itself to k-dominating sets via the use of Rm where m>1, as well as directed graphs due to the incorporation of X ′ within Rm. For a majority of the formulations ... |

105 | Mapping networks of terrorist cells - Krebs - 2001 |

93 |
The Motivation to work
- Herzberg, Mausner, et al.
- 1985
(Show Context)
Citation Context ...vation is due to Herzberg et al. [1965]. In an attempt to find the key factors that lead to job satisfaction, Herzberg et al. developed the theoretical bases for a person’s attitude toward their job [=-=Herzberg et al., 1965-=-, pg. 3]. Factors associated “...with conditions that surround the doing of the job,” thereby affecting the psychological health of the work environment, comprise the “factors of hygiene” [Herzberg et... |

87 |
SMARTS and SMARTER: Improved Simple Methods for Multi-attribute Utility Measurement
- Edwards, Barron
- 1994
(Show Context)
Citation Context ...ues [Bottomley and Doyle, 2001, pg. 553-554] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 2.17 SMART Methodology [Edwards, 1977, pg. 327-9] . . . . . . . 90 2.18 SMARTS Methodology [=-=Edwards and Barron, 1994-=-, pg. 307-9] 90 2.19 Indifference Methods [von Winterfeldt and Edwards, 1986, pg. 287-98] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 2.20 Levels and Focus of Fundamental Analyses .... |

79 |
2004 Understanding Terror Networks
- Sageman
(Show Context)
Citation Context ... . . . . . . . . . . . 248 7.4 Cost Coefficient Analysis . . . . . . . . . . . . . . . . . . . . 250 7.5 Arc Capacity Analysis . . . . . . . . . . . . . . . . . . . . . . 252 8.1 Actor-Specific Data [=-=Sageman, 2004-=-] . . . . . . . . . . . . . . 263 8.2 RBAP (Worship Network) . . . . . . . . . . . . . . . . . . . 266 8.3 RBAP (Discipleship Network) . . . . . . . . . . . . . . . . . 266 8.4 RBAP (Combined Network)... |

74 |
How to use multiattribute utility measurement for social decision making
- Edwards
- 1977
(Show Context)
Citation Context ...uce, 1986, pg. 168] . . . . . . . . . 87 2.16 Example Rating Techniques [Bottomley and Doyle, 2001, pg. 553-554] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 2.17 SMART Methodology [=-=Edwards, 1977-=-, pg. 327-9] . . . . . . . 90 2.18 SMARTS Methodology [Edwards and Barron, 1994, pg. 307-9] 90 2.19 Indifference Methods [von Winterfeldt and Edwards, 1986, pg. 287-98] . . . . . . . . . . . . . . . .... |

73 |
Combinatorial algorithms: generation, enumeration, and search
- Kreher, Stinson
- 1999
(Show Context)
Citation Context ...literature. Developing the linkage of the KPP problem to mathematical programming also lends this problem to the array of heuristic approaches developed for these specific combinatorial problems [cf. =-=Kreher and Stinson, 1999-=-]. These may be particularly useful when analyzing very large social networks in a limited amount of time. However, this particular application, that of influencing a target network from within, is ce... |

71 |
An Integrative Model of Organizational Trust.” Academy of Management Review
- Mayer, Davis, et al.
- 1995
(Show Context)
Citation Context ...ones” [Levin et al., 2002, pg. D2]. Trust–“that quality of the trusted party that makes the trustor willing to be vulnerable”–is assumed to play a key role in binding the network membership together [=-=Mayer et al., 1995-=-, pg. 712]. A recent survey by Hite investigated a number of sociological studies that characterized interpersonal ties. Note the conceptual variety illustrated within Table 6.1 and that none of these... |

64 | The strength of weak ties you can trust: The mediating role of trust in effective knowledge transfer
- Levin, Cross
- 2004
(Show Context)
Citation Context ...ns are] a bundle of different interaction elements” [Burt and Schøtt, 1985, pg, 288]. As shown by Levin et al. [2002], “strong ties promote effective knowledge because they tend to be trusting ones” [=-=Levin et al., 2002-=-, pg. D2]. Trust–“that quality of the trusted party that makes the trustor willing to be vulnerable”–is assumed to play a key role in binding the network membership together [Mayer et al., 1995, pg. 7... |

60 | A Formal Theory of - French - 1956 |

58 | Centrality and network flow - Borgatti - 2005 |

57 |
The application of network analysis to criminal intelligence: An assessment of the prospects
- Sparrow
- 1991
(Show Context)
Citation Context ...r structures or are unwilling to provide information regarding their operations; examples include criminal networks, secret societies, and, most importantly, clandestine terrorist organizations [cf., =-=Sparrow, 1991-=-; van Meter, 2002]. 3sGiven the resultant understanding and insights provided by the analytic techniques developed in the course of this research, decision makers are offered better courses of action ... |

56 | in valued graphs: A measure of betweenness based on network flow
- Freeman, Borgatti, et al.
- 1991
(Show Context)
Citation Context ...e population reached. This mirrors an aspect of Borgatti’s research and offers another element of flexibility to the MP approach. 2.6.3 Generalized Network Flow As seen in [Renfro, 2001; Clark, 2005; =-=Freeman et al., 1991-=-], network flow models provide a useful methodology for the study of influential actors within a network. These works, however, focus upon the development of interpersonal measures that serve as capac... |

53 |
Measuring tie strength
- Marsden, Campbell
- 1984
(Show Context)
Citation Context ...Consequently, a model defining the theoretical building blocks that contribute to the ‘strength’ of a relationship is developed. Other works such as [Carroll, 2006; Friedkin, 1990, 1980; Gould, 1991; =-=Marsden and Campbell, 1984-=-] are analyzed, summarized, and synthesized to serve as a basis for the theoretical model. This effectively builds upon the seminal work of Granovetter, who stated the general definition of the streng... |

49 | Eigenvector-like measures of centrality for asymmetric relations - Bonacich, Lloyd |

48 |
Zelen M: Rethinking centrality: Methods and examples
- Stephenson
- 1989
(Show Context)
Citation Context ...vements. 2.4.3 Information Centrality Stephenson and Zelen developed a centrality measure based upon the amount of information (potentially) flowing through “all paths between [all] pairs of points” [=-=Stephenson and Zelen, 1989-=-, pg. 2]. This approach is attractive in that (1) it accounts for the geodesic as well as the non-geodesic communication or flow of influence through a network and (2) it easily permits the use of wei... |

45 |
Snowball sampling
- Goodman
- 1961
(Show Context)
Citation Context ... . . . . . . . . . 27 2.4 Actor Roles [Brass, 1995, pg. 46] . . . . . . . . . . . . . . . . 28 2.5 Network Attributes [Brass, 1995, pg. 47] . . . . . . . . . . . . 30 2.6 Snowball Sampling Procedure [=-=Goodman, 1961-=-, pg. 148] . . . 37 2.7 Covertness Factors [Tsvetovat and Carley, 2005, np] . . . . . 39 2.8 Needs Hierarchy [Costley et al., 1994, pg. 219] . . . . . . . . 44 2.9 Assumptions [Slade, 1995, pg. 126-7]... |

44 | Approximation algorithms for partial covering problems - Gandhi, Khuller, et al. |

44 |
Strategic Decision Making: Multiobjective Decision Analysis with Spreadsheets
- Kirkwood
- 1997
(Show Context)
Citation Context ... is not a measurable value function, it can be stated that the decision maker prefers a3 over a2, but it cannot be stated that the value of a3 is over twice the value of a2 [cf. Dyer and Sarin, 1979; =-=Kirkwood, 1997-=-, pg. 241-4]. Normalization of the weights subsequently limits the weight-sets, w, to lie within a bounded polyhedral set such that W = {w : 0 ≤ wi ≤ 1, ∀i}; this was also observed, and leveraged for ... |

42 | Who attains social status? Effects of personality and physical attractiveness in social groups - Anderson, John, et al. - 2001 |

42 | A Graph-theoretic perspective on centrality - Borgatti, Everett - 2006 |

42 |
Measurable multiattribute value functions
- Dyer, Sarin
- 1979
(Show Context)
Citation Context ... example in Table 2.12 is not a measurable value function, it can be stated that the decision maker prefers a3 over a2, but it cannot be stated that the value of a3 is over twice the value of a2 [cf. =-=Dyer and Sarin, 1979-=-; Kirkwood, 1997, pg. 241-4]. Normalization of the weights subsequently limits the weight-sets, w, to lie within a bounded polyhedral set such that W = {w : 0 ≤ wi ≤ 1, ∀i}; this was also observed, an... |

41 | A Formal Theory of Social Power - French - 1956 |

41 |
Targeted sampling: options for the study of hidden populations
- JK, Biernacki
- 1989
(Show Context)
Citation Context ...intravenous drug users. The fact that the members of such a network were involved in illicit drug use essentially results in a clandestine network not totally unlike that of a terrorist organization [=-=Watters and Biernacki, 1989-=-]. Snowball sampling procedures are defined by a predetermined number of s stages and k names. The steps of the methodology are shown in Table 2.6. Note that if the ‘random sample’ in step 1 is replac... |