✦ LIBER ✦

Remarks on Distance Distributions for Graphs Modeling Computer Networks

✍ Scribed by Bruce Elenbogen; John Frederick Fink

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 474 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00070-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximate planning model for distri

An approximate planning model for distributed computing networks

✍ John S. Hollywood 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

Some Formulas for Spin Models on Distanc

Some Formulas for Spin Models on Distance-Regular Graphs

✍ Brian Curtin; Kazumasa Nomura 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A spin model is a square matrix W satisfying certain conditions which ensure that it yields an invariant of knots and links via a statistical mechanical construction of V. F. R. Jones. Recently F. Jaeger gave a topological construction for each spin model W of an association scheme which contains W

A data distribution model for distribute

A data distribution model for distributed relational databases with dissimilar computers and network costs

✍ Dalia Motzkin; Patrick D. Yurk 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Computing bounds on project duration dis

Computing bounds on project duration distributions for stochastic PERT networks

✍ Tetsuo Iida 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

Predicting Speedup for Distributed Compu

Predicting Speedup for Distributed Computing on a Token Ring Network

✍ Phillip M. Feldman; Raisa E. Feldman; David B. Kim 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 145 KB

Before a conventional application is converted into a distributed one (typically a costly process), it is prudent to estimate the improvement in run time that will be achieved. Previous research has tended to ignore communications delays in order to facilitate analysis. However, such models lead to

Closure, connectivity and degree distrib

Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social networks

✍ Garry Robins; Pip Pattison; Peng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 1005 KB

New specifications for exponential random graph models. Sociological Methodology 36, exhibit substantial improvements in model fit compared with the commonly used Markov random graph models. Snijders et al., however, concentrated on non-directed graphs, with only limited extensions to directed graph