Digraphons: connectivity and spectral aspects
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908710740164608 |
|---|---|
| author | Hladký, Jan Savický, Petr |
| author_facet | Hladký, Jan Savický, Petr |
| contents | The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of sequences of directed graphs (digraphs). Our results address their decomposition into strongly connected components, periodicity, spectral properties, and asymptotic behaviour of their large powers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_16839 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Digraphons: connectivity and spectral aspects Hladký, Jan Savický, Petr Combinatorics The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of sequences of directed graphs (digraphs). Our results address their decomposition into strongly connected components, periodicity, spectral properties, and asymptotic behaviour of their large powers. |
| title | Digraphons: connectivity and spectral aspects |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2510.16839 |