Abstract
The notion of p-modulus of a family of objects on a graph is a measure of the richness of such families. We develop the notion of minimal subfamilies using the method of Lagrangian duality for p-modulus. We show that minimal subfamilies have at most |E| elements and that these elements carry a weight related to their “importance” in relation to the corresponding p-modulus problem. When \(p=2\), this measure of importance is in fact a probability measure and modulus can be thought as trying to minimize the expected overlap in the family.
Similar content being viewed by others
References
Ahlfors, L.-V. 1973. Conformal invariants: topics in geometric function theory. New York: McGraw-Hill.
Albin, N., M. Brunner, R. Perez, P. Poggi-Corradini, and N. Wiens. 2015. Modulus on graphs as a generalization of standard graph theoretic quantities. Conform. Geom. Dyn. 19: 298–317.
Albin, N., Darabi Sahneh, F., Goering, M., and Poggi-Corradini, P. Modulus of families of walks on graphs. (Preprint).
Badger, M. 2013. Beurling’s criterion and extremal metrics for Fuglede modulus. Ann. Acad. Sci. Fenn. Math. 38(2): 677–689.
Doyle, P.G., and J.L. Snell. 1984. Random walks and electric networks., Carus mathematical monographs Washington, DC: Mathematical Association of America.
Duffin, R. 1962. The extremal length of a network. Journal of Mathematical Analysis and Applications 5(2): 200–215.
Goering, M., Albin, N., Sahneh, F., Scoglio, C., and Poggi-Corradini, P. 2015. Numerical investigation of metrics for epidemic processes on graphs. 1317–1322. 2015 49th Asilomar Conference on Signals, Systems and Computers.
Goldfarb, D., and A. Idnani. 1983. A numerically stable dual method for solving strictly convex quadratic programs. Math. Programming 27(1): 1–33.
Harris, J.M., J.L. Hirst, and M.J. Mossinghoff. 2008. Combinatorics and graph theory, 2nd ed. New York: Undergraduate Texts in Mathematics. Springer.
Heinonen, J. 2001. Lectures on analysis on metric spaces. New York: Universitext. Springer-Verlag.
Lyons, R., and Peres, Y. 2016. Probability on Trees and Networks. Cambridge: Cambridge University Press. http://pages.iu.edu/~rdlyons/.
Rockafellar, R. T. 1970. Convex analysis. Princeton: Princeton University Press.
Schramm, O. 1993. Square tilings with prescribed combinatorics. Israel Journal of Mathematics 84(1–2): 97–118.
Shakeri, H., Poggi-Corradini, P., Scoglio, C., and Albin, N. Generalized network measures based on modulus of families of walks. Journal of Computational and Applied Mathematics (2016).
Acknowledgments
Research partially supported by NSF Grants DMS-1201427 and DMS-1515810.
Author information
Authors and Affiliations
Corresponding author
Additional information
On the occasion of David Minda’s retirement.
Rights and permissions
About this article
Cite this article
Albin, N., Poggi-Corradini, P. Minimal subfamilies and the probabilistic interpretation for modulus on graphs. J Anal 24, 183–208 (2016). https://doi.org/10.1007/s41478-016-0002-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s41478-016-0002-9