Infinite paths and cliques in random graphs

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages

Scientific paper

We study some percolation problems on the complete graph over $\mathbf N$. In
particular, we give sharp sufficient conditions for the existence of (finite or
infinite) cliques and paths in a random subgraph. No specific assumption on the
probability, such as independency, is made. The main tools are a topological
version of Ramsey theory, exchangeability theory and elementary ergodic theory.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Infinite paths and cliques in random graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Infinite paths and cliques in random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite paths and cliques in random graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-603906

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.