We construct a strongly local regular Dirichlet form on the golden ratio Sierpinski gasket, which is a self-similar set without a finitely ramified cell structure, via a study on the trace of an electrical network on an infinite graph. The Dirichlet form is the unique one that is self-similar in the sense of an infinite iterated function system, and is decimation invariant with respect to a graph-directed construction. The proof is based on a fixed point problem of a renormalization map, inspired by Sabot's celebrated work for finitely ramified fractals. Lastly, the Hunt process associated with the Dirichlet form satisfies a two-sided sub-Gaussian heat kernel estimate.

Let $G$ be an infinite graph on countably many vertices and let $\unicode[STIX]{x1D6EC}$ be a closed, infinite set of real numbers. We establish the existence of an unbounded self-adjoint operator whose graph is $G$ and whose spectrum is $\unicode[STIX]{x1D6EC}$.

We define a growing model of random graphs. Given a sequence of non-negative integers {dn}n=0∞ with the property that di≤i, we construct a random graph on countably infinitely many vertices v0, v1… by the following process: vertex vi is connected to a subset of {v0, …, vi−1} of cardinality di chosen uniformly at random. We study the resulting probability space. In particular, we give a new characterization of random graphs, and we also give probabilistic methods for constructing infinite random trees.

In this paper, we consider the (essential) spectrum of the discrete Laplacian of an infinite graph. We introduce a new quantity for an infinite graph, in terms of which we give new lower bound estimates of the (essential) spectrum and give also upper bound estimates when the infinite graph is bipartite. We give sharp estimates of the (essential) spectrum for several examples of infinite graphs.