Metraipolis › archive › dc_741f1fc8fc11

Exponential random graph models with soft clique constraints — arXiv:2608.30869

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.30869
License (as archived)
CC0-1.0
Archived
2026-10-17T07:55:02.082Z
SHA-256 of the archived text
6ed32d62d70d7fcc2d53a10b5260df85e3c74c87cc611fe0a1519c1b169a5996
Stable URL of this page
https://metraipolis.com/documento/dc_741f1fc8fc11

How to cite

Exponential random graph models with soft clique constraints — arXiv:2608.30869 — arXiv (en), https://arxiv.org/abs/2608.30869 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_741f1fc8fc11 (Metraipolis archive dc_741f1fc8fc11, sha256 6ed32d62d70d7fcc2d53a10b5260df85e3c74c87cc611fe0a1519c1b169a5996)
BibTeX
@misc{dc741f1fc8fc11,
  title = {Exponential random graph models with soft clique constraints — arXiv:2608.30869},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.30869},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_741f1fc8fc11; sha256 6ed32d62d70d7fcc2d53a10b5260df85e3c74c87cc611fe0a1519c1b169a5996},
  year = {2026}
}

Archived text

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

Let $r\geq3$ be fixed, and let $\mathbf{G}_n$ be the set of all simple graphs with vertex set $[n]=\{1,\ldots,n\}$. We consider an exponential random graph model which gives higher probability to $G \in \mathbf{G}_n$ than to $H \in \mathbf{G}_n$ if $G$ has fewer $r$-cliques than $H$. But all graphs in $\mathbf{G}_n$ have positive probability. The degree to which graphs with fewer $r$-cliques are given higher probability is determined by a positive weight $w$. We prove that, asymptotically almost surely as $n \to \infty$, a random graph from $\mathbf{G}_n$ has a vertex partition into $r-1$ parts of roughly equal size, the density of edges between the parts is close to $1/2$, and for every $\varepsilon > 0$ the density of edges within any part is less than $\varepsilon$. The asymptotic structural properties are independent of the weight $w$ as long as it is positive. We also extend the result to the context of several clique sizes, each one with its own weight.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.AI).
Categorie arXiv: Combinatorics (math.CO) ; Artificial Intelligence (cs.AI); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2608.30869 — 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-10-17T07:28:26.917Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).