相关论文: The evolution of the permutahedron

We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the…

Majority bootstrap percolation on a graph $G$ is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have more infected than non-infected…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

The location and nature of the percolation transition in random networks is a subject of intense interest. Recently, a series of graph evolution processes have been introduced that lead to discontinuous percolation transitions where the…

Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…

We investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth $\mathscr{G}$ satisfying…

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…

Due to their conceptual and mathematical simplicity, Erd\"os-R\'enyi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely…

Independent sets in graphs, i.e., subsets of vertices where no two are adjacent, have long been studied, for instance as a model of hard-core gas. The $d$-dimensional hypercube, $\{0,1\}^d$, with the nearest neighbor structure, has been a…

We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called "rank 1…

We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…

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…

We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

We study higher-dimensional homological analogues of bond percolation on a square lattice and site percolation on a triangular lattice. By taking a quotient of certain infinite cell complexes by growing sublattices, we obtain finite cell…

We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…

We study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly…

Paul Erd\H{o}s and Alfred Renyi considered the evolution of the random graph G(n,p) as p ``evolved'' from 0 to 1. At p=1/n a sudden and dramatic change takes place in G. When p=c/n with c<1 the random G consists of small components, the…

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…

Correlations are known to play a crucial role in determining the structure of complex networks. Here we study how their presence affects the computation of the percolation threshold in random hypergraphs. In order to mimic the correlation…