arXiv (All)
open access
Evolving scale-free networks and node-based random edge deletion
We investigate a growing network model that combines preferential and uniform attachment with two distinct mechanisms of edge deletion. In addition to the usual uniform random edge deletion, we introduce a novel node-based rule in which uniformly chosen non-isolated nodes lose one of their incident
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Recovery Random Walks and Extreme Events on Complex Networks#1144344
- Partisan voter model on complex networks: Dynamics of local ordering#1105074
- Multiscale Renormalization of Weighted Networks#1142884
- PRA-TAM: prototype-regularised residual affinity maximisation for unsupervised graph anomaly detection#425890
- Revealed Social Networks#665469
Record · ID 1117328
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive