419 citations · 1.5k across the 24 of their papers we have counts for
4 papers · 1 filter
Scale-Free Networks Emerging from Weighted Random Graphs
Tomer Kalisky, Sameet Sreenivasan, Lidia A. Braunstein +3
We study Erdös-Rényi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights bel…
Effect of Disorder Strength on Optimal Paths in Complex Networks
Sameet Sreenivasan, Tomer Kalisky, Lidia A. Braunstein +3
We study the transition between the strong and weak disorder regimes in the scaling properties of the average optimal path in a disordered Erdős-Rényi (ER) random…
Discrepancy between Monte-Carlo Results and Analytic Values for the Average Excluded Volume of Rectangular Prisms
Sameet Sreenivasan, Don R. Baker, Gerald Paul +1
We perform Monte Carlo simulations to determine the average excluded volume <V_{ex}> of randomly oriented rectangular prisms, randomly oriented ellipsoids and randomly oriented cap…
The Approximate Invariance of the Average Number of Connections for the Continuum Percolation of Squares at Criticality
Sameet Sreenivasan, Don R. Baker, Gerald Paul +1
We perform Monte Carlo simulations to determine the average excluded area of randomly oriented squares, randomly oriented widthless sticks and aligned squares in two dim…