On effectiveness of wiretap programs in mapping social networks

Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost. Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php     

A Generalized Markov Sampler

A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis–Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis.     

Sampling Consensus of 2nd-Order Multi-Agent Systems Based on Time-Varying Topology北大核心CSCD

基于速度一致位移差保持不变的一致性概念,研究了二阶多智能体系统在时变拓扑下的采样一致性问题。首先,引入虚拟领导者,将具有时变拓扑结构的多智能体系统的采样一致性问题转换为误差系统的采样控制稳定性问题。其次,通过预估采样误差,研究采样误差对系统达到一致性的影响。最后,应用Lyapunov稳定性理论,分析所构造的误差系统的稳定性,并给出该误差系统最终稳定的充分条件。数值仿真结果验证了理论分析的有效性和正确性。     

Consensus,Polarization and Hysteresis in the Three-State Noisy q-Voter Model with Bounded Confidence

In this work, we address the question of the role of the influence of group size on the emergence of various collective social phenomena, such as consensus, polarization and social hysteresis. To answer this question, we study the three-state noisy q-voter model with bounded confidence, in which agents can be in one of three states: two extremes (leftist and rightist) and centrist. We study the model on a complete graph within the mean-field approach and show that, depending on the size q of the influence group, saddle-node bifurcation cascades of different length appear and different collective phenomena are possible. In particular, for all values of q>1, social hysteresis is observed. Furthermore, for small values of q∈(1,4), disagreement, polarization and domination of centrists (a consensus understood as the general agreement, not unanimity) can be achieved but not the domination of extremists. The latter is possible only for larger groups of influence. Finally, by comparing our model to others, we discuss how a small change in the rules at the microscopic level can dramatically change the macroscopic behavior of the model.     

概率语言多属性群决策方法及其在新型智慧城市市民获得感评价中的应用

针对公众参与的语言信息多属性群决策问题,研究了考虑参与者满意度的概率语言多属性群决策方法。首先,根据参与者的语言评价信息确定并规范化概率语言决策矩阵。然后,对大群体进行共识分析,由最大化参与者群体的满意度构建线性规划模型,确定参与者群组的权重;构造正、负理想方案的评价向量,构建多目标规划模型,用拉格朗日乘子法求解属性权重;定义各方案的加权贴近度,并以此对方案进行排序和优选。最后,通过新型智慧城市市民获得感评价案例验证了模型的可行性和有效性。     

基于邻域贡献权值细化的圆心亚像素定位算法

针对传统的圆心算法过程复杂、定位精度受初始边缘提取效果影响较大等问题,提出了一种基于邻域贡献权值细化的圆心亚像素定位算法。首先引入邻域贡献权值系数,改进传统非极大值抑制法,细化边缘;然后在边缘点的梯度方向对灰度值进行高斯拟合,确定亚像素边缘位置;最后针对边缘突变点提出了基于随机抽样一致的最小二乘法来拟合圆心。实验结果表明,该算法具有较好的精度和稳定性,圆心的提取精度可以达到0.1个像素。     

Opinion dynamics in networks with heterogeneous confidence and influence

We propose a discrete-time model of opinion dynamics. The neighborhood relationship is decided by confidence radius and influence radius of each agent. We investigate the influence of heterogeneity in confidence/influence distribution on the behavior of the network. The simulations suggest that the heterogeneity of single confidence or influence networks can promote the opinions to achieve consensus. It is shown that the heterogeneous influence radius systems converge in fewer time steps and more often in finite time than the heterogeneous confidence radius systems. We find that heterogeneity does not always promote consensus, and there is an optimal heterogeneity so that the relative size of the largest consensus cluster reaches maximum in heterogeneous confidence and influence networks.     

Stability analysis of a class of uncertain switched systems on time scale using Lyapunov functions

This paper deals with the stability analysis of a class of uncertain switched systems on non-uniform time domains. The considered class consists of dynamical systems which commute between an uncertain continuous-time subsystem and an uncertain discrete-time subsystem during a certain period of time. The theory of dynamic equations on time scale is used to study the stability of these systems on non-uniform time domains formed by a union of disjoint intervals with variable length and variable gap. Using the concept of common Lyapunov function, sufficient conditions are derived to guarantee the asymptotic stability of this class of systems on time scale with bounded graininess function. The proposed scheme is used to study the leader–follower consensus problem under intermittent information transmissions.     

Dynamic output feedback consensus of continuous‐time networked multiagent systems

This article addresses the dynamic output feedback consensus problem of continuous‐time networked multiagent systems. Both a fixed topology and Markovian switching topologies are considered. The consensus algorithms are on the base of the output information of each agent's itself and its neighbors. Some sufficient conditions for consensus of multiagent systems are obtained in forms of bilinear matrix inequalities. The algorithm based on the homotopy continuation method is given to compute the feasible controller gains. Numerical simulations are given to show the effectiveness of the proposed results. © 2014 Wiley Periodicals, Inc. Complexity 20: 35–42, 2015