id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_t5ywgdkj2zf2vla3p2ylgicvhe	Frédérique Oggier	A split-and-transfer flow based entropic centrality	2019	21	.pdf	application/pdf	11819	1400	73	The contribution of this paper is to propose a split-andtransfer flow model for entropic centrality, where at every node, the flow can actually be transfer entropic centrality set-up for the ease of computation, and carry out three case transfer entropic centrality over a graph with suitable equivalent edge probabilities (which The transfer entropic centrality CH(v1) of v1 is computed using (1), for a uniform edge probabilities on graph edges and (3) prove that computing the split-and-transfer entropic centrality104 can be reduced to transfer entropic centrality over a graph with suitable equivalent edge probabilities105 Consider the network shown on Figure 1a and assume that the probability of an indivisible flow going114 Figure 1 The transfer entropic centrality CH (v1) of v1 is computed using (1), for a uniform edge distribution (the choice of an edge at a given vertex is chosen uniformly at random among choices of unvisited neighbors) in (A), and for a non-uniform distribution in (B).	./cache/work_t5ywgdkj2zf2vla3p2ylgicvhe.pdf	./txt/work_t5ywgdkj2zf2vla3p2ylgicvhe.txt