
arXiv: 2502.17285
A rooted network consists of a connected, locally finite graph G , equipped with edge conductances and a distinguished vertex o . A nonnegative function on the vertices of G which vanishes at o , has Laplacian 1 at o , and is harmonic at all other vertices is called a potential. We prove that every infinite recurrent rooted network admits a potential tending to infinity. This is an analogue of classical theorems due to Evans and Nakai in the settings of Euclidean domains and Riemannian surfaces.
rooted network, Mathematics - Analysis of PDEs, Probability (math.PR), Random graphs (graph-theoretic aspects), edge conductances, FOS: Mathematics, Small world graphs, complex networks (graph-theoretic aspects), Mathematics - Probability, Analysis of PDEs (math.AP)
rooted network, Mathematics - Analysis of PDEs, Probability (math.PR), Random graphs (graph-theoretic aspects), edge conductances, FOS: Mathematics, Small world graphs, complex networks (graph-theoretic aspects), Mathematics - Probability, Analysis of PDEs (math.AP)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
