Results 11 to 20 of about 292,694 (268)
Littelmann paths and Brownian paths [PDF]
We study some path transformations related to Littelmann path model and their applications to representation theory and Brownian motion in a Weyl chamber.
Biane, Philippe +2 more
openaire +5 more sources
Eigenvalue paths arising from matrix paths [PDF]
It is known (see e.g. [2], [4], [5], [6]) that continuous variations in the entries of a complex square matrix induce continuous variations in its eigenvalues. If such a variation arises from one real parameter $ \in [0, 1]$, then the eigenvalues follow continuous paths in the complex plane as $ $ shifts from $0$ to $1$.
Jankowski, Eric, Johnson, Charles R.
openaire +2 more sources
Showing the path to path dependence: the habitual path [PDF]
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 +4 more sources
It is the case that, in certain applications of fuzzy graphs, a t-norm, instead of a minimum, is more suitable. This requires the development of a new theory of fuzzy graphs involving an arbitrary t-norm in the basic definition of a fuzzy graph. There is
John N. Mordeson, Sunil Mathew
doaj +1 more source
On the basis of the direct product of paths and wheels
The basis number, b(G), of a graph G is defined to be the least integer k such that G has a k-fold basis for its cycle space. In this paper we determine the basis number of the direct product of paths and wheels.
A. A. Al-Rhayyel
doaj +1 more source
Percursos de regresso ao trabalho após acidente: confronto com novos obstáculos
This paper discusses the obstacles the injured workers have to face upon their return to work after the accident. Two studies developed in Portugal support the analysis and the reflection on this issue. One of the studies is the outcome of a request from
Cláudia Pereira +2 more
doaj +1 more source
Abstract The betweenness centrality of a vertex v is an important centrality measure that quantifies how many optimal paths between pairs of other vertices visit v. Computing betweenness centrality in a temporal graph, in which the edge set may change over discrete timesteps, requires us to count temporal paths that are optimal with respect to ...
Enright, Jessica +2 more
openaire +5 more sources
Structure Connectivity and Substructure Connectivity of
We present new results on the fault tolerability of $k$ -ary $n$ -cube (denoted $Q_{n}^{k}$ ) networks. $Q_{n}^{k}$ is a topological model for interconnection networks that has been extensively studied since proposed, and this paper is concerned ...
Guozhen Zhang, Dajin Wang
doaj +1 more source
Main Text: 5 pages, 5 figures, 7 equations.
Mandelli, Davide +2 more
openaire +3 more sources
Minimum path bases and relevant paths [PDF]
AbstractGiven an undirected graph G(V,E) and a vertex subset U ⊆ V the U‐space is the vector space over GF(2) spanned by the paths with end‐points in U and the cycles in G(V,E). We extend Vismara's algorithm to the computation of the union of all minimum length bases of the U‐space. Although the size distribution of subgraphs is the same in all minimum
Gleiss, Petra M. +2 more
openaire +3 more sources

