human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "high dimensional random walks and colorful expansion"
  Abstract: Random walks on bounded degree expander graphs have numerous applications, both in theoretical and practical computational problems. A key property of these walks is that they converge rapidly to their stationary distribution. #R##N#In this work we {\em define high order random walks}: These are generalizations of random walks on graphs to high dimensional simplicial complexes, which are the high dimensional analogues of graphs. A simplicial complex of dimension $d$ has vertices, edges, triangles, pyramids, up to $d$-dimensional cells. For any $0 \leq i < d$, a high order random walk on dimension $i$ moves between neighboring $i$-faces (e.g., edges) of the complex, where two $i$-faces are considered neighbors if they share a common $(i+1)$-face (e.g., a triangle). The case of $i=0$ recovers the well studied random walk on graphs. #R##N#We provide a {\em local-to-global criterion} on a complex which implies {\em rapid convergence of all high order random walks} on it. Specifically, we prove that if the $1$-dimensional skeletons of all the links of a complex are spectral expanders, then for {\em all} $0 \le i < d$ the high order random walk on dimension $i$ converges rapidly to its stationary distribution. #R##N#We derive our result through a new notion of high dimensional combinatorial expansion of complexes which we term {\em colorful expansion}. This notion is a natural generalization of combinatorial expansion of graphs and is strongly related to the convergence rate of the high order random walks. #R##N#We further show an explicit family of {\em bounded degree} complexes which satisfy this criterion. Specifically, we show that Ramanujan complexes meet this criterion, and thus form an explicit family of bounded degree high dimensional simplicial complexes in which all of the high order random walks converge rapidly to their stationary distribution.

Connected through hyperedge HE-1 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model"):
  with members:
    - "improved analysis of higher order random walks and applications"
    - "log concave polynomials ii high dimensional walks and an fpras for counting bases of a matroid"
    - "convergence of mcmc and loopy bp in the tree uniqueness region for the hard core model"
    - "computing the independence polynomial from the tree threshold down to the roots"
    - "spatial mixing and the connective constant optimal bounds"
    - "spatial mixing and approximation algorithms for graphs with bounded connective constant"
    - "improved bounds on the phase transition for the hard core model in 2 dimensions"
    - "correlation decay up to uniqueness in spin systems"

Connected through hyperedge HE-2 (induced by source paper "improved analysis of higher order random walks and applications"):
  with members:
    - "approximating constraint satisfaction problems on high dimensional expanders"
    - "high dimensional expanders from expanders"
    - "agreement testing theorems on layered set systems"
    - "log concave polynomials ii high dimensional walks and an fpras for counting bases of a matroid"
    - "walking on the edge and cosystolic expansion"
    - "high dimensional expanders and property testing"

Connected through hyperedge HE-3 (induced by source paper "approximating constraint satisfaction problems on high dimensional expanders"):
  with members:
    - "agreement testing theorems on layered set systems"
    - "good distance lattices from high dimensional expanders"
    - "log concave polynomials ii high dimensional walks and an fpras for counting bases of a matroid"
    - "sum of squares lower bounds for refuting any csp"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "a new regularity lemma and faster approximation algorithms for low threshold rank graphs"
    - "faster sdp hierarchy solvers for local rounding algorithms"
    - "rounding semidefinite programming hierarchies via global correlation"

Connected through hyperedge HE-4 (induced by source paper "agreement testing theorems on layered set systems"):
  with members:
    - "approximating constraint satisfaction problems on high dimensional expanders"
    - "small set expansion in shortcode graph and the 2 to 2 conjecture"
    - "log concave polynomials ii high dimensional walks and an fpras for counting bases of a matroid"
    - "cube vs cube low degree test"
    - "high dimensional expanders and property testing"

Connected through hyperedge HE-5 (induced by source paper "high dimensional expanders from expanders"):
  with members:
    - "log concave polynomials ii high dimensional walks and an fpras for counting bases of a matroid"

Connected through hyperedge HE-6 (induced by source paper "log concave polynomials ii high dimensional walks and an fpras for counting bases of a matroid"):
  with members:
    - "approximately counting bases of bicircular matroids"
    - "log concave polynomials i entropy and a deterministic approximation algorithm for counting bases of matroids"
    - "monte carlo markov chain algorithms for sampling strongly rayleigh distributions and determinantal point processes"
    - "random cluster dynamics for the ising model is rapidly mixing"
    - "approximating the tutte polynomial of a binary matroid and other related combinatorial polynomials"
    - "the complexity of computing the sign of the tutte polynomial"
    - "inapproximability of the tutte polynomial of a planar graph"
    - "approximating the partition function of the ferromagnetic potts model"

Connected through hyperedge HE-7 (induced by source paper "walking on the edge and cosystolic expansion"):
  with members:
    - "high dimensional expanders and property testing"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CC(Computational Complexity)