scholarly journals From the Periphery to the Core: Information Brokerage in an Evolving Network

2018 ◽  
Author(s):  
Bo Yan ◽  
Yiping Liu ◽  
Jiamou Liu ◽  
Yijin Cai ◽  
Hongyi Su ◽  
...  
Keyword(s):  
Network Dynamics ◽  
Dynamic Networks ◽  
Dynamic Network ◽  
Network Models ◽  
Relationship Building ◽  
Superior Performance ◽  
Alternative Methods ◽  
Real World Datasets ◽  
And Performance ◽  
Interpersonal Ties

Interpersonal ties are pivotal to individual efficacy, status and performance in an agent society.This paper explores three important and interrelated themes in social network theory: the center/periphery partition of the network; network dynamics; and social integration of newcomers. We tackle the question: How would a newcomer harness information brokerage to integrate into a dynamic network going from periphery to center? We model integration as the interplay between the newcomer and the dynamics network and capture information brokerage using a process of relationship building. We analyze theoretical guarantees for the newcomer to reach the center through tactics; proving that a winning tactic always exists for certain types of network dynamics. We then propose three tactics and show their superior performance over alternative methods on four real-world datasets and four network models. In general, our tactics place the newcomer to the center by adding very few new edges on dynamic networks with ~14000 nodes.

scholarly journals The (T, L)-Path Model and Algorithms for Information Dissemination in Dynamic Networks

Information ◽  
2018 ◽  
Vol 9 (9) ◽  
pp. 212
Author(s):  
Zhiwei Yang ◽  
Weigang Wu
Keyword(s):  
Network Topology ◽  
Information Dissemination ◽  
Dynamic Networks ◽  
Dynamic Network ◽  
Network Models ◽  
Point Of View ◽  
Path Model ◽  
Dynamic Network Models ◽  
Topology Changes ◽  
Practical Design

A dynamic network is the abstraction of distributed systems with frequent network topology changes. With such dynamic network models, fundamental distributed computing problems can be formally studied with rigorous correctness. Although quite a number of models have been proposed and studied for dynamic networks, the existing models are usually defined from the point of view of connectivity properties. In this paper, instead, we examine the dynamicity of network topology according to the procedure of changes, i.e., how the topology or links change. Following such an approach, we propose the notion of the “instant path” and define two dynamic network models based on the instant path. Based on these two models, we design distributed algorithms for the problem of information dissemination respectively, one of the fundamental distributing computing problems. The correctness of our algorithms is formally proved and their performance in time cost and communication cost is analyzed. Compared with existing connectivity based dynamic network models and algorithms, our procedure based ones are definitely easier to be instantiated in the practical design and deployment of dynamic networks.

scholarly journals Network Embedding under Partial Monitoring for Evolving Networks

2019 ◽  
Author(s):  
Yu Han ◽  
Jie Tang ◽  
Qian Chen
Keyword(s):  
Real World ◽  
Dynamic Networks ◽  
Dynamic Network ◽  
Actual Situation ◽  
Challenging Problem ◽  
Network Embedding ◽  
Strong Assumption ◽  
Evolving Networks ◽  
Real World Datasets ◽  
The Web

Network embedding has been extensively studied in recent years. In addition to the works on static networks, some researchers try to propose new models for evolving networks. However, sometimes most of these dynamic network embedding models are still not in line with the actual situation, since these models have a strong assumption that we can achieve all the changes in the whole network, while in fact we cannot do this in some real world networks, such as the web networks and some large social networks. So in this paper, we study a novel and challenging problem, i.e., network embedding under partial monitoring for evolving networks. We propose a model on dynamic networks in which we cannot perceive all the changes of the structure. We analyze our model theoretically, and give a bound to the error between the results of our model and the potential optimal cases. We evaluate the performance of our model from two aspects. The experimental results on real world datasets show that our model outperforms the baseline models by a large margin.

scholarly journals Affect and Personality

