activity
20212025
most citedSpin resonance without a spin: A microwave analog

1 citations · 1 across the 7 of their papers we have counts for

collaborators

7 papers

cs.LG2025

On the expressivity of sparse maxout networks

Moritz Grillo, Tobias Hofmann

We study the expressivity of sparse maxout networks, where each neuron takes a fixed number of inputs from the previous layer and employs a, possibly multi-argument, maxout activat…

math.CO2025

The connectivity dimension of a graph

Kurt Klement Gottwald, Tobias Hofmann

This article investigates the connectivity dimension of a graph. We introduce this concept in analogy to the metric dimension of a graph, providing a graph parameter that measures…

physics.app-ph2024★ 1 cited

Spin resonance without a spin: A microwave analog

Tobias Hofmann, Finn Schmidt, Hans-Jürgen Stöckmann +1

An analog of nuclear magnetic resonance is realized in a microwave network with symplectic symmetry. The network consists of two identical subgraphs coupled by a pair of bonds with…

physics.class-ph2024

Realization of an NMR analog in a microwave network with symplectic symmetry

Finn Schmidt, Tobias Hofmann, H. -J. Stöckmann +1

In a previous paper, we realized a microwave network with symplectic symmetry simulating a spin 1/2 (Rehemanjiang et al. [Phys. Rev. Lett. 117, 064101 (2016)]), following a suggest…

physics.class-ph2024

Non-Weyl Behavior Induced by Superradiance: A Microwave Graph Study

Junjie Lu, Tobias Hofmann, Hans-Jürgen Stöckmann +1

We study experimentally the manifestation of non-Weyl graph behavior in open systems using microwave networks. For this a coupling variation to the network is necessary, which was…

math.CO2022

Properties of uniformly -connected graphs

Frank Göring, Tobias Hofmann

A graph on at least vertices is uniformly -connected if each pair of its vertices is connected by and not more than independent paths. We reinvestigate a recent…

math.NA2021

Fast ultrametric matrix-vector multiplication

Tobias Hofmann, Andy Oertel

We study the properties of ultrametric matrices aiming to design methods for fast ultrametric matrix-vector multiplication. We show how to encode such a matrix as a tree structure…