English
Related papers

Related papers: Topology of random 2-dimensional cubical complexes

200 papers

Let P be a random $d$-dimensional 0/1-polytope with $n(d)$ vertices, and denote by $\phi_k(P)$ the \emph{$k$-face density} of $P$, i.e., the quotient of the number of $k$-dimensional faces of $P$ and $\binom{n(d)}{k+1}$. For each $k\ge 2$,…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel

We compute the Hochschild homology of the free orthogonal quantum group $A_o(n)$. We show that it satisfies Poincar\'e duality and should be considered to be a 3-dimensional object. We then use recent results of R. Vergnioux to derive…

Operator Algebras · Mathematics 2019-02-27 B. Collins , J. Härtel , A. Thom

We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…

Combinatorics · Mathematics 2019-07-30 Michael Anastos , Peleg Michaeli , Samantha Petti

This paper introduces a new percolation model motivated from polymer materials. The mathematical model is defined over a random cubical set in the $d$-dimensional space $\mathbb{R}^d$ and focuses on generations and percolations of…

Probability · Mathematics 2019-04-09 Yasuaki Hiraoka , Tatsuya Mikami

We have considered an equilibrium ensemble of large Erd\H{o}s-Renyi topological random networks with fixed vertex degree and two types of vertices, black and white, prepared randomly with the bond connection probability, $p$. The network…

Statistical Mechanics · Physics 2016-01-20 V. Avetisov , A. Gorsky , S. Nechaev , O. Valba

It is well-known that the $G(n,p)$ model of random graphs undergoes a dramatic change around $p=\frac 1n$. It is here that the random graph is, almost surely, no longer a forest, and here it first acquires a giant (i.e., order $\Omega(n)$)…

Probability · Mathematics 2016-09-20 Nathan Linial , Yuval Peled

Let $G$ be a free-by-cyclic group or a 2-dimensional right-angled Artin group. We provide an algebraic and a geometric characterization for when each aspherical simplicial complex with fundamental group isomorphic to $G$ has minimal volume…

Group Theory · Mathematics 2021-03-04 Corey Bregman , Matt Clay

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…

Probability · Mathematics 2019-08-05 Masanori Hino , Shu Kanazawa

The 2-girth of a 2-dimensional simplicial complex $X$ is the minimum size of a non-zero 2-cycle in $H_2(X, \mathbb{Z}/2)$. We consider the maximum possible girth of a complex with $n$ vertices and $m$ 2-faces. If $m = n^{2 + \alpha}$ for…

Algebraic Topology · Mathematics 2017-07-11 Dominic Dotterrer , Larry Guth , Matthew Kahle

We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…

Probability · Mathematics 2018-10-10 Alessandra Faggionato , Hlafo Alfie Mimun

Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…

Probability · Mathematics 2008-02-03 Svante Janson , Donald E. Knuth , Tomasz Łuczak , Boris Pittel

We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…

Statistical Mechanics · Physics 2009-11-07 Jesper Dall , Michael Christensen

Fix a finite set of points in Euclidean $n$-space $\euc^n$, thought of as a point-cloud sampling of a certain domain $D\subset\euc^n$. The Rips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an…

Geometric Topology · Mathematics 2007-12-05 Erin W. Chambers , Vin de Silva , Jeff Erickson , Robert Ghrist

We describe a new family of $k$-uniform hypergraphs with independent random edges. The hypergraphs have a high probability of being peelable, i.e. to admit no sub-hypergraph of minimum degree $2$, even when the edge density (number of edges…

Data Structures and Algorithms · Computer Science 2019-07-11 Martin Dietzfelbinger , Stefan Walzer

In this paper, we explore the higher- and lower-order connectivity aspects of the visibility graph representation of sandpile models, focusing on the Bak-Tang-Wiesenfeld (BTW) model. By converting the time series of avalanche events into…

Statistical Mechanics · Physics 2026-02-23 Vadood Adami , Hosseing Masoomy , Morteza Nattagh-Najafi

Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…

Probability · Mathematics 2016-07-21 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim

There have been several recent articles studying homology of various types of random simplicial complexes. Several theorems have concerned thresholds for vanishing of homology, and in some cases expectations of the Betti numbers. However…

Probability · Mathematics 2011-01-19 Matthew Kahle , Elizabeth Meckes

We study random subgraphs of the 2-dimensional Hamming graph H(2,n), which is the Cartesian product of two complete graphs on $n$ vertices. Let $p$ be the edge probability, and write $p=\frac{1+\vep}{2(n-1)}$ for some $\vep\in \R$. In Borgs…

Probability · Mathematics 2008-12-15 Remco van der Hofstad , Malwina J. Luczak

We compute the homology of random \v{C}ech complexes over a homogeneous Poisson process on the d-dimensional torus, and show that there are, coarsely, two phase transitions. The first transition is analogous to the Erd\H{o}s-R\'enyi phase…

Probability · Mathematics 2016-03-24 Omer Bobrowski , Shmuel Weinberger

In this paper we study the connectivity properties of the random subgraph of the $n$-cube generated by the $k$-out model and denoted by $Q^n(k)$. Let $k$ be an integer, $1\leq k \leq n-1$. We let $Q^n(k)$ be the graph that is generated by…

Combinatorics · Mathematics 2017-06-13 Michael Anastos