Results 31 to 40 of about 17,304 (236)
Discrete Dynamics in Nature and Society, 2021 Using different methods than the probability space, under the condition that the Choquet integral exists, we study the complete convergence theorem for weighted sums of widely acceptable random variables under sublinear expectation space.
Rong Hu, Qunying Wu
doaj +1 more source
Distributed Non-Convex Optimization with Sublinear Speedup under Intermittent Client Availability [PDF]
INFORMS journal on computing, 2020 Federated learning is a new distributed machine learning framework, where numerous heterogeneous clients collaboratively train a model without sharing training data.
Yikai Yan +7 more
semanticscholar +1 more source
Sublinear Circuits for Polyhedral Sets [PDF]
Vietnam Journal of Mathematics, 2021 AbstractSublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the arithmetic-geometric inequality.
Helen Naumann, Thorsten Theobald
openaire +4 more sources
Discrete Dynamics in Nature and Society, 2021 We investigate the complete pth moment convergence for weighted sums of independent, identically distributed random variables under sublinear expectations space.
Mingzhou Xu, Kun Cheng
doaj +1 more source
Mathematics, 2023 We investigate the complete convergence for weighted sums of sequences of negative dependence (ND) random variables and p-th moment convergence for weighted sums of sequences of ND random variables under sublinear expectation space.
Peiyu Sun, Dehui Wang, Xili Tan
doaj +1 more source
, 2015 A distance labeling scheme labels the $n$ nodes of a graph with binary strings such that, given the labels of any two nodes, one can determine the distance in the graph between the two nodes by looking only at the labels. A $D$-preserving distance labeling scheme only returns precise distances between pairs of nodes that are at distance at least $D ...
Alstrup, Stephen +3 more
openaire +4 more sources
Approximating the Arboricity in Sublinear Time [PDF]
, 2022 We consider the problem of approximating the arboricity of a graph $G= (V,E)$, which we denote by $\mathsf{arb}(G)$, in sublinear time, where the arboricity of a graph is the minimal number of forests required to cover its edges. An algorithm for this problem may perform degree and neighbor queries, and is allowed a small error probability.
Talya Eden, Saleet Mossel, Dana Ron
openaire +2 more sources
Solving QSAT in Sublinear Depth [PDF]
, 2019 Among $\mathbf{PSPACE}$-complete problems, QSAT, or quantified SAT, is one of the most used to show that the class of problems solvable in polynomial time by families of a given variant of P systems includes the whole $\mathbf{PSPACE}$. However, most solutions require a membrane nesting depth that is linear with respect to the number of variables of ...
Leporati, A +4 more
openaire +4 more sources
Existence of Positive Solutions for Second-Order Third-Point Semipositive BVP
Journal of Function Spaces, 2021 In this paper, we study the existence of positive solutions for the following nonlinear second-order third-point semi-positive BVP. We derive an explicit interval of positive parameters, which for any l,μ in this interval, the existence of positive ...
Hua Su, Jinmin Yu
doaj +1 more source
Oscillation in second order functional equations with deviating arguments
International Journal of Mathematics and Mathematical Sciences, 1981 For the pair of functional equations (A)(r(t)y′(t))+p(t)h(h(g(t)))=f(t) and (B)(r(t)y′(t))−p(t)h(y(g(t)))=0 sufficient conditions have been found to cause all solutions of equation (A) to be oscillatory.
Bhagat Singh
doaj +1 more source