Related papers: Giants through higher-order paths in random simpli…
Various different random graph models have been proposed in which the vertices of the graph are seen as members of a metric space, and edges between vertices are determined as a function of the distance between the corresponding metric…
We consider a contact process on $Z^d$ with two species that interact in a symbiotic manner. Each site can either be vacant or occupied by individuals of species $A$ and/or $B$. Multiple occupancy by the same species at a single site is…
We investigate simplicial complexes deterministically growing from a single vertex. In the first step, a vertex and an edge connecting it to the primordial vertex are added. The resulting simplicial complex has a 1-dimensional simplex and…
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…
We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large-deviation…
Two models of a random digraph on $n$ vertices, $D(n,\text{Prob}(\text{arc})=p)$ and $D(n,\text{number of arcs}=m)$ are studied. In 1990, Karp for $D(n,p)$ and independently T. \L uczak for $D(n,m=cn)$ proved that for $c>1$, with…
A complex system with many interacting individuals can be represented by a network consisting of nodes and links representing individuals and pairwise interactions, respectively. However, real-world systems grow with time and include many…
A random graph process, $\Gorg[1](n)$, is a sequence of graphs on $n$ vertices which begins with the edgeless graph, and where at each step a single edge is added according to a uniform distribution on the missing edges. It is well known…
It is well known that the branching process approach to the study of the random graph $G_{n,p}$ gives a very simple way of understanding the size of the giant component when it is fairly large (of order $\Theta(n)$). Here we show that a…
We consider bond percolation on the $d$-dimensional binary hypercube with $p=c/d$ for fixed $c>1$. We prove that the typical diameter of the giant component $L_1$ is of order $\Theta(d)$, and the typical mixing time of the lazy random walk…
We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly sublinear in the number of vertices. In this…
We introduce a novel percolation model that generalizes the classical Random Connection Model (RCM) to a random simplicial complex, allowing for a more refined understanding of connectivity and emergence of large-scale structures in random…
The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…
In this paper we study the notion of critical dimension of random simplicial complexes in the general multi-parameter model described in our previous papers of this series. This model includes as special cases the Linial-Meshulam-Wallach…
We study the different quantum phases that occur in massive ${\cal N}=2$ supersymmetric QCD with gauge groups $SU(2)$ and $SU(3)$ as the coupling $\Lambda/M$ is gradually increased from 0 to infinity. The phases can be identified by…
We establish central and local limit theorems for the number of vertices in the largest component of a random $d$-uniform hypergraph $\hnp$ with edge probability $p=c/\binnd$, where $(d-1)^{-1}+\eps<c<\infty$. The proof relies on a new,…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is extended to include the possibility of creating and annihilating random walkers. Steady-state…
We study the following preferential attachment variant of the classical Erdos-Renyi random graph process. Starting with an empty graph on n vertices, new edges are added one-by-one, and each time an edge is chosen with probability roughly…
This article introduces a novel, geometric approach for multi-manifold clustering (MMC), i.e. for clustering a collection of potentially intersecting, d-dimensional manifolds into the individual manifold components. We first compute a…