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 20 of 32 for “"Random Networks"”.
-
Robustness in large-scale random networks
We consider the issue of protection in very large networks displaying randomness in topology. We employ random graph models to describe such networks, and obtain probabilistic bounds on several parameters related to various protection schemes. In particular, we take the case of random regular …
-
The statistical mechanics of continuous random networks
Under sufficient permanent random covalent bonding, a fluid of atoms or small molecules is transformed into an amorphous solid network. Being amorphous, local structural properties in such networks vary across the sample. A natural order parameter, resulting from a statistical-mechanical approach, …
-
Computational and Statistical Detection of High-Dimensional Latent Space Structure in Random Networks
… optimal test for detecting the spherical random geometric graph is the signed triangle count. We contribute to the existing literature by confirming that the signed triangle count is computationally optimal among low-degree polynomial tests. Our main technical ingredient is a strategy for …
-
HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems
… biological, social, and various infrastructure networks, which have, in turn, contributed to the rise of massive networks. During the past decade, analyzing and mining of these networks has become an emerging research area with many real-world applications. The most relevant problems in this …
-
How network structure impacts socially reinforced diffusion?
… reinforcement threshold for adoption, clustered networks are better conduits of social contagion than random ones. Using models with deterministic thresholds this argument formalizes the idea that transmission will get 'stuck' should the number of neighboring adopters fall below a threshold. In …
-
The Betweenness Centrality Of Biological Networks
… have generated genome-wide protein interaction networks for many organisms including Saccharomyces cerevisiae (baker's yeast), Caenorhabditis elegans (worm) and Drosophila melanogaster (fruit fly). In this thesis, we examine the vertex and edge betweenness centrality measures of these graphs. …
-
Simulating Network Structure, Layering Multi-layer Network System and Developing Network Block Configuration Model to Understand and Improve Energy Conservation in Residential Buildings
… I examined if and how the structure of peer networks can impact residents' conservation behaviors through network analysis by employing agent-based simulation techniques. Following confirmation of the impact that network structure has on user behavior, I created a layered network model to …
-
Large scale structural optimization using genetic and generative algorithms with sequential linear programming
… based on generative algorithms and Boolean random networks are proposed that facilitate systematic exploration of the design space while limiting the number of design variables. The presented methodology is demonstrated on classical planar and space truss optimization problems. A nested …
-
Structure and evolution of communication networks in organizations
… statistics, we show how communication networks in an organization differ from random networks and other social networks. We also compare and contrast the three types of communication networks. Using Quadratic Assignment Procedure (QAP), Multiple Regression Quadratic Assignment Procedure …
-
Backup Radio Placement for Optical Fault Tolerance in Hybrid Wireless-Optical Broadband Access Networks
… algorithms, we run simulation on real and random networks. The simulation results show that our approach gives a more feasible and cost-effective way to provide optical fault-tolerance compared to traditional PON and other existing solutions.
-
Parallel Algorithms for Switching Edges and Generating Random Graphs from Given Degree Sequences using HPC Platforms
Networks (or graphs) are an effective abstraction for representing many real-world complex systems. Analyzing various structural properties of and dynamics on such networks reveal valuable insights about the behavior of such systems. In today's data-rich world, we are deluged by the massive amount …
-
Stochastic optimization application in molecular electronics
… by allowing molecules to self-assemble into random networks. These molecules are capable of retaining different conductive states. The challenge then is to program or reconfigure the molecular states of the nanocell post-fabrication. In essence, the nanocell idea is to shift the burden from …
-
Actomyosin Contractility in Nonmuscle Cells
… of their motion in idealized computer-generated random, isotropic actin networks and actin bundles. The networks and bundles are generated as random collections of actin filaments in two dimensions with constrained orientations, crosslinked and attached to fixed walls: four walls for isotropic …
-
Electrical and thermal characterization techniques for carbon nanotube transistors and networks
… increase the ION/IOFF ratio of carbon nanotube random network transistors is also demonstrated. The ratio is increased by three orders of magnitude, with minimal reduction in ION (< 50%). It is shown that adsorbed water rather than oxygen promotes nanotube breakdown. Finally, the design of an …
-
Cooperative routing in wireless networks
… efficiency and reliability in wireless ad-hoc networks. First, we introduce the idea of wireless cooperation advantage. We formulate the problem of finding the minimum energy cooperative route for a wireless network under idealized channel and receiver models. Fundamental to the understanding …
-
A statistical mechanics approach for an effective, scalable, and reliable distributed load balancing scheme for grid networks
… collaborative computing environment called Grid Networks. Grid network is a parallel and distributed computing network system that possesses the ability to achieve a higher computing throughput by taking advantage of many computing resources available in the network. To achieve a scalable and …
-
Applications of Random Matrix Theory to Portfolio Management and Financial Networks
This thesis is an application of Random Matrix Theory (RMT) to portfolio management and financial networks. From a portfolio management perspective, we apply the RMT approach to clean measurement noise from correlation matrices constructed for large portfolios of stocks of the FTSE 100. We apply …
-
Dynamical systems on networks
… and a model for opinion formation in social networks. Our main focus is on understanding the fixed points of these systems and their stability. For many models the stability of such fixed points can be studied with a Laplacian matrix. We give a formula for the inertia of these matrices, …
-
Day-roosting Social Ecology of the Northern Long-eared Bat (Myotis septentrionalis) and the Endangered Indiana Bat (Myotis sodalis)
… Kentucky, USA, resulted in formation of non-random networks of roosts that exhibited a trend toward centralization. Centralization of day-roost networks was reflected in the social structure of colonies, which were characterized by dense associations among individuals within colonies. Social …
Page 1 of 2