Searcharxiv⌕ Search

arXiv subjects

Fan Wei

Publications and source records attributed to Fan Wei.

At least 37 records · Page 2Linked to original sources

Constructing a Norm for Children's Scientific Drawing: Distribution Features Based on Semantic Similarity of Large Language Models

The use of children's drawings to examining their conceptual understanding has been proven to be an effective method, but there are two major problems with previous research: 1. The content of the drawings heavily relies on the task, and the ecological validity of the conclusions is low; 2. The interpretation of drawings relies too much on the subjective feelings of the researchers. To address this issue, this study uses the Large Language Model (LLM) to identify 1420 children's scientific drawings (covering 9 scientific themes/concepts), and uses the word2vec algorithm to calculate their semantic similarity. The study explores whether there are consistent drawing representations for children on the same theme, and attempts to establish a norm for children's scientific drawings, providing a baseline reference for follow-up children's drawing research. The results show that the representation of most drawings has consistency, manifested as most semantic similarity>0.8. At the same time, it was found that the consistency of the representation is independent of the accuracy (of LLM's recognition), indicating the existence of consistency bias. In the subsequent exploration of influencing factors, we used Kendall rank correlation coefficient to investigate the effects of "sample size", "abstract degree", and "focus points" on drawings, and used word frequency statistics to explore whether children represented abstract themes/concepts by reproducing what was taught in class. It was found that accuracy (of LLM's recognition) is the most sensitive indicator, and data such as sample size and semantic similarity are related to it; The consistency between classroom experiments and teaching purpose is also an important factor, many students focus more on the experiments themselves rather than what they explain.

cs.CL↗

On Domination Exponents for Pairs of Graphs

Understanding graph density profiles is notoriously challenging. Even for pairs of graphs, complete characterizations are known only in very limited cases, such as edges versus cliques. This paper explores a relaxation of the graph density profile problem by examining the homomorphism density domination exponent $C(H_1, H_2)$. This is the smallest real number $c \geq 0$ such that $t(H_1, T) \geq t(H_2, T)^c$ for all target graphs $T$ (if such a $c$ exists) where $t(H,T)$ is the homomorphism density from $H$ to $T$. We demonstrate that infinitely many families of graphs are required to realize $C(H_1, H_2)$ for all connected graphs $H_1$, $H_2$. We derive the homomorphism density domination exponent for a variety of graph pairs, including paths and cycles. As a couple of typical examples, we obtain exact values when $H_1$ is an even cycle and $H_2$ contains a Hamiltonian cycle, and provide asymptotically sharp bounds when both $H_1$ and $H_2$ are odd cycles.

math.CO↗

An Improved Physically-Based Surface Triangulation Method

This paper proposes improvements to the physically-based surface triangulation method, bubble meshing. The method simulates physical bubbles to automatically generate mesh vertices, resulting in high-quality Delaunay triangles. Despite its flexibility in local mesh size control and the advantage of local re-meshing, bubble meshing is constrained by high computational costs and slow convergence on complex surfaces. The proposed approach employs conformal mapping to simplify surface bubble packing by flattening the surface onto a plane. Surface triangulation is induced from the planar mesh, avoiding direct bubble movement on the surface. Optimizing bubble quantity control and separating it from the relaxation process accelerates convergence, cutting computation time by over 70%. The enhanced method enables efficient triangulation of disk topology surfaces, supports local size control, curvature adaptation, and re-meshing of discrete surfaces. Keywords: Adaptive triangulation, Surface remeshing, Bubble meshing, Conformal parameterization, Algorithm efficiency

cs.CG↗

Density Measures for Language Generation

