On the Characterization of Regular Ring Lattices and their Relation with the Dirichlet Kernel
Regular ring lattices (RRLs) are defined as peculiar undirected circulant graphs constructed from a cycle graph, wherein each node is connected to pairs of neighbors that are spaced progressively in terms of vertex degree. This kind of network topology is extensively adopted in several graph-based distributed scalable protocols and their spectral properties often play a central role in the determination of convergence rates for such algorithms. In this work, basic properties of RRL graphs and the eigenvalues of the corresponding Laplacian and Randi\'{c} matrices are investigated. A deep characterization for the spectra of these matrices is given and their relation with the Dirichlet kernel is illustrated. Consequently, the Fiedler value of such a network topology is found analytically. With regard to RRLs, properties on the bounds for the spectral radius of the Laplacian matrix and the essential spectral radius of the Randi\'{c} matrix are also provided, proposing interesting conjectures on the latter quantities.
Code (0)
등록된 구현이 없습니다.
Tasks
RelationSimilar Papers 제목 키워드 기반
Lattice Convolutional Networks for Learning Ground States of Quantum Many-Body Systems
Deep learning methods have been shown to be effective in representing ground-state wave functions of quantum many-body systems. Existing methods use convolutional neural networks (CNNs) for square lattices due to their i…
Graph Neural NetworkExploring the structure-property relations of thin-walled, 2D extruded lattices using neural networks
This paper investigates the structure-property relations of thin-walled lattices under dynamic longitudinal compression, characterized by their cross-sections and heights. These relations elucidate the interactions of di…
Transfer LearningStrategy-proof aggregation rules in median semilattices with applications to preference aggregation
Two characterizations of the whole class of strategy-proof aggregation rules on rich domains of locally unimodal preorders in finite median join-semilattices are provided. In particular, it is shown that such a class con…
Fast and Flexible Monotonic Functions with Ensembles of Lattices
For many machine learning problems, there are some inputs that are known to be positively (or negatively) related to the output, and in such cases training the model to respect that monotonic relationship can provide reg…
Cooperation in regular lattices
In the context of Evolutionary Game Theory, one of the most noteworthy mechanisms to support cooperation is spatial reciprocity, usually accomplished by distributing players in a spatial structure allowing cooperators to…