Results 1 to 10 of about 292 (62)
Networks of causal relationships in the U.S. stock market
Dependence Modeling, 2022 We consider a network-based framework for studying causal relationships in financial markets and demonstrate this approach by applying it to the entire U.S. stock market.
Shirokikh Oleg +6 more
doaj +1 more source
Some Results on Path-Factor Critical Avoidable Graphs
Discussiones Mathematicae Graph Theory, 2023 A path factor is a spanning subgraph F of G such that every component of F is a path with at least two vertices. We write P≥k = {Pi : i ≥ k}. Then a P≥k-factor of G means a path factor in which every component admits at least k vertices, where k ≥ 2 is ...
Zhou Sizhong
doaj +1 more source
Decomposing tournaments into paths
Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020 Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
Determination of the magnetostrictive atomic enviroments in FeCoB alloys [PDF]
, 2012 The atomic environments of Fe and Co involved in the magnetostriction effect in FeCoB alloys have been identified by differential extended x-ray fine structure (DiffEXAFS) spectroscopy.
Aroca Hernández-Ros, Claudio +6 more
core +3 more sources
Mathematical evolution in discrete networks [PDF]
, 2013 This paper provides a mathematical explanation for the phenomenon of \triadic closure" so often seen in social networks. It appears to be a natural consequence when network change is constrained to be continuous.
Pfaltz, John F.
core +2 more sources
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks [PDF]
Computer Science Journal of Moldova, 2005 The game-theoretic formulation of the multiobjective multicommodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
The time-varying shortest path problem with fuzzy transit costs and speedup
Acta Universitatis Sapientiae: Mathematica, 2016 In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost.
Rezapour Hassan, Shirdel Gholamhassan
doaj +1 more source
Algorithms for minimum flows [PDF]
Computer Science Journal of Moldova, 2001 We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n2m) time.
Eleonor Ciurea, Laura Ciupal
doaj
The maximum flow in dynamic networks [PDF]
Computer Science Journal of Moldova, 2005 The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
A note on polylinking flow networks [PDF]
, 2013 This is a supplementary note on M. X. Goemans, S. Iwata, and R. Zenklusen’s paper that proposes a flow model based on polylinking systems. Their flow model is a series (or tandem) connection of polylinking systems.
Fujishige, Satoru
core +1 more source