Related papers: Entropy waves, the zig-zag graph product, and new …
We prove well-posedness for very general linear wave- and diffusion equations on compact or non-compact metric graphs allowing various different conditions in the vertices. More precisely, using the theory of strongly continuous operator…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
A graph $\Gamma$ is said to be stable if $\mathrm{Aut}(\Gamma\times K_2)\cong\mathrm{Aut}(\Gamma)\times \mathbb{Z}_{2}$ and unstable otherwise. If an unstable graph is connected, non-bipartite and any two of its distinct vertices have…
The entropic force exerted by the Brownian fluctuations of a grafted semiflexible polymer upon a rigid smooth wall are calculated both analytically and by Monte Carlo simulations. Such forces are thought to play an important role for…
We consider skew-products with concave interval fiber maps over a certain subshift obtained as the projection of orbits staying in a given region. It generates a new type of (essentially) coded shift. The fiber maps have expanding and…
In this paper, we use graph theory to solve wave scattering problems in the discrete dipole approximation. As a key result of this work, in the presence of active scatterers, we present a systematic method to find arbitrary large-order zero…
We study how the spectral gap and diameter of Cayley graphs depend strongly on the choice of generating set. We answer a question of Pyber and Szab\'o (2013) by exhibiting a sequence of finite groups $G_n$ with $|G_n| \to \infty$ admitting…
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
This work is about self-similar sequences of growing connected graphs. We explain how to construct such sequences and why they are important. We show for instance that all the connected graphs in a self-similar sequence have not only the…
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
Wasserstein gradient flows on probability measures have found a host of applications in various optimization problems. They typically arise as the continuum limit of exchangeable particle systems evolving by some mean-field interaction…
Graph embedding methods transform high-dimensional and complex graph contents into low-dimensional representations. They are useful for a wide range of graph analysis tasks including link prediction, node classification, recommendation and…
We compute the entanglement entropy in a composite system separated by a finitely ramified boundary with the structure of a self-similar lattice graph. We derive the entropy as a function of the decimation factor which determines the…
The rapid growth of graph data creates significant scalability challenges as most graph algorithms scale quadratically with size. To mitigate these issues, Graph Condensation (GC) methods have been proposed to learn a small graph from a…
The unitary Cayley graph of $\mathbb Z/n\mathbb Z$, denoted $G_{\mathbb Z/n\mathbb Z}$, is the graph with vertices $0,1,\ldots,$ $n-1$ in which two vertices are adjacent if and only if their difference is relatively prime to $n$. These…
$S$-gap shifts are a well-studied class of shift spaces, which has led to several proposed generalizations. This paper introduces a new class of shift spaces called $\mathcal{S}$-graph shifts whose essential structure is encoded in a novel…
In connection with the Entropy Conjecture it is known that the topological entropy of a continuous graph map is bounded from below by the spectral radius of the induced map on the first homology group. We show that in the case of a…
We consider the existence of the topological entropy of shift spaces on a finitely generated semigroup whose Cayley graph is a tree. The considered semigroups include free groups. On the other hand, the notion of stem entropy is introduced.…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…