Results 11 to 20 of about 1,207,649 (297)
Discrete embedding for attributed graphs
Abstract Attributed graphs refer to graphs where both node links and node attributes are observable for analysis. Attributed graph embedding enables joint representation learning of node links and node attributes. Different from classical graph embedding methods such as Deepwalk and node2vec that first project node links into low-dimensional vectors ...
Hong Yang 0003 +4 more
openaire +4 more sources
Exploring the space of graphs with fixed discrete curvatures [PDF]
Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks across a wide
Michelle Roost +3 more
doaj +2 more sources
On the Discrete Fréchet Distance in a Graph [PDF]
The Fréchet distance is a well-studied similarity measure between curves that is widely used throughout computer science. Motivated by applications where curves stem from paths and walks on an underlying graph (such as a road network), we define and study the Fréchet distance for paths and walks on graphs.
Anne Driemel +2 more
openaire +5 more sources
Cauchy problem for integrable discrete equations on quad-graphs [PDF]
Initial value problems for the integrable discrete equations on quadgraphs are investigated. We give a geometric criterion of when such a problem is well-posed.
V.E. Adler (7160759) +1 more
core +6 more sources
Domination in discrete topology graph [PDF]
In this paper a graph of the discrete topology under some conditions has been created. It is obtained from the composition of the topologies. The properties and domination number on the discrete topology graph have studied. On a modified graph through deleting or adding the vertex, the affection discrete topological graph domination parameter is ...
Jabor, Ali Ameer, Omran, Ahmed Abd Ali
openaire +2 more sources
Thoroughly revised the paper originally titled "Vector-Quantized Graph Auto-Encoder. Implemented comprehensive modifications across all sections. Incorporated additional experiments to enhance the study. Maintained the fundamental structure and essence of the original work, ensuring it remains a continuation of the same ...
Yoann Boget +2 more
openaire +3 more sources
Graph-based methods for discrete choice
AbstractChoices made by individuals have widespread impacts—for instance, people choose between political candidates to vote for, between social media posts to share, and between brands to purchase—moreover, data on these choices are increasingly abundant.
Kiran Tomlinson, Austin R. Benson
openaire +3 more sources
Discrete realizations of contact and intersection graphs.
Summary: Known realizations of geometric representations of graphs, like contact, intersection, etc., are ``continuous'', in the sense that the geometric objects are drawn in Euclidean space with real numbers as coordinates. We initiate the study of dicrete versions of contact and intersection graphs and examine their relation to their continuous ...
Jurek Czyzowicz +3 more
openaire +3 more sources
On the use of graphs in discrete tomography [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de Werra, Dominique +3 more
openaire +6 more sources
Discrete linear canonical transform on graphs
With the wide application of spectral and algebraic theory in discrete signal processing techniques in the field of graph signal processing, an increasing number of signal processing methods have been proposed, such as the graph Fourier transform, graph wavelet transform and windowed graph Fourier transform.
Yu Zhang 0228, Bing-Zhao Li 0001
openaire +2 more sources

