中文
相关论文

相关论文: Betti numbers in the Random Connection Model for h…

200 篇论文

We study mathematical expectations of Betti numbers of configuration spaces of planar linkages, viewing the lengths of the bars of the linkage as random variables. Our main result gives an explicit asymptotic formulae for these mathematical…

代数拓扑 · 数学 2007-05-23 Michael Farber , Thomas Kappeler

The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…

概率论 · 数学 2010-10-12 Yusuke Ide , Norio Konno , Naoki Masuda

Border's theorem gives an intuitive linear characterization of the feasible interim allocation rules of a Bayesian single-item environment, and it has several applications in economic and algorithmic mechanism design. All known…

计算机科学与博弈论 · 计算机科学 2015-04-30 Parikshit Gopalan , Noam Nisan , Tim Roughgarden

We introduce a natural class of models of random chain complexes of real vector spaces that some classical ensembles of random matrices, the length $1$ case. We are interested here in the homological properties of these random complexes.…

概率论 · 数学 2026-02-12 Ayat Ababneh , Matthew Kahle

A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. The soft random simplicial complexes is a model for random simplicial complexes built over the…

概率论 · 数学 2025-07-15 Julián David Candela

Betti numbers of configuration spaces of mechanical linkages (known also as polygon spaces) depend on a large number of parameters -- the lengths of the bars of the linkage. Motivated by applications in topological robotics, statistical…

代数拓扑 · 数学 2007-08-23 Michael Farber

We prove a complexity lower bound on deciding membership in a semialgebraic set for arithmetic networks in terms of the sum of Betti numbers with respect to "ordinary" (singular) homology. This result complements a similar lower bound by…

计算复杂性 · 计算机科学 2016-07-14 Andrei Gabrielov , Nicolai Vorobjov

We study the homological properties of random simplicial complexes. In particular, we obtain the asymptotic behavior of lifetime sums for a class of increasing random simplicial complexes; this result is a higher-dimensional counterpart of…

概率论 · 数学 2019-08-05 Masanori Hino , Shu Kanazawa

Most work in the area of statistical relational learning (SRL) is focussed on discrete data, even though a few approaches for hybrid SRL models have been proposed that combine numerical and discrete variables. In this paper we distinguish…

机器学习 · 计算机科学 2015-06-17 Jiuchuan Jiang , Manfred Jaeger

We study topological and geometric functionals of $l_\infty$-random geometric graphs on the high-dimensional torus in a sparse regime, where the expected number of neighbors decays exponentially in the dimension. More precisely, we…

概率论 · 数学 2025-01-08 Gilles Bonnet , Christian Hirsch , Daniel Rosen , Daniel Willhalm

We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…

概率论 · 数学 2022-07-19 Youri Davydov , Arkady Tempelman

In this paper we study some algebraic properties of hypergraphs, in particula their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge, are not previously considered in the literature.…

交换代数 · 数学 2008-02-06 Eric Emtander

We study the problem of maximizing Betti numbers of simplicial complexes. We prove an upper bound of 1.32^n for the sum of Betti numbers of any n-vertex flag complex and 1.25^n for the independence complex of a triangle-free graph. These…

组合数学 · 数学 2013-04-18 Michal Adamaszek

A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…

信息论 · 计算机科学 2016-11-17 Junekey Jeon

Persistent homology is a fundamental tool in topological data analysis; however, it lacks methods to quantify the fragility or fineness of cycles, anticipate their formation or disappearance, or evaluate their stability beyond persistence.…

We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…

组合数学 · 数学 2022-10-21 Florian Frick , Andrew Newman

The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…

概率论 · 数学 2018-08-06 Günter Last , Franz Nestmann , Matthias Schulte

We study the expected behavior of the Betti numbers of arrangements of the zeros of random (distributed according to the Kostlan distribution) polynomials in $\mathbb{R}\mathrm{P}^n$. Using a random spectral sequence, we prove an…

代数几何 · 数学 2022-06-09 Saugata Basu , Antonio Lerario , Abhiram Natarajan

This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of…

信息论 · 计算机科学 2016-11-17 Maxim Raginsky

We study persistent Betti numbers and persistence diagrams obtained from time series and random fields. It is well known that the persistent Betti function is an efficient descriptor of the topology of a point cloud. So far, convergence…

概率论 · 数学 2021-03-02 Johannes Krebs