Search results for " Topology"

Algorithms for Graph and Network Analysis: Clustering and Search of Motifs in Graphs

2019

In this article we deal with problems that involve the analysis of topology in graphs modeling biological networks. In particular, we consider two important problems: (i) Network clustering, aiming at finding compact subgraphs inside the input graph in order to isolate molecular complexes, and (ii) searching for motifs, i.e., sub-structures repeated in the input network and presenting high significance (e.g., in terms of their frequency). We provide a compact overview of the main techniques proposed in the literature to solve these problems.

A comparison theorem for the mean exit time from a domain in a K�hler manifold

1992

Let M be a Kahler manifold with Ricci and antiholomorphic Ricci curvature bounded from below. Let ω be a domain in M with some bounds on the mean and JN-mean curvatures of its boundary ∂ω. The main result of this paper is a comparison theorem between the Mean Exit Time function defined on ω and the Mean Exit Time from a geodesic ball of the complex projective space ℂℙ n (λ) which involves a characterization of the geodesic balls among the domain ω. In order to achieve this, we prove a comparison theorem for the mean curvatures of hypersurfaces parallel to the boundary of ω, using the Index Lemma for Submanifolds.

Nonlinear Nonhomogeneous Robin Problems with Almost Critical and Partially Concave Reaction

2020

We consider a nonlinear Robin problem driven by a nonhomogeneous differential operator, with reaction which exhibits the competition of two Caratheodory terms. One is parametric, $$(p-1)$$-sublinear with a partially concave nonlinearity near zero. The other is $$(p-1)$$-superlinear and has almost critical growth. Exploiting the special geometry of the problem, we prove a bifurcation-type result, describing the changes in the set of positive solutions as the parameter $$\lambda >0$$ varies.

Incremental Generalized Discriminative Common Vectors for Image Classification.

2015

Subspace-based methods have become popular due to their ability to appropriately represent complex data in such a way that both dimensionality is reduced and discriminativeness is enhanced. Several recent works have concentrated on the discriminative common vector (DCV) method and other closely related algorithms also based on the concept of null space. In this paper, we present a generalized incremental formulation of the DCV methods, which allows the update of a given model by considering the addition of new examples even from unseen classes. Having efficient incremental formulations of well-behaved batch algorithms allows us to conveniently adapt previously trained classifiers without th…

Complex Formation between Polyelectrolytes and Oppositely Charged Oligoelectrolytes

2016

We study the complex formation between one long polyanion chain and many short oligocation chains by computer simulations. We employ a coarse-grained bead-spring model for the polyelectrolyte chains, and model explicitly the small salt ions. We systematically vary the concentration and the length of the oligocation, and examine how the oligocations affects the chain conformation, the static structure factor, the radial and axial distribution of various charged species, and the number of bound ions in the complex. At low oligocation concentration, the polyanion has an extended structure. Upon increasing the oligocation concentration, the polyanion chain collapses and forms a compact globule,…

Topology-based goodness-of-fit tests for sliced spatial data

2023

In materials science and many other application domains, 3D information can often only be extrapolated by taking 2D slices. In topological data analysis, persistence vineyards have emerged as a powerful tool to take into account topological features stretching over several slices. In the present paper, we illustrate how persistence vineyards can be used to design rigorous statistical hypothesis tests for 3D microstructure models based on data from 2D slices. More precisely, by establishing the asymptotic normality of suitable longitudinal and cross-sectional summary statistics, we devise goodness-of-fit tests that become asymptotically exact in large sampling windows. We illustrate the test…

Optimal rates of convergence for persistence diagrams in Topological Data Analysis

2013

Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field. In this paper, we study topological persistence in general metric spaces, with a statistical approach. We show that the use of persistent homology can be naturally considered in general statistical frameworks and persistence diagrams can be used as statistics with interesting convergence properties. Some numerical experiments are performed in various contexts to illustrate our results.

On the ultradistributions of Beurling type

2009

Sea un conjunto abierto no vac´ýo del espacio euclideo . En este articulo se demuestra que si S es una ultradistribucion en , perteneciente a una clase de tipo Beurling que sea estable frente a operadores diferenciales, entonces S se puede representar en la formaP2Nk0 Df, donde f es una funcion compleja definida en que es Lebesgue medible y esencialmente acotada en cada subconjunto compacto de . Tambi´en se obtienen otros resultados de estructura de ciertas ultradistribuciones.

Special issue on geometric constraints and reasoning

2012

Maximal subgroups of small index of finite almost simple groups

2022

We prove in this paper that a finite almost simple group $R$ with socle the non-abelian simple group $S$ possesses a conjugacy class of core-free maximal subgroups whose index coincides with the smallest index $\operatorname{l}(S)$ of a maximal group of $S$ or a conjugacy class of core-free maximal subgroups with a fixed index $v_S \leq {\operatorname{l}(S)^2}$, depending only on $S$. We show that the number of subgroups of the outer automorphism group of $S$ is bounded by $\log^3 {\operatorname{l}(S)}$ and $\operatorname{l}(S)^2 < |S|$.