Fetching the paper…
Reading the bibliography…
We consider the problem of diffusing information in networks that contain malicious nodes.
J. N. Tsitsiklis, “Problems in decentralized decision making and computation,” Ph.D. dissertation, Massachusetts Institute of Technology, 1984
1984
Earlier work this paper cites.
D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. E.Weihl, “Reaching approximate agreement in the presence of faults,” Journal of the ACM , vol. 33, pp. 499–516, May 1986
1986
Earlier work this paper cites.
——, “Low cost approximate agreement in partially connected networks,” Journal of Computing and Information , vol. 3, no. 1, pp. 53–85, 1993
1993
Earlier work this paper cites.
R. M. Kieckhafer and M. H. Azadmanesh, “Reaching approximate agreement with mixed mode faults,” IEEE Transactions on Parallel and Distributed Systems , vol. 5, no. 1, pp. 53–63, 1994
1994
Earlier work this paper cites.
N. A. Lynch, Distributed Algorithms . Elsevier (imprint: Morgan Kaufmann), 1996
1996
Earlier work this paper cites.
S. Morris, “Contagion,” The Review of Economic Studies , vol. 67, no. 1, pp. 57–78, 2000
2000
Earlier work this paper cites.
A. H. Azadmanesh and H. Bajwa, “Global convergence in partially fully connected networks (pfcn) with limited relays,” The 27th Annual Conference of the IEEE , vol. 3, pp. 2022–2025, 2001
2001
Earlier work this paper cites.
M. E. J. Newman, “Spread of epidemic disease on networks,” Phys. Rev. E , vol. 66, p. 016128, July 2002
2002
Earlier work this paper cites.
I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,” Computer Networks , vol. 38, no. 4, pp. 393–422, 2002
2002
Earlier work this paper cites.
M. H. Azadmanesh and R. M. Kieckhafer, “Asynchronous approximate agreement in partially connected networks,” International Journal of Parallel and Distributed Systems and Networks , vol. 5, no. 1, pp. 26–34, 2002
2002
Earlier work this paper cites.
R. Hegselmann and U. Krause, “Opinion dynamics and bounded confidence: models, analysis and simulation,” Journal of Artificial Societies and Social Simulation , vol. 5, no. 3, pp. 1–24, 2002
2002
Earlier work this paper cites.
R. Albert and A.-L. Barabasi, “Statistical mehanics of complex networks,” Review. Mod. Phys. , vol. 74, no. 1, pp. 47–97, Jan 2002
2002
Earlier work this paper cites.
A. Jadbabaie, J. Lin, and A. S. Morse, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,” IEEE Transactions on Automatic Control , vol. 48, no. 6, pp. 988–1001, June 2003
2003
Cited alongside, same era.
C. Y. Koo, “Broadcast in radio networks tolerating byzantine adversarial behavior,” in Proc. of 23rd Annual ACM Symp. on Principles of Distributed Computing , 2004, pp. 275–282
2004
Cited alongside, same era.
L. Xiao and S. Boyd, “Fast linear iterations for distributed averaging,” Systems and Control Letters , vol. 53, no. 1, pp. 65–78, Sept. 2004
2004
Cited alongside, same era.
J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger, Dissemination of Information in Communication Networks . Springer-Verlag, 2005
2005
Cited alongside, same era.
A. Pelc and D. Peleg, “Broadcasting with locally bounded Byzantine faults,” in Information Processing Letters , 2005, pp. 109–115
V. D. Blondel, J. M. Hendrickx, and J. N. Tsitsiklis, “On Krause’s multi-agent consensus model with state-dependent connectivity,” IEEE Transactions on Automatic Control , vol. 54, no. 11, pp. 2586–2597, November 2009
2009
Later among the works it cites.
D. Easley and J. Kleinberg, Networks, Crowds and Markets: Reasoning about a Highly Connected World . Cambridge University Press, 2010
2010
Later among the works it cites.
J. Lorenz and D. A. Lorenz, “On conditions for convergence to consensus,” IEEE Transactions on Automatic Control , vol. 55, no. 7, pp. 1651–1656, July 2010
2010
Later among the works it cites.
A. Teixeira, H. Sandberg, and K. H. Johansson, “Networked control systems under cyber attacks with applications to power networks,” in Proc. of the American Control Conference , 2010, pp. 3690–3696
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2005
Cited alongside, same era.
W. Ren and R. W. Beard, “Consensus seeking in multiagent systems under dynamically changing interation topologies,” IEEE Transactions on Automatic Control , vol. 50, no. 5, pp. 655–661, May 2005
2005
Cited alongside, same era.
L. Moreau, “Stability of multiagent systems with time-dependent communication links,” IEEE Transactions on Automatic Control , vol. 50, no. 2, pp. 169–181, Feb. 2005
2005
Cited alongside, same era.
V. Gupta, C. Langbort, and R. M. Murray, “On the robustness of distributed algorithms,” in Proceedings of the 45th IEEE Conference on Decision and Control , 2006, pp. 3437–3478
2006
Cited alongside, same era.
D. Stauffer and M. Sahimi, “Can a few fanatics influence the opinion of a large segment of a society?” The European Physical Journal B - Condensed Matter and Complex Systems , vol. 57, pp. 147–152, 2007
2007
Cited alongside, same era.
R. Olfati-Saber, J. A. Fax, and R. M. Murray, “Consensus and cooperation in networked multi-agent systems,” in Proceedings of the IEEE , 2007, pp. 215–233
2007
Cited alongside, same era.
S. Sundaram and C. N. Hadjicostis, “Distributed function calculation and consensus using linear iterative strategies,” IEEE JSAC: Special Issue on Control and Communications , vol. 26, no. 1, pp. 215–233, Jan 2007
2007
Cited alongside, same era.
A. Azadmanesh, A. Farahani, and L. Najjar, “Fault-tolerant weighted voting algorithms,” Journal of Network Security , vol. 7, no. 2, pp. 663–674, 2008
2008
Cited alongside, same era.
A. Chapman and M. Mesbahi, “Semi-autonomous networks: Network resilience and adaptive trees,” in Proceedings of the 49th IEEE Conference on Decision and Control , 2010, pp. 7473–7478
2010
Later among the works it cites.
A. Ichimura and M. Shigeno, “A new parameter for a broadcast algorithm with locally bounded Byzantine faults,” Information Processing Letters , vol. 110, pp. 514–517, 2010
2010
Later among the works it cites.
J. Xie, S. Sreenivasan, G. Korniss, W. Zhang, C. Lim, and B. K. Szymanski, “Social consensus through the influence of committed minorities,” Phys. Rev. E , vol. 84, p. 011130, July 2011
2011
Closest in time.
——, “Distributed function calculation via linear iterative strategies in the presence of malicious agents,” IEEE Transactions on Automatic Control , vol. 56, no. 7, pp. 1495–1508, July 2011
2011
Closest in time.
H. LeBlanc and X. Koutsoukos, “Consensus in networked multi-agent systems with adversaries,” in Proceedings of the 14th international conference on Hybrid systems: computation and control , ser. HSCC ’11, 2011, pp. 281–290
2011
Closest in time.
——, “Low complexity resilient consensus in networked multi-agent systems with adversaries,” in Proceedings of the 15th International Conference on Hybrid Systems: Computation and Control , ser. HSCC ’12, 2012, to appear
2012
Closest in time.
H. LeBlanc, H. Zhang, S. Sundaram, and X. Koutsoukos, “Consensus of multi-agent networks in the presence of adversaries using only local information,” Proceedings of the 1st International Conference on High Confidence Networked Systems (HiCoNS) , 2012, to appear
2012
Closest in time.