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 128 for “"random networks"”.
-
Connectivity of random networks
The concept of message propagation over random networks is of fundamental importance in such diverse problem areas as spread of an epidemic in a closed population, design of survivable communication networks, connectivity of neural networks, etc. Major limitations of the approaches available in …
-
Communities and competition in random networks
… inspired by the social properties of large-scale random networks. Firstly, we consider evolutionary games on a population whose underlying topology of interactions is determined by a binomial random graph. Our focus is on 2-player symmetric games with 2 strategies played between the incident …
-
Uniform multicommodity flows in random networks
… constraints.</p> <p>This thesis considers networks with random edge-capacities. Multicommodity flows are of interest in operational research and combinatorial optimisation and sampling. They have been studied extensively from a "worst-case" perspective, but the "typical" behaviour of …
-
Statistical Inference in Scale-Free Random Networks
… of network science observed that many real-world networks have degree distributions with power-law tails. This discovery, also known as the scale-free property, led to the development of networks models that could imitate scale-free behavior. While these network models provide useful …
-
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, …
-
Rigidity and self-organization of random networks
Thesis (Ph. D.)--Michigan State University, Department of Physics & Astronomy, 2003
-
Trees, paths and avalanches on random networks
Thesis (Ph. D.)--Michigan State University. Department of Physics and Astronomy, 2002
-
Random Networks with Tunable Degree Distribution and Clustering
We present an algorithm for generating random networks with arbitrary degree distribution and clustering (frequency of triadic closure). We use this algorithm to generate networks with exponential, power law, and poisson degree distributions with variable levels of clustering. Such networks may be …
-
Throughput Stability and Flows in Large-Scale Random Networks
… of the maximum stable throughput in large-scale random networks as a function of network size is studied in this thesis. The problem is formulated as one of determining the value of the maximum multicommodity flow on the corresponding random unit-disk graph and shown to be equivalent. In this …
-
Mean Eigenvalue Counting Function Bound for Laplacians on Random Networks
… our work here. We introduce here three models of random graphs and show that the eigenvalue counting function of Laplacians on these graphs has exponential decay bound. Since our methods heavily depend on the first nonzero eigenvalue of Laplacian, we study also this eigenvalue for the graph in …
-
RANDOM NETWORKS OF ONE-DIMENSIONAL CONDUCTIVE NANOMATERIALS: FABRICATION, PROPERTIES, AND APPLICATIONS
Random networks of one-dimensional conductive nanomaterials are unique structures that exhibit nominal properties useful in flexible thin-film electronics; however, a greater understanding of these properties is necessary to enable high performance device functionality. This thesis presents a …
-
Theory of the elastic and vibrational properties of central force random networks
Thesis (Ph. D.)--Michigan State University. Department of Physics and Astronomy, 1985
-
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 …
-
Applications of fixed point theory to distributed optimization, robust convex optimization, and stability of stochastic systems
… and distributed optimization problems over random networks. Centralized robust convex optimization is defined on Hilbert spaces that is included in the defined optimization problem. An algorithm using diminishing step size is proposed to solve the optimization problem under suitable …
-
Topology and Dynamics of Complex Social Networks
The problem of modeling complex social networks is considered from three perspectives: The problem of describing network topology; the problem of modeling dynamic processes on networks; and the problem of network sampling. These perspectives are highly complementary, each providing results with …
-
Price Discrimination in Large Social Networks
… be insignificant for certain classes of large networks. Thus, firms and public agencies may need to be more careful about the design of mechanisms within social networks. In this thesis, we focus on a particular application of mechanism design problems with social network effects, i.e., the …
-
Dynamical implications of network statistics
Dynamics on large networks can be highly complex. I present several methods for investigating the effects of network structure/statistics on rate dynamics and spike correlations. The dynamical models under consideration come from computational neuroscience, but these methods may generalize to other …
-
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. …
-
The Psychology of the Supreme Court: Modeling Judicial Semantics from Written Opinions
The construction of knowledge networks from text is a novel way to study the cognitive organization of domain specific content. This dissertation evaluated the application of knowledge networks to legal text. Text analysis methods were used to transform text from 8,014 Supreme Court opinions into …
Page 1 of 7