Simplifying continuous-time quantum walks on dynamic graphs
Sign Up to like & getrecommendations! Published in 2022 at "Quantum Information Processing"
DOI: 10.1007/s11128-021-03403-7
Abstract: A continuous-time quantum walk on a dynamic graph evolves by Schrödinger’s equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic… read more here.
Keywords: dynamic graphs; dynamic graph; time quantum; continuous time ... See more keywords
Managing large distributed dynamic graphs for smart city network applications
Sign Up to like & getrecommendations! Published in 2019 at "Applied Network Science"
DOI: 10.1007/s41109-019-0224-2
Abstract: Smart cities and traffic applications can be modelled by dynamic graphs for which vertices or edges can be added, removed or change their properties. In the smart city or traffic monitoring problem, we wish to… read more here.
Keywords: network; city; graph; monitoring ... See more keywords
Optimizing Vertex Pressure Dynamic Graph Partitioning in Many-Core Systems
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Computers"
DOI: 10.1109/tc.2021.3059386
Abstract: With the rise of graph-based algorithms in many applications, dynamic graphs have become critical for applications that work with real-time or time-series relationship data. Due to their large storage footprint, these applications require high parallelism… read more here.
Keywords: many core; vertex pressure; graph; dynamic graphs ... See more keywords
Fast Core Maintenance in Dynamic Graphs
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Computational Social Systems"
DOI: 10.1109/tcss.2021.3064836
Abstract: This article studies the core maintenance problem in dynamic graphs. The core number is a fundamental index reflecting the cohesiveness of a graph, which is widely used in large-scale graph analytics. The core maintenance problem… read more here.
Keywords: dynamic graphs; maintenance; core maintenance; inserted deleted ... See more keywords
A Novel Representation Learning for Dynamic Graphs Based on Graph Convolutional Networks
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Cybernetics"
DOI: 10.1109/tcyb.2022.3159661
Abstract: Graph representation learning has re-emerged as a fascinating research topic due to the successful application of graph convolutional networks (GCNs) for graphs and inspires various downstream tasks, such as node classification and link prediction. Nevertheless,… read more here.
Keywords: graph convolutional; dynamic graphs; novel representation; representation learning ... See more keywords
Motif-Level Anomaly Detection in Dynamic Graphs
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Transactions on Information Forensics and Security"
DOI: 10.1109/tifs.2023.3272731
Abstract: As many real-world networks evolve over time, such as social networks, user-item networks, and IP-IP networks, anomaly detection for dynamic graphs has attracted growing attention. Most existing studies focus on detecting anomalous nodes or edges… read more here.
Keywords: detection dynamic; dynamic graphs; anomaly detection; motif level ... See more keywords
Efficient Maintenance of Shortest Distances in Dynamic Graphs
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2017.2772233
Abstract: Computing shortest distances is a central task in many domains. The growing number of applications dealing with dynamic graphs calls for incremental algorithms, as it is impractical to recompute shortest distances from scratch every time… read more here.
Keywords: distances dynamic; efficient maintenance; maintenance shortest; dynamic graphs ... See more keywords
A Stochastic Approach to Finding Densest Temporal Subgraphs in Dynamic Graphs
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2020.3025463
Abstract: One important problem that is insufficiently studied is finding densest lasting-subgraphs in large dynamic graphs, which considers the time duration of the subgraph pattern. We propose a framework called Expectation-Maximization with Utility functions (EMU), a… read more here.
Keywords: finding densest; stochastic approach; dynamic graphs; densest temporal ... See more keywords
Event-Based Dynamic Graph Visualisation
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Visualization and Computer Graphics"
DOI: 10.1109/tvcg.2018.2886901
Abstract: Dynamic graph drawing algorithms take as input a series of timeslices that standard, force-directed algorithms can exploit to compute a layout. However, often dynamic graphs are expressed as a series of events where the nodes… read more here.
Keywords: time; event based; based dynamic; dynamic graphs ... See more keywords
Multiscale Snapshots: Visual Analysis of Temporal Summaries in Dynamic Graphs
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Visualization and Computer Graphics"
DOI: 10.1109/tvcg.2020.3030398
Abstract: The overview-driven visual analysis of large-scale dynamic graphs poses a major challenge. We propose Multiscale Snapshots, a visual analytics approach to analyze temporal summaries of dynamic graphs at multiple temporal scales. First, we recursively generate… read more here.
Keywords: temporal summaries; visual analysis; snapshots visual; multiscale snapshots ... See more keywords
High-Order Topology-Enhanced Graph Convolutional Networks for Dynamic Graphs
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14102218
Abstract: Understanding the evolutionary mechanisms of dynamic graphs is crucial since dynamic is a basic characteristic of real-world networks. The challenges of modeling dynamic graphs are as follows: (1) Real-world dynamics are frequently characterized by group… read more here.
Keywords: topology; dynamic graphs; order topology; high order ... See more keywords