시간: 11:30~12:30 Simplicial complexes as a generalization of graphs have been studied in high-dimensional combinatorics. Simplicial networks emerged due to demands for considering interactions among more than two vertices. This thesis covers both combinatorial aspects of simplicial complexes and applications to simplicial networks. We present combinatorial formulas for simplicial complexes concerning spanning trees. We provide tools for analyzing simplicial networks based on electrical networks.