Results 41 to 50 of about 1,157 (63)

Sharp threshold for percolation on expanders

open access: yes, 2012
We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p.
Benjamini, Itai   +3 more
core   +1 more source

A note on the component structure in random intersection graphs with tunable clustering

open access: yes, 2007
We study the component structure in random intersection graphs with tunable clustering, and show that the average degree works as a threshold for a phase transition for the size of the largest component.
Lagerås, Andreas Nordvall   +1 more
core   +3 more sources

The set chromatic number of random graphs [PDF]

open access: yes, 2015
In this paper we study the set chromatic number of a random graph $G(n,p)$ for a wide range of $p=p(n)$.
Dudek, Andrzej   +2 more
core   +2 more sources

Bipartite stable Poisson graphs on R [PDF]

open access: yes, 2012
Let red and blue points be distributed on $\mathbb{R}$ according to two independent Poisson processes $\mathcal{R}$ and $\mathcal{B}$ and let each red (blue) point independently be equipped with a random number of half-edges according to a probability ...
Deijfen, Maria, Lopes, Fabio
core   +1 more source

Special issue on statistical analysis of networks: Preface by the guest editors. [PDF]

open access: yesStat Methods Appt, 2021
Schweinberger M, Stingo FC, Vitale MP.
europepmc   +1 more source

Quasirandom Graphs and the Pantograph Equation. [PDF]

open access: yesAm Math Mon, 2021
Shapira A, Tyomkyn M.
europepmc   +1 more source

Solving the migration-recombination equation from a genealogical point of view. [PDF]

open access: yesJ Math Biol, 2021
Alberti F   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy