Results 11 to 20 of about 751,203 (314)
Littelmann paths and Brownian paths [PDF]
Duke Mathematical Journal, 2005 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
Finding an induced path that is not a shortest path [PDF]
Discrete Mathematics, 2021 We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.
Eli Berger +2 more
openaire +3 more sources
The Path to Path-Traced Movies [PDF]
Foundations and Trends® in Computer Graphics and Vision, 2016 Path tracing is one of several techniques to render photorealistic images by simulating the physics of light propagation within a scene. The roots of path tracing are outside of computer graphics, in the Monte Carlo simulations developed for neutron transport.
Per H. Christensen, Wojciech Jarosz
openaire +2 more sources
Physical Review Letters, 2020 Main Text: 5 pages, 5 figures, 7 equations.
Mandelli, Davide +2 more
openaire +4 more sources
Minimum path bases and relevant paths [PDF]
Networks, 2005 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
Petra M. Gleiss +2 more
openaire +4 more sources
Finding next-to-shortest paths in a graph [PDF]
, 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
A simple proof of distance bounds for Gaussian rough paths [PDF]
, 2013 We derive explicit distance bounds for Stratonovich iterated integrals along two Gaussian processes (also known as signatures of Gaussian rough paths) based on the regularity assumption of their covariance functions.
Riedel, Sebastian, Xu, Weijun
core +1 more source
Smooth rough paths, their geometry and algebraic renormalization [PDF]
, 2021 We introduce the class of "smooth rough paths" and study their main properties. Working in a smooth setting allows us to discard sewing arguments and focus on algebraic and geometric aspects.
Paycha, Sylvie (Prof. Dr.) +10 more
core +1 more source
The number of lattice paths below a cyclically shifting boundary [PDF]
, 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 +3 more
core +1 more source
, 2022 Initial release of jupyter notebooks for stochastic path probabilities.If you use this software, please cite it using these metadata. Please also cite: 'Optimizing dynamical function for speed' by R. A. Bone and J. R. Green 'Ensembles of stochastic paths
Bone, Rebecca, Green, Jason
core +1 more source