778 research outputs found
Simplicial Homology of Random Configurations
Given a Poisson process on a -dimensional torus, its random geometric
simplicial complex is the complex whose vertices are the points of the Poisson
process and simplices are given by the \u{C}ech complex associated to the
coverage of each point. By means of Malliavin calculus, we compute explicitly
the n order moment of the number of -simplices. The two first order
moments of this quantity allow us to find the mean and the variance of the
Euler caracteristic. Also, we show that the number of any connected geometric
simplicial complex converges to the Gaussian law when the intensity of the
Poisson point process tends to infinity. We use a concentration inequality to
find bounds for the for the distribution of the Betti number of first order and
the Euler characteristic in such simplicial complex
Visualizing Sensor Network Coverage with Location Uncertainty
We present an interactive visualization system for exploring the coverage in
sensor networks with uncertain sensor locations. We consider a simple case of
uncertainty where the location of each sensor is confined to a discrete number
of points sampled uniformly at random from a region with a fixed radius.
Employing techniques from topological data analysis, we model and visualize
network coverage by quantifying the uncertainty defined on its simplicial
complex representations. We demonstrate the capabilities and effectiveness of
our tool via the exploration of randomly distributed sensor networks
Simplicial Homology for Future Cellular Networks
Simplicial homology is a tool that provides a mathematical way to compute the
connectivity and the coverage of a cellular network without any node location
information. In this article, we use simplicial homology in order to not only
compute the topology of a cellular network, but also to discover the clusters
of nodes still with no location information. We propose three algorithms for
the management of future cellular networks. The first one is a frequency
auto-planning algorithm for the self-configuration of future cellular networks.
It aims at minimizing the number of planned frequencies while maximizing the
usage of each one. Then, our energy conservation algorithm falls into the
self-optimization feature of future cellular networks. It optimizes the energy
consumption of the cellular network during off-peak hours while taking into
account both coverage and user traffic. Finally, we present and discuss the
performance of a disaster recovery algorithm using determinantal point
processes to patch coverage holes
Simplicial and Cellular Trees
Much information about a graph can be obtained by studying its spanning
trees. On the other hand, a graph can be regarded as a 1-dimensional cell
complex, raising the question of developing a theory of trees in higher
dimension. As observed first by Bolker, Kalai and Adin, and more recently by
numerous authors, the fundamental topological properties of a tree --- namely
acyclicity and connectedness --- can be generalized to arbitrary dimension as
the vanishing of certain cellular homology groups. This point of view is
consistent with the matroid-theoretic approach to graphs, and yields
higher-dimensional analogues of classical enumerative results including
Cayley's formula and the matrix-tree theorem. A subtlety of the
higher-dimensional case is that enumeration must account for the possibility of
torsion homology in trees, which is always trivial for graphs. Cellular trees
are the starting point for further high-dimensional extensions of concepts from
algebraic graph theory including the critical group, cut and flow spaces, and
discrete dynamical systems such as the abelian sandpile model.Comment: 39 pages (including 5-page bibliography); 5 figures. Chapter for
forthcoming IMA volume "Recent Trends in Combinatorics
Persistent Homology and String Vacua
We use methods from topological data analysis to study the topological
features of certain distributions of string vacua. Topological data analysis is
a multi-scale approach used to analyze the topological features of a dataset by
identifying which homological characteristics persist over a long range of
scales. We apply these techniques in several contexts. We analyze N=2 vacua by
focusing on certain distributions of Calabi-Yau varieties and Landau-Ginzburg
models. We then turn to flux compactifications and discuss how we can use
topological data analysis to extract physical informations. Finally we apply
these techniques to certain phenomenologically realistic heterotic models. We
discuss the possibility of characterizing string vacua using the topological
properties of their distributions.Comment: 32 pages, 12 pdf figure
- …