Related papers: Central Limit Theorem for Euclidean Minimal Spanni…
We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of…
Using the LePage representation, a strictly stable random element in a Banach space with $\alpha\in(0,2)$ can be represented as a sum of points of a Poisson process. This point process is union-stable, i.e. the union of its two independent…
For a Borel set $A$ and a stationary Poisson point process $\eta_t$ in $\mathbb R^d$ of intensity $t>0$, the Poisson-Delaunay approximation $ A_{\eta_t}$ of $A$ is the union of all Delaunay cells generated by $\eta_t$ with center in $A$. It…
We study the weight and length of the minimum mean-weight cycle in the stochastic mean-field distance model, i.e., in the complete graph on $n$ vertices with edges weighted by independent exponential random variables. Mathieu and Wilson…
We prove the Central Limit Theorem and superpolynomial mixing for environment viewed for the particle process in quasi periodic Diophantine random environment. The main ingredients are smoothness estimates for the solution of the Poisson…
In this paper, we first establish a decomposition theorem for size-biased Poisson random measures. As consequences of this decomposition theorem, we get a spine decomposition theorem and a 2-spine decomposition theorem for some critical…
In this work, we give sufficient conditions for the almost global asymptotic stability of a cascade in which the subsystems are only almost globally asymptotically stable. The result is extended to upper triangular systems of arbitrary…
We develop two generalizations of contraction theory, namely, semi-contraction and weak-contraction theory. First, using the notion of semi-norm, we propose a geometric framework for semi-contraction theory. We introduce matrix…
In this paper, employing the weak convergence method, based on a variational representation for expected values of positive functionals of a Brownian motion, we investigate moderate deviation %(CLT for abbreviation) for a class of…
We study the asymptotic expansion of the determinant of the graph Laplacian associated to discretizations of a half-translation surface endowed with a flat unitary vector bundle. By doing so, over the discretizations, we relate the…
This paper makes two main contributions: The first is the construction of a near-minimum spanning tree with constant average distortion. The second is a general equivalence theorem relating two refined notions of distortion: scaling…
The minimum spanning tree (MST) is a combinatorial optimization problem: given a connected graph with a real weight ("cost") on each edge, find the spanning tree that minimizes the sum of the total cost of the occupied edges. We consider…
We investigate the stability properties of an abstract class of semi-linear systems. Our main result establishes rational rates of decay for classical solutions assuming a certain non-uniform observability estimate for the linear part and…
Computing a Euclidean minimum spanning tree of a set of points is a seminal problem in computational geometry and geometric graph theory. We combine it with another classical problem in graph drawing, namely computing a monotone geometric…
We prove nonlinear stability of the Larson-Penston family of self-similarly collapsing solutions to the isothermal Euler-Poisson system. Our result applies to radially symmetric perturbations and it is the first full nonlinear stability…
The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend…
Galileo, in the XVII century, observed that the small oscillations of a pendulum seem to have constant period. In fact, the Taylor expansion of the period map of the pendulum is constant up to second order in the initial angular velocity…
We prove CLTs for biased randomly trapped random walks in one dimension. In particular, we will establish an annealed invariance principal by considering a sequence of regeneration times under the assumption that the trapping times have…
We introduce a decomposition method for the distributed calculation of exact Euclidean Minimum Spanning Trees in high dimensions (where sub-quadratic algorithms are not effective), or more generalized geometric-minimum spanning trees of…
Maxmin trees are trees that consist of nodes that are either local minimums or maximums. Such trees were first studied by Postnikov. Later Dugan, Glennon, Gunnells, and Steingrimsson introduced the concept of weight to these trees and…