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

Generative models for graphs have been typically committed to strong prior assumptions concerning the form of the modeled distributions. Moreover, the vast majority of currently available models are either only suitable for characterizing…

Bayesian additive regression trees have seen increased interest in recent years due to their ability to combine machine learning techniques with principled uncertainty quantification. The Bayesian backfitting algorithm used to fit BART…

Real-world networks tend to be scale free, having heavy-tailed degree distributions with more hubs than predicted by classical random graph generation methods. Preferential attachment and growth are the most commonly accepted mechanisms…

For a simplicial complex K on m vertices and simplicial complexes K1,...,Km a composed simplicial complex K(K1,...,Km) is introduced. This construction generalizes an iterated simplicial wedge construction studied by A. Bahri, M. Bendersky,…

Document networks are found in various collections of real-world data, such as citation networks, hyperlinked web pages, and online social networks. A large number of generative models have been proposed because they offer intuitive and…

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph…

In this paper, we prove that the $L^2$ Betti numbers of an amenable covering space can be approximated by the average Betti numbers of a regular exhaustion, proving a conjecture that we made in an earlier paper. We also prove that an…

We introduce a dynamic random hypergraph model constructed from a bipartite graph. In this model, both vertex sets of the bipartite graph are generated by marked Poisson point processes. Vertices of both vertex sets are equipped with marks…

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

The Central Limit Theorem (CLT) is one of the most fundamental results in statistics. It states that the standardized sample mean of a sequence of $n$ mutually independent and identically distributed random variables with finite first and…

Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. The topologies of random Boolean networks with one input per…

The purpose of this paper is twofold. First, we present a conjecture to the effect that the ranks of the syzygy modules of a smooth projective variety become normally distributed as the positivity of the embedding line bundle grows. Then,…

The central limit theorem of martingales is the fundamental tool for studying the convergence of stochastic processes. The central limit theorem and functional central limit theorem are obtained for martingale like random variables under…

We study the asymptotic laws for the number, Betti numbers, and isotopy classes of connected components of zero sets of real Gaussian random fields, where the random zero sets almost surely consist of submanifolds of codimension greater…

Let $\Delta$ be simplicial complex and let $k[\Delta]$ denote the Stanley--Reisner ring corresponding to $\Delta$. Suppose that $k[\Delta]$ has a pure free resolution. Then we describe the Betti numbers and the Hilbert--Samuel multiplicity…

We study the persistent homology of random \v{C}ech complexes. Generalizing a method of Penrose for studying random geometric graphs, we first describe an appropriate theoretical framework in which we can state and address our main…

We propose a refinement of the Betti numbers and of the homology with coefficients in a field of a compact ANR in the presence of a continuous real valued function. The refinement of Betti numbers consists of finite configurations of points…

In this dissertation we develop a new formal graphical framework for causal reasoning. Starting with a review of monoidal categories and their associated graphical languages, we then revisit probability theory from a categorical perspective…

Let S be a polynomial ring and R=S/I where I is a graded ideal of S. The Multiplicity Conjecture of Herzog, Huneke, and Srinivasan which was recently proved using the Boij-Soederberg theory states that the multiplicity of R is bounded above…

We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…