Results 41 to 50 of about 1,519,388 (324)
Geometric Algebras of Light Cone Projective Graph Geometries [PDF]
A null vector is an algebraic quantity with the property that its square is zero. I denote the universal algebra generated by taking all sums and products of null vectors over the real or complex numbers by N\documentclass[12pt]{minimal} \usepackage ...
G. Sobczyk
semanticscholar +1 more source
Community Detection in General Hypergraph Via Graph Embedding [PDF]
Conventional network data have largely focused on pairwise interactions between two entities, yet multi-way interactions among multiple entities have been frequently observed in real-life hypergraph networks.
Yao Zhen, Junhui Wang
semanticscholar +1 more source
NULL COMPACTNESS FOR LOCAL, PARTIAL GRAPHS IN ECONOMIC TASKS
N. Tazhbayev +7 more
openalex +2 more sources
Complete resolution of the circulant nut graph order-degree existence problem [PDF]
A circulant nut graph is a non-trivial simple graph such that its adjacency matrix is a circulant matrix whose null space is spanned by a single vector without zero elements. Regarding these graphs, the order-degree existence problem can be thought of as
Ivan Damnjanovi'c
semanticscholar +1 more source
Columnar Storage and List-based Processing for Graph Database Management Systems [PDF]
We revisit column-oriented storage and query processing techniques in the context of contemporary graph database management systems (GDBMSs).
Pranjal Gupta +2 more
semanticscholar +1 more source
Alice and the Caterpillar: A more descriptive null model for assessing data mining results [PDF]
We introduce novel null models for assessing the results obtained from observed binary transactional and sequence datasets, using statistical hypothesis testing.
Giulia Preti +2 more
semanticscholar +1 more source
Non-parallel graph of submodules of a module [PDF]
A non-parallel submodules graph of M, denoted by G ∦ (M), is an undirected simple graph whose vertices are in one-to-one correspondence with all non-zero proper submodules of M and two distinct vertices are adjacent if and only if they are not parallel ...
نسرین شیرعلی +1 more
doaj +1 more source
Continuous Regular Functions [PDF]
Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function $f:[0,1] \to [0,1]$ is $r$-regular if there is a B\"{u}chi automaton that accepts precisely the set of base $r \in \mathbb{N}$ representations of elements of the graph of $f$.
Alexi Block Gorman +7 more
doaj +1 more source
Discrete Random Walks on One-Sided ``Periodic'' Graphs [PDF]
In this paper we consider discrete random walks on infinite graphs that are generated by copying and shifting one finite (strongly connected) graph into one direction and connecting successive copies always in the same way.
Michael Drmota
doaj +1 more source
A Spinorial Formulation of the Maximum Clique Problem of a Graph [PDF]
We present a new formulation of the maximum clique problem of a graph in complex space. We start observing that the adjacency matrix A of a graph can always be written in the form A = B B where B is a complex, symmetric matrix formed by vectors of zero ...
Knuth D. E. +3 more
core +3 more sources

