All Stories

  1. Right-most position of a last progeny modified time inhomogeneous branching random walk
  2. A new approach to Pólya urn schemes and its infinite color generalization
  3. Strong convergence of infinite color balanced urns under uniform ergodicity
  4. Linear de-preferential urn models
  5. Pólya urn schemes with infinitely many colors
  6. On the expected total number of infections for virus spread on a finite network
  7. Random walks in I.I.D. random environment on Cayley trees
  8. Rate of convergence and large deviation for the infinite color Pólya urn schemes
  9. On the nearest-neighbor algorithm for the mean-field traveling salesman problem
  10. On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem
  11. On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem
  12. Variance estimation for tree-order restricted models
  13. The connectivity threshold of random geometric graphs with Cantor distributed vertices
  14. Endogeny for the Logistic Recursive Distributional Equation
  15. On the One Dimensional "Learning from Neighbours" Model
  16. On the cluster size distribution for percolation on some general graphs
  17. Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
  18. Counting without sampling
  19. A survey of max-type recursive distributional equations
  20. How to Combine Fast Heuristic Markov Chain Monte Carlo with Slow Exact Sampling