Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Probability-graphons: Limits of large dense weighted graphs (2312.15935v1)

Published 26 Dec 2023 in cs.DM and math.PR

Abstract: We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of subgraph sampling converge. The edge-weights are taken from a general Polish space, which also covers the case of decorated graphs. Here, graphs can be either directed or undirected. Starting from a distance $d_m$ inducing the weak topology on measures, we define a cut distance on probability-graphons, making it a Polish space, and study the properties of this cut distance. In particular, we exhibit a tightness criterion for probability-graphons related to relative compactness in the cut distance. We also prove that under some conditions on the distance $d_m$, which are satisfied for some well-know distances like the Prohorov distance, and the Fortet-Mourier and Kantorovitch-Rubinstein norms, the topology induced by the cut distance on the spaceof probability-graphons is independent from the choice of $d_m$. Eventually, we prove that this topology coincides with the topology induced by the convergence in distribution of the sampled subgraphs.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (50)
  1. Structural vulnerability of the North American power grid. Physical Review E, 69(2):025103, February 2004.
  2. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47–97, January 2002.
  3. Graph Limit for Interacting Particle Systems on Weighted Random Graphs, July 2023.
  4. Flooding in Weighted Sparse Random Graphs. SIAM Journal on Discrete Mathematics, 27(1):1–26, January 2013.
  5. The diameter of weighted random graphs. The Annals of Applied Probability, 25(3), June 2015.
  6. Weighted random-geometric and random-rectangular graphs: Spectral and eigenfunction properties of the adjacency matrix. Journal of Complex Networks, 6(5):753–766, October 2018.
  7. Opinion dynamics on graphon: The piecewise constant case. Applied Mathematics Letters, 133:108227, November 2022.
  8. The GHP scaling limit of uniform spanning trees in high dimensions, April 2022.
  9. Graphons: A Nonparametric Method to Model, Estimate, and Design Algorithms for Massive Networks. In Proceedings of the 2017 ACM Conference on Economics and Computation, pages 665–672, Cambridge Massachusetts USA, June 2017. ACM.
  10. Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Advances in Mathematics, 219(6):1801–1851, December 2008.
  11. Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Annals of Mathematics, 176(1):151–219, July 2012.
  12. Patrick Billingsley. Convergence of Probability Measures. Wiley, New York, second edition edition, 1999.
  13. The Cut Metric, Random Graphs, and Branching Processes. Journal of Statistical Physics, 140(2):289–335, July 2010.
  14. Vladimir I. Bogachev. Measure Theory Vol. 1, volume 1. Springer, Berlin ; New York, 2007.
  15. Vladimir I. Bogachev. Measure Theory Vol. 2, volume 2. Springer, Berlin ; New York, 2007.
  16. Vladimir I. Bogachev. Weak Convergence of Measures. Number volume 234 in Mathematical Surveys and Monographs. American Mathematical Society, Providence, Rhode Island, 2018.
  17. Stefan Bornholdt and Hans Georg Schuster, editors. Handbook of Graphs and Networks: From the Genome to the Internet. Wiley, 1 edition, November 2002.
  18. First passage percolation on random graphs with finite mean degrees. The Annals of Applied Probability, 20(5), October 2010.
  19. An infinite-dimensional metapopulation SIS model. Journal of Differential Equations, 313:1–53, March 2022.
  20. Measurable sets of measures. Pacific Journal of Mathematics, 14(4):1211–1222, December 1964.
  21. Epidemics and Rumours in Complex Networks. Number 369 in London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge ; New York, 2010.
  22. Markov processes: characterization and convergence, volume 282. John Wiley & Sons, 2009.
  23. Ryszard Engelking. General topology. Number 6 in Sigma series in pure mathematics. Heldermann, Berlin, rev. and completed ed edition, 1989.
  24. Reflection positivity, rank connectivity, and homomorphism of graphs. Journal of the American Mathematical Society, 20(1):37–51, April 2006.
  25. Multicolour containers and the entropy of decorated graph limits, July 2016.
  26. Diego Garlaschelli. The weighted random graph model. New Journal of Physics, 11(7):073005, July 2009.
  27. On Watts’ cascade model with random link weights. Journal of Complex Networks, 1(1):25–43, June 2013.
  28. The local limit of the uniform spanning tree on dense graphs. Journal of Statistical Physics, 173(3-4):502–545, November 2018.
  29. A. Humphreys and Stephen Simpson. Separable Banach space theory needs strong set existence axioms. Transactions of the American Mathematical Society, 348(10):4231–4255, 1996.
  30. Random minimum spanning tree and dense graph limits, October 2023.
  31. Graphon mean-field control for cooperative multi-agent reinforcement learning. Journal of the Franklin Institute, September 2023.
  32. Svante Janson. Graphons, cut norm and distance, couplings and rearrangements. New York Journal of Mathematics, 4, March 2013.
  33. Recovering communities in weighted stochastic block models. In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 1308–1315, Monticello, IL, September 2015. IEEE.
  34. Olav Kallenberg. Foundations of modern probability. Probability and its Applications (New York). Springer-Verlag, New York, second edition, 2002.
  35. Olav Kallenberg. Random Measures, Theory and Applications, volume 77 of Probability Theory and Stochastic Modelling. Springer International Publishing, Cham, 2017.
  36. Multigraph limits, unbounded kernels, and Banach space decorated graphs. Journal of Functional Analysis, 282(2):109284, January 2022.
  37. Mathematics of Epidemics on Networks: From Exact to Approximate Models, volume 46 of Interdisciplinary Applied Mathematics. Springer International Publishing, Cham, 2017.
  38. What functions can Graph Neural Networks compute on random graphs? The role of Positional Encoding, May 2023.
  39. Network Science: Theory and Practice. Wiley, Hoboken, NJ, 2009.
  40. Reconstruction in the labeled stochastic block model. In 2013 IEEE Information Theory Workshop (ITW), pages 1–5, Sevilla, Spain, September 2013. IEEE.
  41. László Lovász. Large networks and graph limits, volume 60. American Mathematical Society, Colloquium Publications, 2012.
  42. Limits of dense graph sequences. Journal of Combinatorial Theory, Series B, 96(6):933–957, November 2006.
  43. Limits of compact decorated graphs, October 2010.
  44. A Label-State Formulation of Stochastic Graphon Games and Approximate Equilibria on Large Networks. Mathematics of Operations Research, page moor.2022.1329, November 2022.
  45. M. E. J. Newman. The Structure and Function of Complex Networks. SIAM Review, 45(2):167–256, January 2003.
  46. Robert Purves. Bimeasurable functions. Fund. Math., 58:149–157, 1966.
  47. Veeravalli S. Varadarajan. Weak convergence of measures on separable metric spaces. Sankhyā: The Indian Journal of Statistics (1933-1960), 19(1/2):15–22, 1958.
  48. Optimal rates for community estimation in the weighted stochastic block model. The Annals of Statistics, 48(1), February 2020.
  49. Edge label inference in generalized stochastic block models: from spectral theory to impossibility results. In Maria Florina Balcan, Vitaly Feldman, and Csaba Szepesvári, editors, Proceedings of The 27th Conference on Learning Theory, volume 35 of Proceedings of Machine Learning Research, pages 903–920, Barcelona, Spain, 13–15 Jun 2014. PMLR.
  50. Optimal cluster recovery in the labeled stochastic block model. In D. Lee, M. Sugiyama, U. Luxburg, I. Guyon, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 29. Curran Associates, Inc., 2016.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now