A carregar...
Graph limits of random graphs from a subset of connected k‐trees
For any set Ω of non‐negative integers such that [Formula: see text] , we consider a random Ω‐k‐tree G (n,k) that is uniformly selected from all connected k‐trees of (n + k) vertices such that the number of (k + 1)‐cliques that contain any fixed k‐clique belongs to Ω. We prove that G(n,k), scaled by...
Na minha lista:
| Publicado no: | Random Struct Algorithms |
|---|---|
| Main Authors: | , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
John Wiley & Sons, Inc.
2018
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6686707/ https://ncbi.nlm.nih.gov/pubmed/31423073 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1002/rsa.20802 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|