Finite approximation for unimodular random networks

DOI10.1360/N012017-00073zbMATH Open1499.05583OpenAlexW2943016286WikidataQ127959899 ScholiaQ127959899MaRDI QIDQ5064080FDOQ5064080

Authors: Kai-Nan Xiang 

Publication date: 21 March 2022

Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1360/n012017-00073

Recommendations

• Processes on unimodular random networks
• Large networks and graph limits
• On limits of sparse random graphs
• Structural limits and approximations of mappings
• On the density of triangles and squares in regular finite and unimodular random graphs

zbMATH Keywords

graph limitfinite approximationlocal limitunimodular random network

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15)

Cited In (2)

• On optimal random nets
• Sup-norm approximation bounds for networks through probabilistic methods

This page was built for publication: Finite approximation for unimodular random networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5064080)