相关论文: N-tree approximation for the largest Lyapunov expo…
In this work we present a theoretical and numerical study of the behaviour of the maximum Lyapunov exponent for a generic coupled-map-lattice in the weak-coupling regime. We explain the observed results by introducing a suitable…
A parquet approximation (generalized ladder diagrams) in matrix models is considered. By means of numerical calculations we demonstrate that in the large $N$ limit the parquet approximation gives an excellent agreement with exact results.
In recent years, non-parametric methods utilizing random walks on graphs have been used to solve a wide range of machine learning problems, but in their simplest form they do not scale well due to the quadratic complexity. In this paper, a…
Given a directed graph $G$ on $n$ vertices with a special vertex $s$, the directed minimum degree spanning tree problem requires computing a incoming spanning tree rooted at $s$ whose maximum tree in-degree is the smallest among all such…
In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…
Treedepth is a central parameter to algorithmic graph theory. The current state-of-the-art in computing and approximating treedepth consists of a $2^{O(k^2)} n$-time exact algorithm and a polynomial-time $O(\text{OPT} \log^{3/2}…
We consider a generalisation of Ulam's method for approximating invariant densities of one-dimensional chaotic maps. Rather than use piecewise constant polynomials to approximate the density, we use polynomials of degree n which are defined…
We revisit the Maximum Node-Disjoint Paths problem, the natural optimization version of Node-Disjoint Paths, where we are given a graph $G$, $k$ pairs of vertices $(s_i, t_i)$ and an integer $\ell$, and are asked whether there exist at…
We present approximation algorithms for the following NP-hard optimization problems related to bottleneck spanning trees in metric spaces. 1. The disjoint bottleneck spanning tree problem: Given $n$ pairs of points in a metric space, find…
We study synchronization of random one-dimensional linear maps for which the Lyapunov exponent can be calculated exactly. Certain aspects of the dynamics of these maps are explained using their relation with a random walk. We confirm that…
We present several modifications to the previously proposed MSPP algorithm that can speed-up its execution considerably. The MSPP algorithm leverages a multiscale representation of the environment in $n$ dimensions. The information of the…
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed eps > 0 and given n terminals in the plane with connection requests between some pairs of terminals, our…
We give an $O(g^{1/2} n^{3/2} + g^{3/2} n^{1/2})$-size extended formulation for the spanning tree polytope of an $n$-vertex graph embedded on a surface of genus $g$, improving on the known $O(n^2 + g n)$-size extended formulations following…
Let $K$ be an algebraically closed field of characteristic 0 that is complete with respect to a non-archimedean absolute value. We establish a locally uniform approximation formula of the Lyapunov exponent of a rational map $f$ of…
We introduce a new approach to evaluate the largest Lyapunov exponent of a family of nonnegative matrices. The method is based on using special positive homogeneous functionals on $R^{d}_+,$ which gives iterative lower and upper bounds for…
We develop and analyze methods for computing provably optimal {\em maximum a posteriori} (MAP) configurations for a subclass of Markov random fields defined on graphs with cycles. By decomposing the original distribution into a convex…
The parametric instability contribution to the largest Lyapunov exponent (LLE) is derived for a mean-field Hamiltonian model, with attractive long-range interactions. This uses a recent Riemannian approach to describe Hamiltonian chaos with…
Given a pointed metric space $(X,\mathsf{dist}, w)$ on $n$ points, its Gromov's approximating tree is a 0-hyperbolic pseudo-metric space $(X,\mathsf{dist}_T)$ such that $\mathsf{dist}(x,w)=\mathsf{dist}_T(x,w)$ and $\mathsf{dist}(x, y)-2…
In this paper we develop a Bethe approximation, based on the cluster variation method, which is apt to study lattice models of branched polymers. We show that the method is extremely accurate in cases where exact results are known as, for…
A connected graph has tree-depth at most $k$ if it is a subgraph of the closure of a rooted tree whose height is at most $k$. We give an algorithm which for a given $n$-vertex graph $G$, in time $\mathcal{O}(1.9602^n)$ computes the…