activity
20122021
most citedA generalized Polya's urn with graph based interactions

44 citations · 53 across the 5 of their papers we have counts for

collaborators

5 papers

cs.IT2021★ 6 cited

Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity

Lei Yu, Venkat Anantharam, Jun Chen

In this paper, we study the type graph, namely, a bipartite graph induced by a joint type. We investigate the maximum edge density of induced bipartite subgraphs of this graph havi…

math.PR2014★ 1 cited

Vertex-reinforced random walk on Z with sub-square-root weights is recurrent

Jun Chen, Gady Kozma

We prove that vertex-reinforced random walk on the integers with weight of order k to the power alpha, for alpha in [0, 1/2), is recurrent. This confirms a conjecture of Volkov for…

math.PR2013★ 2 cited

A generalized Pólya's Urn with graph based interactions: convergence at linearity

Jun Chen, Cyrille Lucas

We consider a special case of the generalized Pólya's urn model introduced by Benaim et al (2013). Given a finite connected graph , place a bin at each vertex. Two bins are call…

math.PR2012★ 44 cited

A generalized Polya's urn with graph based interactions

Michel Benaim, Itai Benjamini, Jun Chen +1

Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a p…

math.PR2012

A Class of Multi-particle Reinforced Interacting Random Walks

Jun Chen

We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite o…