Related papers: Elastic Graphs
The behaviour of elastic structures undergoing large deformations is the result of the competition between confining conditions, self-avoidance and elasticity. This combination of multiple phenomena creates a geometrical frustration that…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
A hypergraph as a generalization of graphs records higher-order interactions among nodes, yields a more flexible network model, and allows non-linear features for a group of nodes. In this article, we propose a hypergraph echo state network…
The qualitative behavior of a dynamical system can be encoded in a graph. Each node of the graph is an equivalence class of chain-recurrent points and there is an edge from node $A$ to node $B$ if, using arbitrary small perturbations, a…
Edge lengths of a graph are called flexible if there exist infinitely many non-congruent realizations of the graph in the plane satisfying these edge lengths. It has been shown recently that a graph has flexible edge lengths if and only if…
We investigate the possibility of a striped inhomoegenous phase occurring as an electronic system with an order parameter linearly coupled to the elastic degrees of freedom is tuned through the electronic phase transition. We find that in…
The (proper) power graph of a group is a graph whose vertex set is the set of all (nontrivial) elements of the group and two distinct vertices are adjacent if one is a power of the other. Various kinds of planarity of (proper) power graphs…
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvious counterpart in time-varying ones. In this paper, we…
A \emph{temporal graph} is, informally speaking, a graph that changes with time. When time is discrete and only the relationships between the participating entities may change and not the entities themselves, a temporal graph may be viewed…
We study vulnerability of a uniformly distributed random graph to an attack by an adversary who aims for a global change of the distribution while being able to make only a local change in the graph. We call a graph property $A$…
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…
We study stationary points of the bending energy of curves $\gamma\colon[a,b]\to\mathbb{R}^n$ subject to constraints on the arc-length and the curve's holonomy while simultaneously allowing for a variable bending stiffness along the…
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. This note is about the energy of regular graphs. It is shown that graphs that are close to regular can be made regular with a negligible…
Let $G$ be a group. The \emph{power graph} of $G$ is a graph with the vertex set $G$, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence…
The energy of an elastic manifold in a random landscape at T=0 is shown numerically to obey a probability distribution that depends on size of the box it is put into. If the extent of the spatial fluctuations of the manifold is much less…
The behavior of an elastic curve bound to a surface will reflect the geometry of its environment. This may occur in an obvious way: the curve may deform freely along directions tangent to the surface, but not along the surface normal.…
In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars, joined together at joints around which the bars may rotate. In this paper, we will…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
A graph G is said to be orderenergetic, if its energy equal to its order and it is said to be hypoenergetic if its energy less than its order. Two non-isomorphic graphs of same order are said to be equienergetic if their energies are equal.…
Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into…