On an application of convexity to discrete systems
Discrete Applied Mathematics
The number of fixed points of the majority rule
Discrete Mathematics
On a paper of Agur, Fraenkel and Klein
Discrete Mathematics
The r-majority vote action on 0-1 sequences
Discrete Mathematics
Parametrization for stationary patterns of the r-majority operators on 0-1 sequences
Discrete Mathematics
Randomized algorithms
Almost exact minimum feedback vertex set in meshes and butterflies
Information Processing Letters
Size bounds for dynamic monopolies
Discrete Applied Mathematics
Random disease on the square grid
proceedings of the eighth international conference on Random structures and algorithms
The majority action on infinite graphs: strings and puppets
Discrete Mathematics
Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Optimal irreversible dynamos in chordal rings
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Dynamic monopolies of constant size
Journal of Combinatorial Theory Series B
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
Majority Consensus and the Local Majority Rule
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Majority Voting Games in Trees
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Mining knowledge-sharing sites for viral marketing
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
The power of small coalitions in graphs
Discrete Applied Mathematics
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On time versus size for monotone dynamic monopolies in regular topologies
Journal of Discrete Algorithms
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Decycling Cartesian Products of Two Cycles
SIAM Journal on Discrete Mathematics
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Combinatorics, Probability and Computing
On the submodularity of influence in social networks
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the approximability of influence in social networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
Majority bootstrap percolation on the hypercube
Combinatorics, Probability and Computing
Theoretical Computer Science
Convergence to Equilibrium in Local Interaction Games
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Web marshals fighting curly link farms
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Note: Combinatorial model and bounds for target set selection
Theoretical Computer Science
Bootstrap percolation in high dimensions
Combinatorics, Probability and Computing
Spreading of Messages in Random Graphs
Theory of Computing Systems
Influential nodes in a diffusion model for social networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Variants of spreading messages
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Bounding the number of tolerable faults in majority-based systems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
| Hi-index | 0.89 |
Consider the following cascading process on an undirected connected graph G(V,E). A set S of vertices, called the seeds, are active initially. Thereafter, an inactive vertex is activated when at least a @r fraction of its neighbors is active, where @r@?(0,1]. The cascading process proceeds asynchronously until no more vertices can be activated. This paper proves the existence of at most (22+3)@?@r|V|@? seeds that can activate all vertices at the end.