The recent successes of large language models (LLMs) have led to a surge of theoretical research into language generation. A recent line of work proposes an abstract view, called language generation in the limit, where generation is seen as a game between an adversary and an algorithm: the adversary generates strings from an unknown language $K$, chosen from a countable collection of candidate languages, and after seeing a finite set of these strings, the algorithm must generate new strings from $K$ that it has not seen before. This formalism highlights a key tension: the trade-off between validity (the algorithm should only produce strings from the language) and breadth (it should be able to produce many strings from the language). This trade-off is central in applied language generation as well, where it appears as a balance between hallucination (generating invalid utterances) and mode collapse (generating only a restricted set of outputs). Despite its importance, this trade-off has been challenging to study quantitatively. We develop ways to quantify this trade-off by formalizing breadth using measures of density. Existing algorithms for language generation in the limit produce output sets that can have zero density in the true language, and this important failure of breadth might seem unavoidable. We show, however, that such a failure is not necessary: we provide an algorithm for language generation in the limit whose outputs have strictly positive density in $K$. We also study the internal representations built by these algorithms, specifically the sequence of hypothesized candidate languages they consider, and show that achieving the strongest form of breadth may require oscillating indefinitely between high- and low-density representations. Our analysis introduces a novel topology on language families, with notions of convergence and limit points playing a key role.

math.CO↗

Undecidability of polynomial inequalities in tournaments

Many fundamental problems in extremal combinatorics are equivalent to proving certain polynomial inequalities in graph homomorphism densities. In 2011, a breakthrough result by Hatami and Norine showed that it is undecidable to verify polynomial inequalities in graph homomorphism densities. Recently, Blekherman, Raymond and Wei extended this result by showing that it is also undecidable to determine the validity of polynomial inequalities in homomorphism densities for weighted graphs with edge weights taking real values. These two results resolved a question of Lovász. In this paper, we consider the problem of determining the validity of polynomial inequalities in digraph homomorphism densities for tournaments. We prove that the answer to this problem is also undecidable.

math.CO↗

Non-bipartite k-common graphs

A graph H is k-common if the number of monochromatic copies of H in a k-edge-coloring of K_n is asymptotically minimized by a random coloring. For every k, we construct a connected non-bipartite k-common graph. This resolves a problem raised by Jagger, Stovicek and Thomason [Combinatorica 16 (1996), 123-141]. We also show that a graph H is k-common for every k if and only if H is Sidorenko and that H is locally k-common for every k if and only if H is locally Sidorenko.

math.CO↗

The binomial random graph is a bad inducer

For a finite graph $F$ and a value $p \in [0,1]$, let $I(F,p)$ denote the largest $y$ for which there is a sequence of graphs of edge density approaching $p$ so that the induced $F$-density of the sequence approaches $y$. We show that for all $F$ on at least three vertices and all $p \in (0,1)$, the binomial random graph $G(n,p)$ has induced $F$-density strictly less than $I(F,p).$ This provides a negative answer to a problem posed by Liu, Mubayi and Reiher. Our approach is in the limiting setting of graphons, and we in fact show a stronger result: the binomial random graph is never a \emph{local} maximum in the space of graphons of edge density $p$. This is done by finding a sequence of balanced perturbations of arbitrarily small norm that increase the $F$-density.

math.CO↗

Extremal number of cliques of given orders in graphs with a forbidden clique minor

Alon and Shikhelman initiated the systematic study of a generalization of the extremal function. Motivated by algorithmic applications, the study of the extremal function $\text{ex}(n, K_k, K_t\text{-minor})$, i.e., the number of cliques of order $k$ in $K_t$-minor free graphs on $n$ vertices, has received much attention. In this paper, we determine essentially sharp bounds on the maximum possible number of cliques of order $k$ in a $K_t$-minor free graph on $n$ vertices. More precisely, we determine a function $C(k,t)$ such that for each $k < t$ with $t-k\gg \log_2 t$, every $K_t$-minor free graph on $n$ vertices has at most $ n C(k, t)^{1+o_t(1)}$ cliques of order $k$. We also show this bound is sharp by constructing a $K_t$-minor-free graph on $n$ vertices with $C(k, t) n$ cliques of order $k$. This bound answers a question of Wood and Fox-Wei asymptotically up to $o_t(1)$ in the exponent except the extreme values when $k$ is very close to $t$.

