Related papers: Elastic Graphs
We study the problem of learning graph dynamics of deformable objects that generalizes to unknown physical properties. Our key insight is to leverage a latent representation of elastic physical properties of cloth-like deformable objects…
We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…
In this work we show that there is a direct relationship between a graph's topology and the free energy of a spin system on the graph. We develop a method of separating topological and enthalpic contributions to the free energy, and find…
Disordered networks of fragile elastic elements have been proposed as a model for inner porous regions of large bones [Gunaratne et.al., cond-mat/0009221]. In numerical studies, weakening of such networks is seen to be accompanied by…
A graph is $k$-planar if it can be drawn in the plane so that each edge is crossed at most $k$ times. Typically, the class of 1-planar graphs is among the most investigated graph families within the so-called "beyond planar graphs". A…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
The mechanical response of naturally abundant amorphous solids such as gels, jammed grains, and biological tissues are not described by the conventional paradigm of broken symmetry that defines crystalline elasticity. In contrast, the…
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the…
While many existing graph neural networks (GNNs) have been proven to perform $\ell_2$-based graph smoothing that enforces smoothness globally, in this work we aim to further enhance the local smoothness adaptivity of GNNs via $\ell_1$-based…
Neural networks for structured data like graphs have been studied extensively in recent years. To date, the bulk of research activity has focused mainly on static graphs. However, most real-world networks are dynamic since their topology…
A temporal graph is a data structure, consisting of nodes and edges in which the edges are associated with time labels. To analyze the temporal graph, the first step is to find a proper graph dataset/benchmark. While many temporal graph…
A temporal graph can be represented by a graph with an edge labelling, such that an edge is present in the network if and only if the edge is assigned the corresponding time label. A journey is a labelled path in a temporal graph such that…
A periodic graph in dimension $d$ is a directed graph with a free action of $\Z^d$ with only finitely many orbits. It can conveniently be represented in terms of an associated finite graph with weights in $\Z^d$, corresponding to a…
Flexible mechanical metamaterials possess repeating structural motifs that imbue them with novel, exciting properties including programmability, anomalous elastic moduli and nonlinear and robust response. We address such structures via…
We generalize the enhanced power graph by replacing elements with classes under automorphisms. We show that the connectivity and diameter of this graph is similar to that of the enhanced power graph. We consider the universal vertices of…
The power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We introduce some way for find the automorphism groups of some graphs. As an…
We consider a periodic lattice structure in $d=2$ or $3$ dimensions with unit cell comprising $Z$ thin elastic members emanating from a similarly situated central node. A general theoretical approach provides an algebraic formula for the…
The coupling of scale-free networks with mobile unstructured networks is certainly unusual. In mobile networks, connections active at a given instant are constrained by the geographical distribution of mobile nodes, and by the limited…
Athermal models of disordered fibrous networks are highly useful for studying the mechanics of elastic networks composed of stiff biopolymers. The underlying network architecture is a key aspect that can affect the elastic properties of…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…