Searcharxiv⌕ Search

arXiv subjects

Emil Saucan

Publications and source records attributed to Emil Saucan.

At least 37 records · Page 2Linked to original sources
arXiv2016

Characterizing Complex Networks with Forman-Ricci Curvature and Associated Geometric Flows

We introduce Forman-Ricci curvature and its corresponding flow as characteristics for complex networks attempting to extend the common approach of node-based network analysis by edge-based characteristics. Following a theoretical introduction and mathematical motivation, we apply the proposed network-analytic methods to static and dynamic complex networks and compare the results with established node-based characteristics. Our work suggests a number of applications for data mining, including denoising and clustering of experimental data, as well as extrapolation of network evolution.

cs.DM↗
arXiv2016

Can one see the shape of a network?

Traditionally, network analysis is based on local properties of vertices, like their degree or clustering, and their statistical behavior across the network in question. This paper develops an approach which is different in two respects. We investigate edge-based properties, and we define global characteristics of networks directly. The latter will provide our affirmative answer to the question raised in the title. More concretely, we start with Forman's notion of the Ricci curvature of a graph, or more generally, a polyhedral complex. This will allow us to pass from a graph as representing a network to a polyhedral complex for instance by filling in triangles into connected triples of edges and to investigate the resulting effect on the curvature. This is insightful for two reasons: First, we can define a curvature flow in order to asymptotically simplify a network and reduce it to its essentials. Second, using a construction of Bloch, which yields a discrete Gauss-Bonnet theorem, we have the Euler characteristic of a network as a global characteristic. These two aspects beautifully merge in the sense that the asymptotic properties of the curvature flow are indicated by that Euler characteristic.

math.CO↗
arXiv2016

Forman-Ricci flow for change detection in large dynamic data sets

We present a viable solution to the challenging question of change detection in complex networks inferred from large dynamic data sets. Building on Forman's discretization of the classical notion of Ricci curvature, we introduce a novel geometric method to characterize different types of real-world networks with an emphasis on peer-to-peer networks. Furthermore we adapt the classical Ricci flow that already proved to be a powerful tool in image processing and graphics, to the case of undirected and weighted networks. The application of the proposed method on peer-to-peer networks yields insights into topological properties and the structure of their underlying data.

cs.SI↗
arXiv2016

Forman curvature for complex networks

We adapt Forman's discretization of Ricci curvature to the case of undirected networks, both weighted and unweighted, and investigate the measure in a variety of model and real-world networks. We find that most nodes and edges in model and real networks have a negative curvature. Furthermore, the distribution of Forman curvature of nodes and edges is narrow in random and small-world networks, while the distribution is broad in scale-free and real-world networks. In most networks, Forman curvature is found to display significant negative correlation with degree and centrality measures. However, Forman curvature is uncorrelated with clustering coefficient in most networks. Importantly, we find that both model and real networks are vulnerable to targeted deletion of nodes with highly negative Forman curvature. Our results suggest that Forman curvature can be employed to gain novel insights on the organization of complex networks.

q-bio.MN↗
arXiv2015

Space Filling Curves for 3D Sensor Networks with Complex Topology

Several aspects of managing a sensor network (e.g., motion planning for data mules, serial data fusion and inference) benefit once the network is linearized to a path. The linearization is often achieved by constructing a space filling curve in the domain. However, existing methods cannot handle networks distributed on surfaces of complex topology. This paper presents a novel method for generating space filling curves for 3D sensor networks that are distributed densely on some two-dimensional geometric surface. Our algorithm is completely distributed and constructs a path which gets uniformly, progressively denser as it becomes longer. We analyze the algorithm mathematically and prove that the curve we obtain is dense. Our method is based on the Hodge decomposition theorem and uses holomorphic differentials on Riemann surfaces. The underlying high genus surface is conformally mapped to a union of flat tori and then a proportionally-dense space filling curve on this union is constructed. The pullback of this curve to the original network gives us the desired curve.

cs.CG↗
arXiv2015

Ricci Curvature of the Internet Topology

Analysis of Internet topologies has shown that the Internet topology has negative curvature, measured by Gromov's "thin triangle condition", which is tightly related to core congestion and route reliability. In this work we analyze the discrete Ricci curvature of the Internet, defined by Ollivier, Lin, etc. Ricci curvature measures whether local distances diverge or converge. It is a more local measure which allows us to understand the distribution of curvatures in the network. We show by various Internet data sets that the distribution of Ricci cuvature is spread out, suggesting the network topology to be non-homogenous. We also show that the Ricci curvature has interesting connections to both local measures such as node degree and clustering coefficient, global measures such as betweenness centrality and network connectivity, as well as auxilary attributes such as geographical distances. These observations add to the richness of geometric structures in complex network theory.

cs.SI↗
arXiv2012

Metric Ricci curvature for $PL$ manifolds

We introduce a metric notion of Ricci curvature for $PL$ manifolds and study its convergence properties. We also prove a fitting version of the Bonnet-Myers Theorem, for surfaces as well as for a large class of higher dimensional manifolds.

