Haoran Luo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Haoran Luo has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
József Balogh
8 shared publications- Fan Cheng
School of Cryptology, East China Normal University, Shanghai, China
3 shared publications - Heng Yu
Key Laboratory of Biorheological Science and Technology (Ministry of Education), Chongqing University, Chongqing, 400044, China; College of Bioengineering, Chongqing University, Chongqing, 400044, China
3 shared publications - József Balogh
Department of Mathematics and University of Illinois Urbana-Champaign Urbana IL USA
3 shared publications - Yuqi Yi
Department of Computer Science and Engineering, MoE Key Laboratory of Artificial Intelligence, AI Institute, Shanghai Jiao Tong University, Shanghai, China
3 shared publications - Igor Araujo
University of Illinois at Urbana-Champaign
2 shared publications
Latest Publications
- 14 January 2026
- Published by Elsevier in Computational Geometry
- Vol. 133
Maximum number of points in general position in a random subset of finite 3-dimensional spaces
- 14 January 2026
- Published by Elsevier in Computational Geometry
- Vol. 133
Maximum number of points in general position in a random subset of finite 3-dimensional spaces
- 13 June 2025
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 175, 1-28
Non-degenerate hypergraphs with exponentially many extremal constructions
- 13 June 2025
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 175, 1-28
Non-degenerate hypergraphs with exponentially many extremal constructions
- 3 April 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (8)
On the maximum number of r-cliques in graphs free of complete r-partite subgraphs
- 3 April 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (8)
On the maximum number of r-cliques in graphs free of complete r-partite subgraphs
- 6 December 2024
- Published by Wiley in Random Structures & Algorithms
- Vol. 66 (1)
On the Maximum F$ F $‐Free Induced Subgraphs in Kt$ {K}_t $‐Free GraphsFor graphs and , let be the minimum possible size of a maximum ‐free induced subgraph in an ‐vertex ‐free graph. This notion generalizes the Ramsey function and the Erdős–Rogers function. Establishing a container lemma for the ‐free subgraphs, we give a general upper bound on , assuming the existence of certain locally dense ‐free graphs. In particular, we prove that for every graph with , where , we have For the cases where is a complete multipartite graph, letting , we prove that We also make an observation which improves the bounds of by a polylogarithmic factor.
- 6 December 2024
- Published by Wiley in Random Structures & Algorithms
- Vol. 66 (1)
On the Maximum F$ F $‐Free Induced Subgraphs in Kt$ {K}_t $‐Free GraphsFor graphs and , let be the minimum possible size of a maximum ‐free induced subgraph in an ‐vertex ‐free graph. This notion generalizes the Ramsey function and the Erdős–Rogers function. Establishing a container lemma for the ‐free subgraphs, we give a general upper bound on , assuming the existence of certain locally dense ‐free graphs. In particular, we prove that for every graph with , where , we have For the cases where is a complete multipartite graph, letting , we prove that We also make an observation which improves the bounds of by a polylogarithmic factor.
- 17 April 2024
- Published by Springer Nature in Combinatorica
- Vol. 44 (5) , 949-976
Turán Density of Long Tight Cycle Minus One Hyperedge
- 17 April 2024
- Published by Springer Nature in Combinatorica
- Vol. 44 (5) , 949-976
Turán Density of Long Tight Cycle Minus One Hyperedge
- Open Access
- 12 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 9123-9137
Probabilistic Temporal Fusion Transformers for Large-Scale KPI Anomaly Detection
This paper introduces a new generic and scalable framework for large-scale time series prediction and unsupervised anomaly detection. The most common approach of state-of-the-art time series anomaly detection techniques, which are mostly based on neural networks, is to train a network per time series. However, a typical modern microservice system consists of hundreds of active nodes/instances. To monitor the performance of such a system, we often need to keep track of thousands of time series describing different aspects of the system, including CPU usage, call latency, and workloads. We introduce a new methodology for grouping metrics that share the same type, predicting hundreds of metrics concurrently with a single neural network model with shared parameters. The model also integrates the probabilistic representations and Temporal Fusion Transformers for better performance. In a real-world dataset, our proposed model achieved up to 50% improvement in terms of MSE.
- 12 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 9123-9137
Open AccessProbabilistic Temporal Fusion Transformers for Large-Scale KPI Anomaly Detection
This paper introduces a new generic and scalable framework for large-scale time series prediction and unsupervised anomaly detection. The most common approach of state-of-the-art time series anomaly detection techniques, which are mostly based on neural networks, is to train a network per time series. However, a typical modern microservice system consists of hundreds of active nodes/instances. To monitor the performance of such a system, we often need to keep track of thousands of time series describing different aspects of the system, including CPU usage, call latency, and workloads. We introduce a new methodology for grouping metrics that share the same type, predicting hundreds of metrics concurrently with a single neural network model with shared parameters. The model also integrates the probabilistic representations and Temporal Fusion Transformers for better performance. In a real-world dataset, our proposed model achieved up to 50% improvement in terms of MSE.
- Open Access
- 6 October 2023
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (4) , P4.22
On the Maximum $F_5$-Free Subhypergraphs of a Random Hypergraph
Denote by $F_5$ the $3$-uniform hypergraph on vertex set $\{1,2,3,4,5\}$ with hyperedges $\{123,124,345\}$. Balogh, Butterfield, Hu, and Lenz proved that if $p > K \log n /n$ for some large constant $K$, then every maximum $F_5$-free subhypergraph of $G^3(n,p)$ is tripartite with high probability, and showed that if $p_0 = 0.1\sqrt{\log n} /n$, then with high probability there exists a maximum $F_5$-free subhypergraph of $G^3(n,p_0)$ that is not tripartite. In this paper, we sharpen the upper bound to be best possible up to a constant factor. We prove that if $p > C \sqrt{\log n} /n $ for some large constant $C$, then every maximum $F_5$-free subhypergraph of $G^3(n, p)$ is tripartite with high probability.- 6 October 2023
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (4) , P4.22
Open AccessOn the Maximum $F_5$-Free Subhypergraphs of a Random Hypergraph
Denote by $F_5$ the $3$-uniform hypergraph on vertex set $\{1,2,3,4,5\}$ with hyperedges $\{123,124,345\}$. Balogh, Butterfield, Hu, and Lenz proved that if $p > K \log n /n$ for some large constant $K$, then every maximum $F_5$-free subhypergraph of $G^3(n,p)$ is tripartite with high probability, and showed that if $p_0 = 0.1\sqrt{\log n} /n$, then with high probability there exists a maximum $F_5$-free subhypergraph of $G^3(n,p_0)$ that is not tripartite. In this paper, we sharpen the upper bound to be best possible up to a constant factor. We prove that if $p > C \sqrt{\log n} /n $ for some large constant $C$, then every maximum $F_5$-free subhypergraph of $G^3(n, p)$ is tripartite with high probability. - Open Access
On the Maximum $F_5$-free Subhypergraphs of a Random Hypergraph
Denote by $F_5$ the $3$-uniform hypergraph on vertex set $\{1,2,3,4,5\}$ with hyperedges $\{123,124,345\}$. Balogh, Butterfield, Hu, and Lenz proved that if $p > K \log n / n$ for some large constant $K$, then every maximum $F_5$-free subhypergraph of $G^3(n,p)$ is tripartite with high probability, and showed that if $p_0 = 0.1\sqrt{\log n} / n$, then with high probability there exists a maximum $F_5$-free subhypergraph of $G^3(n,p_0)$ that is not tripartite. In this paper, we sharpen the upper bound to be best possible up to a constant factor. We prove that if $p > C \sqrt{\log n} / n $ for some large constant $C$, then every maximum $F_5$-free subhypergraph of $G^3(n, p)$ is tripartite with high probability.Open AccessOn the Maximum $F_5$-free Subhypergraphs of a Random Hypergraph
Denote by $F_5$ the $3$-uniform hypergraph on vertex set $\{1,2,3,4,5\}$ with hyperedges $\{123,124,345\}$. Balogh, Butterfield, Hu, and Lenz proved that if $p > K \log n / n$ for some large constant $K$, then every maximum $F_5$-free subhypergraph of $G^3(n,p)$ is tripartite with high probability, and showed that if $p_0 = 0.1\sqrt{\log n} / n$, then with high probability there exists a maximum $F_5$-free subhypergraph of $G^3(n,p_0)$ that is not tripartite. In this paper, we sharpen the upper bound to be best possible up to a constant factor. We prove that if $p > C \sqrt{\log n} / n $ for some large constant $C$, then every maximum $F_5$-free subhypergraph of $G^3(n, p)$ is tripartite with high probability. - 13 June 2023
- Published by Springer Nature in Combinatorica
- Vol. 43 (6) , 1-22
Maximal 3-Wise Intersecting Families
- 13 June 2023
- Published by Springer Nature in Combinatorica
- Vol. 43 (6) , 1-22
Maximal 3-Wise Intersecting Families
- Open Access
Non-degenerate Hypergraphs with Exponentially Many Extremal Constructions
For every integer $t \ge 0$, denote by $F_5^t$ the hypergraph on vertex set $\{1,2,\ldots, 5+t\}$ with hyperedges $\{123,124\} \cup \{34k : 5 \le k \le 5+t\}$. We determine $\mathrm{ex}(n,F_5^t)$ for every $t\ge 0$ and sufficiently large $n$ and characterize the extremal $F_5^t$-free hypergraphs. In particular, if $n$ satisfies certain divisibility conditions, then the extremal $F_5^t$-free hypergraphs are exactly the balanced complete tripartite hypergraphs with additional hyperedges inside each of the three parts $(V_1,V_2,V_3)$ in the partition; each part $V_i$ spans a $(|V_i|,3,2,t)$-design. This generalizes earlier work of Frankl and F\"uredi on the Tur\'an number of $F_5:=F_5^0$. Our results extend a theory of Erd\H{o}s and Simonovits about the extremal constructions for certain fixed graphs. In particular, the hypergraphs $F_5^{6t}$, for $t\geq 1$, are the first examples of hypergraphs with exponentially many extremal constructions and positive Tur\'an density.Open AccessNon-degenerate Hypergraphs with Exponentially Many Extremal Constructions
For every integer $t \ge 0$, denote by $F_5^t$ the hypergraph on vertex set $\{1,2,\ldots, 5+t\}$ with hyperedges $\{123,124\} \cup \{34k : 5 \le k \le 5+t\}$. We determine $\mathrm{ex}(n,F_5^t)$ for every $t\ge 0$ and sufficiently large $n$ and characterize the extremal $F_5^t$-free hypergraphs. In particular, if $n$ satisfies certain divisibility conditions, then the extremal $F_5^t$-free hypergraphs are exactly the balanced complete tripartite hypergraphs with additional hyperedges inside each of the three parts $(V_1,V_2,V_3)$ in the partition; each part $V_i$ spans a $(|V_i|,3,2,t)$-design. This generalizes earlier work of Frankl and F\"uredi on the Tur\'an number of $F_5:=F_5^0$. Our results extend a theory of Erd\H{o}s and Simonovits about the extremal constructions for certain fixed graphs. In particular, the hypergraphs $F_5^{6t}$, for $t\geq 1$, are the first examples of hypergraphs with exponentially many extremal constructions and positive Tur\'an density.