p-adic numbers encode complex networks
Abstract The Erdős-Rényi (ER) random graph G(n, p) analytically characterizes the behaviors in complex networks. However, attempts to fit real-world observations need more sophisticated structures (e.g., multilayer networks), rules (e.g., Achlioptas processes), and projections onto geometric, social...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Publishing Group
2021-01-01
|
| Series: | Scientific Reports |
| Online Access: | https://doi.org/10.1038/s41598-020-79507-4 |