Randomized broadcast in networks
- 1 December 1990
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 1 (4) , 447-460
- https://doi.org/10.1002/rsa.3240010406
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The electrical resistance of a graph captures its commute and cover timesPublished by Association for Computing Machinery (ACM) ,1989
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- On Spreading a RumorSIAM Journal on Applied Mathematics, 1987
- Epidemic algorithms for replicated database maintenancePublished by Association for Computing Machinery (ACM) ,1987
- The shortest-path problem for graphs with random arc-lengthsDiscrete Applied Mathematics, 1985
- The Independence Ratio of Regular GraphsProceedings of the American Mathematical Society, 1981
- Generalization of Epidemic Theory: An Application to the Transmission of IdeasNature, 1964
- On the strength of connectedness of a random graphActa Mathematica Hungarica, 1964
- Contribution to the mathematical theory of contagion and spread of information: I. Spread through a thoroughly mixed populationBulletin of Mathematical Biology, 1953
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952