SearcharxivSearch

arXiv subjects

Juan Yan

Publications and source records attributed to Juan Yan.

4 recordsLinked to original sources

Towards Reliable Social A/B Testing: Spillover-Contained Clustering with Robust Post-Experiment Analysis

A/B testing is the foundation of decision-making in online platforms, yet social products often suffer from network interference: user interactions cause treatment effects to spill over into the control group. Such spillovers bias causal estimates and undermine experimental conclusions. Existing approaches face key limitations: user-level randomization ignores network structure, while cluster-based methods often rely on general-purpose clustering that is not tailored for spillover containment and has difficulty balancing unbiasedness and statistical power at scale. We propose a spillover-contained experimentation framework with two stages. In the pre-experiment stage, we build social interaction graphs and introduce a Balanced Louvain algorithm that produces stable, size-balanced clusters while minimizing cross-cluster edges, enabling reliable cluster-based randomization. In the post-experiment stage, we develop a tailored CUPAC estimator that leverages pre-experiment behavioral covariates to reduce the variance induced by cluster-level assignment, thereby improving statistical power. Together, these components provide both structural spillover containment and robust statistical inference. We validate our approach through large-scale social sharing experiments on Kuaishou, a platform serving hundreds of millions of users. Results show that our method substantially reduces spillover and yields more accurate assessments of social strategies than traditional user-level designs, establishing a reliable and scalable framework for networked A/B testing.

cs.SI

Dynamic Coupling of Infiltration-Soil Moisture Feedback:Emergent Vegetation Patterns in a Water-Vegetation Model

We present a modified water-vegetation model to investigate the mechanistic relationship between infiltration-soil moisture feedback and vegetation pattern in arid/semi-arid ecosystems. Employing Turing pattern formation theory, we drive conditions for diffusion-induced instability and analyze spatiotemporal dynamics near Turing-Hopf bifurcation points. Our key findings include: (i) The system exhibits rich dynamics including multiple stable equilibria, supercritical/subcritical Hopf bifurcations, bubble loops of limit cycles and homoclinic bifurcations. (ii) The system admits Turing-Hopf bifurcation. Using normal form theory, we establish the existence of quasiperiodic solutions and mixedmode oscillations near critical thresholds, providing a mathematical framework for predicting nonlinear ecological regime shifts. (iii) Soil moisture feedbacks govern critical transitions between three distinct ecosystem states: uniform vegetation covering, self-organized spatial patterns (labyrinth/gapped vegetation), and bare soil state, which demonstrates that soil moisture thresholds control the final state selection in this system.

math.DS

On problems about judicious bipartitions of graphs

Bollobás and Scott [5] conjectured that every graph $G$ has a balanced bipartite spanning subgraph $H$ such that for each $v\in V(G)$, $d_H(v)\ge (d_G(v)-1)/2$. In this paper, we show that every graphic sequence has a realization for which this Bollobás-Scott conjecture holds, confirming a conjecture of Hartke and Seacrest [10]. On the other hand, we give an infinite family of counterexamples to this Bollobás-Scott conjecture, which indicates that $\lfloor (d_G(v)-1)/2\rfloor$ (rather than $(d_G(v)-1)/2$) is probably the correct lower bound. We also study bipartitions $V_1, V_2$ of graphs with a fixed number of edges. We provide a (best possible) upper bound on $e(V_1)^λ+e(V_2)^λ$ for any real $λ\geq 1$ (the case $λ=2$ is a question of Scott [13]) and answer a question of Scott [13] on $\max\{e(V_1),e(V_2)\}$.

math.CO

Antifactors of regular bipartite graphs

Let $G=(X,Y;E)$ be a bipartite graph, where $X$ and $Y$ are color classes and $E$ is the set of edges of $G$. Lov\'asz and Plummer \cite{LoPl86} asked whether one can decide in polynomial time that a given bipartite graph $G=(X,Y; E)$ admits a 1-anti-factor, that is subset $F$ of $E$ such that $d_F(v)=1$ for all $v\in X$ and $d_F(v)\neq 1$ for all $v\in Y$. Cornu\'ejols \cite{CHP} answered this question in the affirmative. Yu and Liu \cite{YL09} asked whether, for a given integer $k\geq 3$, every $k$-regular bipartite graph contains a 1-anti-factor. This paper answers this question in the affirmative.

math.CO