math.CO↗

Common graphs with arbitrary chromatic number

Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. In 1962, Erdos conjectured that the random 2-edge-coloring minimizes the number of monochromatic copies of K_k, and the conjecture was extended by Burr and Rosta to all graphs. In the late 1980s, the conjectures were disproved by Thomason and Sidorenko, respectively. A classification of graphs whose number of monochromatic copies is minimized by the random 2-edge-coloring, which are referred to as common graphs, remains a challenging open problem. If Sidorenko's Conjecture, one of the most significant open problems in extremal graph theory, is true, then every 2-chromatic graph is common, and in fact, no 2-chromatic common graph unsettled for Sidorenko's Conjecture is known. While examples of 3-chromatic common graphs were known for a long time, the existence of a 4-chromatic common graph was open until 2012, and no common graph with a larger chromatic number is known. We construct connected k-chromatic common graphs for every k. This answers a question posed by Hatami, Hladky, Kral, Norine and Razborov [Combin. Probab. Comput. 21 (2012), 734-742], and a problem listed by Conlon, Fox and Sudakov [London Math. Soc. Lecture Note Ser. 424 (2015), 49-118, Problem 2.28]. This also answers in a stronger form the question raised by Jagger, Stovicek and Thomason [Combinatorica 16, (1996), 123-131] whether there exists a common graph with chromatic number at least four.

math.CO↗

An Asymptotically Sharp Bound on the Maximum Number of Independent Transversals

Let $G$ be a multipartite graph with partition $V_1, V_2,\ldots, V_k$ of $V(G)$. Let $d_{i,j}$ denote the edge density of the pair $(V_i, V_j)$. An independent transversal is an independent set of $G$ with exactly one vertex in each $V_i$. In this paper, we prove an asymptotically sharp upper bound on the maximum number of independent transversals given the $d_{i,j}$'s.

math.CO↗

The limit points of the top and bottom eigenvalues of regular graphs

We prove that for each $d \geq 3$ the set of all limit points of the second largest eigenvalue of growing sequences of $d$-regular graphs is $[2\sqrt{d-1},d]$. A similar argument shows that the set of all limit points of the smallest eigenvalue of growing sequences of $d$-regular graphs with growing (odd) girth is $[-d, -2 \sqrt{d-1}]$. The more general question of identifying all vectors which are limit points of the vectors of the top $k$ eigenvalues of sequences of $d$-regular graphs is considered as well. As a by product, in the study of discrete counterpart of the "scarring" phenomenon observed in the investigation of quantum ergodicity on manifolds, our technique provides a method to construct $d$-regular almost Ramanujan graphs with large girth and localized eigenvectors corresponding to eigenvalues larger than $2\sqrt{d-1}$, strengthening a result of Alon, Ganguly, and Srivastava.

math.CO↗

Phase Transition of Degeneracy in Minor-Closed Families

Given an infinite family ${\mathcal G}$ of graphs and a monotone property ${\mathcal P}$, an (upper) threshold for ${\mathcal G}$ and ${\mathcal P}$ is a "fastest growing" function $p: \mathbb{N} \to [0,1]$ such that $\lim_{n \to \infty} \Pr(G_n(p(n)) \in {\mathcal P})= 1$ for any sequence $(G_n)_{n \in \mathbb{N}}$ over ${\mathcal G}$ with $\lim_{n \to \infty}\lvert V(G_n) \rvert = \infty$, where $G_n(p(n))$ is the random subgraph of $G_n$ such that each edge remains independently with probability $p(n)$. In this paper we study the upper threshold for the family of $H$-minor free graphs and for the graph property of being $(r-1)$-degenerate, which is one fundamental graph property with many applications. Even a constant factor approximation for the upper threshold for all pairs $(r,H)$ is expected to be very difficult by its close connection to a major open question in extremal graph theory. We determine asymptotically the thresholds (up to a constant factor) for being $(r-1)$-degenerate for a large class of pairs $(r,H)$, including all graphs $H$ of minimum degree at least $r$ and all graphs $H$ with no vertex-cover of size at most $r$, and provide lower bounds for the rest of the pairs of $(r,H)$. The results generalize to arbitrary proper minor-closed families and the properties of being $r$-colorable, being $r$-choosable, or containing an $r$-regular subgraph, respectively.

