The following pages link to Nelly Litvak (Q266697):
Displaying 49 items.
- Convergence of rank based degree-degree correlations in random directed networks (Q266698) (← links)
- A scaling analysis of a cat and mouse Markov chain (Q417084) (← links)
- Efficiency evaluation for pooling resources in health care (Q427499) (← links)
- Mean field analysis of personalized PageRank with implications for local graph clustering (Q1756549) (← links)
- Routing in queues with delayed information (Q1869361) (← links)
- On a class of order pick strategies in paternosters (Q1870015) (← links)
- On the minimal travel time needed to collect \(n\) items on a circle. (Q1879896) (← links)
- An adaptive control for conflicting flows: a quantitative and numerical study of its probabilistic model (Q1881827) (← links)
- An adaptive control for conflicting flows: its probabilistic model (Q1883740) (← links)
- New ways of solving large Markov chains (Q2146386) (← links)
- Local weak convergence for PageRank (Q2180377) (← links)
- Queuing network models for panel sizing in oncology (Q2315071) (← links)
- Managing the overflow of intensive care patients (Q2464179) (← links)
- The travel time in carousel systems under the nearest item heuristic (Q2731149) (← links)
- Order picking in carusel systems under the nearest item heuristic (Q2731302) (← links)
- Some peculiarities of exponential random variables (Q2774458) (← links)
- Quick Detection of Nodes with Large Degrees (Q2900585) (← links)
- Alpha Current Flow Betweenness Centrality (Q2938020) (← links)
- PageRank in Scale-Free Random Graphs (Q2945278) (← links)
- Modelling of Trends in Twitter Using Retweet Graph Dynamics (Q2945280) (← links)
- A Singular Perturbation Approach for Choosing the PageRank Damping Factor (Q3078597) (← links)
- Proof of the Hamiltonicity-Trace Conjecture for Singularly Perturbed Markov Chains (Q3108463) (← links)
- Markov Chains and Optimality of the Hamiltonian Cycle (Q3169019) (← links)
- Upper Bounds for Number of Removed Edges in the Erased Configuration Model (Q3460739) (← links)
- Probabilistic Relation between In-Degree and PageRank (Q3520032) (← links)
- Asymptotic analysis for personalized Web search (Q3578045) (← links)
- Characterization of Tail Dependence for In-Degree and PageRank (Q3601171) (← links)
- (Q4788099) (← links)
- Blocking Probabilities in Erlang Loss Queues with Advance Reservation (Q4981821) (← links)
- Quick Detection of Nodes with Large Degrees (Q4985346) (← links)
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees (Q4985358) (← links)
- Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees (Q4985779) (← links)
- Limit theorems for assortativity and clustering in null models for scale-free networks (Q5005042) (← links)
- Locating highly connected clusters in large networks with HyperLogLog counters (Q5022511) (← links)
- Generalized PageRank on directed configuration networks (Q5357980) (← links)
- On The Minimal Travel Time Needed to Collect n Items on a Circle (Q5363259) (← links)
- Chapter 23 Applications: simple models and difficult theorems (Q5363260) (← links)
- Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient (Q5386203) (← links)
- Distribution of PageRank Mass Among Principle Components of the Web (Q5458297) (← links)
- Determining Factors Behind the PageRank Log-Log Plot (Q5458304) (← links)
- The Effect of New Links on Google Pagerank (Q5478910) (← links)
- In-Degree and PageRank: Why Do They Follow Similar Power Laws? (Q5892546) (← links)
- In-Degree and PageRank: Why Do They Follow Similar Power Laws? (Q5894139) (← links)
- A survey on performance analysis of warehouse carousel systems (Q6250931) (← links)
- Phase transitions for scaling of structural correlations in directed networks (Q6260639) (← links)
- Detecting hyperbolic geometry in networks: why triangles are not enough (Q6506013) (← links)
- Learning the mechanisms of network growth (Q6528617) (← links)
- A survey on performance analysis of warehouse carousel systems (Q6573281) (← links)
- Power-law hypothesis for PageRank on undirected graphs (Q6737105) (← links)
