Related papers: Dynamic Complexity of Expansion
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…
This survey paper is aimed to describe a relatively new branch of symbolic dynamics which we call Arithmetic Dynamics. It deals with explicit arithmetic expansions of reals and vectors that have a "dynamical" sense. This means precisely…
Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood.…
Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix…
Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two variants of exact algorithms using semidefinite programming (SDP) to compute this constant…
A dynamic program, as introduced by Patnaik and Immerman (1994), maintains the result of a fixed query for an input database which is subject to tuple insertions and deletions. It can use an auxiliary database whose relations are updated…
We study the structure and dynamics of the infinite sequence of extensions of the Poincar{\'e} algebra whose method of construction was described in a previous paper [1]. We give explicitly the Maurer-Cartan (MC) 1-forms of the extended Lie…
In a recent paper [Phys. Rev. B 90, 115134 (2014)] we put forward a diagrammatic expansion for the self-energy which guarantees the positivity of the spectral function. In this work we extend the theory to the density response function. We…
We investigate the use of extended phase-space symplectic integration for simulating two different classes of electron dynamics. The first one, with one and a half degrees of freedom, comes from plasma physics and describes the classical…
Recent work of Bornemann has uncovered hitherto hidden integrable structures relating to the asymptotic expansion of quantities at the soft edge of Gaussian and Laguerre random matrix ensembles. These quantities are spacing distributions…
Expander graphs in general, and Ramanujan graphs in particular, have been of great interest in the last three decades with many applications in computer science, combinatorics and even pure mathematics. In these notes we describe various…
In this paper we present a general procedure that allows for the reduction or expansion of any network (considered as a weighted graph). This procedure maintains the spectrum of the network's adjacency matrix up to a set of eigenvalues…
Symanzik polynomials are defined on Feynman graphs and they are used in quantum field theory to compute Feynman amplitudes. They also appear in mathematics from different perspectives. For example, recent results show that they allow to…
In this paper we provide an extension for the method of Discrete Lagrangian Descriptors with the purpose of exploring the phase space of unbounded maps. The key idea is to construct a working definition, that builds on the original approach…
We establish an Expander Mixing Lemma for directed graphs in terms of the eigenvalues of an associated asymmetric transition probability matrix, extending the classical spectral inequality to the asymmetric setting. As an application, we…
Periodic orbit theory provides two important functions---the dynamical zeta function and the spectral determinant for the calculation of dynamical averages in a nonlinear system. Their cycle expansions converge rapidly when the system is…
While spectral clustering algorithms for undirected graphs are well established and have been successfully applied to unsupervised machine learning problems ranging from image segmentation and genome sequencing to signal processing and…
We study a variant of the dispersion process on the complete graph introduced in the recent work [17] under the mean-field framework. We adopt a kinetic perspective (as opposed to the probabilistic approach taken in [17] and many other…
A Dirac picture perturbation theory is developed for the time evolution operator in classical dynamics in the spirit of the Schwinger-Feynman-Dyson perturbation expansion and detailed rules are derived for computations. Complexification…