math.CO↗

Threshold Ramsey multiplicity for paths and even cycles

The Ramsey number $r(H)$ of a graph $H$ is the minimum integer $n$ such that any two-coloring of the edges of the complete graph $K_n$ contains a monochromatic copy of $H$. While this definition only asks for a single monochromatic copy of $H$, it is often the case that every two-edge-coloring of the complete graph on $r(H)$ vertices contains many monochromatic copies of $H$. The minimum number of such copies over all two-colorings of $K_{r(H)}$ will be referred to as the threshold Ramsey multiplicity of $H$. Addressing a problem of Harary and Prins, who were the first to systematically study this quantity, we show that there is a positive constant $c$ such that the threshold Ramsey multiplicity of a path or an even cycle on $k$ vertices is at least $(ck)^k$. This bound is tight up to the constant $c$. We prove a similar result for odd cycles in a companion paper.

math.CO↗

Undecidability of polynomial inequalities in weighted graph homomorphism densities

Many problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights. Using the theory of graph limits, we can equivalently evaluate polynomial expressions in homomorphism densities on kernels $W$, i.e., symmetric, bounded, and measurable functions $W$ from $[0,1]^2 \to \mathbb{R}$. In 2011, Hatami and Norin proved a fundamental result that it is undecidable to determine the validity of polynomial inequalities in homomorphism densities for graphons (i.e., the case where the range of $W$ is $[0,1]$, which corresponds to unweighted graphs, or equivalently, to graphs with edge weights between $0$ and $1$). The corresponding problem for more general sets of kernels, e.g., for all kernels or for kernels with range $[-1,1]$, remains open. For any $a > 0$, we show undecidability of polynomial inequalities for any set of kernels which contains all kernels with range $\{0,a\}$. This result also answers a question raised by Lovász about finding computationally effective certificates for the validity of homomorphism density inequalities in kernels.

math.CO↗

On the asymptotic confirmation of the Faudree-Lehel Conjecture for general graphs

Given a simple graph $G$, the {\it irregularity strength} of $G$, denoted by $s(G)$, is the least positive integer $k$ such that there is a weight assignment on edges $f: E(G) \to \{1,2,\dots, k\}$ attributing distinct weighted degrees: $\tilde f(v):= \sum_{u: \{u,v\}\in E(G)} f(\{u,v\})$ to all vertices $v\in V(G)$. It is straightforward that $s(G) \geq n/d$ for every $d$-regular graph $G$ on $n$ vertices with $d>1$. In 1987, Faudree and Lehel conjectured in turn that there is an absolute constant $c$ such that $s(G) \leq n/d + c$ for all such graphs. Even though the conjecture has remained open in almost all relevant cases, it is more generally believed that there exists a universal constant $c$ such that $s(G) \leq n/δ+ c$ for every graph $G$ on $n$ vertices with minimum degree $δ\geq 1$ which does not contain an isolated edge. In this paper we confirm that the generalized Faudree-Lehel Conjecture holds for graphs with $δ\geq n^β$ where $β$ is any fixed constant larger than $0.8$. Furthermore, we confirm that the conjecture holds in general asymptotically. That is we prove that for any $\varepsilon\in(0,0.25)$ there exist absolute constants $c_1, c_2$ such that for all graphs $G$ on $n$ vertices with minimum degree %at least $δ\geq 1$ and without isolated edges, $s(G) \leq \frac{n}δ(1+\frac{c_1}{δ^{\varepsilon}})+c_2$, thus extending in various aspects and strengthening a recent result of Przybyło, who showed that $s(G) \leq \frac{n}{d}(1+ \frac{1}{\ln^{ε/19}n})=\frac{n}{d}(1+o(1))$ for $d$-regular graphs with $d\in [\ln^{1+ε} n, n/\ln^εn]$, and improving an earlier general upper bound: $s(G)< 6\frac{n}δ+6$ of Kalkowski, Karoński and Pfender.

