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 166 for “"Degree distribution"”.

  1. Random Networks with Tunable Degree Distribution and Clustering

    … 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 used as models of …

    cornell Repository record for Random Networks with Tunable Degree Distribution and Clustering (opens in a new tab)

  2. Improving the Left Degree Distribution of Fountain Codes in the Finite-Length Regime

    … channel. The graph is generated from an ensemble degree distribution. The LT codes are also known as rateless codes, in the sense that they can generate potentially limitless codeword symbols from original data and self-adjust to channels with different erasure probabilities. LT Codes also have a …

    queens Repository record for Improving the Left Degree Distribution of Fountain Codes in the Finite-Length Regime (opens in a new tab)

  3. A Study of Random Duplication Graphs and Degree Distribution Pattern of Protein-Protein Interaction Networks

    … interaction networks present a unique degree distribution pattern, where the majority of the proteins are sparsely connected, while densely-connected proteins also exist. Since the degree distribution pattern of protein-protein interaction networks arises through a long-time …

    waterloo Repository record for A Study of Random Duplication Graphs and Degree Distribution Pattern of Protein-Protein Interaction Networks (opens in a new tab)

  4. Degree Assortativity and Estimation of Degree Distribution in a Contact Network of People Who Inject Drugs

    … physical contact (syringe sharing) network degree distribution. Visualization of degree distribution for social and physical networks, Kolmogorov-Smirnov tests of difference, and kernel tests of equivalence were used for comparison of distributions. Spearman's rho and GAM non-parametric …

    portland-state Repository record for Degree Assortativity and Estimation of Degree Distribution in a Contact Network of People Who Inject Drugs (opens in a new tab)

  5. On the design of Raptor codes over Gaussian channels

    … that there exists no universal choice of input degree distribution or constructing capacity-achieving Raptor codes using mean-LLR, EXIT chart approach. An approach of finding input and output degree distribution jointly is proposed. Through the codes constructed by this approach, we show our …

    ottawa-retro Repository record for On the design of Raptor codes over Gaussian channels (opens in a new tab)

  6. Applications of Visibility Graphs for the representation of Time Series

    … these parameters and the fitting with the degree distribution of the corresponding visibility graphs. When chaos is present, we link them with the exponent obtained when fitting the degree distribution to a power-law of the form x^(¿¿). With this approach, we provide an integrated vision of …

    upv Repository record for Applications of Visibility Graphs for the representation of Time Series (opens in a new tab)

  7. Barabási-Albert random graphs, scale-free distributions and bounds for approximation through Stein's method

    … used to model social networks with scale-free degree distributions. It has been shown that Barabási-Albert random graph models have asymptotic scale-free degree distributions as the size of the graph tends to infinity. Real world networks, however, have finite size so it is important to know …

    oxford Repository record for Barabási-Albert random graphs, scale-free distributions and bounds for approximation through Stein's method (opens in a new tab)

  8. Soliton-Like LT Codes over GF(4) and GF(8)

    … use over erasure channels. However, the degree distributions designed for the Binary Erasure Channel (BEC), such as the Robust Soliton Distribution (RSD) which are asymptotically and universally optimal over the BEC, are not optimal over noisy channels. Research has been done to improve …

    queens Repository record for Soliton-Like LT Codes over GF(4) and GF(8) (opens in a new tab)

  9. Outage Capacity and Code Design for Dying Channels

    … We consider the rateless codes and optimize the degree distribution to maximize the average recovery probability. In particular, we first study the upper bound of the average recovery probability, based on which we define the objective function as the gap between the upper bound and the average …

    tamu Repository record for Outage Capacity and Code Design for Dying Channels (opens in a new tab)

  10. Error and attack tolerance of complex real networks

    … networks is attributed to their non-homogeneous degree distribution. Non-homogenous networks are also known as scale free networks. Real networks along with the scale free property show high modularity.;Many network models have been proposed to model real networks. Erdos-Renyi Random network …

    wvu Repository record for Error and attack tolerance of complex real networks (opens in a new tab)

  11. Network Models and Information Diffusion

    … exhibit strongly connected communities and a degree distribution that follows a power law. This thesis explores these two topics - community structure and power law distributions - as they relate to network models and the diffusion of information on networks. We first consider the generation …

    cornell Repository record for Network Models and Information Diffusion (opens in a new tab)

  12. Extreme value theory and graphs, bridging the gap

    … of graphical structure, such as their degree distribution, and graphs have been used for their stochastic representation to aid in dimensionality reduction in EVT models. The work contained in this thesis contributes to both of these areas. For characteristics of graphical structures, …

    lancaster Download PDF for Extreme value theory and graphs, bridging the gap (opens in a new tab)

  13. Topological features of online social networks

    The first-order properties like degree distribution of nodes and the clustering co-efficient have been the prime focus of research in the study of structural properties of networks. The presence of a power law in the degree distribution of nodes has been considered as an important structural …

    uvic Repository record for Topological features of online social networks (opens in a new tab)

  14. Borromean: Preserving Binary Node Attribute Distributions in Large Graph Generations

    … Moreover, generating such graphs in which the distribution of the node attributes preserves real-world characteristics is still an open challenge. This thesis introduces Borromean, a graph generating algorithm that creates synthetic graphs with binary node attributes in which the attributes …

    usf Repository record for Borromean: Preserving Binary Node Attribute Distributions in Large Graph Generations (opens in a new tab)

  15. Models for On-line Social Networks

    … in the deterministic ILT model such as average degree, average distance, and diameter. We show that the domination number and cop number stay the same no matter how many nodes or edges are added over time. We investigate the automorphism groups and eigenvalues of graphs generated by the ILT …

    wilfrid-laurier Repository record for Models for On-line Social Networks (opens in a new tab) Download PDF for Models for On-line Social Networks (opens in a new tab)

  16. The Betweenness Centrality Of Biological Networks

    … or edge. Our primary observation is that the distribution of the vertex betweenness centrality follows a power law, but the distribution of the edge betweenness centrality has a Poisson-like distribution with a very sharp spike. To investigate this phenomenon, we generated random networks with …

    vt Repository record for The Betweenness Centrality Of Biological Networks (opens in a new tab)

  17. Modeling and Analysis of Affiliation Networks with Subsumption

    … attachment growth and a power-law in the degree distribution (where degree is defined as the number of affiliations a node belongs to). We develop a theoretical model of this network generation procedure, prove that the degree distribution in the hypergraph case is governed by the …

    cuny-grad Repository record for Modeling and Analysis of Affiliation Networks with Subsumption (opens in a new tab)

  18. Low-Complexity Soliton-like Network Coding for a Resource-Limited Relay

    … Particularly, the sink should see a Soliton-like degree distribution for efficient BP decoding. The first protocol, named Soliton-like rateless coding (SLRC), recognizes that certain encoded packets are essential for BP decoding to perform well. Therefore, the relay protects these important …

    queens Repository record for Low-Complexity Soliton-like Network Coding for a Resource-Limited Relay (opens in a new tab)

  19. A Practical Coding Scheme For Broadcast Channel

    … We also propose a method for optimizing the degree distribution of multilevel LDPC codes based on the analysis of EXIT functions.</p>

    mcmaster Repository record for A Practical Coding Scheme For Broadcast Channel (opens in a new tab)

Page 1 of 9