Adding more communication pathways between agents does not automatically enhance multi‑agent performance. In a controlled experiment with 50 runs, recovery stayed stable as relationship density increased from 20% to 100%, yet the proportion of edges actually used dropped sharply as the network grew denser. This highlights a disconnect between configured connectivity and the connections that are behaviorally utilized.
arXiv:2607. 26533v1 Announce Type: new Abstract: Graph Foundation Models (GFMs) aim to learn transferable knowledge from multi-domain graphs and adapt to unseen scenarios.
Graph Foundation Models (GFMs) aim to learn transferable knowledge from multi-domain graphs and adapt to unseen scenarios. As a fundamental source of relational semantics in graphs, the transferability of topological patterns has long been central to GFM research.
arXiv:2609.01525v1 Announce Type: cross Abstract: A durable assumption holds that graph analytics requires a purpose-built graph engine, and that relational systems are ill-suited to connected data....
Posted by Bahare Fatemi and Bryan Perozzi, Research Scientists, Google Research Imagine all the things around you — your friends, tools in your kitchen, or even the parts of your bike. They are all connected in different ways.
arXiv:2610.18616v1 Announce Type: cross Abstract: Searching text-rich knowledge graphs requires following relations while examining textual evidence. Predefined graph interfaces constrain what eviden...
arXiv:2606. 12581v1 Announce Type: cross Abstract: Real-world networks are inherently incomplete, noisy, and dynamically evolving, making it difficult to capture all actors and their relationships.
LLMs have evolved from language generators to autonomous agents capable of complex, long-horizon tasks. This evolution has produced paradigms including Prompt Engineering to elicit model capabilities,...
arXiv:2608.21156v1 Announce Type: cross Abstract: LLMs have evolved from language generators to autonomous agents capable of complex, long-horizon tasks. This evolution has produced paradigms includi...
The paper evaluates seven graph database engines, including Corvic AI, on a synthetic biomedical property graph with 1.02 million nodes and 5.34 million rows. It benchmarks query latency, bulk‑ingest throughput, point‑update latency, and correctness across a twenty‑query workload that covers neighborhood lookups, bounded paths, set intersections, anti‑joins, aggregation, ranking, temporal filters, full scans, and relational joins. The study finds that no single engine is universally fastest; performance depends on query shape, and the largest cost difference arises from bulk‑ingest throughput, which varies by three orders of magnitude and dominates total cost for workloads with fewer than about 10⁵ queries per data refresh.
I benchmarked raw chat history, vector-only RAG, and a context graph on the same multi-agent conversations. The results exposed a surprising weakness in relational retrieval.
The paper surveys self‑evolving agents, highlighting that their states—memories, tools, skills, workflows, and inter‑agent relations—are dynamic and can be modeled as evolving graphs. It critiques existing surveys for treating graphs merely as support structures and proposes a framework that views agent evolution as dynamic graph transformation, categorizing methods into node/feature, edge/topology, subgraph activation, and cross‑component co‑evolution. The authors further map dynamic‑graph learning subfields to agent capabilities, discuss potential failure modes, and outline graph‑aware evaluation and governance protocols to guide the design and oversight of self‑evolving agents.
The paper explores how information propagates in Deep Graph Networks (DGNs) for both static and dynamic graphs, treating DGNs as dynamical systems. It presents new architectures that better preserve long‑term node dependencies and learn complex spatio‑temporal patterns from irregular, sparsely sampled dynamic graphs. The work combines theoretical analysis with empirical results to demonstrate the effectiveness of these designs.