

<feed xmlns="http://www.w3.org/2005/Atom">
  <id>http://localhost:4000/</id>
  <title>Haipeng Ding</title>
  <subtitle>A minimal, responsive and feature-rich Jekyll theme for technical writing.</subtitle>
  <updated>2025-11-10T10:59:30+08:00</updated>
  <author>
    <name>Haipeng Ding</name>
    <uri>http://localhost:4000/</uri>
  </author>
  <link rel="self" type="application/atom+xml" href="http://localhost:4000/feed.xml"/>
  <link rel="alternate" type="text/html" hreflang="en"
    href="http://localhost:4000/"/>
  <generator uri="https://jekyllrb.com/" version="4.3.4">Jekyll</generator>
  <rights> © 2025 Haipeng Ding </rights>
  <icon>/assets/img/favicons/favicon.ico</icon>
  <logo>/assets/img/favicons/favicon-96x96.png</logo>


  
  <entry>
    <title>Navigation Page</title>
    <link href="http://localhost:4000/posts/navigation-page/" rel="alternate" type="text/html" title="Navigation Page" />
    <published>2025-01-21T17:09:00+08:00</published>
  
    <updated>2025-01-21T17:09:00+08:00</updated>
  
    <id>http://localhost:4000/posts/navigation-page/</id>
    <content type="text/html" src="http://localhost:4000/posts/navigation-page/" />
    <author>
      <name>Haipeng_Ding</name>
    </author>

  
    
    <category term="Tutorial" />
    
    <category term="Navigation" />
    
  

  <summary>This is a forever pinned page, and will fastly lead you to what you are interested in, both in and out of this site.</summary>

  </entry>

  
  <entry>
    <title>Spectral and Algebraic Graph Theory Ch16 - The Lovàsz-Simonovits Approach to Random Walks</title>
    <link href="http://localhost:4000/posts/Spectral-and-Algebraic-Graph-Theory-Ch16-The-Lov%C3%A0sz-Simonovits-Approach-to-Random-Walks/" rel="alternate" type="text/html" title="Spectral and Algebraic Graph Theory Ch16 - The Lovàsz-Simonovits Approach to Random Walks" />
    <published>2022-11-07T15:35:00+08:00</published>
  
    <updated>2022-11-07T15:35:00+08:00</updated>
  
    <id>http://localhost:4000/posts/Spectral-and-Algebraic-Graph-Theory-Ch16-The-Lov%C3%A0sz-Simonovits-Approach-to-Random-Walks/</id>
    <content type="text/html" src="http://localhost:4000/posts/Spectral-and-Algebraic-Graph-Theory-Ch16-The-Lov%C3%A0sz-Simonovits-Approach-to-Random-Walks/" />
    <author>
      <name>Haipeng_Ding</name>
    </author>

  
    
    <category term="Blogging" />
    
    <category term="Readings" />
    
  

  <summary>本期专栏为 “谱图理论” 系列的第16期，将介绍耶鲁大学教授、两届哥德尔奖得主 Daniel A. Spielman 所著图书 
《Spectral and Algebraic Graph Theory》 电子版链接 第十六章 The Lovàsz - Simonovits Approach to Random Walks 中的内容。

本期作者 | 丁海鹏，中国人民大学高瓴人工智能学院

16.1 引入

在介绍本章内容之前，首先引入一个新定义。对于向量 \(\mathbf{f}\) 和整数 \(k\)，定义 \(\mathbf{f}\{k\}\) 为 \(\mathbf{f}\) 中最大的 \(k\) 个分量的和。特别地，\(\mathbf{f}\{0\}=0\). 若写成更严格的符号化定义，对于 \(n\) 维向量 \(\mathbf{f}\)，构造排列 \(\pi\) 使得
...</summary>

  </entry>

  
  <entry>
    <title>Spectral and Algebraic Graph Theory Ch15 - Tutte's Theorem - How to draw a graph</title>
    <link href="http://localhost:4000/posts/Spectral-and-Algebraic-Graph-Theory-Ch15-Tutte's-Theorem-How-to-draw-a-graph/" rel="alternate" type="text/html" title="Spectral and Algebraic Graph Theory Ch15 - Tutte&amp;apos;s Theorem - How to draw a graph" />
    <published>2022-10-31T09:42:00+08:00</published>
  
    <updated>2022-10-31T09:42:00+08:00</updated>
  
    <id>http://localhost:4000/posts/Spectral-and-Algebraic-Graph-Theory-Ch15-Tutte's-Theorem-How-to-draw-a-graph/</id>
    <content type="text/html" src="http://localhost:4000/posts/Spectral-and-Algebraic-Graph-Theory-Ch15-Tutte's-Theorem-How-to-draw-a-graph/" />
    <author>
      <name>Haipeng_Ding</name>
    </author>

  
    
    <category term="Blogging" />
    
    <category term="Readings" />
    
  

  <summary>本期专栏为 “谱图理论” 系列的第15期，将介绍耶鲁大学教授、两届哥德尔奖得主 Daniel A. Spielman 所著图书 
《Spectral and Algebraic Graph Theory》 电子版链接 第十五章 Tutte’s Theorem: How to draw a graph 中的内容。

本期作者 | 丁海鹏，中国人民大学高瓴人工智能学院

15.0 概要
塔特定理介绍了如何利用弹簧网络嵌入来获得一个\(3\)-连通平面图的平面嵌入。当我们选定一个平面图的面，并将该面相关联的结点都固定在一个平面上，弹簧网络的性质告诉我们所有未被固定的点都处于它所相邻节点的重心位置（边原长为0，且所有边具有相同的弹性系数），即其邻居节点的位置均值。而塔特证明了，此方法对于一个\(3\)-连通图，将产生一个正确的平面嵌入（示例如下图）。



15.1 \(3\)-连通图，平面...</summary>

  </entry>

</feed>


