Temporal Stable Community in Time-Varying Networks

  title={Temporal Stable Community in Time-Varying Networks},
  author={Wenjing Wang and Xiang Li},
  journal={IEEE Transactions on Network Science and Engineering},
  • Wenjing WangXiang Li
  • Published 12 November 2018
  • Computer Science
  • IEEE Transactions on Network Science and Engineering
Identifying community structure of a complex network provides insight to the interdependence between the network topology and emergent collective behaviors of networks, while detecting such invariant communities in a time-varying network is more challenging. In this paper, we define the temporal stable community and use the temporal similarity of edges for judging whether temporal stable communities exist in time-varying networks. Furthermore, we newly propose the concept of dynamic modularity… 

Figures and Tables from this paper

Robust Dynamic Clustering for Temporal Networks

Experimental results on six artificial datasets and four real-world dynamic network datasets indicate that RTSC performs better than six state-of-the-art algorithms for dynamic clustering in temporal networks.

Information Sources Estimation in Time-Varying Networks

This work comprehensively study the problem of identifying single and multiple information sources in time-varying networks, and designs and presents an effective algorithm to estimate the number of sources.

Dynamic community discovery via common subspace projection

This work develops a novel dynamic community detection algorithm by leveraging the encoding–decoding scheme present in a succinct network representation method to reconstruct each snapshot via a common low-dimensional subspace, resulting in the mitigation of community instability to a large degree.

Network Representation Learning With Community Awareness and Its Applications in Brain Networks

A deep attributed network representation learning with community awareness (DANRL-CA) framework is proposed, which designs a neighborhood enhancement autoencoder module to capture the 2-step relations between node pairs and introduces two variants of DANRL -CA, which incorporate the community information and attribute semantics into node neighbors with different methods.

Adaptive Vertex Cover of Dynamical Networks With Prospect Theoretic Perspective

It is proved that given the reference point in the active region, the designed adaptive evolution scheme can drive the network structure and vertices' strategies to a Nash cover equilibrium (NCE) state with probability one.

Dismantling Networks by Skeleton Extraction and Greedy Tree Breaking

This paper proposes a novel network dismantling algorithm that combines skeleton extraction and greedy tree breaking (SEGTB), which is both effective and efficient, outperforming the state-of-the-art.

Adaptive Reputation Promotes Trust in Social Networks

If investors have access to the reputation scores of trustees, the fraction of untrustworthy trustees drops if only the degree of rationality is sufficiently large, and this irrespective of the reputation threshold that determines the cutoff for untrustworthiness.

Visual sensor network stimulation model identification via Gaussian mixture model and deep embedded features



Community Structure in Time-Dependent, Multiscale, and Multiplex Networks

A generalized framework of network quality functions was developed that allowed us to study the community structure of arbitrary multislice networks, which are combinations of individual networks coupled through links that connect each node in one network slice to itself in other slices.

Temporal stability of network partitions

  • G. PetriP. Expert
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2014
It is shown that, when applied to a toy model and real data sets, temporal stability uncovers structures that are persistent over meaningful time scales as well as important isolated events, making it an effective tool to study both abrupt changes and gradual evolution of a network mesoscopic structures.

Cross-linked structure of network evolution.

We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to

Community structure in social and biological networks

  • M. GirvanM. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.

Epidemic Spreading in Temporal and Adaptive Networks with Static Backbone

An improved modeling framework is examined that superimposes an ADN to a static backbone network, toward the integration of persistent contacts with time-varying connections and the effect of behavioral changes on the disease dynamics is investigated.

Common community structure in time-varying networks.

Results show that the proposed method not only can resolve detailed common communities, but also can effectively identify the dynamical phenomena in time-varying networks.

Constrained information flows in temporal networks reveal intermittent communities

The results suggest that node-level layer coupling can improve the modeling of information spreading in temporal networks and better capture intermittent community structure.

Finding and evaluating community structure in networks.

  • M. NewmanM. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.

Temporal Networks

Reconstruction of stochastic temporal networks through diffusive arrival times

This work proposes an inverse modelling method based on first-arrival observations of the diffusion process taking place on temporal networks that builds in particular but not exclusively on the null model assumption of mutually independent interaction sequences at the dyadic level.