collections of interconnected units , or networks , have long been used in various domains in cognitive science ( e.g. , artificial neural networks , rosenblatt , 1958 ; mcclelland et al . , 1986 ; networks of semantic memory , quillian , 1967 ; collins and loftus , 1975 ; linguistic nections , lamb , 1970 ) . recent developments in other fields including mathematics , physics , and computer science have sparked interest in a new type of network analysis known as network science ( watts , 2004 ; see also jasny et al . , 2009 ) . in the network science approach , nodes represent entities , and links represent simple relationships between entities in a complex system . a fundamental assumption of network science is that the large - scale structure of the system has consequences for the dynamics of that system ( watts and strogatz , 1998 ) . to give a concrete example , consider a social system comprised of people who are friends with each other . in a network science analysis of this system , nodes would represent individual people , and links would represent friendships between particular people ( alternatively , links could be defined by financial exchanges between people , sexual relationships , etc . ) . 2009 ) or innovations ( valente , 1995 ) spread through that social network depends on who is connected to whom . another example of how network structure influences network dynamics can be seen in studies of the efficiency of search algorithms in various types of networks ( e.g. , kleinberg , 2000 ) . network science is often used to model complex social , biological , and technological systems ( for reviews see albert and barabsi , 2002 ; boccaletti et al . , 2006 ; newman , 2010 ) . however , this approach has also been used to model complex cognitive systems ( for an application to neural systems see sporns et al . , 2004 ) , and has provided novel insights into several domains of cognition including semantic memory ( steyvers and tenenbaum , 2005 ; for a review see borge - holthoefer and arenas , 2010a ) , language development ( hills et al . previous psychological research in each of these cognitive domains has identified and thoroughly examined a myriad of characteristics about individual words  such as the frequency , length , and concreteness of a word  that influence processing . what is relatively less studied and understood in the psychological perspective is  for lack of a better term  the collective behavior of words . that is , how does a group of words facilitate or interfere with the processing of a given word . ( for psycholinguistic work that begins to examine this issue at the phonological level see luce and pisoni , 1998 and at the semantic level see nelson et al . network science offers researchers a novel set of tools to explore such interactions among entities in large systems , and motivated the present work . using the network science approach , vitevitch ( 2008 ) constructed a network from approximately 20,000 english words in which nodes in the network represented phonological word - forms , and ( unweighted , undirected ) links between nodes indicated phonological similarity between words . two words were phonologically similar if a single phoneme could be substituted , added , or deleted from one word to form the other word . this psychologically valid metric ( see experiment 2 of luce and large , 2001 ) is widely used in psycholinguistic research to assess similarity between two words ( e.g. , luce and pisoni , 1998 ; see also greenberg and jenkins , 1967 ) , and is more generally referred to as levenshtein distance . analysis of the phonological network in english revealed several structural features that were also found in phonological networks of spanish , mandarin , hawaiian , and basque ( arbesman et al . given the presence of these structural features in the phonological networks of several languages , chan and vitevitch ( 2009 , 2010 ) wondered how certain network structures might influence language processing . of the variety of measurements that are often used to describe the structure of a network , two are most relevant to the present investigation : degree and clustering coefficient . degree refers to the number of connections that a node has . in the context of the phonological network of vitevitch ( 2008 ) , degree corresponds to the number of word - forms that sound similar to a given word ( based on the one - phoneme metric described above ) . in the psycholinguistic literature , this measure is referred to as phonological neighborhood density ( luce and pisoni , 1998 ) , but we will use the term degree to maintain consistency with the network perspective that motivated the present study . ( this does not mean we are reinventing , or redefining the term  neighborhood density  in any way ; we simply wish to use the term degree to maintain consistency with the network science literature that motivated the present study . ) much psycholinguistic research has demonstrated that degree influences a variety of language - related processes including spoken word production ( e.g. , vitevitch , 2002b ; vitevitch and stamer , 2006 , 2009 ) , spoken word recognition ( e.g. , luce and pisoni , 1998 ; vitevitch , 2002a ) , word learning ( e.g. , storkel et al . , 2006 ) , reading ( yates et al . , 2004 ) , and serial recall ( e.g. , roodenrys et al . , 2002 ) . in figure 1 , degree corresponds to the lines that connect the words badge and log to their respective neighbors ( note that both words have 13 neighbors ) . the word badge has high c and the word log has low c , but both words have the same number of neighbors ( a.k.a . degree ) . in these networks , connections are placed between words that are phonologically similar using the one - phoneme metric described in the text . for the sake of visual clarity , connections from the neighbors to other words in the lexical network are not shown . in contrast to degree , the clustering coefficient , c ( watts and strogatz , 1998 ) , measures the extent to which neighbors of a given node are also neighbors of each other . this characteristic is represented in figure 1 by the lines that connect a neighbor of badge and log to another neighbor of badge and log . c ranges from 0 ( none of the immediate neighbors of a node are connected to each other ) to 1 ( all of the immediate neighbors of a node are fully interconnected ) . in the present study , c ( i.e. , the local clustering coefficient for an undirected graph ) was computed for each word as in [ eq.1 ] : ejk refers to the presence of a connection ( or edge ) between two neighbors ( j and k ) of node i , | | is used to indicate cardinality , or the number of elements in the set ( not absolute value ) , and ki refers to the degree ( i.e. , neighborhood density ) of node i. thus , the ( local ) clustering coefficient is the number of connections that actually exist among the neighbors of a given node divided by the number of connections that could possibly exist among the neighbors of a given node . just as degree has demonstrable influences on various language - related processes , c has been shown to influence the processes of spoken word recognition and production ( chan and vitevitch , 2009 , 2010 ) . in all current models of spoken word recognition , auditory input partially activates a number of words in long - term memory that resemble the input ( mcclelland and elman , 1986 ; norris , 1994 ; luce and pisoni , 1998 ) . from those similar sounding candidates , one word is recognized as the word that was heard , and its meaning is retrieved from long - term memory resulting in comprehension . chan and vitevitch ( 2009 ) found in two word recognition tasks  perceptual identification , where listeners indicate the word that they heard in the presence of white noise , and lexical decision , where listeners indicate whether the stimulus was a real word in english or a made - up word , like  foosh   that words with high c ( badge in figure 1 ) were responded to more slowly and less accurately than words with low c ( log in figure 1 ) , even though the words were equivalent on a number of other characteristics ( e.g. , degree , frequency of occurrence , etc . ) . to account for these observations , chan and vitevitch ( 2009 ) offered a verbal description of the spoken word recognition process inspired by the network science approach . note that current models of spoken word recognition view the mental lexicon as a collection of arbitrarily ordered phonological representations , and the process of lexical retrieval as a special instance of pattern matching . lexical retrieval occurs in these models because a given word - form best matches the acoustic chan and vitevitch ( 2009 ) instead suggested that the mental lexicon could be viewed as a ( small - world ) network , and lexical retrieval could be viewed as a search through that network , much like the pagerank algorithm ( page et al . , 1998 ) searches through the structured network of information that is the world - wide web . ( 2007 ) demonstrated that the pagerank algorithm could be used in a semantic network constructed from word association data to predict performance of participants who were shown a letter of the alphabet and asked to name the first word beginning with that letter that came to mind . in the present report we used a network simulation to examine the verbal description that chan and vitevitch ( 2009 ) gave for the process of spoken word recognition . in the description of their findings , chan and vitevitch ( 2009 ) started with the network structure for the phonological lexicon observed by vitevitch ( 2008 ) . overlaying that structure was the additional assumption that  activation  would  spread  from an initially activated node to the nodes that it was connected to , and then on to the nodes that they in turn were connected to ( which included the node from which activation was initially received ) . although other models of cognitive processing often include additional parameters such as inhibition , decay of activation , threshold levels , etc . , no such assumptions were made in the description offered by chan and vitevitch ( 2009 ) . in the case of a word with low c in the mental lexicon ( log in figure 1 ) , chan and vitevitch ( 2009 ) suggested that the small number of interconnections among the neighbors would result in some of the activation from the neighbors spreading back to the target word , and the remaining activation dispersing to the rest of the network ( i.e. , words related to the neighbors of log , but not shown in figure 1 ) . the strongly activated target word , log , would  stand out  from the less activated neighbors ( and less activated neighbors of neighbors ) , resulting in rapid and accurate retrieval from the lexicon of target words with low c. in the case of a word with high c in the mental lexicon ( badge in figure 1 ) , where the neighbors are highly interconnected with each other , most of the activation will remain amongst the interconnected neighbors rather than spread back to the target word or to the rest of the network as happens for words with low c. with a highly activated target word as well as highly activated neighbors , discrimination of the target word becomes more difficult , resulting in slower and less accurate retrieval of target words with high c from the lexicon . note that for words with high c , activation will spread to the target word and to the rest of the lexicon , but to a lesser extent than for words with low c. furthermore , given the different way in which activation disperses in the two types of networks , the amount of activation that a word with high c ends up with is likely to be less than the amount of activation that a word with low c ends up with . this additional difference in the amount of activation for words with high versus low c might also contribute to the processing differences observed in chan and vitevitch ( 2009 ) . to more precisely examine the description of spoken word recognition offered by chan and vitevitch ( 2009 ) , we simulated the spread of activation across small networks that had the same degree ( i.e. , phonological neighborhood density ) , but varied in c. ( see lewandowsky ( 1993 ) for the benefits of computationally examining even simple verbal descriptions . ) the concept of spreading activation is commonly used to model the search process in various domains of cognition . more broadly speaking , the concept of spreading activation resembles diffusion dynamics in network science ; that is , how a disease or a fad spreads across a system . previous network simulations of diffusion dynamics by newman ( 2003 ; see also naug , 2008 ) demonstrated that information ( or disease ) will spread widely across a network with low clustering coefficient , but in a network with high clustering coefficient information / disease will be constrained to a more restricted region of the network . ( for examples of studies exploring diffusion dynamics in cognitively relevant domains see borge - holthoefer and arenas , 2010b , and borge - holthoefer et al . , 2011 . ) although the account offered by chan and vitevitch ( 2009 ) is consistent with the results of the simulation by newman ( 2003 ) , it is important to note that newman ( 2003 ) assessed how widely  activation  would be dispersed in the network ( or how many nodes would be  infected  ) , not how the dispersion of activation affected a specific item . in the present simulation we directly examined how the spreading of activation in networks that varied in clustering coefficient influenced the final activation value of a specific node , simulating the retrieval of that item from the mental lexicon . although there is much value in using mathematically abstract networks to examine network dynamics ( as in newman , 2003 ) , we instead selected nodes from the phonological network analyzed in vitevitch ( 2008 ) in order to more directly and more realistically examine how lexical structure might influence lexical processing . each node in this network represented a phonological word - form ( not a semantic concept ) , and ( unweighted , bidirectional ) links connected nodes that were phonologically related to each other ( based on the substitution , addition , or deletion of one phoneme in a word , a levenstein distance of 1 ; luce and pisoni , 1998 ) . the full network analyzed in vitevitch ( 2008 ) contained 19,340 nodes , had a mean degree ( < k > ) equal to 9.105 , an average path length (  ) equal to 6.05 , an average clustering coefficient of 0.126 , a network density of 0.001 , a degree distribution that deviated from a power - law , and exhibited assortative mixing by degree . recall that the nodes in the network examined in vitevitch ( 2008 ) corresponded to phonological word - forms . degree refers to the number of connections per node . in the context of the phonological network examined in vitevitch ( 2008 ) degree referred to the number of  phonological neighbors  that a word had . the average path length referred to the number of connections that had to be traversed to connect any two nodes in the ( largest component of the ) network . for example , to get from the word cat to the word dog , one can traverse the links between the nodes corresponding to the words bat , bag , and bog . the clustering coefficient , c , characterizes the extent to which neighbors of a node are also neighbors of each other . a clustering coefficient of 0 indicates that none of the neighbors of a node are neighbors of each other , whereas a value of 1 indicates that all of the neighbors of a node are neighbors of each other ( watts and strogatz , 1998 ) . as reported in chan and vitevitch ( 2010 ) , the correlation between degree , k , and c for the 6,281 words with two or more neighbors ( the minimum number of neighbors required to compute c ) from the network examined in vitevitch ( 2008 ) is r  =  0.005 , p  =  0.68 . that is , a word with many neighbors , k , could have high or low c. similarly , a word with few neighbors , k , could have high or low c. furthermore , we did a correlation analysis between c and k for the items used in the present simulation and found that r ( 22 )  =  0.24 ( p  =  0.25 ) , indicating that there is no correlation between c and k for the items used in the present simulation . conceptually similar to the clustering coefficient is the measurement known as network density , which measures the number of connections that exist in an entire network in relation to the maximal number of connections that could exist in that network . a network density value near 0 indicates that there are actually few connections in the network compared to the number of connections that could exist in the network . a network density value near 1 indicates that the number of connections in the network is approaching the maximal number of connections that could exist in the network . ( the term  network density  is from the field of network science , and should not be confused with the term  phonological neighborhood density  from the field of psycholinguistics . ) the degree distribution refers to the proportion of nodes that have a given number of links . networks with degree distributions that follow a power - law are called scale - free networks , and have attracted attention because of certain structural and dynamic properties ( albert and barabsi , 2002 ) . ( 2010 ) for a discussion of why the degree distribution of phonological networks is likely to deviate from a power - law . assortative mixing by degree refers to the way in which nodes connect to each other ; specifically a highly connected node tends to connect to other nodes that are also highly connected ( newman , 2002 ) . in other words , there is a positive correlation between the degree of a node and the degree of its neighbors . ( 2010 ) for a discussion of the processing implications of this network characteristic . in the present simulation , we wished to examine the influence of c on processing in nodes with a wide range of degree . twelve pairs of nodes ranging in degree from 3 to 40 were selected from the lexical network in vitevitch ( 2008 ) . even though the nodes in each pair had the same degree , one node in each pair had low c , and the other node in the pair had high c. the nodes in each pair were chosen such that c for each node 0  <  c  <  1 , and the difference in clustering coefficient between the nodes was maximal ( with the node having the minimal value of c being classified as having low c , and the node having the maximal value of c being classified as having high c ) . for nodes with low degree , however , for nodes with higher degree , there were fewer nodes to select from and the difference in clustering coefficient was less ; these items were , nevertheless , included in the simulation . overall the difference in c between the low c nodes ( mean  =  0.21 ; sd  =  0.06 ) and the high c nodes ( mean  =  0.46 ; sd  =  0.12 ) was statistically significant [ t(22 )  =  6.38 , p  <  0.0001 ] . in addition to extracting the 24 target nodes from the larger network analyzed in vitevitch ( 2008 ) , we also extracted the neighbors of each target , as well as the neighbors of the neighbors ( i.e. , the two - hop neighborhood ) from the larger network to create 24  mini  networks . the two - hop neighborhood allowed us to simulate the spread of activation to ( admittedly a smaller - scale version of ) the rest of the network . figure 2 shows an illustration of the one - hop and the two - hop neighborhood of a node . the target node is shown in black , the neighbors of the target node are shown in gray ( i.e. , one - hop neighbors of the target node ) , and the neighbors of the neighbors are shown in white ( i.e. , two - hop neighbors of the target node ) . for visual clarity , only a few connections among nodes are drawn . each consisting of a target word , its neighbors , and the neighbors of the neighbors  we computed network density to verify that the high and low c networks were comparable in number of nodes and number of connections in the networks . there was no statistically significant difference in network density for the words with low c ( mean  =  0.075 neighbors ; sd  =  0.06 ) and the words with high c [ mean  =  0.084 neighbors ; sd  =  0.06 ; t(22 )  =  0.35 , p  =  0.72 ] . values of degree , clustering coefficient , and network density for the selected nodes can be found in table a1 in the appendix . note that the present simulation uses an abstraction of or simply the structural relationships among nodes found in the phonological network examined in vitevitch ( 2008 ) . the identity of the nodes ( i.e. , the word corresponding to that node ) , as well as other variables that are typically examined in psycholinguistic experiments  word frequency , word length , concreteness , etc .  are not directly represented in the structure of the network . using this abstract network structure essentially results in those characteristics being held constant or controlled between the nodes with low and high c , therefore these variables will not affect the outcome of the present simulations . the use of an abstract network also facilitates generalizing the present results to other domains that examine diffusion dynamics . the term  spreading activation  has been used to mean many different things in many different and diverse models of cognitive processing ( cf . , collins and loftus , 1975 ; anderson , 1983 ; mackay , 1987 ) . in the present simulation , activation is defined as a limited cognitive resource , which spreads unimpeded between connected nodes , and does not decay over time . furthermore , in the present simulation the length of a link between two nodes does not correspond to any psychological construct , such as relatedness . the links between nodes in the present simulation indicate that two nodes simply are phonologically related ( based on the one phoneme metric ) , not that some word pairs are more related than others . because the length of the links is meaningless ( and the links are not weighted , which is an alternative way of representing varying amounts of  relatedness  ) activation in the present simulation does not diminish as it spreads between two connected nodes . we recognize that the assumptions we employ regarding activation and its spread in the current simulation are simple and may differ from other cognitive models that employ  spreading activation . first , these simple assumptions facilitate our ability to generalize more broadly the present results to other domains that examine diffusion dynamics . second , we see no reason to include additional assumptions simply because other models include those assumptions . in the present simulation we invoke the principle of parsimony , so that we may examine how many psychological phenomena can be accounted for with as simple a model as possible . in the present simulation , we varied this proportion in increments of 0.10 , ranging from 0.10 to 0.90 to explore the possibility that different outcomes might emerge at different amounts of retained activation . the amount of activation that was not retained in the target node was equally divided ( i.e. , spread ) amongst the one - hop neighbors of the target word . similar to the target node , each one - hop neighbor retained a portion of the activation it received from the target node . the portion of activation that was not retained in a one - hop neighbor node was spread equally to the nodes to which it was connected ( including the target , other one - hop neighbors , and the two - hop neighbors ) . activation that reached the two - hop neighbors ( i.e. , the white nodes in figure 2 ) was sent back to the one - hop neighbors ( i.e. , the gray nodes in figure 2 ) and to other two - hop neighbors to which that node was connected ( n.b . , these connections were omitted from figure 2 for the sake of visual clarity ) , resulting in activation spreading back and forth between the target , the one - hop neighbors , and the two - hop neighbors over 10 discrete time steps . retrieval of the target items occurred after activation spread from node to node for 10 discrete time steps . at this point we recognize that current models of word recognition and memory might implement the retrieval process differently than the simplified criterion employed in the present simulation , but it is important to keep in mind that the different mechanisms commonly employed in those models ( e.g. , an activation threshold that must be crossed , different resting levels of activation , etc . ) produce isomorphic results . the present simulation is not intended to discriminate among models of word recognition or memory , or among the different mechanisms employed in such models . rather , we simply wished to computationally examine the retrieval mechanism described by chan and vitevitch ( 2009 ) . the activation value in the target node can be mapped to the dependent variables examined in chan and vitevitch ( 2009 )  response latency and accuracy  in the following ways : ( 1 ) activation values are inversely related to response latency , such that higher activation values indicate that lexical retrieval occurred rapidly , and lower activation values indicate that lexical retrieval required more time to be completed , and ( 2 ) activation values are directly related to accuracy , such that higher activation values indicate more accurate retrieval from the lexicon , and lower activation values indicate less accurate retrieval from the lexicon . the assumptions we make regarding the mapping of the activation values in the target nodes to the dependent variables of response latency and accuracy enable us to qualitatively compare the results of our simulations to the results of the two psycholinguistic experiments reported by chan and vitevitch ( 2009 ) . it is also important to note that it is only the activation value of the target nodes  not the activation value of neighboring nodes , or a comparison between the activation value of the target and its neighboring nodes  that is relevant for comparison to the experiments reported in chan and vitevitch ( 2009 ) . although the mechanism described in chan and vitevitch ( 2009 ) referenced the activation of a target word to the activation of its neighbors , all that was assessed in the two experiments reported in chan and vitevitch ( 2009 ) was  via the dependent variables of response latency and accuracy  the  activation  of the target words . furthermore , in the present network simulation , target nodes receive activation from the initial burst of activation to the target node and , in subsequent time steps , from their neighboring nodes . in contrast , non - target nodes ( i.e. , one - hop and two - hop neighbors ) receive activation only in subsequent time steps from their connections to the target and to other nodes . the difference in the timing and source of activation that target and non - target nodes receive makes it impossible for a non - target node to have a higher activation value than a target node . this leads to the idealized situation in which the model always correctly retrieves the target word , which contrasts with the perceptual errors that are observed in natural human performance ( i.e. , slips of the ear ; vitevitch , 2002a ) and that occur in laboratory based tasks . although  perfect  performance in a model may lack ecological validity , it is not uncommon for models of cognitive processing to perform in this way ( e.g. , levelt et al . , 1999 ) . such performance does not diminish the novel insights into a cognitive process that these models may provide . to describe the simulation algorithmically , at time step 1 the target node , n , a proportion of that activation stayed in the target node , according to eq.2 , and the remaining amount of activation was spread equally to all the neighbors of node n , according to eq.3 . where reservoir ( t , n ) is the activation retained at node n at time step t , r is the proportion of the activation ( ranging from 0.1 to 0.9 in increments of 0.1 ) retained at node n , inflow ( t , n ) is the amount of activation that node n received at time - step t , outflow ( t , n ) is the amount of activation that spreads to each of the neighbors of node n at time t , and degree ( n ) is the number of neighbors of node n. the total amount of activation at a given node was computed by adding reservoir ( t , n ) to reservoir ( t1 , n ) . at the end of 10 time steps the total amount of activation in the target nodes with low and high c was examined . if the spreading activation mechanism implemented in the networks varying in c adequately captures the lexical retrieval process described by chan and vitevitch ( 2009 ) , then  based on the mapping assumptions described above target nodes with low c will have higher activation values than target nodes with high c after 10 time steps . if the predicted results are indeed observed , this will demonstrate that the simple description offered by chan and vitevitch ( 2009 ) is minimally sufficient to account for the results obtained in two psycholinguistic experiments . in addition , obtaining the predicted results will further demonstrate that the large - scale structure of the lexicon influences processing more broadly , the results of the present simulation have implications for network science as well . recall that previous simulations ( e.g. , newman , 2003 ) looked at the extent to which information or diseases dispersed across networks varying in c. the present simulation instead examined how the spread of activation in such networks might influence a specific node . therefore the results of the present simulation offer a different perspective and new insight into studies of dispersion dynamics in complex systems . linear multiple regression was used to examine the influence that network structure  as measured by the clustering coefficient ( using the continuous values of c listed in table a1 in the appendix )  as well as degree , proportion of activation retained , and network density had on the final activation value in the target nodes after 10 time steps had elapsed in the simulation . the final activation value in the 24 target nodes was examined across 9 different levels of retained activation ( 24 networks  *  9 levels of retained activation  =  216 simulations ) . the results of the analysis indicated that all four of the independent variables contributed significantly , though not equally , to final activation value [ r  =  0.999 , f(4 , 211 )  =  43108.25 , p  <  0.0001 ] . in the following descriptions of the analysis we report the beta coefficients (  ; also known as standardized coefficients ) for each variable . the magnitude of  allows one to compare the relative contribution of each independent variable in the prediction of the dependent variable . the sign (  ) associated with the  coefficient indicates the direction of the relationship between the independent and dependent variables . we also report for each  coefficient the results of a t - test , which indicates that the independent variable made a statistically significant contribution to the prediction of the dependent variable ( even though the value of  might be numerically small ) . not surprisingly , target nodes that retained a larger proportion of incoming activation had higher activation values at the end of 10 time steps than target nodes that retained a smaller proportion of incoming activation [   =  + 0.999 , t(211 )  =  414.96 , p  <  0.0001 ] . the proportion of activation retained in a node was manipulated to verify that any influence of c that we might observe in the present simulation was not due to a unique setting of a particular parameter ( see pitt et al . more germane to the question of how clustering coefficient influences the retrieval of a specific node , target nodes with lower c had higher activation values than target nodes with higher c after 10 time steps [   =  0.026 , t(211 )  =  10.12 , p  <  0.0001 ] . as per the mapping assumptions between activation values and response latency and accuracy , the results suggest that target words with lower c are retrieved more quickly and more accurately than target words with higher c. activation values as a function of degree and c when the proportion of activation retained at a node ( r in eqs 2 and 3 ) equaled 0.3 and 0.7 are shown in figure 3 . these values of r were selected for illustrative purposes only ; we wished to avoid extreme values of r ( e.g. , 0.1 and 0.9 ) as well as the middle value of r ( 0.5 ) . in none of the simulations was there ever a case in which a target node with higher clustering coefficient had more activation than the target node with the same degree but lower clustering coefficient . the influence of c on activation values in figure 3 is seen by the consistently higher activation values for target nodes with lower c ( the diamonds ) compared to the activation values for target nodes with higher c ( the squares ) . final activation values in the target nodes after 10 time steps as a function of c and degree . the top panel shows the results of the simulation when ( the proportion of activation retained at a node ) r  =  0.3 , and the bottom panel shows the results when r  =  0.7 . these results are illustrative of other values of r. for instances in which the markers appear on top of one another the difference in activation value between high and low c was observed in the tenth , or hundredth position . target nodes with lower degree ( i.e. , few phonological neighbors ) had a higher activation value at the end of 10 time steps than target nodes with higher degree [ i.e. , many phonological neighbors ;   =  0.025 , t(211 )  =  5.91 , p  <  0.0001 ] . as per the mapping assumptions between activation values and response latency and accuracy , the results suggest that target words with few phonological neighbors are retrieved more quickly and accurately than target words with many phonological neighbors . the influence of degree on activation values can be seen in figure 3 by the relatively higher activation values for target nodes with lower degree compared to the activation values for target nodes with higher degree for both high and low c nodes ; degree is plotted on the x - axis . this finding replicates numerous studies examining the influence of degree ( known in the psycholinguistic literature as phonological neighborhood density ) in spoken word recognition ( e.g. , luce and pisoni , 1998 ) . we included in the present simulation nodes with a wide range of degree simply to be able to generalize more broadly our findings of the influence of the clustering coefficient on processing . we did not design the present simulation to nor set out to replicate the previously observed results regarding the influence of degree on spoken word recognition . observing the influence of degree on activation levels in the present simulation although network density in the high and low c networks was not statistically different , network density did have a small , but statistically significant , influence on the final activation values in the target nodes . recall that the network science term network density measures the number of connections that exist in an entire network in relation to the maximal number of connections that could exist in that network ( with a range from 0 to 1 ) , and should not be confused with the psycholinguistic term phonological neighborhood density ( which corresponds to the term degree in the present context ) . target nodes with higher network density had higher activation values at the end of 10 time steps than target nodes with lower network density [   =  + 0.012 , t(211 )  =  2.79 , p  <  0.01 ] . as per the mapping assumptions between activation values and response latency and accuracy , this result suggests that target words embedded in denser networks will be retrieved more quickly and accurately than target words embedded in sparser networks . the influence of network density on diffusion dynamics has been examined in other domains studied with network science ( e.g. , buskens and yamaguchi , 1999 ) . however , the influence of network density observed in the present simulation is ( to the best of our knowledge ) a novel finding in the domain of psycholinguistics . future psycholinguistic experiments could examine how network density influences spoken word recognition ( see also geer and luce , 2011 ) . in the present simulation we created 24 mini - networks ( extracted from the larger network of phonological word - forms examined in vitevitch , 2008 ) that varied in degree and clustering coefficient ( as well as the proportion of activation retained in a node ) to examine the influence of network structure on the cognitive process of spoken word recognition . a simple form of spreading activation was used to model the search and retrieval process during spoken word recognition . this simplified form of spreading activation can be viewed as a special instance of diffusion dynamics ( e.g. , the spread of disease through a social network ) , a topic commonly examined in network science ( e.g. , newman , 2003 ; naug , 2008 ; borge - holthoefer and arenas , 2010b ; borge - holthoefer et al . , 2011 ) . four factors were shown to influence the final activation value of the target nodes : ( 1 ) the proportion of activation retained in each node , ( 2 ) degree , ( 3 ) clustering coefficient , and ( 4 ) network density . not unexpectedly the results of our simulations showed that the proportion of activation retained in each node influenced the final activation value of the target nodes . nodes that retained more activation had higher activation values at the end of 10 time steps than nodes that retained less activation . the proportion of activation retained in each node was manipulated in order to explore the possibility that different outcomes might emerge at different amounts of retained activation . somewhat unexpectedly  because we did not set out to directly replicate this effect  we observed an influence of degree on the final activation values . degree was manipulated in the present simulation in order to generalize the results across a wide range of values for degree . we observed , however , that target nodes with higher degree had less activation than target nodes with lower degree . this result suggests that words with higher degree are retrieved more slowly and less accurately than words with lower degree , which replicates many psycholinguistic experiments examining the influence of phonological neighborhood density during spoken word recognition ( e.g. , luce and pisoni , 1998 ; vitevitch , 2003 ) . although the effect of degree observed in the present simulation replicated the results commonly found in studies of spoken word recognition , different influences of neighborhood density ( degree ) have been observed in other language - related processes . in the case of speech production , words with many neighbors are produced more quickly and accurately than words with few neighbors ( e.g. , vitevitch , 2002b ; vitevitch and sommers , 2003 ; cf . , it is important to note , however , that different mechanisms are believed to underlie the effects of neighborhood density observed in other language - related processes [ see vitevitch and storkel ( submitted ) for a description of the mechanism used in word learning ] . vitevitch ( 2002b ) and others suggested that during speech production the effects of neighborhood density emerge from the interaction of word - forms via representations of phonological segments . in those accounts of speech production , word - forms do not interact directly with each other in the lexicon ( as they do in the present simulation and in current models of spoken word recognition ) . words that sound similar to the target word become activated only by activation spreading through shared phonological segments ( or semantic information ) . indeed , gordon and dell ( 2001 ) showed how a two - step interactive - activation model consisting of separate layers for semantic features , words , and phonological segments with excitatory and bidirectional connections between layers ( but no connections between nodes within a layer ) could produce the effects of neighborhood density typically observed in speech production . the present simulation differs from the connectionist network used by gordon and dell ( 2001 ) in a couple ways . first , there are no connections among words in the gordon and dell ( 2001 ) model ; the present simulation does contain connections among words . second , the gordon and dell ( 2001 ) model contained representations of individual phonological segments , words , and semantic information ; the present simulation contained only phonological word - forms . we appreciate the value of representing other types of information in a model ( e.g. , phonological segments , or semantic information ) , but a complex network that includes two types of nodes with links connecting one type to another is beyond the scope of the present investigation . such networks  known as bipartite networks  are very complicated mathematical entities , and still pose significant challenges to network scientists . admittedly , the complexity of bipartite networks might be viewed by some as a limitation of the network science approach in the study of cognition . we believe , however , that the network science approach has other advantages for the study of cognition that outweigh such shortcomings . for example , the network science approach provided the tools that enabled chan and vitevitch ( 2009 ) to examine the influence of a new , previously unexplored characteristic of words on spoken word recognition , namely clustering coefficient , c. interestingly , the results of the present simulation showed that target nodes with lower c had higher activation levels after 10 time steps than target nodes with higher c. this result suggests that words with lower clustering coefficients are retrieved more quickly and accurately than words with higher clustering coefficients , replicating the results of psycholinguistic experiments reported by chan and vitevitch ( 2009 ) . this result also suggests that a simple diffusion mechanism  commonly examined in many other domains explored by network science  could be used to account for the cognitive process of spoken word recognition ( see borge - holthoefer and arenas , 2010b ; borge - holthoefer et al . , 2011 for a similar account in other cognitive domains ) . furthermore , the present simulation contributes more broadly to network science by demonstrating that diffusion dynamics can affect processing of an individual node . studies of diffusion dynamics typically examine how many nodes in a system are affected during diffusion ( e.g. , newman , 2003 ; naug , 2008 ) . finally , the results of the present simulation showed that target nodes embedded in denser networks had higher activation values after 10 time steps than target nodes embedded in sparser networks . although previous psycholinguistic research has shown that immediate neighbors of a word influence processing ( e.g. , luce and pisoni , 1998 ) , the present result suggests that more distant neighbors , and the connectivity among those distant neighbors might also influence spoken word recognition . to the best of our knowledge the influence of network density on language processing has not been reported previously in the psycholinguistic literature , thus indicating a new direction for future psycholinguistic research . we acknowledge that the present simulation is a simplified version of the structure and processes we envision occurring in the larger phonological network . however , it is important to keep in mind that  [ m]odels are not intended to capture fully the processes they attempt to elucidate . rather , they are explorations of ideas about the nature of cognitive processes . in these explorations , simplification is essential  through simplification , the implications of the central ideas become more transparent  ( mcclelland , 2009 , p. 11 ) . we believe the present simulation has greatly elucidated the manner in which network structure might influence lexical retrieval during spoken word recognition . the authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest .
network science describes how entities in complex systems interact , and argues that the structure of the network influences processing . 
 clustering coefficient , c  one measure of network structure  refers to the extent to which neighbors of a node are also neighbors of each other . 
 previous simulations suggest that networks with low c dissipate information ( or disease ) to a large portion of the network , whereas in networks with high c information ( or disease ) tends to be constrained to a smaller portion of the network ( newman , 2003 ) . in the present simulation we examined how c influenced the spread of activation to a specific node , simulating retrieval of a specific lexical item in a phonological network . 
 the results of the network simulation showed that words with lower c had higher activation values ( indicating faster or more accurate retrieval from the lexicon ) than words with higher c. these results suggest that a simple mechanism for lexical retrieval can account for the observations made in chan and vitevitch ( 2009 ) , and have implications for diffusion dynamics in other fields .