Local majorities, coalitions and monopolies in graphs: A review

Theoretical Computer Science

Volumn 282, Issue 2, 2002, Pages 231-257

  Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY;

SYNCHRONOUS PROBABILISTIC MODEL;

GRAPH THEORY;

EID: 0037054318     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00055-X     Document Type: Conference Paper

References (66)

1. Resilience and variability in pathogens and hosts
2. Fixed points of majority rule cellular automata applied to plasticity and precision of the immune response
3. The number of fixed points of the majority rule
4. Applying static network protocols to dynamic networks
5. Local stabilizer
6. The power of small coalitions in graphs
7. Tight bounds on the size of 2-monopolies
8. An o(log n) expected rounds randomized Byzantine generals algorithm
9. Consistency in partitioned networks
10. Efficient testing and reconfiguration of VLSI linear arrays
11. System diagnosis with smallest risk of error
12. Reaching a consensus
13. Worst case analysis of greedy heuristics for integer programming with nonnegative data
14. Finite particle systems and infection models
15. Fault tolerance in networks of bounded degree
16. A threshold of ln n for approximating set cover
17. Irreversible dynamos in chordal rings, in 25th Internat
18. Irreversible dynamos in Tori
19. Monotone Dynamos in Tori
20. A formal theory of social power
21. How to assign votes in a distributed system
22. Weighted voting for replicated data
23. Periodic behaviour of generalized threshold functions
24. Decreasing energy functions as a tool for studying threshold networks
25. A note on a paper by Agur, Fraenkel and Klein
26. A criterion for unanimity in French's theory of social power
27. Distributed probabilistic polling and applications to proportionate agreement
28. Extremal bounds for probabilistic polling in graphs
29. Ergodic theorems for weakly interacting infinite systems and the voter model
30. Eigenvalues and expansion of regular graphs
31. Time-adaptive self stabilization
32. Fault-local distributed mending
33. Tight fault-locality
34. The Byzantine generals problem
35. Sphere packing and local majorities in graphs
36. On the ratio of optimal integral and fractional covers
37. Irreversible dynamos in butterflies
38. On the hardness of approximating minimization problems
39. The r-majority vote action on 0-1 sequences
40. Parametrization for stationary patterns of the r-majority operators on 0-1 sequences
41. On the period-two-property of the majority operator in infinite graphs
42. Probabilistic local majority voting for the agreement problem on finite graphs
43. Fault-tolerance of reconfigurable systolic arrays
44. Efficient fault location with small risk
45. Size bounds for dynamic monopolies
46. An optimal synchronizer for the hypercube
47. The availability of quorum systems
48. On periodical behaviour in societies with symmetric influences
49. On an application of convexity to discrete systems
50. On the complexity of testing for catastrophic faults
51. Voting as the optimal static pessimistic scheme for managing replicated data
52. An analysis of the greedy algorithm for the submodular set covering problem