Related papers: Dynamic Complexity of Expansion
At the eight-year anniversary of Watts & Strogatz's work on the collective dynamics of small-world networks and seven years after Barabasi & Albert's discovery of scale-free networks, the area of dynamical processes on complex networks is…
This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…
In this paper we investigate the problem of learning evolving concepts over a combinatorial structure. Previous work by Emamjomeh-Zadeh et al. [2020] introduced dynamics into interactive learning as a way to model non-static user…
We study the network untangling problem introduced by Rozenshtein, Tatti, and Gionis [DMKD 2021], which is a variant of Vertex Cover on temporal graphs -- graphs whose edge set changes over discrete time steps. They introduce two problem…
Virtually all questions that one can ask about the behavioral and structural complexity of a stochastic process reduce to a linear algebraic framing of a time evolution governed by an appropriate hidden-Markov process generator. Each type…
Dynamical linked cluster expansions are linked cluster expansions with hopping parameter terms endowed with their own dynamics. This amounts to a generalization from 2-point to point-link-point interactions. We develop an associated graph…
We develop linear discretization of complex analysis, originally introduced by R. Isaacs, J. Ferrand, R. Duffin, and C. Mercat. We prove convergence of discrete period matrices and discrete Abelian integrals to their continuous…
This paper is devoted to the study of some connections between coadjoint orbits in infinite dimensional Lie algebras, isospectral deformations and linearization of dynamical systems. We explain how results from deformation theory,…
Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with…
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
Consider a finite inhomogeneous random graph running in continuous time, where each vertex has a mass, and the edge that links any pair of vertices appears with a rate equal to the product of their masses. The simultaneous…
Dynamical linked cluster expansions are linked cluster expansions with hopping parameter terms endowed with their own dynamics. They amount to a generalization of series expansions from 2-point to point-link-point interactions. We outline…
We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…
Coboundary and cosystolic expansion are notions of expansion that generalize the Cheeger constant or edge expansion of a graph to higher dimensions. The classical Cheeger inequality implies that for graphs edge expansion is equivalent to…
Recent research on deep graph learning has shifted from static to dynamic graphs, motivated by the evolving behaviors observed in complex real-world systems. However, the temporal extension in dynamic graphs poses significant data…
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…
This paper helps to clarify the status of cylindrical contact homology, a conjectured contact invariant introduced by Eliashberg, Givental, and Hofer in 2000. We explain how heuristic arguments fail to yield a well-defined homological…
Planar Embedding is a drawing of a graph on the plane such that the edges do not intersect each other except at the vertices. We know that testing the planarity of a graph and computing its embedding (if it exists), can efficiently be…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
In the present paper, dynamics of generalized charged particles are studied in the presence of external electromagnetic interactions. This particular extension of the free relativistic particle model lives in Non-Commutative…