Jnaneshwar Baslingker

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Hadamard powers of some positive matrices 2016 Tanvi Jain
2
+ On fractional Hadamard powers of positive definite matrices 1977 Carl H. Fitzgerald
Roger A. Horn
2
+ Positive definite functions on spheres 1942 I. J. Schoenberg
2
+ Complete characterization of Hadamard powers preserving Loewner positivity, monotonicity, and convexity 2014 Dominique Guillot
Apoorva Khare
Bala Rajaratnam
2
+ A Course in Metric Geometry 2001 Dmitri Burago
Yuri Burago
S. V. Ivanov
1
+ PDF Chat A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces 2013 Romain Abraham
Jean‐François Delmas
Patrick Hoscheit
1
+ Integral Inequalities for Convex Functions of Operators on Martingales 2011 Burgess Davis
Renming Song
1
+ PDF Chat Limit Distributions and Random Trees Derived from the Birthday Problem with Unequal Probabilities 2000 Michael Camarri
Jim Pitman
1
+ PDF Chat Monotonicity for entrywise functions of matrices 2009 Fumio Hiai
1
+ Positivity Preserving Hadamard Matrix Functions 2007 Rajendra Bhatia
L. Elsner
1
+ PDF Chat Cycle structure of percolation on high-dimensional tori 2014 Remco van der Hofstad
Artëm Sapozhnikov
1
+ PDF Chat Universal Behavior of Optimal Paths in Weighted Networks with General Disorder 2006 Yiping Chen
Eduardo LĂłpez
Shlomo Havlin
H. Eugene Stanley
1
+ PDF Chat The component sizes of a critical random graph with given degree sequence 2014 Adrien Joseph
1
+ Graph evolution by stochastic additions of points and lines 1983 Michael Capobianco
Ove Frank
1
+ Inequalities with applications to percolation and reliability 1985 J. van den Berg
Harry Kesten
1
+ PDF Chat Brownian excursions, critical random graphs and the multiplicative coalescent 1997 David Aldous
1
+ PDF Chat Are randomly grown graphs really random? 2001 Duncan S. Callaway
John E. Hopcroft
Jon Kleinberg
M. E. J. Newman
Steven H. Strogatz
1
+ Quick Approximation to Matrices and Applications 1999 Alan Frieze
Ravi Kannan
1
+ PDF Chat The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin’s local time identity 2004 David Aldous
Grégory Miermont
Jim Pitman
1
+ PDF Chat Random Graph Asymptotics on High-Dimensional Tori 2006 Markus Heydenreich
Remco van der Hofstad
1
+ PDF Chat The continuum limit of critical random graphs 2010 Louigi Addario‐Berry
Nicolas Broutin
Christina Goldschmidt
1
+ Probability and Real Trees 2007 Steven N. Evans
1
+ PDF Chat Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing 2008 Christian Borgs
Jennifer Chayes
L. LovĂĄsz
Vera T. SĂłs
K. Vesztergombi
1
+ PDF Chat Percolation on dense graph sequences 2010 BĂ©la BollobĂĄs
Christian Borgs
Jennifer Chayes
Oliver Riordan
1
+ PDF Chat The Phase Transition in the Configuration Model 2012 Oliver Riordan
1
+ PDF Chat Concentration of the spectral measure of large Wishart matrices with dependent entries 2009 Adityanand Guntuboyina
Hannes Leeb
1
+ Random Graph Processes with Degree Restrictions 1992 Andrzej RuciƄski
Nicholas Wormald
1
+ PDF Chat Transport in Weighted Networks: Partition into Superhighways and Roads 2006 Zhenhua Wu
Lidia A. Braunstein
Shlomo Havlin
H. Eugene Stanley
1
+ PDF Chat Critical Random Graphs: Limiting Constructions and Distributional Properties 2010 Louigi Addario‐Berry
Nicolas Broutin
Christina Goldschmidt
1
+ Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions 2001 Jim Pitman
1
+ PDF Chat OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS 2007 Lidia A. Braunstein
Zhenhua Wu
Yiping Chen
Sergey V. Buldyrev
Tomer Kalisky
Sameet Sreenivasan
Reuven Cohen
Eduardo LĂłpez
Shlomo Havlin
H. Eugene Stanley
1
+ PDF Chat Optimal Paths in Disordered Complex Networks 2003 Lidia A. Braunstein
Sergey V. Buldyrev
Reuven Cohen
Shlomo Havlin
H. Eugene Stanley
1
+ PDF Chat Random graph asymptotics on high-dimensional tori II: volume, diameter and mixing time 2009 Markus Heydenreich
Remco van der Hofstad
1
+ PDF Chat Random trees and applications 2005 Jean-François Le Gall
1
+ Critical window for the configuration model: finite third moment degrees 2017 Souvik Dhara
Remco van der Hofstad
Johan S. H. van Leeuwaarden
Sanchayan Sen
1
+ PDF Chat Heavy-tailed configuration models at criticality 2020 Souvik Dhara
Remco van der Hofstad
Johan S. H. van Leeuwaarden
Sanchayan Sen
1
+ PDF Chat Stable graphs: distributions and line-breaking construction 2022 Christina Goldschmidt
Bénédicte Haas
Delphin SĂ©nizergues
1
+ PDF Chat Asymptotic equivalence and contiguity of some random graphs 2009 Svante Janson
1
+ PDF Chat The phase transition in inhomogeneous random graphs 2007 BĂ©la BollobĂĄs
Svante Janson
Oliver Riordan
1
+ The scaling limit of the minimum spanning tree of the complete graph 2017 Louigi Addario‐Berry
Nicolas Broutin
Christina Goldschmidt
Grégory Miermont
1
+ PDF Chat The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs 2017 Shankar Bhamidi
Remco van der Hofstad
Sanchayan Sen
1
+ PDF Chat Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees 2019 Shankar Bhamidi
Sanchayan Sen
1
+ PDF Chat The stable graph: The metric space scaling limit of a critical random graph with i.i.d. power-law degrees 2022 Guillaume Conchon--Kerjan
Christina Goldschmidt
1
+ PDF Chat Universality for critical heavy-tailed network models: Metric structure of maximal components 2020 Shankar Bhamidi
Souvik Dhara
Remco van der Hofstad
Sanchayan Sen
1
+ Hypercube percolation 2017 Remco van der Hofstad
Asaf Nachmias
1
+ PDF Chat Noise sensitivity of critical random graphs 2022 Eyal Lubetzky
Yuval Peled
1
+ PDF Chat A probabilistic approach to the leader problem in random graphs 2020 Louigi Addario‐Berry
Shankar Bhamidi
Sanchayan Sen
1
+ PDF Chat The Cut Metric, Random Graphs, and Branching Processes 2010 BĂ©la BollobĂĄs
Svante Janson
Oliver Riordan
1
+ PDF Chat Critical Percolation on Scale-Free Random Graphs: New Universality Class for the Configuration Model 2021 Souvik Dhara
Remco van der Hofstad
Johan S. H. van Leeuwaarden
1
+ PDF Chat Geometry of the minimal spanning tree of a random 3-regular graph 2021 Louigi Addario‐Berry
Sanchayan Sen
1