Results 31 to 40 of about 608,783 (278)
About Directed d-Convex Simple Graphs [PDF]
Computer Science Journal of Moldova, 2008 In this article we introduce a pseudo-metric on directed graphs, which forms there a family of convex sets. The graphs without d-convex sets, except empty set, sets of one vertex and set of all vertexes, are called d-convex simple.
Nadejda Sur, Sergiu Cataranciuc
doaj
Priors on exchangeable directed graphs
, 2016 Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter.
Ackerman, Nathanael +2 more
core +1 more source
All finite transitive graphs admit self-adjoint free semigroupoid algebras
, 2020 In this paper we show that every non-cycle finite transitive directed graph has a Cuntz-Krieger family whose WOT-closed algebra is $B(\mathcal{H})$. This is accomplished through a new construction that reduces this problem to in-degree $2$-regular graphs,
Dor-On, Adam, Linden, Christopher
core +1 more source
A Graph Convolution for Signed Directed Graphs
CoRR, 2022 Preprint ...
Ko, Taewook, Kim, Chong-Kwon
openaire +2 more sources
Gromov Hyperbolicity in Directed Graphs [PDF]
Symmetry, 2020 In this paper, we generalize the classical definition of Gromov hyperbolicity to the context of directed graphs and we extend one of the main results of the theory: the equivalence of the Gromov hyperbolicity and the geodesic stability. This theorem has potential applications to the development of solutions for secure data transfer on the internet.
Ana Portilla +3 more
openaire +3 more sources
, 2016 We introduce the notion of balance for directed graphs: a weighted directed graph is $\alpha$-balanced if for every cut $S \subseteq V$, the total weight of edges going from $S$ to $V\setminus S$ is within factor $\alpha$ of the total weight of edges ...
Ene, Alina +3 more
core +1 more source
Community detection in directed acyclic graphs [PDF]
, 2015 Some temporal networks, most notably citation networks, are naturally represented as directed acyclic graphs (DAGs). To detect communities in DAGs, we propose a modularity for DAGs by defining an appropriate null model (i.e., randomized network ...
Masuda, Naoki +2 more
core +1 more source
Large-scale DCMs for resting-state fMRI [PDF]
Network Neuroscience, 2017 This paper considers the identification of large directed graphs for resting-state brain networks based on biophysical models of distributed neuronal activity, that is, effective connectivity.
Adeel Razi +8 more
doaj +1 more source
CoRR, 2020 This paper presents several algorithms for hashing directed graphs. The algorithms given are capable of hashing entire graphs as well as assigning hash values to specific nodes in a given graph. The notion of node symmetry is made precise via computation of vertex orbits and the graph automorphism group, and nodes that are symmetrically identical are ...
openaire +2 more sources
Journal of Computer and System Sciences, 1971 Diverse graph structure models for concurrent processing systems have been suggested and used. The structures differ in generality and scope according to the properties one wishes to model and analyze. In this paper we solve a problem of maximal storage requirements for a simple flowchart model called the Marked Graph Model.
Frederic G. Commoner +3 more
openaire +2 more sources