Supercritical percolation on finite transitive graphs
In Bernoulli bond percolation, each edge of some graph are chosen to be either deleted or retained independently at random with retention probability p.
Mon compte
Pas encore inscrit ?
In Bernoulli bond percolation, each edge of some graph are chosen to be either deleted or retained independently at random with retention probability p.
We will consider a stochastic dynamic matching model, in which items of different classes arrive according to independent Poisson processes...
Learning on graphs requires a graph feature representation able to discriminate among different graphs while being amenable to fast computation. The graph isomorphism problem tells us that no
We will discuss a couple of results and questions regarding the structure of large graphs. These include vertex transitive graphs, expanders and random graphs.
I will give an overview of research in the area of random directed graphs with possibly random edge weights.
Motivated by Krioukov et al.'s model of random hyperbolic graphs for real-world networks, and inspired by the analysis of a dynamic model of graphs in Euclidean space by Peres et al., we introduce a
A Poisson outdegree-one graph is a directed graph based on a marked Poisson point process such that each vertex has only one outgoing edge. We state the absence of percolation for such graphs
This talk is centered on covariant dynamics on unimodular random graphs and random networks (marked graphs), namely maps from the set of vertices to itself which are preserved by graph or
Local weak convergence of graphs, introduced by Itaï Benjamini and Oded Schramm in 2001, tries to understand the intern geometry of a typical vertex in large graphs...
Percolation is a model for propagation in porous media that as introduced in 1957 by Broadbent and Hammersley. An infinite graph G models the geometry of the situation and a parameter p
The notion of discrete alpha-stable point processes generalizes to point processes the notion of stable distribution. It has been introduced and studied by Davydov, Molchanov and Zuyev a few
We consider the classical Erdős-Rényi random graph as well as percolation on a random regular graph...