Related papers: Blockage detection in networks: the area reconstru…

A problem of reconstruction of the topology and the respective edge resistance values of an unknown circular planar passive resistive network using limitedly available resistance distance measurements is considered. We develop a multistage…

We develop a linearized boundary control method for the inverse boundary value problem of determining the damping coefficient in the damped wave equation. The objective is to reconstruct an unknown perturbation in a known background damping…

This article is concerned with the reconstruction of obstacle $\O$ immersed in a fluid flowing in a bounded domain $\Omega$ in the two dimensional case. We assume that the fluid motion is governed by the Stokes-Brinkmann equations. We make…

We consider the in-plane motion of elastic strings on tree-like network, observed from the 'leaves'. We investigate the inverse problem of recovering not only the physical properties i.e. the 'optical lengths' of each string, but also the…

Given a subset of active nodes in a network can we re- construct the cascade that has generated these observa- tions? This is a problem that has been studied in the literature, but here we focus in the case that tempo- ral information is…

In this paper we develop a reconstruction algorithm for the solution of an inverse boundary value problem dealing with a semilinear elliptic partial differential equation of interest in cardiac electrophysiology. The goal is the detection…

We address the inverse problem of reconstructing both the structure and dynamics of a network from mean-field measurements, which are linear combinations of node states. This setting arises in applications where only a few aggregated…

We show that the problem of recovering the topology and admittance of an electrical network from power and voltage data at all vertices is often ill-posed, and sometimes it even has multiple solutions. We reformulate the problem to seek for…

We present an algorithm for recovering planted solutions in two well-known models, the stochastic block model and planted constraint satisfaction problems, via a common generalization in terms of random bipartite graphs. Our algorithm…

Network reconstruction consists in determining the unobserved pairwise couplings between $N$ nodes given only observational data on the resulting behavior that is conditioned on those couplings -- typically a time-series or independent…

We develop a linearized boundary control method for the inverse boundary value problem of determining a density in the acoustic wave equation. The objective is to reconstruct an unknown perturbation in a known background density from the…

We consider the problem of recovering the topology and the edge conductance value, as well as characterizing a set of electrical networks that satisfy the limitedly available Thevenin impedance measurements. The measurements are obtained…

In this paper we present the first algorithm in the streaming model to characterize completely the biconnectivity properties of undirected networks: articulation points, bridges, and connected and biconnected components. The motivation of…

A challenging problem in complex networks is the network reconstruction problem from data. This work deals with a class of networks denoted as conserved networks, in which a flow associated with every edge and the flows are conserved at all…

Consider an information source generating a symbol at the root of a tree network whose links correspond to noisy communication channels, and broadcasting it through the network. We study the problem of reconstructing the transmitted symbol…

This paper is concerned with the inverse problem of time-harmonic acoustic scattering by an unbounded, locally rough interface which is assumed to be a local perturbation of a plane. The purpose of this paper is to recover the local…

This paper addresses the inverse obstacle scattering problem of simultaneously reconstructing the obstacle geometry and boundary conditions from multi-frequency near-field backscattering data. We first establish rigorous high-frequency…

We study recovering a 1D order from a noisy, locally sampled pairwise comparison matrix under a tight query budget. We recast the task as reconstructing a sparse, noisy line graph and present, to our knowledge, the first method that…

We present a non-iterative algorithm to reconstruct the isotropic acoustic wave speed from the measurement of the Neumann-to-Dirichlet map. The algorithm is designed based on the boundary control method and involves only computations that…

Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edge set by performing as few queries as possible. An algorithm…