Results 21 to 30 of about 280,099 (288)
Integral Jensen–Mercer and Related Inequalities for Signed Measures with Refinements
In this paper, we give necessary and sufficient conditions for the integral Jensen–Mercer inequality and closely related inequalities to be satisfied for finite signed measures.
László Horváth
doaj +1 more source
Majorization Inequalities for n-Convex Functions with Applications to 3-Convex Functions
In this paper, we study majorization-type inequalities for n-convex (specifically 3-convex) functions. Numerous papers deal with such integral inequalities, in which n-convex functions are defined on compact intervals and nonnegative measures are used in
László Horváth
doaj +1 more source
A NOTE ON THE LEAST (NORMALIZED) LAPLACIAN EIGHVA;UE OF SIGNED GRAPHS
Let Γ=(G,σ)Γ=(G,σ) be a connected signed graph, and L(Γ)L(Γ) be its Laplacian and L(Γ)L(Γ) its normalized Laplacian with eigenvalues λ1≥λ2≥⋯≥λnλ1≥λ2≥⋯≥λn and μ1≥μ2≥⋯≥μnμ1≥μ2≥⋯≥μn, respectively.
Li, Hui Shu;Li, Hong Hai
core +1 more source
Examining the relationship between corporate governance and bank performance in Bangladesh
Previous research has studied the impact of corporate governance on bank performance, but only a few aspects of the impact were reported. The present study develops a unique corporate governance index to provide a comprehensive measure of corporate ...
J. Islam, S. Sathye, H. Hu
doaj +1 more source
Stable Community Detection in Signed Social Networks
IEEE Community detection is one of the most fundamental problems in social network analysis, while most existing research focuses on unsigned graphs. In real applications, social networks involve not only positive relationships but also negative ones. It
Wang, X, Sun, R, Chen, C, Zhang, Y
core +1 more source
Link prediction algorithm in signed networks based on clustering coefficient and sign influence
In order to achieve the dual goals of link prediction and sign prediction in signed social networks quickly and accurately, a link prediction algorithm is proposed based on the clustering coefficient of common neighbor nodes and the influence of the sign
LIU Miao-Miao +3 more
doaj
On the Feynman–Kac semigroup for some Markov processes
For a (non-symmetric) strong Markov process X, consider the Feynman–Kac semigroup \[{T_{t}^{A}}f(x):={\mathbb{E}}^{x}\big[{e}^{A_{t}}f(X_{t})\big],\hspace{1em}x\in {\mathbb{R}}^{n},\hspace{2.5pt}t>0,\] where A is a continuous additive functional of X ...
Victoria Knopova
doaj +1 more source
ABSTRACT Background An internal tandem duplication in the gene encoding Fms‐like tyrosine kinase 3 (FLT3‐ITD) is associated with high relapse risk and poor prognosis in acute myeloid leukemia (AML) and plays a crucial role in treatment decisions. Measurable residual disease (MRD) analysis of FLT3‐ITD during and after treatment has shown prognostic ...
Sofie Johansson Alm +11 more
wiley +1 more source
Regularized spectral methods for clustering signed networks
International audienceWe study the problem of k-way clustering in signed graphs. Considerable attention in recent years has been devoted to analyzing and modeling signed graphs, where the affinity measure betweennodes takes either positive or negative ...
Sulem, Deborah +3 more
core +1 more source
Signed networks provide information to study the structure and composition of relationships (positive and negative) among individuals in a complex system. Individuals, through different criteria, form groups or organizations called communities. Community
José Brito-Montes +2 more
doaj +2 more sources

