Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"average path length"”.
-
Critical Node Identifcation for accessing network vulnerability, a necessary consideration
… participation of a node in forming the shortest path route. The Banzhaf power index is inspired from the theory of voting games in game theory whereas, the diversity index is inspired from the analysis and understanding of the influence of the average path length of a network on its performance. …
-
FLOC-SPANNER: An O(1) time, locally self-stabilizing algorithm for geometric spanner construction in a wireless sensor network
… is verified using large scale simulations. The average path length ratio for routing along the spanner for large networks is shown to be less than 2.;Geometric Spanners is a well-researched topic. The algorithm presented in this thesis differs from other spanner algorithms in the following ways: …
-
Study of parton energy loss in heavy ion collisions using charged particle spectra measured with CMS
… xenon nuclei are also studied to constrain the path length dependence of parton energy loss. The strength of energy loss is found to increase with both [square root of SNN and the average path length through the QGP. Comparisons to theoretical models and previous measurements indicate that the …
-
Nested (2,r)-regular graphs and their network properties.
… We examine the network properties such as the average path length, clustering coefficient, and the spectrum of these nested graphs.</p>
-
Self-organizing Bluetooth scatternets
… TSF generates tree topologies where the average path length between any node pair grows logarithmically with the size of the scatternet. Our scheduling algorithm, called TSS (Tree Scatternet Scheduling), takes advantage of the tree structure of the scatternets constructed by TSF. Unlike …
-
Graph theory analysis of functional and structural connectome: Links to Auditory Processing Disorder
… precentral gyrus based on network measures of average path length (APL) and betweenness centrality, respectively. In Study 1, the APD group showed a positive correlation in the left parahippocampal gyrus between PC and Spatial advantage performance on the LiSN-S task. In contrast, in Study 2, …
-
Variational approximation for importance sampling and statistical inference on social influence
… with a high clustering coefficient and a low average path length. We generalize the regular Erd\H{o}s-R\'enyi dyadic random graph by considering higher-order motif, which is triadic graph. We show some properties of our proposed model, analyze the probability of multi-edges, and compare the …
-
Unravelling the complexity of metabolic networks
… topological characteristics, such as a small average path-length, large clustering coecient and a hierarchical modular structure. Relations between structure, function and evolution, however, for even the simplest of organisms is far from understood. In this thesis, we employ network analysis …
-
Mass-balanced randomization : a significance measure for metabolic networks
… unifying structural properties, including small average path length, large clustering coefficient, heavy-tail degree distribution, and hierarchical organization, viewed as requirements for efficient and robust system architectures. Existing studies estimate the significance of network properties …
-
A Framework for Web Object Self-Preservation
… and simulation show that the USW graph has an average path length (L(G)) and clustering coefficient (C(G)) values comparable to small-world graphs. A high C(G) is important because it reflects how likely it is that a WO will be able spread copies to other domains, thereby increasing its …
-
ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS
… networks. First, we com-pute the minimum cost path between a given source-destination pair with channelassignment on each link in the path such that no two transmissions interfere witheach other. Such a path must satisfy the constraint that no two consecutive links onthe path are assigned the …
-
Qualitative topological coverage of unknown environments by mobile robots
… the constructed model to plan complete coverage paths. A topological map is used for planning coverage paths in this thesis. The landmarks in the map are large scale features that occur naturally in the environment. Due to the qualitative nature of topological maps, it is rather difficult to …