Metraipolis › archive › dc_9902bb10441b

The Iterated Local Transitivity Model for oriented graphs — arXiv:2611.03843

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03843
License (as archived)
CC0-1.0
Archived
2026-11-04T19:00:14.138Z
SHA-256 of the archived text
3f96765453432516a8a33cd891295173353db0299c218956676b88681bba6037
Stable URL of this page
https://metraipolis.com/documento/dc_9902bb10441b

How to cite

The Iterated Local Transitivity Model for oriented graphs — arXiv:2611.03843 — arXiv (en), https://arxiv.org/abs/2611.03843 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9902bb10441b (Metraipolis archive dc_9902bb10441b, sha256 3f96765453432516a8a33cd891295173353db0299c218956676b88681bba6037)
BibTeX
@misc{dc9902bb10441b,
  title = {The Iterated Local Transitivity Model for oriented graphs — arXiv:2611.03843},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03843},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9902bb10441b; sha256 3f96765453432516a8a33cd891295173353db0299c218956676b88681bba6037},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03843. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Transitivity in social and other complex networks describes the tendency for two nodes with a common neighbor to become adjacent. We propose a new model for complex networks based on transitivity, called the Iterated Local Transitivity Model for Oriented Graphs (ILTO). The model generalizes the Iterated Local Model for Tournaments (ILMT). As in ILMT, oriented graphs are generated iteratively by cloning nodes and their adjacencies, with arcs between clones oriented either as the corresponding arcs between their parents or in the reverse direction. This process produces dense oriented graphs and, under suitable conditions, graphs with high connectivity and small diameter. We analyze the universality properties of ILTO, showing that, for generating sequences with infinite support, the base oriented graph determines which oriented graphs appear as induced subgraphs, unlike in ILMT. We study motifs in ILTO and show that when the base graph is a tournament and the generating sequence has infinite support, the model generates quasirandom tournament sequences. Finally, we study domination numbers, the cop number, and the dichromatic number. We bound the cop number in terms of the independence number of the base graph and show that, for each fixed base graph, the dichromatic number is $\Theta(2^t)$ after $2t$ consecutive 0-steps.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.03843 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:38:22.298Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).