Abstract

AbstractIn this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our method to a model of a random intersection graph, a random graph obtained through p-bond percolation on a general d-regular graph, and a model of an inhomogeneous random graph.

Full Text

Published Version
Open DOI Link

Topics from this Paper

  • Model Of Random Graph
  • Random Graph
  • Critical Random Graphs
  • Model Of Graph
  • Large Components
    • + Show 5 more

Create a personalized feed of these topics

Get Started

Get access to 115M+ research papers

Discover from 40M+ Open access, 2M+ Pre-prints, 9.5M Topics and 32K+ Journals.

Sign Up Now! It's FREE

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Inhomogeneous Models for Random Graphs and Spreading Processes: Applications in Wireless Sensor Networks and Social Networks
  • Oct 2, 2019
Relevant
Not Relevant
The spectral analysis of random graph matrices
  • Sep 5, 2018
Relevant
Not Relevant
Automated design of random dynamic graph models
  • Jul 13, 2019
Relevant
Not Relevant
Behavior Analysis of Random Power Graphs for Optimal PMU Placement in Smart Grids
  • Oct 29, 2020
Relevant
Not Relevant
Rainbow k-connectivity of Random Bipartite Graphs
  • Acta Mathematicae Applicatae Sinica, English Series
  • Oct 1, 2020
Relevant
Not Relevant
Automated design of random dynamic graph models for enterprise computer network applications
  • Jul 13, 2019
Relevant
Not Relevant
Recent developments in exponential random graph (p*) models for social networks
  • Social Networks
  • May 1, 2007
Relevant
Not Relevant
Random Graph Modeling: A Survey of the Concepts
  • ACM Computing Surveys
  • Jan 21, 2020
Relevant
Not Relevant
Maximum cliques in graphs with small intersection number and random intersection graphs
  • Computer Science Review
  • Feb 1, 2021
Relevant
Not Relevant
Communication and security in random intersection graphs models
  • Jun 1, 2011
Relevant
Not Relevant
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
  • Carolina Digital Repository (University of North Carolina at Chapel Hill)
  • Jan 1, 2015
Relevant
Not Relevant
Sharp threshold functions via a coupling method
  • Jan 1, 2013
Relevant
Not Relevant
An introduction to exponential random graph (p*) models for social networks
  • Social Networks
  • May 1, 2007
Relevant
Not Relevant
Routing in Generalized Geometric Inhomogeneous Random Graphs
  • Jan 1, 2021
Relevant
Not Relevant
Metric Models for Random Graphs
  • Journal of Classification
  • Feb 1, 1998
Relevant
Not Relevant
READ MORE FROM

Journal of Applied Probability

Characteristics of the switch process and geometric divisibility
Open Access
  • Journal of Applied Probability
  • Nov 6, 2023
Relevant
Not Relevant
Tessellation-valued processes that are generated by cell division
  • Journal of Applied Probability
  • Nov 1, 2023
Relevant
Not Relevant
Trajectory fitting estimation for reflected stochastic linear differential equations of a large signal
  • Journal of Applied Probability
  • Oct 31, 2023
Relevant
Not Relevant
A large-deviation principle for birth–death processes with a linear rate of downward jumps
  • Journal of Applied Probability
  • Oct 31, 2023
Relevant
Not Relevant
On a time-changed variant of the generalized counting process
  • Journal of Applied Probability
  • Oct 27, 2023
Relevant
Not Relevant
The unified extropy and its versions in classical and Dempster–Shafer theories
  • Journal of Applied Probability
  • Oct 23, 2023
Relevant
Not Relevant
Aging notions, stochastic orders, and expected utilities
  • Journal of Applied Probability
  • Oct 18, 2023
Relevant
Not Relevant
Resolving an old problem on the preservation of the IFR property under the formation of -out-of- systems with discrete distributions
  • Journal of Applied Probability
  • Oct 16, 2023
Relevant
Not Relevant
Central limit theorem in complete feedback games
Open Access
  • Journal of Applied Probability
  • Oct 16, 2023
Relevant
Not Relevant
Stochastic ordering results on the duration of the gambler’s ruin game
  • Journal of Applied Probability
  • Oct 6, 2023
Relevant
Not Relevant