Related papers: Random clique complex process inside the critical …
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…
We introduce several new quantum algorithms for estimating homological invariants, specifically Betti numbers and persistent Betti numbers, of a simplicial complex given via a structured classical input. At the core of our algorithm lies…
Clique complexes of Erd\H{o}s-R\'{e}nyi random graphs with edge probability between $n^{-{1\over 3}}$ and $n^{-{1\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex…
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are presented with K=K(n) edges, chosen uniformly at random from the…
We study the problem of counting the number of {\em isomorphic} copies of a given {\em template} graph, say $H$, in the input {\em base} graph, say $G$. In general, it is believed that polynomial time algorithms that solve this problem…
Amit and Linial showed that a random lift of a graph with minimum degree $\delta\ge3$ is asymptotically almost surely $\delta$-connected, and mentioned the problem of estimating this probability as a function of the degree of the lift. We…
We describe topology of random simplicial complexes in the lower and upper models in the medial regime, i.e. under the assumption that the probability parameters $p_\sigma$ approach neither $0$ nor $1$. We show that nontrivial Betti numbers…
Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an…
Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erd\"os-R\'enyi G(N, p) random graph. We use Maximum Clique to explore the structure of the problem as a function of…
We study combinatorial and algebraic properties of $t$-clique-free complexes, a family of simplicial complexes associated with finite simple graphs that generalize the classical independence complex. For a graph $G$ and an integer $t \ge…
We study certain random simplicial complexes, called random quota complexes. A quota complex on $N+1$ weighted vertices is constructed by adding an $n$-simplex if the sum of the weights of the vertices is below a given quota, $q$. In this…
A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their…
In this paper, a random clique network model to mimic the large clustering coefficient and the modular structure that exist in many real complex networks, such as social networks, artificial networks, and protein interaction networks, is…
Path homology is a topological invariant for directed graphs, which is sensitive to their asymmetry and can discern between digraphs which are indistinguishable to the directed flag complex. In Erd\"os-R\'enyi directed random graphs, the…
We investigate convergence of point processes associated with critical faces for a \v{C}ech filtration built over a homogeneous Poisson point process in the $d$-dimensional flat torus. The convergence of our point process is established in…
We associate to each algebraic variety defined over $\mathbb{R}$ a filtered cochain complex, which computes the cohomology with compact supports and $\mathbb{Z}\_2$-coefficients of the set of its real points. This filtered complex is…
Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the…
Simplicial complex (SC) representation is an elegant mathematical framework for representing the effect of complexes or groups with higher-order interactions in a variety of complex systems ranging from brain networks to social…
We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first…
Topological invariants of a dataset, such as the number of holes that survive from one length scale to another (persistent Betti numbers) can be used to analyze and classify data in machine learning applications. We present an improved…