Related papers: Random Simplicial Complexes in the Medial Regime
Asymptotic normality is frequently observed in large combinatorial structures, rigorously established for many quantities such as cycles or inversions in random permutations, the number of prime factors of random integers, and various…
This manuscript collects three independent works: arXiv:1902.03805, arXiv:1906.04444, with Antonio Lerario and arXiv:2103.10853, together with some additional results, observations, examples and comments, some of which were taken up in the…
An important question in statistical network analysis is how to estimate models of discrete and dependent network data with intractable likelihood functions, without sacrificing computational scalability and statistical guarantees. We…
The special limit of the totally asymmetric zero range process of the low-dimensional non-equilibrium statistical mechanics described by the non-Hermitian Hamiltonian is considered. The calculation of the conditional probabilities of the…
Modularity is a quantity which has been introduced in the context of complex networks in order to quantify how close a network is to an ideal modular network in which the nodes form small interconnected communities that are joined together…
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
We study when co-evolving (or adaptive) higher-order networks defined on directed hypergraphs admit a simplicial description. Binary and triadic couplings are modelled by time-dependent weight tensors. Using representation theory of the…
We show that extremely simple systems of a not too large number of particles can be simultane- ously thermally stable and complex. To such an end, we extend the statistical complexity's notion to simple configurations of non-interacting…
We give, as $L$ grows to infinity, an explicit lower bound of order $L^{n/m}$ for the expected Betti numbers of the vanishing locus of a random linear combination of eigenvectors of $P$ with eigenvalues below $L$. Here, $P$ denotes an…
The Chiral Random Matrix Model or the Gaussian Penner Model (generalized Laguerre ensemble) is re-examined in the light of the results which have been found in double well matrix models [D97,BD99] and subtleties discovered in the single…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
Graphs are ubiquitous to model the irregular (non-Euclidean) structure of complex data, but they are limited to pairwise relationships and fail to model the complexities of the datasets exhibiting higher-order interactions. In that context,…
We provide dual algorithms for sampling the space of abstract simplicial complexes on a fixed number of vertices. We develop a generative and descriptive sampler designed with heuristics to help balance the combinatorial multiplicities of…
Random simplices and more general random convex bodies of dimension $p$ in $\mathbb{R}^n$ with $p\leq n$ are considered, which are generated by random vectors having an elliptical distribution. In the high-dimensional regime, that is, if…
We study the topology of a random cubical complex associated to Bernoulli site percolation on a cubical grid. We begin by establishing a limit law for homotopy types. More precisely, looking within an expanding window, we define a sequence…
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…
It is known that the numerical invariants Betti numbers and Bass numbers are worthwhile tools for decoding a large amount of information about modules over commutative rings. We highlight this fact, further, by establishing some criteria…
Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…
Linial-Meshulam complex is a random simplicial complex on $n$ vertices with a complete $(d-1)$-dimensional skeleton and $d$-simplices occurring independently with probability p. Linial-Meshulam complex is one of the most studied…
Let $L$ be a simplicial complex. In this paper, we study random sub-hypergraphs and random sub-complexes of $L$. By considering the minimal complex that a sub-hypergraph can be embedded in and the maximal complex that can be embedded in a…