相关论文: Stability and convergence of the string method for…

We consider the problem of finding a minimum cut of a weighted graph presented as a single-pass stream. While graph sparsification in streams has been intensively studied, the specific application of finding minimum cuts in streams is less…

We study the connected ensemble, a statistical-mechanics framework that characterizes the formation of low-loss paths in rugged landscapes. First introduced in a previous paper, this ensemble allows one to identify when a network can be…

With applications in distribution systems and communication networks, the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum distance in T between two adjacent vertices is minimized. The…

Connectivity (or equivalently, unweighted maximum flow) is an important measure in graph theory and combinatorial optimization. Given a graph $G$ with vertices $s$ and $t$, the connectivity $\lambda(s,t)$ from $s$ to $t$ is defined to be…

Quantum string, which was brought into discussion recently as a model for the stripe phase in doped cuprates, is simulated by means of the density-matrix-renormalization-group method. String collides with adjacent neighbors, as it wonders,…

We deal with algorithmic techniques for minimal cost input-connectivity while maintaining controllability of linear systems. The input matrix is assumed to be constrained in the sense that the set of states that each input (if present) can…

In this paper the minimum spanning tree problem with uncertain edge costs is discussed. In order to model the uncertainty a discrete scenario set is specified and a robust framework is adopted to choose a solution. The min-max, min-max…

We present a message-passing algorithm to solve the edge disjoint path problem (EDP) on graphs incorporating under a unique framework both traffic optimization and path length minimization. The min-sum equations for this problem present an…

We analyze the problem of calculating the solutions and the spectrum of a string with arbitrary density and fixed ends. We build a perturbative scheme which uses a basis of WKB-type functions and obtain explicit expressions for the…

Driven by a wide range of applications, many principal subspace estimation problems have been studied individually under different structural constraints. This paper presents a unified framework for the statistical analysis of a general…

We derive a fluid-dynamic model for electron transport near a Dirac point in graphene. The derivation is based on the minimum entropy principle, which is exploited in order to close fluid-dynamic equations for quantum mixed states. To this…

The subject of this paper is the study of the asymptotic behaviour of the equilibrium configurations of a nonlinearly elastic thin rod, as the diameter of the cross-section tends to zero. Convergence results are established assuming…

We introduce a variant of the capacitated vehicle routing problem that is encountered in sensor networks for scientific data collection. Consider an undirected graph $G=(V \cup \{\mathbf{sink}\},E)$. Each vertex $v \in V$ holds a…

Let $n\geq 3$ and let $\Omega \subset \mathbb{R}^n$ be a $\mathcal{C}^1$ bounded domain which is diffeomorphic to a ball. We investigate here the problem of finding critical points of the $n$-energy in the space $\mathcal{I}=\{v\in…

We study a number of multi-route cut problems: given a graph G=(V,E) and connectivity thresholds k_(u,v) on pairs of nodes, the goal is to find a minimum cost set of edges or vertices the removal of which reduces the connectivity between…

We study the convergence rates of the EM algorithm for learning two-component mixed linear regression under all regimes of signal-to-noise ratio (SNR). We resolve a long-standing question that many recent results have attempted to tackle:…

Recent years have seen the emergence of nonlinear methods for solving partial differential equations (PDEs), such as physics-informed neural networks (PINNs). While these approaches often perform well in practice, their theoretical analysis…

A modified version of the Dijkstra algorithm using an inventive contraction hierarchy is proposed. The algorithm considers a directed acyclic graph with a conical or semi-circular structure for which a pair of edges is chosen iteratively…

We prove that any limit-interface corresponding to a locally uniformly bounded, locally energy-bounded sequence of stable critical points of the van der Waals--Cahn--Hilliard energy functionals with perturbation parameter tending to 0 is…

Models involving branched structures are employed to describe several supply-demand systems such as the structure of the nerves of a leaf, the system of roots of a tree and the nervous or cardiovascular systems. Given a flow (traffic path)…