The large deviation principle for the Erdős-Rényi random graph

2011/10/01 by Sourav Chatterjee, S.R.S. Varadhan · 3 citations

paper · doi:10.1016/j.ejc.2011.03.014

Cited by

• polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs
• Using dense graph limit theory to count cocycles of random simplicial complexes
• Urn Modeling of Random Graphs Across Granularity Scales: A Framework for Origin-Destination Human Mobility Networks