Related papers: On an inverse problem for tree-like networks of el…
Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or…
Decompositions of networks are useful not only for structural exploration. They also have implications and use in analysis and computational solution of processes (such as the Ising model, percolation, SIR model) running on a given network.…
The problem of characterizing the structure of an elastic network constrained to lie on a frozen curved surface appears in many areas of science and has been addressed by many different approaches, most notably, extending linear elasticity…
A communication network can be modeled as a directed connected graph with edge weights that characterize performance metrics such as loss and delay. Network tomography aims to infer these edge weights from their pathwise versions measured…
Wavelet trees are widely used in the representation of sequences, permutations, text collections, binary relations, discrete points, and other succinct data structures. We show, however, that this still falls short of exploiting all of the…
We consider the inverse problem of recovering both an unknown electric current and the surrounding electromagnetic parameters of a medium from boundary measurements. This inverse problem arises in brain imaging. We show that under generic…
This paper investigates the inverse random source problem for elastic waves in three dimensions, where the source is assumed to be driven by an additive white noise. A novel computational method is proposed for reconstructing the variance…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
We consider drawings of trees in which all edges incident to leaves can be extended to infinite rays without crossing, partitioning the plane into infinite convex polygons. Among all such drawings we seek the one maximizing the angular…
The main purpose of this work is to study an inverse coefficient problem for the telegrapher's equations on a tree-shaped network. To analyze the stability for this inverse problem, Carleman estimate is established first. Based upon this…
We propose a new method that uses deep learning techniques to solve the inverse problems. The inverse problem is cast in the form of learning an end-to-end mapping from observed data to the ground-truth. Inspired by the splitting strategy…
In this article we present a method to reconstruct the interconnectedness of dynamically related stochastic processes, where the interactions are bi-directional and the underlying topology is a tree. Our approach is based on multivariate…
This paper deals with the Sturm-Liouville operators with distribution potentials of the space $W_2^{-1}$ on a metric tree. We study an inverse spectral problem that consists in the recovery of the potentials from the characteristic…
We propose an effective geometrical approach to recover the normal form of a given Elasticity tensor, once we know its symmetry class. In other words, we produce a rotation which brings an Elasticity tensor onto its normal form, given its…
We address here spanning tree problems on a graph with binary edge weights. For a general weighted graph the minimum spanning tree is solved in super-linear running time, even when the edges of the graph are pre-sorted. A related problem,…
The network reconfiguration problem seeks to find a rooted tree $T$ such that the energy of the (unique) feasible electrical flow over $T$ is minimized. The tree requirement on the support of the flow is motivated by operational constraints…
Motivated from the study of eccentricity, center, and sum of eccentricities in graphs and trees, we introduce several new distance-based global and local functions based on the smallest distance from a vertex to some leaf (called the…
The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we improve known parameterized algorithms and…
Dix formulated the inverse problem of recovering an elastic body from the measurements of wave fronts of point sources. We geometrize this problem in the context of seismology, leading to the geometrical inverse problem of recovering a…
This article examines the inverse problem for a lossy quantum graph that is internally excited and sensed. In particular, we supply an algorithmic methodology for deducing the topology and geometric structure of the underlying metric graph.…