math.DG↗
arXiv2011

Fat Triangulations and Differential Geometry

We study the differential geometric consequences of our previous result on the existence of fat triangulations, in conjunction with a result of Cheeger, Müller and Schrader, regarding the convergence of Lipschitz-Killing curvatures of piecewise-flat approximations of smooth Riemannian manifolds. A further application to the existence of quasiconformal mappings between manifolds, as well as an extension of the triangulation result to the case of almost Riemannian manifolds, are also given. In addition, the notion of fatness of triangulations and its relation to metric curvature and to excess is explored. Moreover, applications of the main results, and in particular a purely metric approach to Regge calculus, are also investigated.

math.DG↗
arXiv2011

On the properties of the combinatorial Ricci flow for surfaces

We investigate the properties of the combinatorial Ricci flow for surfaces, both forward and backward -- existence, uniqueness and singularities formation. We show that the positive results that exist for the smooth Ricci flow also hold for the combinatorial one and that, moreover, the same results hold for a more general, metric notion of curvature. Furthermore, using the metric curvature approach, we show the existence of the Ricci flow for polyhedral manifolds of piecewise constant curvature. We also study the problem of the realizability of the said flow in $\mathbb{R}^3$.

math.DG↗
arXiv2011

A Simple Sampling Method for Metric Measure Spaces

We introduce a new, simple metric method of sampling metric measure spaces, based on a well-known "snowflakeing operator" and we show that, as a consequence of a classical result of Assouad, the sampling of doubling metric spaces is bilipschitz equivalent to that of subsets of some $\mathbb{R}^N$. Moreover, we compare this new method with two other approaches, in particular to one that represents a direct application of our triangulation method of metric measure spaces satisfying a generalized Ricci curvature condition.

cs.IT↗
arXiv2010

On a construction of Burago and Zalgaller

The purpose of this note is to scrutinize the proof of Burago and Zalgaller regarding the existence of $PL$ isometric embeddings of $PL$ compact surfaces into $\mathbb{R}^3$. We conclude that their proof does not admit a direct extension to higher dimensions. Moreover, we show that, in general, $PL$ manifolds of dimension $n \geq 3$ admit no nontrivial $PL$ embeddings in $\mathbb{R}^{n+1}$ that are close to conformality. We also extend the result of Burago and Zalgaller to a large class of noncompact $PL$ 2-manifolds. The relation between intrinsic and extrinsic curvatures is also examined, and we propose a $PL$ version of the Gauss compatibility equation for smooth surfaces.

math.DG↗
arXiv2010

Isometric Embeddings in Imaging and Vision: Facts and Fiction

We explore the practicability of Nash's Embedding Theorem in vision and imaging sciences. In particular, we investigate the relevance of a result of Burago and Zalgaller regarding the existence of isometric embeddings of polyhedral surfaces in $\mathbb{R}^3$ and we show that their proof does not extended directly to higher dimensions.

cs.CV↗
arXiv2010

Geometric approach to sampling and communication

Relationships that exist between the classical, Shannon-type, and geometric-based approaches to sampling are investigated. Some aspects of coding and communication through a Gaussian channel are considered. In particular, a constructive method to determine the quantizing dimension in Zador's theorem is provided. A geometric version of Shannon's Second Theorem is introduced. Applications to Pulse Code Modulation and Vector Quantization of Images are addressed.

cs.IT↗
arXiv2010

Curvature based triangulation of metric measure spaces

We prove that a Ricci curvature based method of triangulation of compact Riemannian manifolds, due to Grove and Petersen, extends to the context of weighted Riemannian manifolds and more general metric measure spaces. In both cases the role of the lower bound on Ricci curvature is replaced by the curvature-dimension condition ${\rm CD}(K,N)$. We show also that for weighted Riemannian manifolds the triangulation can be improved to become a thick one and that, in consequence, such manifolds admit weight-sensitive quasimeromorphic mappings. An application of this last result to information manifolds is considered. Further more, we extend to weak ${\rm CD}(K,N)$ spaces the results of Kanai regarding the discretization of manifolds, and show that the volume growth of such a space is the same as that of any of its discretizations.

math.DG↗
arXiv2009

Combinatorial Ricci Curvature and Laplacians for Image Processing

A new Combinatorial Ricci curvature and Laplacian operators for grayscale images are introduced and tested on 2D synthetic, natural and medical images. Analogue formulae for voxels are also obtained. These notions are based upon more general concepts developed by R. Forman. Further applications, in particular a fitting Ricci flow, are discussed.

cs.CV↗
arXiv2008

The existence of thick triangulations -- an "elementary" proof

We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary differential topology. The role played by curvatures in this construction is also emphasized.

math.GT↗
arXiv2004

The Existence of Quasimeromorphic Mappings

We prove that a Kleinian group $G$ acting upon $\mathbb{H}^{n}$ admits a non-constant $G$-automorphic function, even if it has torsion elements, provided that the orders of the elliptic (torsion) elements are uniformly bounded. This is accomplished by developing a technique for mashing distinct fat triangulations while preserving fatness.

math.CV↗