519 research outputs found
A proper fixed functional for four-dimensional Quantum Einstein Gravity
Abstract: Realizing a quantum theory for gravity based on Asymptotic Safety hinges on the existence of a non-Gaussian fixed point of the theory’s renormalization group flow. In this work, we use the functional renormalization group equation for the effective average action to study the fixed point underlying Quantum Einstein Gravity at the functional level including an infinite number of scale-dependent coupling constants. We formulate a list of guiding principles underlying the construction of a partial differential equation encoding the scale-dependence of f(R)-gravity. We show that this equation admits a unique, globally well-defined fixed functional describing the non-Gaussian fixed point at the level of functions of the scalar curvature. This solution is constructed explicitly via a numerical double-shooting method. In the UV, this solution is in good agreement with results from polynomial expansions including a finite number of coupling constants, while it scales proportional to R2, dressed up with non-analytic terms, in the IR. We demonstrate that its structure is mainly governed by the conformal sector of the flow equation. The relation of our work to previous, partial constructions of similar scaling solutions is discussed
Dynamic Computation of Network Statistics via Updating Schema
In this paper we derive an updating scheme for calculating some important
network statistics such as degree, clustering coefficient, etc., aiming at
reduce the amount of computation needed to track the evolving behavior of large
networks; and more importantly, to provide efficient methods for potential use
of modeling the evolution of networks. Using the updating scheme, the network
statistics can be computed and updated easily and much faster than
re-calculating each time for large evolving networks. The update formula can
also be used to determine which edge/node will lead to the extremal change of
network statistics, providing a way of predicting or designing evolution rule
of networks.Comment: 17 pages, 6 figure
Fast linear algebra is stable
In an earlier paper, we showed that a large class of fast recursive matrix
multiplication algorithms is stable in a normwise sense, and that in fact if
multiplication of -by- matrices can be done by any algorithm in
operations for any , then it can be done
stably in operations for any . Here we extend
this result to show that essentially all standard linear algebra operations,
including LU decomposition, QR decomposition, linear equation solving, matrix
inversion, solving least squares problems, (generalized) eigenvalue problems
and the singular value decomposition can also be done stably (in a normwise
sense) in operations.Comment: 26 pages; final version; to appear in Numerische Mathemati
Approximating Spectral Impact of Structural Perturbations in Large Networks
Determining the effect of structural perturbations on the eigenvalue spectra
of networks is an important problem because the spectra characterize not only
their topological structures, but also their dynamical behavior, such as
synchronization and cascading processes on networks. Here we develop a theory
for estimating the change of the largest eigenvalue of the adjacency matrix or
the extreme eigenvalues of the graph Laplacian when small but arbitrary set of
links are added or removed from the network. We demonstrate the effectiveness
of our approximation schemes using both real and artificial networks, showing
in particular that we can accurately obtain the spectral ranking of small
subgraphs. We also propose a local iterative scheme which computes the relative
ranking of a subgraph using only the connectivity information of its neighbors
within a few links. Our results may not only contribute to our theoretical
understanding of dynamical processes on networks, but also lead to practical
applications in ranking subgraphs of real complex networks.Comment: 9 pages, 3 figures, 2 table
Eigenvalue Estimation of Differential Operators
We demonstrate how linear differential operators could be emulated by a
quantum processor, should one ever be built, using the Abrams-Lloyd algorithm.
Given a linear differential operator of order 2S, acting on functions
psi(x_1,x_2,...,x_D) with D arguments, the computational cost required to
estimate a low order eigenvalue to accuracy Theta(1/N^2) is
Theta((2(S+1)(1+1/nu)+D)log N) qubits and O(N^{2(S+1)(1+1/nu)} (D log N)^c)
gate operations, where N is the number of points to which each argument is
discretized, nu and c are implementation dependent constants of O(1). Optimal
classical methods require Theta(N^D) bits and Omega(N^D) gate operations to
perform the same eigenvalue estimation. The Abrams-Lloyd algorithm thereby
leads to exponential reduction in memory and polynomial reduction in gate
operations, provided the domain has sufficiently large dimension D >
2(S+1)(1+1/nu). In the case of Schrodinger's equation, ground state energy
estimation of two or more particles can in principle be performed with fewer
quantum mechanical gates than classical gates.Comment: significant content revisions: more algorithm details and brief
analysis of convergenc
Mixed precision bisection
We discuss the implementation of the bisection algorithm for the computation of the eigenvalues of
symmetric tridiagonal matrices in a context of mixed precision arithmetic. This approach is motivated by the
emergence of processors which carry out floating-point operations much faster in single precision than they do in double precision. Perturbation theory results are used to decide when to switch from single to double precision. Numerical examples are presente
- …