Results 61 to 70 of about 157,967 (267)
Quantum causal graph dynamics [PDF]
Physical 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
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
The Current Landscape of Scalable Dynamic Graph Processing
IEEE AccessWith the rapid growth in data volume, workloads from various domains have undergone drastic changes in recent years. Today, streaming workloads are commonplace.
Gabriel G. Dos Santos +2 more
doaj +1 more source
Dynamic monopolies in simple graphs [PDF]
AUT Journal of Mathematics and ComputingThis paper studies a repetitive polling game played on an $n$-vertex graph $G$. At first, each vertex is colored, Black or White. At each round, each vertex (simultaneously) recolors itself by the color of the majority of its closed neighborhood.
Leila Musavizadeh Jazaeri +1 more
doaj +1 more source
Design and analysis strategies for robust microbiome ageing research
FEBS 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
Remarks on Dynamic Monopolies with Given Average Thresholds
Discussiones Mathematicae Graph Theory, 2015 Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and ...
Centeno Carmen C., Rautenbach Dieter
doaj +1 more source
Node embeddings in dynamic graphs
Applied Network Science, 2019 In this paper, we present algorithms that learn and update temporal node embeddings on the fly for tracking and measuring node similarity over time in graph streams. Recently, several representation learning methods have been proposed that are capable of
Ferenc Béres +3 more
doaj +1 more source
CoRRRecent 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]
Journal 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
FEBS 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