Related papers: Betweenness Structures of Small Linear Co-Size
This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods…
Given a flat metric one may generate a local Hamiltonian structure via the fundamental result of Dubrovin and Novikov. More generally, a flat pencil of metrics will generate a local bi-Hamiltonian structure, and with additional…
Who is more important in a network? Who controls the flow between the nodes or whose contribution is significant for connections? Centrality metrics play an important role while answering these questions. The betweenness metric is useful…
We consider the method of alternating (metric) projections for pairs of linear subspaces of finite dimensional Banach spaces. We investigate the size of the set of points for which this method converges to the metric projection onto the…
We study the large-scale geometry of 3-manifolds with nontrivial 2-dimensional bounded cohomology, with a view to proving a weak version of the geometrization conjecture for such manifolds.
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…
Centrality measures, erstwhile popular amongst the sociologists and psychologists, have seen broad and increasing applications across several disciplines of late. Amongst a plethora of application specific definitions available in the…
We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…
We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…
We investigate a relations of almost isometric embedding and almost isometry between metric spaces and prove that with respect to these relations: (1) There is a countable universal metric space. (2) There may exist fewer than continuum…
Betweenness centrality is a graph parameter that has been successfully applied to network analysis. In the context of computer networks, it was considered for various objectives, ranging from routing to service placement. However, as…
The Newman-Penrose-Perjes formalism is applied to smooth contact structures on riemannian 3-manifolds. In particular it is shown that a contact 3-manifold admits an adapted riemannian metric if and only if it admits a metric with a…
We introduce a natural correspondence between artinian monomial almost complete intersections in three variables and punctured hexagonal regions. We use this correspondence to investigate the algebras for the presence of the weak Lefschetz…
We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the…
Barnette and Edelson have shown that there are finitely many minimal triangulations of a connected compact 2-manifold M. Similar finiteness results are obtained for cellular partial triangulations that satisfy various girth inequality…
The embedding of finite metrics in $\ell_1$ has become a fundamental tool for both combinatorial optimization and large-scale data analysis. One important application is to network flow problems in which there is close relation between…
It is well known that 3--regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3--regular graphs without reducing the girth, thereby proving that such graphs with…
In the paper we study the structure of hyperplanes of so called binomial partial Steiner triple systems (BSTS's, in short) i.e. of configurations with $\binom{n}{2}$ points and $\binom{n}{3}$ lines, each line of the size $3$. Consequently,…
We study spherical completeness of ball spaces and its stability under expansions. We introduce the notion of an ultra-diameter, mimicking diameters in ultrametric spaces. We prove some positive results on preservation of spherical…
We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…