Results 61 to 70 of about 232,761 (262)

Quantum causal graph dynamics [PDF]

open access: yesPhysical Review D, 2017
Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded speed, with respect to the distance given by the graph.
Arrighi, Pablo, Martiel, Simon
openaire   +5 more sources

Dynamic Graph Convolutional Recurrent Network With Temporal Self‐Attention for Accurate Traffic Flow Prediction

open access: yesIET Intelligent Transport Systems
Accurate traffic flow prediction is essential for the effective management of Intelligent Transportation Systems (ITS). However, traditional methods based on static graph structures often fail to address the complex and nonlinear spatiotemporal ...
Xin Li   +4 more
doaj   +1 more source

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

Dynamic PageRank with Decay: A Modified Approach for Node Anomaly Detection in Evolving Graph Streams

open access: yesProceedings of the International Florida Artificial Intelligence Research Society Conference
Given a large graph stream with dynamically changing structures over a given timestep, it is important to detect the sudden appearance of anomalous patterns, such as sudden spikes in IP-network attacks or unexpected surges in social media followers.
Ocheme Anthony Ekle, William Eberle
doaj   +1 more source

On dynamic colouring of cartesian product of complete graph with some graphs

open access: yesJournal of Taibah University for Science, 2020
A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj   +2 more
doaj   +1 more source

Decoding the dynamic extracellular matrix in cancer—3D models and bioscaffolds rewire the rules of tumor progression

open access: yesFEBS Letters, EarlyView.
Cancer progression is regulated by the dynamic matrix code of the tumor microenvironment, which influences cellular behavior and disease development. Importantly, matrix remodeling in three‐dimensional cancer models more accurately reflects in vivo conditions compared to conventional two‐dimensional systems.
Sylvia Mangani   +3 more
wiley   +1 more source

Dynamic Graph Condensation

open access: yesCoRR
Recent research on deep graph learning has shifted from static to dynamic graphs, motivated by the evolving behaviors observed in complex real-world systems. However, the temporal extension in dynamic graphs poses significant data efficiency challenges, including increased data volume, high spatiotemporal redundancy, and reliance on costly dynamic ...
Dong Chen 0043   +6 more
openaire   +2 more sources

Queues on a Dynamically Evolving Graph [PDF]

open access: yesJournal of Statistical Physics, 2018
This paper considers a population process on a dynamically evolving graph, which can be alternatively interpreted as a queueing network. The queues are of infinite-server type, entailing that at each node all customers present are served in parallel. The links that connect the queues have the special feature that they are unreliable, in the sense that ...
Mandjes, M.   +2 more
openaire   +6 more sources

TEDDGN: a trend-event decoupled dynamic graph network for traffic forecasting

open access: yesInternational Journal of Digital Earth
Accurate traffic flow prediction is of great significance for urban planning and traffic management. Among existing methods, researchers have shown remarkable progress by utilizing spatiotemporal networks.
Qin Zhang   +3 more
doaj   +1 more source

Dynamic Spectral Layout with an Application to Small Worlds

open access: yesJournal of Graph Algorithms and Applications, 2007
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach ...
Ulrik Brandes   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy