Random Maps with Sociological Flavor
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917770983112704 |
|---|---|
| author | Krapivsky, P. L. |
| author_facet | Krapivsky, P. L. |
| contents | A map of a set to itself admits a representation by a graph with vertices being the elements of the set and an edge between every vertex and its image. Communities defined as the maximal connected components are uni-cyclic. The distributions of the sizes of communities and lengths of cycles for unconstrained random maps is a classical subject. We call experts the images and followers the remaining vertexes, and we further define prophets, egocentrics, and introverts. We introduce and analyze classes of random maps with sociological flavor. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_08834 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Random Maps with Sociological Flavor Krapivsky, P. L. Combinatorics Statistical Mechanics Physics and Society A map of a set to itself admits a representation by a graph with vertices being the elements of the set and an edge between every vertex and its image. Communities defined as the maximal connected components are uni-cyclic. The distributions of the sizes of communities and lengths of cycles for unconstrained random maps is a classical subject. We call experts the images and followers the remaining vertexes, and we further define prophets, egocentrics, and introverts. We introduce and analyze classes of random maps with sociological flavor. |
| title | Random Maps with Sociological Flavor |
| topic | Combinatorics Statistical Mechanics Physics and Society |
| url | https://arxiv.org/abs/2309.08834 |