Proves first-order asymptotics for reachable-set size and community proportions plus tree-like structure of the induced subgraph in the temporal stochastic block model under logarithmic degree.
Tail bounds for sums of geometric and exponential variables.Statistics & Probability Letters, 135:1–6, 2018
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
New O(n(K log(Kn) + γ n)/Φ²) expected convergence bound for discrete incremental voting on graphs with conductance Φ, plus w.h.p. convergence to rounded average for certain regular expanders.
citing papers explorer
-
The temporal stochastic block model
Proves first-order asymptotics for reachable-set size and community proportions plus tree-like structure of the induced subgraph in the temporal stochastic block model under logarithmic degree.
-
Discrete Incremental Voting: New Bounds for General Graphs and Expanders
New O(n(K log(Kn) + γ n)/Φ²) expected convergence bound for discrete incremental voting on graphs with conductance Φ, plus w.h.p. convergence to rounded average for certain regular expanders.