Graph schemes, graph series, and modularity
نویسندگان
چکیده
To a simple graph we associate so-called series, which can be viewed as the Hilbert–Poincaré series of certain infinite jet scheme. We study new q-representations and examine modular properties several examples including Dynkin diagrams finite affine type. Notably, obtain formulas for type A7 A8 in terms “sum tails” D4 D5 form indefinite theta functions signature (1,1). also related to sums powers divisors corresponding 5-cycles. For graphs, prove that are mixed quantum forms mock forms.
منابع مشابه
Spectral Graph Forge: Graph Generation Targeting Modularity
Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure. In this paper, we introduce a principled methodology, the Spectral Graph Forge, for generating random graphs that preserves community structure from a real network of interest, in terms of modularity. Our approac...
متن کاملEnhancing Modularity-Based Graph Clustering
Graph clustering is defined as grouping the vertices of a given input graph into clusters. This article proposes a Two-Phase Modularity-Based Graph Clustering (2-PMGC) algorithm based on modularity optimization. The algorithm consists mainly of two steps; namely, coarsening and refinement. The coarsening phase takes the original graph as input and produces levels of coarsen graphs. The second p...
متن کاملSpectral graph analysis of modularity and assortativity.
Expressions and bounds for Newman's modularity are presented. These results reveal conditions for or properties of the maximum modularity of a network. The influence of the spectrum of the modularity matrix on the maximum modularity is discussed. The second part of the paper investigates how the maximum modularity, the number of clusters, and the hop count of the shortest paths vary when the as...
متن کاملMultilevel Graph Partitioning Schemes
In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph. We investigate the effectiveness of many different choices for all three phases: coarsening, partition of the coarsest graph, and refinement. In p...
متن کاملSchemes and the IP-graph
We consider the common-divisor graph of the set of valencies of a naturally valenced scheme, where scheme is defined in the sense of P.-H. Zieschang. We prove structural results about this graph, and thus give restrictions on the set of natural numbers that can occur as the set of valencies of a naturally valenced scheme.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2023
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2023.105749