Related papers: Signed Chord Length Distribution. I
Line segmentation from handwritten text images is one of the challenging task due to diversity and unknown variations as undefined spaces, styles, orientations, stroke heights, overlapping, and alignments. Though abundant researches, there…
We give formulas, in terms of graph theoretical invariants, for the minimum distance and the generalized Hamming weights of the linear code generated by the rows of the incidence matrix of a signed graph over a finite field, and for those…
In this paper we discuss various connections between geometric discrepancy measures, such as discrepancy with respect to convex sets (and convex sets with smooth boundary in particular), and applications to numerical analysis and…
Discrete signatures are invariants computed from time series corresponding to the discretised version of the signature of paths. We study the algebraic varieties arising from their images, the discrete signature varieties. We introduce them…
We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution…
The level curvature distribution function is studied both analytically and numerically for the case of T-breaking perturbations over the orthogonal ensemble. The leading correction to the shape of the curvature distribution beyond the…
Graphene is an ideal platform to study many-body effects due to its semimetallic character and the possibility to dope it over a wide range. Here we study the width of graphene's occupied $\pi$-band as a function of doping using…
Measure structured deformations are introduced to present a unified theory of deformations of continua. The energy associated with a measure structured deformation is defined via relaxation departing either from energies associated with…
Two competing types of interactions often play an important part in shaping system behavior, such as activatory or inhibitory functions in biological systems. Hence, signed networks, where each connection can be either positive or negative,…
Causal discovery aims to recover graphs that represent causal relations among given variables from observations, and new methods are constantly being proposed. Increasingly, the community raises questions about how much progress is made,…
A signed graph has edge weights drawn from the set $\{+1,-1\}$, and is termed sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is called sign-unbalanced. A nut graph has a one…
Automatic chord recognition (ACR) extracts time-aligned chord labels from music audio recordings. Despite recent advances, ACR still struggles with oversegmentation, data scarcity, and imbalance, especially in recognizing complex chords…
In the past year, polarized deep inelastic scattering experiments at CERN and SLAC have obtained structure function measurements off proton, neutron and deuteron targets at a level of precision never before achieved. The measurements can be…
A continuum mechanical framework for the description of the geometry and kinematics of defects in material structure is proposed. The setting applies to a body manifold of any dimension which is devoid of a Riemannian or a parallelism…
The statistical precision of a chord method for estimating fractal dimension from a correlation integral is derived. The optimal chord length is determined, and a comparison is made to other estimators. These calculations use the…
Precise measurements of polarized electro-production and Drell-Yan in the deep inelastic limit will soon provide first information on the higher twist parton distributions $g_T(x)$ and $h_L(x)$. Sum rules for higher-twist structure…
In a linear chord diagram a short chord is one which joins adjacent vertices. We define a bubble to be a region in a linear chord diagram devoid of short chords. We derive a formal generating function counting bubbles by their size and find…
Assessing the accuracy of the output of causal discovery algorithms is crucial in developing and comparing novel methods. Common evaluation metrics such as the structural Hamming distance are useful for assessing individual links of causal…
This paper significantly strengthens directed low-diameter decompositions in several ways. We define and give the first results for separated low-diameter decompositions in directed graphs, tighten and generalize probabilistic guarantees,…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…