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 5 of 5 for “"Exponential Random Graphs"”.

  1. Exponential Random Graphs and a Generalization of Parking Functions

    Random graphs are a powerful tool in the analysis of modern networks. Exponential random graph models provide a framework that allows one to encode desirable subgraph features directly into the probability measure. Using the theory of graph limits pioneered by Borgs et. al. as a foundation, we …

    denver Repository record for Exponential Random Graphs and a Generalization of Parking Functions (opens in a new tab)

  2. The Effects of Geography and Proximity on Board of Directors: An Exponential Random Graphs Approach

    This dissertation aims at exploring how physical proximity, among other geographical elements, affects the synthesis of boards of directors, the decisions executives make, and, in general, organizations. Drawing on the rich literature in economic geography, these studies focus on re-evaluating the …

    arkansas Repository record for The Effects of Geography and Proximity on Board of Directors: An Exponential Random Graphs Approach (opens in a new tab)

  3. Modeling Dynamic Network with Centrality-based Logistic Regression

    … attempts to combine two of these concepts: an exponential random graph and a centrality index. Exponential random graphs comprise the most useful class of probability models for network data. These models often require the assumption of a complex dependence structure, which creates certain …

    waterloo Repository record for Modeling Dynamic Network with Centrality-based Logistic Regression (opens in a new tab)

  4. New approaches in network data analysis

    … on cross-sectional networks based on Markov graphs, whereas the second takes the evolution of networks with dynamical structure into account. Analyzing network data is challenging in terms of modeling and computation due to large and dependent data sets. The dissertation starts with an …

    lmu-germany Repository record for New approaches in network data analysis (opens in a new tab)

  5. Estimation methods for Bayesian exponential random graph models under the horseshoe prior.

    … frameworks for analyzing network data are Exponential Random Graph Models (ERGMs), which provide a principled approach to capturing structural dependencies. However, ERGMs remain challenging to estimate, especially in sparse or high-dimensional settings where models suffer from degeneracy …

    louisville Repository record for Estimation methods for Bayesian exponential random graph models under the horseshoe prior. (opens in a new tab)