Phase Transitions in Edge-Weighted Exponential Random Graphs: Near-Degeneracy and Universality
classification
🧮 math.PR
math-phmath.MP
keywords
exponentialgraphsrandomdistributionedge-weightednear-degeneracynetworksuniversality
read the original abstract
Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is especially problematic. We extend the existing exponential framework by proposing a generic common distribution for the edge weights. Minimal assumptions are placed on the distribution, that is, it is non-degenerate and supported on the unit interval. By doing so, we recognize the essential properties associated with near-degeneracy and universality in edge-weighted exponential random graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.