quadratic approximations
Recently Published Documents


TOTAL DOCUMENTS

62
(FIVE YEARS 0)

H-INDEX

15
(FIVE YEARS 0)

2018 ◽  
Vol 7 (4) ◽  
pp. 491-514 ◽  
Author(s):  
Giorgia Minello ◽  
Luca Rossi ◽  
Andrea Torsello

Abstract The von Neumann entropy of a graph is a spectral complexity measure that has recently found applications in complex networks analysis and pattern recognition. Two variants of the von Neumann entropy exist based on the graph Laplacian and normalized graph Laplacian, respectively. Due to its computational complexity, previous works have proposed to approximate the von Neumann entropy, effectively reducing it to the computation of simple node degree statistics. Unfortunately, a number of issues surrounding the von Neumann entropy remain unsolved to date, including the interpretation of this spectral measure in terms of structural patterns, understanding the relation between its two variants and evaluating the quality of the corresponding approximations. In this article, we aim to answer these questions by first analysing and comparing the quadratic approximations of the two variants and then performing an extensive set of experiments on both synthetic and real-world graphs. We find that (1) the two entropies lead to the emergence of similar structures, but with some significant differences; (2) the correlation between them ranges from weakly positive to strongly negative, depending on the topology of the underlying graph; (3) the quadratic approximations fail to capture the presence of non-trivial structural patterns that seem to influence the value of the exact entropies; and (4) the quality of the approximations, as well as which variant of the von Neumann entropy is better approximated, depends on the topology of the underlying graph.


2017 ◽  
Vol 19 (4) ◽  
pp. 493-506 ◽  
Author(s):  
Filippo Pecci ◽  
Edo Abraham ◽  
Ivan Stoianov

This paper presents a novel analysis of the accuracy of quadratic approximations for the Hazen–Williams (HW) head loss formula, which enables the control of constraint violations in optimisation problems for water supply networks. The two smooth polynomial approximations considered here minimise the absolute and relative errors, respectively, from the original non-smooth HW head loss function over a range of flows. Since quadratic approximations are used to formulate head loss constraints for different optimisation problems, we are interested in quantifying and controlling their absolute errors, which affect the degree of constraint violations of feasible candidate solutions. We derive new exact analytical formulae for the absolute errors as a function of the approximation domain, pipe roughness and relative error tolerance. We investigate the efficacy of the proposed quadratic approximations in mathematical optimisation problems for advanced pressure control in an operational water supply network. We propose a strategy on how to choose the approximation domain for each pipe such that the optimisation results are sufficiently close to the exact hydraulically feasible solution space. By using simulations with multiple parameters, the approximation errors are shown to be consistent with our analytical predictions.


Sign in / Sign up

Export Citation Format

Share Document