✦ LIBER ✦

Growing networks with preferential deletion and addition of edges

✍ Scribed by Maria Deijfen; Mathias Lindholm

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 460 KB
Volume: 388
Category: Article
ISSN: 0378-4371
DOI: 10.1016/j.physa.2009.06.032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree correlations in growing networks

Degree correlations in growing networks with deletion of nodes

✍ Josep L. Garcia-Domingo; David Juher; Joan Saldaña 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

Modeling of growing networks with direct

Modeling of growing networks with directional attachment and communities

✍ Masahiro Kimura; Kazumi Saito; Naonori Ueda 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Error and attack tolerance of evolving n

Error and attack tolerance of evolving networks with local preferential attachment

✍ Shiwen Sun; Zhongxin Liu; Zengqiang Chen; Zhuzhi Yuan 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Centrality functions of a network with c

Centrality functions of a network with capacities on vertices and edges

✍ Masashi Takeuchi; Tadayuki Ohkubo; Yutaka Itoh 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 331 KB

Resilience of partial k-tree networks wi

Resilience of partial k-tree networks with edge and node failures

✍ Erick Mata-Montero 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 965 KB

The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network is a #P-complete problem even for planar networks with fail-safe nodes. We generalize an O(n\*) time algorithm to compute the resilience of n-node k-tree networks with fai

Identification of motifs with insertions

Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks

✍ Derong Liu; Xiaoxu Xiong; Zeng-Guang Hou; Bhaskar DasGupta 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 291 KB