Related papers: Fundamental groups of random clique complexes
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
Under the assumption that a defining graph of a Coxeter group admits only subsequent elementary twists in $\mathbb{Z}_2$ or dihedral groups and is of type $\mathrm{FC}$, we prove Bernhard M\"uhlherr's Twist Conjecture
We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We…
Introducing the notion of stabilized fundamental group for the complement of a branch curve in $CP^2$, we define effectively computable invariants of symplectic 4-manifolds that generalize those previously introduced by Moishezon and…
We study graphs whose chromatic number is close to the order of the graph (the number of vertices). Both when the chromatic number is a constant multiple of the order and when the difference of the chromatic number and the order is a small…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
We exhibit a map f between aspherical spaces X and Y such that f induces an isomorphism on homotopy groups but, with natural topologies, X and Y fail to have homeomorphic fundamental groups. Thus the topological fundamental group has the…
In this paper we explore maximal deviations of large random structures from their typical behavior. We introduce a model for a high-dimensional random graph process and ask analogous questions to those of Vapnik and Chervonenkis for…
Extensive and systematic machine computations are carried out to investigate the integral cohomology of the Euclidean Bianchi groups and their congruence subgroups. The collected data give insight on several aspects, including the…
We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including…
A recent trend in the context of graph theory is to bring theoretical analyses closer to empirical observations, by focusing the studies on random graph models that are used to represent practical instances. There, it was observed that…
Let k be a field. We attach a CW-complex to any Schurian k-category and we prove that the fundamental group of this CW-complex is isomorphic to the intrinsic fundamental group of the k-category. This extends previous results by J.C.…
We prove that certain acyclic cluster algebras over the complex numbers are the coordinate rings of holomorphic symplectic manifolds. We also show that the corresponding quantum cluster algebras have no non-trivial prime ideals. This allows…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
We study the expected topological properties of Cech and Vietoris-Rips complexes built on i.i.d. random points in R^d. We find higher dimensional analogues of known results for connectivity and component counts for random geometric graphs.…
We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…
The dimension of random simplicial complexes (defined as the maximal dimension among all faces) is a natural extreme value associated with the complex, and is closely related to other functionals defined by a maximum, such as the clique…
A likelihood function on a smooth very affine variety gives rise to a twisted de Rham complex. We show how its top cohomology vector space degenerates to the coordinate ring of the critical points defined by the likelihood equations. We…
Mining dense subgraphs is an important primitive across a spectrum of graph-mining tasks. In this work, we formally establish that two recurring characteristics of real-world graphs, namely heavy-tailed degree distributions and large…
In this note, we prove the K- and L-theoretic Farrell-Jones Conjecture with coefficients in an additive category for fundamental groups of graphs of virtually cyclic groups.