Zobrazeno 1 - 10
of 207
pro vyhledávání: '"Peng, Richard"'
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be exponentially smal
Externí odkaz:
http://arxiv.org/abs/2409.10022
Autor:
Mang, Qiuyang, Chen, Jingbang, Zhou, Hangrui, Gao, Yu, Zhou, Yingli, Peng, Richard, Fang, Yixiang, Ma, Chenhao
Bipartite graphs are ubiquitous in many domains, e.g., e-commerce platforms, social networks, and academia, by modeling interactions between distinct entity sets. Within these graphs, the butterfly motif, a complete 2*2 biclique, represents the simpl
Externí odkaz:
http://arxiv.org/abs/2406.00344
Signed networks, characterized by edges labeled as either positive or negative, offer nuanced insights into interaction dynamics beyond the capabilities of unsigned graphs. Central to this is the task of identifying the maximum balanced subgraph, cru
Externí odkaz:
http://arxiv.org/abs/2402.05006
Autor:
Brand, Jan van den, Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Gutenberg, Maximilian Probst, Sachdeva, Sushant, Sidford, Aaron
We provide an algorithm which, with high probability, maintains a $(1-\epsilon)$-approximate maximum flow on an undirected graph undergoing $m$-edge additions in amortized $m^{o(1)} \epsilon^{-3}$ time per update. To obtain this result, we provide a
Externí odkaz:
http://arxiv.org/abs/2311.03174
Autor:
Peng, Richard1 (AUTHOR) yangp@cs.cmu.edu, Vempala, Santosh S.2 (AUTHOR) vempala@gatech.edu
Publikováno v:
Communications of the ACM. Jul2024, Vol. 67 Issue 7, p79-86. 8p.
Autor:
Brand, Jan van den, Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Gutenberg, Maximilian Probst, Sachdeva, Sushant, Sidford, Aaron
We give a deterministic $m^{1+o(1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities. As a consequence, we obtain the first run
Externí odkaz:
http://arxiv.org/abs/2309.16629
We analyze union-find using potential functions motivated by continuous algorithms, and give alternate proofs of the $O(\log\log{n})$, $O(\log^{*}n)$, $O(\log^{**}n)$, and $O(\alpha(n))$ amortized cost upper bounds. The proof of the $O(\log\log{n})$
Externí odkaz:
http://arxiv.org/abs/2308.09021
The $\textit{Abelian Sandpile}$ model is a well-known model used in exploring $\textit{self-organized criticality}$. Despite a large amount of work on other aspects of sandpiles, there have been limited results in efficiently computing the terminal s
Externí odkaz:
http://arxiv.org/abs/2307.07711
Autor:
Wu, Yiran, Jia, Feiran, Zhang, Shaokun, Li, Hangyu, Zhu, Erkang, Wang, Yue, Lee, Yin Tat, Peng, Richard, Wu, Qingyun, Wang, Chi
Employing Large Language Models (LLMs) to address mathematical problems is an intriguing research endeavor, considering the abundance of math problems expressed in natural language across numerous science and engineering fields. LLMs, with their gene
Externí odkaz:
http://arxiv.org/abs/2306.01337
We analyze the bit complexity of efficient algorithms for fundamental optimization problems, such as linear regression, $p$-norm regression, and linear programming (LP). State-of-the-art algorithms are iterative, and in terms of the number of arithme
Externí odkaz:
http://arxiv.org/abs/2304.02124