2020 ◽  
Vol 36 (6) ◽  
pp. 1009-1023
Author(s):  
Jonathan J. Park ◽  
Sy-Miin Chow ◽  
Zachary F. Fisher ◽  
Peter C. M. Molenaar
Keyword(s):  
Dynamic Networks ◽  
Dynamic Network ◽  
Network Models ◽  
Var Models ◽  
Vector Autoregressive ◽  
Individual Level ◽  
Dynamic Network Models ◽  
Standard Vector ◽  
Personality Theories ◽  
Network Approaches

Abstract. The use of dynamic network models has grown in recent years. These models allow researchers to capture both lagged and contemporaneous effects in longitudinal data typically as variations, reformulations, or extensions of the standard vector autoregressive (VAR) models. To date, many of these dynamic networks have not been explicitly compared to one another. We compare three popular dynamic network approaches – GIMME, uSEM, and LASSO gVAR – in terms of their differences in modeling assumptions, estimation procedures, statistical properties based on a Monte Carlo simulation, and implications for affect and personality researchers. We found that all three dynamic network approaches provided yielded group-level empirical results in partial support of affect and personality theories. However, individual-level results revealed a great deal of heterogeneity across approaches and participants. Reasons for discrepancies are discussed alongside these approaches’ respective strengths and limitations.

Factorial graphical models for dynamic networks

2015 ◽  
Vol 3 (1) ◽  
pp. 37-57 ◽  
Author(s):  
ERNST WIT ◽  
ANTONINO ABBRUZZO
Keyword(s):  
Graphical Models ◽  
Cell Biology ◽  
Time Series Data ◽  
Dynamic Networks ◽  
Real Life ◽  
Dynamic Network ◽  
Network Models ◽  
Series Data ◽  
Time Dynamics ◽  
Dynamic Network Models

AbstractDynamic network models describe many important scientific processes, from cell biology and epidemiology to sociology and finance. Estimating dynamic networks from noisy time series data is a difficult task since the number of components involved in the system is very large. As a result, the number of parameters to be estimated is typically larger than the number of observations. However, a characteristic of many real life networks is that they are sparse. For example, the molecular structure of genes make interactions with other components a highly-structured and, therefore, a sparse process. Until now, the literature has focused on static networks, which lack specific temporal interpretations.We propose a flexible collection of ANOVA-like dynamic network models, where the user can select specific time dynamics, known presence or absence of links, and a particular autoregressive structure. We use undirected graphical models with block equality constraints on the parameters. This reduces the number of parameters, increases the accuracy of the estimates and makes interpretation of the results more relevant. We illustrate the flexibility of the method on both synthetic and real data.

scholarly journals Representing the UK's cattle herd as static and dynamic networks

2008 ◽  
Vol 276 (1656) ◽  
pp. 469-476 ◽  
Author(s):  
Matthew C Vernon ◽  
Matt J Keeling
Keyword(s):  
Dynamic Networks ◽  
Dynamic Network ◽  
Network Models ◽  
Cattle Herd ◽  
Detailed Data ◽  
Dynamic Representation ◽  
Wide Range ◽  
Temporal Structures ◽  
The Uk ◽  
The Impact

Network models are increasingly being used to understand the spread of diseases through sparsely connected populations, with particular interest in the impact of animal movements upon the dynamics of infectious diseases. Detailed data collected by the UK government on the movement of cattle may be represented as a network, where animal holdings are nodes, and an edge is drawn between nodes where a movement of animals has occurred. These network representations may vary from a simple static representation, to a more complex, fully dynamic one where daily movements are explicitly captured. Using stochastic disease simulations, a wide range of network representations of the UK cattle herd are compared. We find that the simpler static network representations are often deficient when compared with a fully dynamic representation, and should therefore be used only with caution in epidemiological modelling. In particular, due to temporal structures within the dynamic network, static networks consistently fail to capture the predicted epidemic behaviour associated with dynamic networks even when parameterized to match early growth rates.

scholarly journals Cluster-based efficient information dissemination in dynamic networks

