Search arXivSearch

arXiv · 2411.00806

Approximating Diffusion on Finite Multi-Topology Systems Using Ultrametrics

Abstract

Motivated by multi-topology building and city model data, first a lossless representation of multiple $T_0$-topologies on a given finite set by a vertex-edge-weighted graph is given, and the subdominant ultrametric of the associated weighted graph distance matrix is proposed as an index structure for these data. This is applied in a heuristic parallel topological sort algorithm for edge-weighted directed acyclic graphs. Such structured data are of interest in simulation of processes like heat flows on building or city models on distributed processors. With this in view, the bulk of this article calculates the spectra of certain unbounded self-adjoint $p$-adic Laplacian operators on the $L^2$-spaces of a compact open subdomain of the $p$-adic number field associated with a finite graph $G$ with respect to the restricted Haar measure. as well as to a Radon measure coming from an ultrametric on the vertices of $G$ with the help of $p$-adic polynomial interpolation. In the end, error bounds are given for the solutions of the corresponding heat equations by finite approximations of such operators.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patrick Erik Bradley, Angel Alfredo Moran Ledezma. 2024-10-21. Approximating Diffusion on Finite Multi-Topology Systems Using Ultrametrics. https://arxiv.org/abs/2411.00806

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM

The parameterised complexity of generalised temporal domination on temporal graphs with modular structure

Inspired by the static problem $(α,β)$-Dominating Set, we propose a general temporal domination problem, called $(α,β)$-Temporal Dominating Set ($(α,β)$-TDS). We show that this problem encompasses Temporal Dominating Set, and additionally provides first temporal extensions of problems such as $k$-Dominating Set and $α$-Dominating Set. In this paper, we study the parameterised complexity of $(α,β)$-TDS with respect to temporal neighbourhood diversity (TND), temporal modular-width (TMW), and temporal cliquewidth (TCW). We obtain fixed parameter tractability results for all values of $α$ and $β$ with respect to TND; W[1]-hardness with respect to TMW and TCW whenever $β$ is in the problem input, or whenever $α\in (0,1)$ and $β$ is a fixed constant; and para-NP-hardness with respect to TCW when $α= 0$ and $β= 1$, or $α= 1$ and $β= 0$.

cs.DM