Related papers: Elastic Graphs
Let $G$ be a finite group. Define a graph on the set $G^{\#} = G \setminus \{ 1 \}$ by declaring distinct elements $x,y\in G^{\#}$ to be adjacent if and only if $\langle x,y\rangle$ is cyclic. Denote this graph by $\Delta(G)$. The graph…
We minimize a linear combination of the Willmore and the length functional among networks in $\mathbb{R}^d$ belonging to a given class determined by the number of curves, the order of the junctions and the angles between curves at the…
We study flat bands of periodic graphs in a Euclidean space. These are infinitely degenerate eigenvalues of the corresponding adjacency matrix, with eigenvectors of compact support. We provide some optimal recipes to generate desired bands,…
The momentum spectrum of a periodic network (quantum graph) has a band-gap structure. We investigate the relative density of the bands or, equivalently, the probability that a randomly chosen momentum belongs to the spectrum of the periodic…
Flexible network design deals with building a network that guarantees some connectivity requirements between its vertices, even when some of its elements (like vertices or edges) fail. In particular, the set of edges (resp. vertices) of a…
Small oscillations of an elastic system of point masses (particles) with a nonlocal interaction are considered. We study the asymptotic behavior of the system, when number of particles tends to infinity, and the distances between them and…
We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good…
A graph is 1-planar if it has a drawing where each edge is crossed at most once. A drawing is RAC (Right Angle Crossing) if the edges cross only at right angles. The relationships between 1-planar graphs and RAC drawings have been partially…
The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back…
The energy of a graph is defined as the sum the absolute values of the eigenvalues of its adjacency matrix. A threshold graph G on n vertices is coded by a binary sequence of length n. In this paper we answer a question posed by Jacobs et…
Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional…
The spread of a graph is the difference between the largest and most negative eigenvalue of its adjacency matrix. We show that for sufficiently large $n$, the $n$-vertex outerplanar graph with maximum spread is a vertex joined to a linear…
The edge-degeneracy model is an exponential random graph model that uses the graph degeneracy, a measure of the graph's connection density, and number of edges in a graph as its sufficient statistics. We show this model is relatively…
Elastic strips provide a canonical system for studying the mechanisms governing elastic shape transitions. Buckling, linear snap-through, and nonlinear snap-through have been observed in boundary-actuated strips and linked to the type of…
Dynamic graphs with ordered sequences of events between nodes are prevalent in real-world industrial applications such as e-commerce and social platforms. However, representation learning for dynamic graphs has posed great computational…
Proper graph coloring assigns different colors to adjacent vertices of the graph. Usually, the number of colors is fixed or as small as possible. Consider applications (e.g. variants of scheduling) where colors represent limited resources…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
Many popular network models rely on the assumption of (vertex) exchangeability, in which the distribution of the graph is invariant to relabelings of the vertices. However, the Aldous-Hoover theorem guarantees that these graphs are dense or…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…
The connectivity structure of graphs is typically related to the attributes of the nodes. In social networks for example, the probability of a friendship between two people depends on their attributes, such as their age, address, and…