Related papers: Dynamic Complexity of Expansion
Given n data points in R^d, an appropriate edge-weighted graph connecting the data points finds application in solving clustering, classification, and regresssion problems. The graph proposed by Daitch, Kelner and Spielman (ICML~2009) can…
We study the spectral gap behavior of an operator obtained by summing a random permutation $M$ and a deterministic bistochastic matrix $Q$. We are interested in the asymptotic in terms of dimension. In the case where $(M,Q)$ are…
We relate structurally dynamic cellular networks, a class of models we developed in fundamental space-time physics, to SDCA, introduced some time ago by Ilachinski and Halpern. We emphasize the crucial property of a non-linear interaction…
Recently there has been a renewed interest in asymptotic Euler-MacLaurin formulas, partly due to applications to spectral theory of differential operators. Using elementary means, we recover such formulas for compactly supported smooth…
We present significant evidence that the powerful property of Yangian invariance extends to a new large class of conformally invariant Feynman integrals. Our results apply to planar Feynman diagrams in any spacetime dimension dual to an…
The field of dynamical systems is being transformed by the mathematical tools and algorithms emerging from modern computing and data science. First-principles derivations and asymptotic reductions are giving way to data-driven approaches…
The well-known Hamiltonian sufficient conditions, proposed by Dirac, Faudree et al., P\'osa, Bondy, Chv\'atal are based on pure degree manipulations without any additional conditions. In this paper, we present two new types of pure degree…
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irreducible-expansion complexity which is more suitable for…
Accurately describing many-body effects in multi-orbital systems remains a major challenge in theoretical condensed matter physics. At present, there is a significant methodological gap between the numerical tools used in ab initio…
The following is a short report about recent work on discrete physics/mathematics on the Planckscale and the use of the concept of ''random graphs'' in this business, appearing in the group21-proceedings (Gosslar 1996)
We develop a sound and complete graphical theory for discrete linear time-invariant dynamical systems. The graphical syntax, as in previous work, is closely related to the classical notion of signal flow diagrams, differently from previous…
In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…
Nonlinear dynamics play an important role in the analysis of signals. A popular, readily interpretable nonlinear measure is Permutation Entropy. It has recently been extended for the analysis of graph signals, thus providing a framework for…
We introduce the asymptotic spectrum of graphs and apply the theory of asymptotic spectra of Strassen (J. Reine Angew. Math. 1988) to obtain a new dual characterisation of the Shannon capacity of graphs. Elements in the asymptotic spectrum…
We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of…
We introduce a new model of random $d$-dimensional simplicial complexes, for $d\geq 2$, whose $(d-1)$-cells have bounded degrees. We show that with high probability, complexes sampled according to this model are coboundary expanders. The…
We generalize classical results in spectral graph theory and linear algebra more broadly, from the case where the underlying matrix is Hermitian to the case where it is non-Hermitian. New admissibility conditions are introduced to replace…
An extension of the Dirac procedure for the quantization of constrained systems is necessary to address certain issues that are left open in Dirac's original proposal. These issues play an important role especially in the context of…
We introduce a family of discrete dynamical systems which includes, and generalizes, the mutation dynamics of rank two cluster algebras. These systems exhibit behavior associated with integrability, namely preservation of a symplectic form,…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…