Degree-based connected graph construction with assortativity constraint
Year: 2025
Type: article
Abstract: Degree-based graph construction is a fundamental problem in network science. A graph is simple if there are no self-loops and no multiple links between any pair of nodes in the graph. A degree sequence d = ( d 1 , d 2 , ⋯ , d N ) is graphical if d can be represented as the degree sequence of at least one simple graph, where the graph is called a realization of the sequence d. In this work, we introduce a novel method (LSFGR) for generating simple graphs from graphical degree sequences, focusing additionally on connectedness and on assortativity. LSFGR guarantees connected graphs for all potentially connected degree sequences. In the case where a degree sequence has no simple realization, LSFGR produces graphs with at most one node with self-loops. In addition, the graphs generated from LSFGR characterize real-world networks with medium assortativity.
Source: New Journal of Physics
Authors: Yingyue Ke, Piet Van Mieghem
Institution: Delft University of Technology
Language: English
Subfield: Statistical and Nonlinear Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,610
Funder: China Scholarship Council
Award: G4070492857
OpenAlex ID: W4414396385