Related papers: Resistance values under transformations in regular…
We consider the Dirichlet Laplacian in a three-dimensional waveguide that is a small deformation of a periodically twisted tube. The deformation is given by a bending and an additional twisting of the tube, both parametrized by a coupling…
In graph signal processing, data samples are associated to vertices on a graph, while edge weights represent similarities between those samples. We propose a convex optimization problem to learn sparse well connected graphs from data. We…
Two-dimensional (2D) topological electronic insulators are known to give rise to gapless edge modes, which underlie low energy dynamics, including electrical and thermal transport. This has been thoroughly investigated in the context of…
Using the unique capabilities of the Variable Density Turbulence Tunnel at the Max Planck Institute for Dynamics and Self-Organization, G\"{o}ttingen, we report experimental result on classical grid turbulence that uncover fine, yet…
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured…
Redundancy needs more precise characterization as it is a major factor in the evolution and robustness of networks of multivariate interactions. We investigate the complexity of such interactions by inferring a connection transitivity that…
Contraction theory is a powerful tool for proving asymptotic properties of nonlinear dynamical systems including convergence to an attractor and entrainment to a periodic excitation. We consider three generalizations of contraction with…
Ideal graphene antidot lattices are predicted to show promising band gap behavior (i.e., $E_G\simeq 500$ meV) under carefully specified conditions. However, for the structures studied so far this behavior is critically dependent on…
We consider the problem of minimizing the number of triangles in a graph of given order and size and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that…
We consider the linear damped wave equation on finite metric graphs and analyse its spectral properties with an emphasis on the asymptotic behaviour of eigenvalues. In the case of equilateral graphs and standard coupling conditions we show…
We study the typical structure and the number of triangle-free graphs with $n$ vertices and $m$ edges where $m$ is large enough so that a typical triangle-free graph has a cut containing nearly all of its edges, but may not be bipartite.…
This paper examines stability properties of distance-based formation control when the underlying topology consists of a rigid graph and a flex node addition. It is shown that the desired equilibrium set is locally asymptotically stable but…
Obtaining an efficient bound for the triangle removal lemma is one of the most outstanding open problems of extremal combinatorics. Perhaps the main bottleneck for achieving this goal is that triangle-free graphs can be highly unstructured.…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
We analyze the exact formulae for the resistance between two arbitrary notes in a rectangular network of resistors under free, periodic and cylindrical boundary conditions obtained by Wu [J. Phys. A 37, 6653 (2004)]. Based on such…
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than what might naively be expected. One application is a simple…
We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for…
A graph can be regarded as an electrical network in which each edge is a resistor. This point of view relates combinatorial quantities, such as the number of spanning trees, to electrical ones such as effective resistance. The second and…
Consider a rooted infinite Galton-Watson tree with mean offspring number $m>1$, and a collection of i.i.d. positive random variables $\xi_e$ indexed by all the edges in the tree. We assign the resistance $m^d \xi_e$ to each edge $e$ at…
A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…