Some implications of interval approach to dimension for network complexity

DOI10.1007/978-3-030-88817-6_13MaRDI QIDQ2093971zbMATH OpenOpenAlexFDO

Authors Věra Kůrková

Publication date 27 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-88817-6_13

zbMATH Keywords

concentration of measurecovering numbershigh-dimensional geometryquasiorthogonal dimensionsparsity of feedforward networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Complex network dimension and path counts
• Dimension measure for complex networks
• Measurement methods on the complexity of network
• scientific article; zbMATH DE number 5548796
• Information-based complexity of networks

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Complexity estimates based on integral transforms induced by computational units
• Concentration of Measure for the Analysis of Randomized Algorithms
• Dimension-independent rates of approximation by neural networks
• Feedforward neural network methodology
• scientific article; zbMATH DE number 109318 (Why is no real title available?)
• scientific article; zbMATH DE number 1149836 (Why is no real title available?)
• Lectures on discrete geometry
• Probability Inequalities for Sums of Bounded Random Variables
• Quasiorthogonal dimension of Euclidean spaces
• Weighted sums of certain dependent random variables

Cited in

(3)

• Minimal partition coverings and generalized dimensions of a complex network
• Non-monotonicity of the generalized dimensions of a complex network
• scientific article; zbMATH DE number 5548796 (Why is no real title available?)

This page was built for publication: Some implications of interval approach to dimension for network complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093971)