Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Eddin, Ahmad Naser, Bono, Jacopo, Aparício, David, Ferreira, Hugo, Ascensão, João, Ribeiro, Pedro, Bizarro, Pedro
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Deep-Graph-Sprints: Accelerated Representation Learning in Continuous-Time Dynamic Graphs
por: Eddin, Ahmad Naser, et al.
Publicado: (2024)

Mind the truncation gap: challenges of learning on dynamic graphs with recurrent architectures
por: Bravo, João, et al.
Publicado: (2024)

Evaluating Transfer Learning Methods on Real-World Data Streams: A Case Study in Financial Fraud Detection
por: Pereira, Ricardo Ribeiro, et al.
Publicado: (2025)

DiConStruct: Causal Concept-based Explanations through Black-Box Distillation
por: Moreira, Ricardo, et al.
Publicado: (2024)

Hub‐aware random walk graph embedding methods for classification
por: Aleksandar Tomčić, et al.
Publicado: (2024)

A quantum annealing approach to graph node embedding
por: Djidjev, Hristo N.
Publicado: (2025)

Comfortability of quantum walks on embedded graphs on surfaces
por: Higuchi, Yusuke, et al.
Publicado: (2025)

Quantum walks on graphs embedded in orientable surfaces
por: Higuchi, Yusuke, et al.
Publicado: (2024)

On the independence number of sparser random Cayley graphs
por: Campos, Marcelo, et al.
Publicado: (2024)

On the independence number of sparser random Cayley graphs
por: Marcelo Campos, et al.
Publicado: (2024)

Subgraph2vec: A random walk-based algorithm for embedding knowledge graphs
por: Bozorgi, Elika, et al.
Publicado: (2024)

Speed of random walk on dynamical percolation in nonamenable transitive graphs
por: Gu, Chenlin, et al.
Publicado: (2024)

Delocalization-localization dynamical phase transition of random walks on graphs
por: Carugno, Giorgio, et al.
Publicado: (2022)

A random walk among random graphs
por: Curien, Nicolas
Publicado: (2024)

Congestion transition on random walks on graphs
por: Di Meco, Lorenzo, et al.
Publicado: (2024)

Tree walks and the spectrum of random graphs
por: Hainzl, Eva-Maria, et al.
Publicado: (2024)

MUSE: Multi-Tenant Model Serving With Seamless Model Updates
por: Correia, Cláudio, et al.
Publicado: (2026)

Countering adversarial perturbations in graphs using error correcting codes
por: Jabari, Saif Eddin
Publicado: (2024)

An Ad-hoc graph node vector embedding algorithm for general knowledge graphs using Kinetica-Graph
por: Karamete, B. Kaan, et al.
Publicado: (2024)

Het-node2vec: second order random walk sampling for heterogeneous multigraphs embedding
por: Soto-Gomez, Mauricio, et al.
Publicado: (2021)

From low resource information extraction to identifying influential nodes in knowledge graphs
por: Cai, Erica, et al.
Publicado: (2024)

A Fano framework for embeddings of graphs in surfaces
por: Dunshee, Blake, et al.
Publicado: (2024)

Nonconcentration of hitting times for random walks on graphs
por: Chiclana, Rafael
Publicado: (2026)

Eichler orders, quotient graphs and random walks
por: Arenas-Carmona, Luis, et al.
Publicado: (2025)

Note on the trace of random walks on pseudorandom graphs
por: Chen, Yaobin, et al.
Publicado: (2026)

Random walks on edge colored random graphs
por: Cooper, Colin, et al.
Publicado: (2024)

Cutoff for random walk on random graphs with a community structure
por: Hermon, Jonathan, et al.
Publicado: (2022)

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

The number of particles in activated random walk on the complete graph
por: Járai, Antal A., et al.
Publicado: (2023)

The SYK charging advantage as a random walk on graphs
por: Divi, Francisco, et al.
Publicado: (2024)

Exponential speedups for quantum walks in random hierarchical graphs
por: Balasubramanian, Shankar, et al.
Publicado: (2023)

Canonization of a random circulant graph by counting walks
por: Verbitsky, Oleg, et al.
Publicado: (2023)

Animal social networks as intersections graphs of random walks
por: Cermelli, Paolo, et al.
Publicado: (2025)

An inverse problem for fractional random walks on finite graphs
por: Covi, Giovanni, et al.
Publicado: (2024)

Hipster random walks, random series-parallel graph and random homogeneous systems
por: Chen, Xinxing, et al.
Publicado: (2025)

Traces left by random walks on large random graphs: local limits
por: Dereich, Steffen
Publicado: (2024)

Convergence of blanket times for sequences of random walks on critical random graphs
por: Andriopoulos, George
Publicado: (2018)

Mixing time of the random walk on the giant component of the random geometric graph
por: Haaland, Magnus H., et al.
Publicado: (2025)

Universal geometric non-embedding of random regular graphs
por: Altschuler, Dylan J., et al.
Publicado: (2025)

Central limit theorem for crossings in randomly embedded graphs
por: Arenas-Velilla, Santiago, et al.
Publicado: (2023)