Results 41 to 50 of about 1,561,879 (232)
Generalized dimensions of images of measures under Gaussian processes [PDF]
, 2014 26 pagesWe show that for certain Gaussian random processes and fields X:RN→Rd, Dq(μx) = min {d, 1/α Dq (μ)} a.s., for an index α which depends on Hölder properties and strong local nondeterminism of X, where q>1, where Dq denotes generalized q-dimension ...
Falconer, Kenneth, Xiao, Yimin
core +1 more source
Sharp Bounds of Local Fractional Metric Dimensions of Connected Networks
IEEE Access, 2020 Metric dimension is a distance based parameter which is used to determine the locations of machines (or robots) with respect to minimum consumption of time, shortest distance among the destinations and lesser number of the utilized nodes as places of the
Muhammad Javaid +3 more
doaj +1 more source
Dimension and measure for generic continuous images [PDF]
, 2013 This work is supported by EPSRC Doctoral Training GrantsWe consider the Banach space consisting of continuous functions from an arbitrary uncountable compact metric space, X, into R-n.
James T. Hyde +9 more
core +1 more source
Vortex counting and the quantum Hall effect
Journal of High Energy Physics, 2022 We provide evidence for conjectural dualities between nonrelativistic Chern-Simons-matter theories and theories of (fractional, nonAbelian) quantum Hall fluids in 2 + 1 dimensions.
Edward Walton
doaj +1 more source
Upper Bound Sequences of Rotationally Symmetric Triangular Prism Constructed as Halin Graph Using Local Fractional Metric Dimension [PDF]
, 2021 In this paper, we consider rotationally symmetric traingular planar network with possible planar symmetries. We find local fractional metric dimension of planar symmetries.
Farooq, Mamoona +3 more
core +1 more source
Study of modified prism networks via fractional metric dimension
AIMS Mathematics, 2023 <abstract><p>For a connected network $ \Gamma $, the distance between any two vertices is the length of the shortest path between them. A vertex $ c $ in a connected network is said to resolve an edge $ e $ if the distances of $ c $ from its endpoints are unequal.
Ahmed Alamer +2 more
openaire +2 more sources
Local fractional metric dimension of rotationally symmetric planar graphs arisen from planar chorded cycles [PDF]
, 2023 In this paper, a new family of rotationally symmetric planar graphs is described based on an edge coalescence of planar chorded cycles. Their local fractional metric dimension is established for those ones arisen from chorded cycles of order up to six ...
Falcón Ganfornina, Raúl Manuel +2 more
core +1 more source
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
On fractional metric dimension of comb product graphs
Statistics, Optimization & Information Computing, 2018 A vertex $z$ in a connected graph $G$ \textit{resolves} two vertices $u$ and $v$ in $G$ if $d_G(u,z)\neq d_G(v,z)$. \ A set of vertices $R_G\{u,v\}$ is a set of all resolving vertices of $u$ and $v$ in $G$. \ For every two distinct vertices $u$ and $v$ in $G$, a \textit{resolving function} $f$ of $G$ is a real function $f:V(G)\rightarrow[0,1]$ such ...
Suhadi Wido Saputro +3 more
openaire +2 more sources