Dimension Reduction in Vertex-Weighted Exponential Random Graphs
Publication Date
9-16-2020
Document Type
Article
Organizational Units
College of Natural Science and Mathematics, Mathematics
Keywords
Random graphs, Vertex weights, Hamiltonian, Vector equation
Abstract
We investigate the behavior of vertex-weighted exponential random graphs. We show that vertex-weighted exponential random graphs with edge weights induced by products of independent vertex weights are approximate mixtures of graphs whose vertex weight vector is a near fixed point of a certain vector equation. For graphs with Hamiltonians counting cliques, it is demonstrated that, under appropriate conditions, every solution to this equation is close to a block vector with a small number of communities. We prove that for the cases of positive weights and small weights in the Hamiltonian in particular, the vector equation has a unique solution. Lastly, the behavior of vertex-weighted exponential random graphs counting triangles is studied in detail and the solution to the vector equation is shown to approach the zero vector as the weight diverges to negative infinity for sufficiently large networks.
Copyright Date
9-16-2020
Copyright Statement / License for Reuse

All Rights Reserved.
Rights Holder
Elsevier B.V
Provenance
Received from author
Language
English (eng)
Publication Statement
Copyright is held by Elsevier B.V. User is responsible for all copyright compliance.
Publication Title
Physica A: Statistical Mechanics and its Applications
Volume
561
First Page
125289
ISSN
1873-2119
Recommended Citation
DeMuse, R., & Yin, M. (2021). Dimension reduction in vertex-weighted exponential random graphs. Physica A: Statistical Mechanics and its Applications, 561, 125289. https://doi.org/10.1016/j.physa.2020.125289