Image de couverture de livre

From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Eddin, Ahmad Naser, Bono, Jacopo, Aparício, David, Ferreira, Hugo, Ascensão, João, Ribeiro, Pedro, Bizarro, Pedro
Format:	Preprint
Publié:	2023
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Deep-Graph-Sprints: Accelerated Representation Learning in Continuous-Time Dynamic Graphs
par: Eddin, Ahmad Naser, et autres
Publié: (2024)

Mind the truncation gap: challenges of learning on dynamic graphs with recurrent architectures
par: Bravo, João, et autres
Publié: (2024)

Evaluating Transfer Learning Methods on Real-World Data Streams: A Case Study in Financial Fraud Detection
par: Pereira, Ricardo Ribeiro, et autres
Publié: (2025)

DiConStruct: Causal Concept-based Explanations through Black-Box Distillation
par: Moreira, Ricardo, et autres
Publié: (2024)

Hub‐aware random walk graph embedding methods for classification
par: Aleksandar Tomčić, et autres
Publié: (2024)

A quantum annealing approach to graph node embedding
par: Djidjev, Hristo N.
Publié: (2025)

Comfortability of quantum walks on embedded graphs on surfaces
par: Higuchi, Yusuke, et autres
Publié: (2025)

Quantum walks on graphs embedded in orientable surfaces
par: Higuchi, Yusuke, et autres
Publié: (2024)

On the independence number of sparser random Cayley graphs
par: Campos, Marcelo, et autres
Publié: (2024)

On the independence number of sparser random Cayley graphs
par: Marcelo Campos, et autres
Publié: (2024)

Subgraph2vec: A random walk-based algorithm for embedding knowledge graphs
par: Bozorgi, Elika, et autres
Publié: (2024)

Speed of random walk on dynamical percolation in nonamenable transitive graphs
par: Gu, Chenlin, et autres
Publié: (2024)

Delocalization-localization dynamical phase transition of random walks on graphs
par: Carugno, Giorgio, et autres
Publié: (2022)

A random walk among random graphs
par: Curien, Nicolas
Publié: (2024)

Congestion transition on random walks on graphs
par: Di Meco, Lorenzo, et autres
Publié: (2024)

Tree walks and the spectrum of random graphs
par: Hainzl, Eva-Maria, et autres
Publié: (2024)

MUSE: Multi-Tenant Model Serving With Seamless Model Updates
par: Correia, Cláudio, et autres
Publié: (2026)

Countering adversarial perturbations in graphs using error correcting codes
par: Jabari, Saif Eddin
Publié: (2024)

An Ad-hoc graph node vector embedding algorithm for general knowledge graphs using Kinetica-Graph
par: Karamete, B. Kaan, et autres
Publié: (2024)

Het-node2vec: second order random walk sampling for heterogeneous multigraphs embedding
par: Soto-Gomez, Mauricio, et autres
Publié: (2021)

From low resource information extraction to identifying influential nodes in knowledge graphs
par: Cai, Erica, et autres
Publié: (2024)

A Fano framework for embeddings of graphs in surfaces
par: Dunshee, Blake, et autres
Publié: (2024)

Nonconcentration of hitting times for random walks on graphs
par: Chiclana, Rafael
Publié: (2026)

Eichler orders, quotient graphs and random walks
par: Arenas-Carmona, Luis, et autres
Publié: (2025)

Note on the trace of random walks on pseudorandom graphs
par: Chen, Yaobin, et autres
Publié: (2026)

Random walks on edge colored random graphs
par: Cooper, Colin, et autres
Publié: (2024)

Cutoff for random walk on random graphs with a community structure
par: Hermon, Jonathan, et autres
Publié: (2022)

Chapter Il ruolo culturale delle Piattaforme Digitali per l’esperienza del patrimonio museale
par: Bono, Jacopo
Publié: (2025)

The number of particles in activated random walk on the complete graph
par: Járai, Antal A., et autres
Publié: (2023)

The SYK charging advantage as a random walk on graphs
par: Divi, Francisco, et autres
Publié: (2024)

Exponential speedups for quantum walks in random hierarchical graphs
par: Balasubramanian, Shankar, et autres
Publié: (2023)

Canonization of a random circulant graph by counting walks
par: Verbitsky, Oleg, et autres
Publié: (2023)

Animal social networks as intersections graphs of random walks
par: Cermelli, Paolo, et autres
Publié: (2025)

An inverse problem for fractional random walks on finite graphs
par: Covi, Giovanni, et autres
Publié: (2024)

Hipster random walks, random series-parallel graph and random homogeneous systems
par: Chen, Xinxing, et autres
Publié: (2025)

Traces left by random walks on large random graphs: local limits
par: Dereich, Steffen
Publié: (2024)

Convergence of blanket times for sequences of random walks on critical random graphs
par: Andriopoulos, George
Publié: (2018)

Mixing time of the random walk on the giant component of the random geometric graph
par: Haaland, Magnus H., et autres
Publié: (2025)

Universal geometric non-embedding of random regular graphs
par: Altschuler, Dylan J., et autres
Publié: (2025)

Central limit theorem for crossings in randomly embedded graphs
par: Arenas-Velilla, Santiago, et autres
Publié: (2023)