Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Fraiman, Nicolas"'
Influence propagation in social networks is a central problem in modern social network analysis, with important societal applications in politics and advertising. A large body of work has focused on cascading models, viral marketing, and finite-horiz
Externí odkaz:
http://arxiv.org/abs/2407.00213
We provide a rearrangement based algorithm for fast detection of subgraphs of $k$ vertices with long escape times for directed or undirected networks. Complementing other notions of densest subgraphs and graph cuts, our method is based on the mean hi
Externí odkaz:
http://arxiv.org/abs/2212.12839
We propose and analyze a mathematical model for the evolution of opinions on directed complex networks. Our model generalizes the popular DeGroot and Friedkin-Johnsen models by allowing vertices to have attributes that may influence the opinion dynam
Externí odkaz:
http://arxiv.org/abs/2209.00969
Autor:
Carlson, Charlie, Davies, Ewan, Fraiman, Nicolas, Kolla, Alexandra, Potukuchi, Aditya, Yap, Corrine
Publikováno v:
Combinator. Probab. Comp. 33 (2024) 487-517
We give algorithms for approximating the partition function of the ferromagnetic $q$-color Potts model on graphs of maximum degree $d$. Our primary contribution is a fully polynomial-time approximation scheme for $d$-regular graphs with an expansion
Externí odkaz:
http://arxiv.org/abs/2204.01923
Autor:
Fraiman, Nicolas, Li, Zichao
In this paper, we present and prove some consistency results about the performance of classification models using a subset of features. In addition, we propose to use beam search to perform feature selection, which can be viewed as a generalization o
Externí odkaz:
http://arxiv.org/abs/2203.04350
In this paper we consider a variant of the well-known Achlioptas process for graphs adapted to monotone Boolean functions. Fix a number of choices $r\in \mathbb N$ and a sequence of increasing functions $(f_n)_{n\ge 1}$ such that, for every $n\ge 1$,
Externí odkaz:
http://arxiv.org/abs/2109.13079
Autor:
Fraiman, Nicolas, Li, Zichao
In this paper, we develop a new classification method based on nearest centroid, and it is called the nearest disjoint centroid classifier. Our method differs from the nearest centroid classifier in the following two aspects: (1) the centroids are de
Externí odkaz:
http://arxiv.org/abs/2109.10436
In 1985, Frieze showed that the expected sum of the edge weights of the minimum spanning tree (MST) in the uniformly weighted graph converges to $\zeta(3)$. Recently, Hino and Kanazawa extended this result to a uniformly weighted simplicial complex,
Externí odkaz:
http://arxiv.org/abs/2012.14122
We propose two numerical schemes for approximating quasi-stationary distributions (QSD) of finite state Markov chains with absorbing states. Both schemes are described in terms of certain interacting chains in which the interaction is given in terms
Externí odkaz:
http://arxiv.org/abs/2010.09942
For a directed graph $G(V_n, E_n)$ on the vertices $V_n = \{1,2, \dots, n\}$, we study the distribution of a Markov chain $\{ {\bf R}^{(k)}: k \geq 0\}$ on $\mathbb{R}^n$ such that the $i$th component of ${\bf R}^{(k)}$, denoted $R_i^{(k)}$, correspo
Externí odkaz:
http://arxiv.org/abs/2010.09596