Results 31 to 40 of about 916,150 (184)
A Geometric Characterization of Steady Laminar Flow
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT We study the steady states of the Euler equations on the periodic channel or annulus. We show that if these flows are laminar (layered by closed non‐contractible streamlines which foliate the domain), then they must be either parallel or circular flows.
Theodore D. Drivas, Marc Nualart
wiley +1 more source
, 2011 In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +1 more source
A New Implementation of Network GARCH Model for Stock Volatility and Co‐Volatility Forecasting
Journal of Forecasting, EarlyView.ABSTRACT Volatility clustering and spillovers are key features of financial time series with many cross‐sectional assets. While network analysis links similar or correlated stocks and helps trace volatility spillovers, contemporary multivariate ARCH‐GARCH formulations struggle to represent structured network dependence and remain parsimonious.
Peiyi Zhou
wiley +1 more source
Towards a Maude tool for model checking temporal graph properties [PDF]
, 2011 We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +1 more source
How Is FinTech Shaping Household Portfolio Behaviour?
International Journal of Finance &Economics, EarlyView.ABSTRACT This paper examines how FinTech adoption influences household portfolio allocation across major advanced economies. Using a flow‐of‐funds framework and the Almost Ideal Demand System (AIDS), we model household demand for currency, deposits, loans, debt securities, and equity in the United States, United Kingdom, Euro Area, Japan and Australia.
Victor Murinde, Athina Petropoulou
wiley +1 more source
A semi-strong Perfect Graph theorem [PDF]
, 1987 Perfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs has been intensely studied. Much of the work has been directed towards proving Berge's Strong and Weak Perfect Graph Conjectures. L. Lovász finally demonstrated the
Reed, B
core +1 more source
Exact Values and Bounds on Covering Schemes of Strength Two
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this work, we investigate covering schemes of strength 2 over finite abelian groups, establishing new lower and upper bounds and evaluating new exact values. A main result is a new general lower bound that improves the trivial one and achieves optimality for the binary case. We also develop a recursive relation based on subsets of the group
André G. Castoldi +4 more
wiley +1 more source
Perfect codes in SL(2,2f) [PDF]
, 2004 It is shown that any subset X which is closed under conjugation does not divide SL(2,2f) non-trivially if f≠1; that is, there exists no perfect code in the Cayley graph of SL(2,2f) with respect to X if f≠1.
Terada, Sachiyo
core +1 more source
Eigenvalues of the perfect matching derangement graph
, 2023 The perfect matching derangement graph M2n is the graph whose vertex set consists of the perfect matchings of the complete graph K2n such that two vertices (perfect matchings) are adjacent if and only if they have no edges in common, i.e.
Koh, Samuel Zhi Kang
core +1 more source
On Odd Covers of Cliques and Disjoint Unions
Journal of Graph Theory, EarlyView.ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan +7 more
wiley +1 more source