math.CO↗

Short proof of the asymptotic confirmation of the Faudree-Lehel Conjecture

Given a simple graph $G$, the {\it irregularity strength} of $G$, denoted $s(G)$, is the least positive integer $k$ such that there is a weight assignment on edges $f: E(G) \to \{1,2,\dots, k\}$ for which each vertex weight $f^V(v):= \sum_{u: \{u,v\}\in E(G)} f(\{u,v\})$ is unique amongst all $v\in V(G)$. In 1987, Faudree and Lehel conjectured that there is a constant $c$ such that $s(G) \leq n/d + c$ for all $d$-regular graphs $G$ on $n$ vertices with $d>1$, whereas it is trivial that $s(G) \geq n/d$. In this short note we prove that the Faudree-Lehel Conjecture holds when $d \geq n^{0.8+ε}$ for any fixed $ε>0$, with a small additive constant $c=28$ for $d$ large enough. Furthermore, we confirm the conjecture asymptotically by proving that for any fixed $β\in(0,1/4)$ there is a constant $C$ such that for all $d$-regular graphs $G$, $s(G) \leq \frac{n}{d}(1+\frac{C}{d^β})+28$, extending and improving a recent result of Przybyło that $s(G) \leq \frac{n}{d}(1+ \frac{1}{\ln^{ε/19}n})$ whenever $d\in [\ln^{1+ε} n, n/\ln^εn]$ and $d$ is large enough.

math.CO↗

Threshold Ramsey multiplicity for odd cycles

The Ramsey number $r(H)$ of a graph $H$ is the minimum $n$ such that any two-coloring of the edges of the complete graph $K_n$ contains a monochromatic copy of $H$. The threshold Ramsey multiplicity $m(H)$ is then the minimum number of monochromatic copies of $H$ taken over all two-edge-colorings of $K_{r(H)}$. The study of this concept was first proposed by Harary and Prins almost fifty years ago. In a companion paper, the authors have shown that there is a positive constant $c$ such that the threshold Ramsey multiplicity for a path or even cycle with $k$ vertices is at least $(ck)^k$, which is tight up to the value of $c$. Here, using different methods, we show that the same result also holds for odd cycles with $k$ vertices.

math.CO↗

Irregular Subgraphs

We suggest two related conjectures dealing with the existence of spanning irregular subgraphs of graphs. The first asserts that any $d$-regular graph on $n$ vertices contains a spanning subgraph in which the number of vertices of each degree between $0$ and $d$ deviates from $\frac{n}{d+1}$ by at most $2$. The second is that every graph on $n$ vertices with minimum degree $δ$ contains a spanning subgraph in which the number of vertices of each degree does not exceed $\frac{n}{δ+1}+2$. Both conjectures remain open, but we prove several asymptotic relaxations for graphs with a large number of vertices $n$. In particular we show that if $d^3 \log n \leq o(n)$ then every $d$-regular graph with $n$ vertices contains a spanning subgraph in which the number of vertices of each degree between $0$ and $d$ is $(1+o(1))\frac{n}{d+1}$. We also prove that any graph with $n$ vertices and minimum degree $δ$ contains a spanning subgraph in which no degree is repeated more than $(1+o(1))\frac{n}{δ+1}+2$ times.

math.CO↗