Related papers: Elastic Graphs
Graphs are widespread data structures used to model a wide variety of problems. The sheer amount of data to be processed has prompted the creation of a myriad of systems that help us cope with massive scale graphs. The pressure to deliver…
Particular aspects of problems ranging from dielectric breakdown to metal insu- lator transition can be studied using electrical o elastic networks. We present an expression for the mean breakdown strength of such networks.First, we intro-…
We connect several notions relating the structural and dynamical properties of a graph. Among them are the topological entropy coming from the vertex shift, which is related to the spectral radius of the graph's adjacency matrix, the…
Dynamic networks reflect temporal changes occurring to the graph's structure and are used to model a wide variety of problems in many application fields. We investigate the design space of dynamic graph visualization along two major…
A network picture has been applied to various physical and biological systems to understand their governing mechanisms intuitively. Utilizing discretization schemes, both electrical and optical materials can also be interpreted as abstract…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
Softer means stickier for solid adhesives, because material compliance facilitates close contact between non-conformal surfaces. Recent discoveries have revealed that soft materials can exhibit a rich array of new physics arising from…
Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There is, however, a subtle difference between networks where weights are continuos…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
Many different classification tasks need to manage structured data, which are usually modeled as graphs. Moreover, these graphs can be dynamic, meaning that the vertices/edges of each graph may change during time. Our goal is to jointly…
A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…
Elasticity ellipses or central ellipses have been long used in graphic statics to capture the elastic behaviour of structural elements. The paper gives a generalisation the concept both in dimensions and in the possibility of degenerate…
Grasping, in both biological and engineered mechanisms, can be highly sensitive to the gripper and object morphology, as well as perception, and motion planning. Here we circumvent the need for feedback or precise planning by using an array…
A monotone drawing of a planar graph $G$ is a planar straight-line drawing of $G$ where a monotone path exists between every pair of vertices of $G$ in some direction. Recently monotone drawings of planar graphs have been proposed as a new…
This note provides a variational description of the mechanical effects of flexural stiffening of a 2D plate glued to an elastic-brittle or an elastic-plastic reinforcement. The reinforcement is assumed to be linear elastic outside possible…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…