Related papers: Topology of random real hypersurfaces
We present a method for estimating the edge of a two-dimensional bounded set, given a finite random set of points drawn from the interior. The estimator is based both on projections on C^1 bases and on extreme points of the point process.…
Current astrophysical models of the interstellar medium assume that small scale variation and noise can be modelled as Gaussian random fields or simple transformations thereof, such as lognormal. We use topological methods to investigate…
We will generalize a Maximum Principle at Infinity in the parabolic case given by De Lima [Ann. Global Anal. Geom. ${\bf 20}$, 325-343 2001] and De Lima and Meeks [Indiana Univ. Math. Journal ${\bf 53}$ 5, 1211-1223 2004], for disjoints…
We review mathematically tractable models for connected networks on random points in the plane, emphasizing the class of proximity graphs which deserves to be better known to applied probabilists and statisticians. We introduce and motivate…
Core-periphery structure is a common property of complex networks, which is a composition of tightly connected groups of core vertices and sparsely connected periphery vertices. This structure frequently emerges in traffic systems, biology,…
The idea of slicing divergences has been proven to be successful when comparing two probability measures in various machine learning applications including generative modeling, and consists in computing the expected value of a `base…
We discuss the toplogical sigma model on an orbifold target space. We describe the moduli space of classical minima for computing correlation functions involving twisted operators, and show, through a detailed computation of an orbifold of…
The main goal of this article is to understand how the length spectrum of a random surface depends on its genus. Here a random surface means a surface obtained by randomly gluing together an even number of triangles carrying a fixed metric.…
We compute the integral homology and cohomology groups of configuration spaces of two distinct points on a given real projective space. The explicit answer is related to the (known multiplicative structure in the) integral cohomology---with…
It is challenging to directly estimate the human geometry from a single image due to the high diversity and complexity of body shapes with the various clothing styles. Most of model-based approaches are limited to predict the shape and pose…
We consider a network topology design problem in which an initial undirected graph underlying the network is given and the objective is to select a set of edges to add to the graph to optimize the coherence of the resulting network. We show…
This is an extended version of the thesis presented to the Programa de P\'os-Gradua\c{c}\~ao em Matem\'atica of the Departamento de Matem\'atica, PUC-Rio, in September 2013, incorporating some suggestions from the examining commission.…
In this paper, we consider a random geometric graph (RGG)~\(G\) on~\(n\) nodes with adjacency distance~\(r_n\) just below the Hamiltonicity threshold and construct Hamiltonian cycles using additional edges called bridges. The bridges by…
We study several models of random geometric subdivisions arising from the model of Diaconis and Miclo (2011). In particular, we show that the limiting shape of an indefinite subdivision of a quadrilateral is a.s.\ a parallelogram. We also…
This paper aims to give some examples of diffeomorphic (or homeomorphic) low-dimensional complete intersections, which can be considered as a geometrical realization of classification theorems about complete intersections. A conjecture of…
We study the topology of singularities of $c$-optimal semicouplings in unequal dimension. Our main results describe homotopy-reductions from a source space $(X,\sigma)$ onto the singularities $Z_j$, $j\geq 0$ of $c$-optimal semicouplings…
This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
The problem of node-similarity in networks has motivated a plethora of such measures between node-pairs, which make use of the underlying graph structure. However, higher-order relations cannot be losslessly captured by mere graphs and…
Let $X$ be an integral projective variety of codimension two, degree $d$ and dimension $r$ and $Y$ be its general hyperplane section. The problem of lifting generators of minimal degree $\sigma$ from the homogeneous ideal of $Y$ to the…