Clique structure and other network properties of the tensor product of Erdős-Rényi graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910565478170624 |
|---|---|
| author | Islak, Umit Incekara, Bugra |
| author_facet | Islak, Umit Incekara, Bugra |
| contents | We analyze the number of cliques of given size and the size of the largest clique in tensor product $G \times H$ of two Erdős-Rényi graphs $G$ and $H$. Then an extended clustering coefficient is introduced and is studied for $G \times H$. Restriction to the standard clustering coefficient has a direct relation to the local efficiency of the graph, and the results are also interpreted in terms of the efficiency. As a last statistic of interest, the number of isolated vertices is analyzed for $G \times H$. The paper is concluded with a discussion of the modular product of random graphs, and the relation to the maximum common subgraph problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_07627 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Clique structure and other network properties of the tensor product of Erdős-Rényi graphs Islak, Umit Incekara, Bugra Combinatorics Probability We analyze the number of cliques of given size and the size of the largest clique in tensor product $G \times H$ of two Erdős-Rényi graphs $G$ and $H$. Then an extended clustering coefficient is introduced and is studied for $G \times H$. Restriction to the standard clustering coefficient has a direct relation to the local efficiency of the graph, and the results are also interpreted in terms of the efficiency. As a last statistic of interest, the number of isolated vertices is analyzed for $G \times H$. The paper is concluded with a discussion of the modular product of random graphs, and the relation to the maximum common subgraph problem. |
| title | Clique structure and other network properties of the tensor product of Erdős-Rényi graphs |
| topic | Combinatorics Probability |
| url | https://arxiv.org/abs/2408.07627 |