English
Related papers

Related papers: Optimal Behaviour in Extremal Bounds for $\sigma$-…

200 papers

Let $D=(V,A)$ be a digraphs without isolated vertices. A vertex-degree based invariant $I(D)$ related to a real function $\varphi$ of $D$ is defined as a summation over all arcs, $I(D) = \frac{1}{2}\sum_{uv\in A}{\varphi(d_u^+,d_v^-)}$,…

Combinatorics · Mathematics 2021-05-03 Hanyuan Deng , Jiaxiang Yang , Zikai Tang , Jing Yang , Meiling You

A $k$-regular graph of girth $g$ is called edge-girth-regular graph, shortly egr-graph, if each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called extremal for the triple $(k, g, \lambda)$ if has the…

Combinatorics · Mathematics 2024-01-30 Gabriela Araujo-Pardo , György Kiss , István Porupsánszki

Recently, Gutman defined a new vertex-degree-based graph invariant, named the Sombor index $SO$ of a graph $G$, and is defined by $$SO(G)=\sum_{uv\in E(G)}\sqrt{d_G(u)^2+d_G(v)^2},$$ where $d_G(v)$ is the degree of the vertex $v$ of $G$. In…

Combinatorics · Mathematics 2023-09-26 Batmend Horoldagva , Chunlei Xu

The Extremal Index is a parameter that measures the intensity of clustering of rare events and is usually equal to the reciprocal of the mean of the limiting cluster size distribution. We show how to build dynamically generated stochastic…

Dynamical Systems · Mathematics 2020-05-20 Miguel Abadi , Ana Cristina Moreira Freitas , Jorge Milhazes Freitas

The maximum (or minimum) generalized eigenvalue of symmetric positive semidefinite matrices that depend on optimization variables often appears as objective or constraint functions in structural topology optimization when we consider…

Optimization and Control · Mathematics 2024-05-09 Akatsuki Nishioka , Yoshihiro Kanno

We derive several upper bounds for the superfluid stiffness $D_s$ for Bose and Fermi systems in terms of expectation values of local operators using linear response theory and variational methods. These give insight into the non-trivial…

Superconductivity · Physics 2009-10-31 Arun Paramekanti , Nandini Trivedi , Mohit Randeria

In this paper we investigate the extremal relationship between two well-studied graph parameters: the order of the largest homogeneous set in a graph $G$ and the maximal number of distinct degrees appearing in an induced subgraph of $G$,…

Combinatorics · Mathematics 2022-12-01 Eoin Long , Laurentiu Ploscaru

We estimate the maximum ratio between the $\sigma_t$- and $\sigma$-irregularity for graphs and trees of order $n$, which are respectively bounded by $\Theta(n^{5/2})$ and $n-2$. This answers a question and a conjecture by Filipovski et al.…

Combinatorics · Mathematics 2026-04-29 Stijn Cambie , Jionghua Chang

We develop a unified nonparametric framework for sharp partial identification and inference on inequality indices when the data contain coarsened observations of the variable of interest. We characterize the extremal allocations for all…

Econometrics · Economics 2026-03-18 James Banks , Thomas Glinnan , Tatiana Komarova

Let $d_G(v)$ be the degree of the vertex $v$ in a graph $G$. The Sombor index of $G$ is defined as $SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}$, which is a new degree-based topological index introduced by Gutman. Let…

Combinatorics · Mathematics 2021-03-16 Ting Zhou , Zhen Lin , Lianying Miao

Both marginal and dependence features must be described when modelling the extremes of a stationary time series. There are standard approaches to marginal modelling, but long- and short-range dependence of extremes may both appear. In…

Methodology · Statistics 2016-03-17 Thomas Lugrin , Anthony C. Davison , Jonathan A. Tawn

A coordinate-free proof of the Maximum Principle is provided in the specific case of an optimal control problem with fixed time. Our treatment heavily relies on a special notion of variation of curves that consist of a concatenation of…

Differential Geometry · Mathematics 2007-05-23 B. Langerock

We introduce the concept of geometric extremal graphical models, which are defined through the gauge function of the limit set obtained from suitably scaled random vectors in light-tailed margins. For block graphs, we prove results relating…

Statistics Theory · Mathematics 2026-01-05 Ioannis Papastathopoulos , Jennifer Wadsworth

In this note, pointwise best-possible (lower and upper) bounds on the set of copulas with a given value of the Gini's gamma coefficient are established. It is shown that, unlike the best-possible bounds on the set of copulas with a given…

Statistics Theory · Mathematics 2025-01-14 Manuel Úbeda-Flores

Fix a subset $I\subseteq \mathbb R_{>0}$ such that $\gamma=\inf\{ \sum_{i}n_ib_i-1>0 \mid n_i\in \mathbb Z_{\geq 0}, b_i\in I \}>0$. We give a explicit upper bound $\ell(\gamma)\in O(1/\gamma^2)$ as $\gamma\to 0$, such that for any smooth…

Algebraic Geometry · Mathematics 2023-07-31 Bingyi Chen

One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…

Commutative Algebra · Mathematics 2017-11-13 Richard Gustavson , Omar León Sánchez

Let $G$ be a simple undirected graph with vertex set $V(G)=\{v_1, v_2, \ldots, v_n\}$ and edge set $E(G)$. The Sombor matrix $\mathcal{S}(G)$ of a graph $G$ is defined so that its $(i,j)$-entry is equal to $\sqrt{d_i^2+d_j^2}$ if the…

Combinatorics · Mathematics 2021-03-02 Zhen Lin

The extremal index $\theta$, a measure of the degree of local dependence in the extremes of a stationary process, plays an important role in extreme value analyses. We estimate $\theta$ semiparametrically, using the relationship between the…

Methodology · Statistics 2016-06-02 Paul J. Northrop

In this paper we obtain bounds on a very general class of distance-based topological indices of graphs, which includes the Wiener index, defined as the sum of the distances between all pairs of vertices of the graph, and most…

Combinatorics · Mathematics 2024-11-21 Peter Dankelmann

Let $G$ be a graph of order $n$, and let $A(G)$ and $D(G)$ be the adjacency matrix and the degree matrix of $G$ respectively. Define the convex linear combinations $A_\alpha (G)$ of $A (G)$ and $D (G) $ by $$A_\alpha (G)=\alpha…

Combinatorics · Mathematics 2022-04-04 Ming-Zhu Chen , A-Ming Liu , Xiao-Dong Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›