Abstract
We prove some exponential Chebyshev inequality and derive the large deviation principle and the law of large numbers for the graphons constructed from a sequence of Erdős–Renyi random graphs with weights. Also, we obtain a new version of the large deviation principle for the number of triangles included in an Erdős–Renyi graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
