Results 21 to 30 of about 62,209 (271)

Consensus mechanism design based on structured directed acyclic graphs

Blockchain: Research and Applications, 2021
Capacity limit is a bottleneck for broader applications of blockchain systems. Scaling up capacity while preserving security and decentralization are major challenges in blockchain infrastructure design.
Jiahao He, Guangju Wang, Guangyuan Zhang, Jiheng Zhang   +3 more
doaj   +1 more source

Evidence synthesis for constructing directed acyclic graphs (ESC-DAGs): a novel and systematic method for building directed acyclic graphs. [PDF]

Int J Epidemiol, 2020
Ferguson KD, McCann M, Katikireddi SV, Thomson H, Green MJ, Smith DJ, Lewsey JD.   +6 more
europepmc   +2 more sources

Causation and decision: On Dawid’s “Decision theoretic foundation of statistical causality”

Journal of Causal Inference, 2022
In a recent issue of this journal, Philip Dawid (2021) proposes a framework for causal inference that is based on statistical decision theory and that is, in many aspects, compatible with the familiar framework of causal graphs (e.g., Directed Acyclic ...
Pearl Judea
doaj   +1 more source

Hierarchy Depth in Directed Networks

Entropy, 2022
In this study, we explore the depth measures for flow hierarchy in directed networks. Two simple measures are defined—rooted depth and relative depth—and their properties are discussed. The method of loop collapse is introduced, allowing investigation of
Krzysztof Suchecki, Janusz A. Hołyst
doaj   +1 more source

A Pathfinding Problem for Fork-Join Directed Acyclic Graphs with Unknown Edge Length

Algorithms, 2021
In a previous paper by the author, a pathfinding problem for directed trees is studied under the following situation: each edge has a nonnegative integer length, but the length is unknown in advance and should be found by a procedure whose computational ...
Kunihiko Hiraishi
doaj   +1 more source

Directed Acyclic Outerplanar Graphs Have Constant Stack Number [PDF]

TheoretiCS
The stack number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological ...
Paul Jungeblut, Laura Merker, Torsten Ueckerdt   +2 more
doaj   +1 more source

Replacement Paths via Row Minima of Concise Matrices [PDF]

, 2013
Matrix $M$ is {\em $k$-concise} if the finite entries of each column of $M$ consist of $k$ or less intervals of identical numbers. We give an $O(n+m)$-time algorithm to compute the row minima of any $O(1)$-concise $n\times m$ matrix. Our algorithm yields
Lee, Cheng-Wei, Lu, Hsueh-I
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, Speidel, Leo, Takaguchi, Taro   +2 more
core   +1 more source

Cycle analysis of Directed Acyclic Graphs

Physica A: Statistical Mechanics and its Applications, 2022
In this paper, we employ the decomposition of a directed network as an undirected graph plus its associated node metadata to characterise the cyclic structure found in directed networks by finding a Minimal Cycle Basis of the undirected graph and augment its components with direction information. We show that only four classes of directed cycles exist,
Vasiliauskaite, Vaiva, Evans, Tim S., Expert, Paul   +2 more
openaire   +6 more sources

Line graphs of directed graphs I [PDF]

Transactions on Combinatorics
We determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj   +1 more source