Local Large deviations for empirical locality measure of typed Random Graph Models

2017/08/13 by Kwabena Doku-Amponsah, Doku-Amponsah, Kwabena
Computer Science · Mathematics · #05C80 #60F10 #94A15 #94A24 #FOS: Computer and information sciences #Information Theory (cs.IT) #Markov Chains and Monte Carlo Methods #Stochastic processes and statistical mechanics #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.1708.03895

openalex publication_date 2017/08/13 · openalex created_date 2017/08/31 · openalex updated_date 2026/07/28

Abstract

In this article, we prove a local large deviation principle (LLDP) for the empirical locality measure of typed random networks on n nodes conditioned to have a given empirical type measure and empirical link measure. From the LLDP, we deduce a full large deviation principle for the typed random graph, and the classical Erdos-Renyi graphs, where nc/2 links are inserted at random among n nodes. No topological restrictions are required for these results.

Related

• Marked random graphs with given degree sequence: large deviations on the local topology
• Some large deviation results for near intermediate random geometric graphs
• Joint Large Deviation principle for empirical measures of the d-regular random graphs
• Large deviation principles for empirical measures of the multitype random networks
• An introduction to large deviations for random graphs