Results 31 to 40 of about 316,590 (267)
A Path-Based Partial Information Decomposition
Entropy, 2020 Based on the conceptual basis of information theory, we propose a novel mutual information measure—‘path-based mutual information’. This information measure results from the representation of a set of random variables as a probabilistic graphical model ...
David Sigtermans
doaj +1 more source
The number of lattice paths below a cyclically shifting boundary
, 2009 We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result can be viewed as an extension of well-known enumerative formulae concerning lattice paths dominated by lines of integer ...
Rattan, Amarpreet +4 more
core +1 more source
Discussiones Mathematicae Graph Theory, 2016 We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks).
Alcón Liliana
doaj +1 more source
The Saturation Number for the Length of Degree Monotone Paths
Discussiones Mathematicae Graph Theory, 2015 A degree monotone path in a graph G is a path P such that the sequence of degrees of the vertices in the order in which they appear on P is monotonic. The length (number of vertices) of the longest degree monotone path in G is denoted by mp(G).
Caro Yair, Lauri Josef, Zarb Christina
doaj +1 more source
Finding next-to-shortest paths in a graph
, 2004 We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest $(u,v)$-path is a shortest $(u,v)$-path amongst $(u,v)$-paths with length strictly greater than the length of the shortest $(u,v)$-path.
Krasikov, I +3 more
core +1 more source
From the Crossing Numbers of K5 + Pn and K5 + Cn to the Crossing Numbers of Wm + Sn and Wm + Wn
AxiomsThe crossing number of a graph is a significant measure that indicates the complexity of the graph and the difficulty of visualizing it. In this paper, we examine the crossing numbers of join products involving the complete graph K5 with discrete graphs,
Michal Staš +2 more
doaj +1 more source
Microstructure of compacted low-plasticity soils: the initial fabric and its evolution on stress and suction paths [PDF]
, 2023 Soils used in earthworks undergo different hydro-mechanical paths due to the compaction and construction process, the change in climatic conditions or the groundwater level oscillations.
Núria M. Pinyol +7 more
core +1 more source
Showing the path to path dependence: the habitual path [PDF]
European Political Science Review, 2014 This article investigates the conceptual and theoretical implications of the logic of habit for the path-dependence approach. In the existing literature, we see two different logics of action associated with two distinct models of path dependence: the logic of consequences (instrumental rationality) is linked with utilitarian paths (i.e.
openaire +3 more sources
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
Dementia Friendly Walking Project: Evaluation Report [PDF]
, 2017 The evaluation project explored the second year of the dementia friendly walking project. Paths for All were keen to obtain views of people living with dementia, their carers and other walk attendees regarding their experiences of attending dementia ...
Gibson, Grant +2 more
core