2018 ◽  
Vol 14 (3) ◽  
pp. 155014771876208
Author(s):  
Zhiwei Yang ◽  
Weigang Wu ◽  
Yong Li ◽  
Yishun Chen
Keyword(s):  
Information Dissemination ◽  
Dynamic Networks ◽  
Cluster Head ◽  
Dynamic Network ◽  
Network Models ◽  
Node Mobility ◽  
Dynamic Network Model ◽  
Dynamic Network Models ◽  
Efficient Information ◽  
The Stability

Dynamic network is an abstraction of networks with frequent topology changes arising from node mobility or other reasons. In this article, we first propose a dynamic network model, named ( T, L)-HiNet, to extend existing dynamic network models with clusters. ( T, L)-HiNet includes several properties defining the stability of cluster hierarchy in a dynamic network, including cluster head set, cluster member set and the connections among them. Based on ( T, L)-HiNet, we design several hierarchical information dissemination algorithms for different scenarios of dynamics. Furthermore, we extend the ( T, L)-HiNet model and corresponding algorithms in two directions, that is, stability of cluster head set and cluster size. The correctness of our algorithms is proved rigorously, and their performance is evaluated via both numerical analysis and simulations. The results show that compared with the algorithm recently proposed by Kuhn et al., our design can significantly reduce communication cost and also time cost.

scholarly journals Network Topology Impact on the Identification of Dynamic Network Models with Application to Autonomous Vehicle Platooning

2020 ◽  
Vol 53 (2) ◽  
pp. 1031-1036
Author(s):  
Guilherme A. Pimentel ◽  
Rafael de Vasconcelos ◽  
Aurélio Salton ◽  
Alexandre Bazanella
Keyword(s):  
Network Topology ◽  
Autonomous Vehicle ◽  
Dynamic Network ◽  
Network Models ◽  
Dynamic Network Models ◽  
Vehicle Platooning

scholarly journals DNA-based constitutional dynamic networks as functional modules for logic gates and computing circuit operations

2021 ◽  
Vol 12 (15) ◽  
pp. 5473-5483
Author(s):  
Zhixin Zhou ◽  
Jianbang Wang ◽  
R. D. Levine ◽  
Francoise Remacle ◽  
Itamar Willner
Keyword(s):  
Nucleic Acid ◽  
Dynamic Networks ◽  
Dynamic Network ◽  
Logic Gates ◽  
Functional Modules ◽  
Logic Operations

A nucleic acid-based constitutional dynamic network (CDN) provides a single functional computational module for diverse input-guided logic operations and computing circuits.

scholarly journals Unsupervised Anomaly Detection with Distillated Teacher-Student Network Ensemble

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 201
Author(s):  
Qinfeng Xiao ◽  
Jing Wang ◽  
Youfang Lin ◽  
Wenbo Gongsa ◽  
Ganghui Hu ◽  
...  
Keyword(s):  
Anomaly Detection ◽  
Multivariate Data ◽  
Failure Detection ◽  
Superior Performance ◽  
Detection Algorithms ◽  
Teacher Student ◽  
Model Complex ◽  
Unsupervised Anomaly Detection ◽  
Real World Datasets ◽  
Complex Features

We address the problem of unsupervised anomaly detection for multivariate data. Traditional machine learning based anomaly detection algorithms rely on specific assumptions of normal patterns and fail to model complex feature interactions and relations. Recently, existing deep learning based methods are promising for extracting representations from complex features. These methods train an auxiliary task, e.g., reconstruction and prediction, on normal samples. They further assume that anomalies fail to perform well on the auxiliary task since they are never trained during the model optimization. However, the assumption does not always hold in practice. Deep models may also perform the auxiliary task well on anomalous samples, leading to the failure detection of anomalies. To effectively detect anomalies for multivariate data, this paper introduces a teacher-student distillation based framework Distillated Teacher-Student Network Ensemble (DTSNE). The paradigm of the teacher-student distillation is able to deal with high-dimensional complex features. In addition, an ensemble of student networks provides a better capability to avoid generalizing the auxiliary task performance on anomalous samples. To validate the effectiveness of our model, we conduct extensive experiments on real-world datasets. Experimental results show superior performance of DTSNE over competing methods. Analysis and discussion towards the behavior of our model are also provided in the experiment section.

Sign in / Sign up

Export Citation Format

Share Document