Skip to content
DraconiticResearch
Search Sources API
182,460 studies31 sourcesUpdated 40 min ago
PreprintarXiv licencearXiv

Intersections of Directed Graphs

  • Zhanping Yang
  • Qinghou Zeng
Open at sourcePDFDOICite

Abstract

Given two weighted directed graphs of order n, we study how much their overlap can deviate from its random average under relabelling, and how concentrated the distribution of their intersection is when they are placed at random. Bollobás and Scott studied these problems on weighted k-uniform hypergraphs and raised the corresponding questions for directed graphs. In this paper, we study these problems for weighted directed graphs and obtain results analogous to those in the weighted hypergraph setting.

Related

  1. Intersections of Oriented Graphs and Tournaments
    Zhanping Yang, Qinghou Zeng
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Bidirectional Labeling with b-values in Directed Graphs and Decision Hypergraphs
    Arthur Léonard, François Clautiaux
    HALPreprintLicence Ouverte 2.0Full textGeneral mathematicsHAL
  3. Parametrized Power-Iteration Clustering for Directed Graphs
    Gwendal Debaussart-Joniec, Harry Sevi, Matthieu Jonckheere +1
    Proceedings of the 41st International Conference on Machine Learning (ICML), PMLRPeer-reviewedLicence not statedGeneral mathematicsHAL
  4. Generalized Dirichlet Energy and Graph Laplacians for Clustering Directed and Undirected Graphs
    Harry Sevi, Gwendal Debaussart-Joniec, Malik Hacini +2
    Transactions on Machine Learning ResearchPeer-reviewedLicence not statedGeneral mathematicsHAL
  5. Enumeration of small vertex-transitive directed strongly regular graphs
    A. E. Brouwer, Š. Gyürki
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{yang2026intersections,
  title = {{Intersections of Directed Graphs}},
  author = {Zhanping Yang and Qinghou Zeng},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.24087},
  eprint = {2609.24087},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.24087},
}
RIS
TY  - UNPB
TI  - Intersections of Directed Graphs
AU  - Zhanping Yang
AU  - Qinghou Zeng
PY  - 2026
DA  - 2026/09/21
PB  - arXiv
DO  - 10.48550/arxiv.2609.24087
UR  - https://arxiv.org/abs/2609.24087
AB  - Given two weighted directed graphs of order n, we study how much their overlap can deviate from its random average under relabelling, and how concentrated the distribution of their intersection is when they are placed at random. Bollobás and Scott studied these problems on weighted k-uniform hypergraphs and raised the corresponding questions for directed graphs. In this paper, we study these problems for weighted directed graphs and obtain results analogous to those in the weighted hypergraph setting.
ER  -