activity
20112023
most citedCANA: A python package for quantifying control and canalization in Boolean Networks

30 citations · 57 across the 9 of their papers we have counts for

collaborators

9 papers

math.PR2023

Scaling limits and universality: Critical percolation on weighted graphs converging to an graphon

Jnaneshwar Baslingker, Shankar Bhamidi, Nicolas Broutin +2

We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredie…

cs.OH2018★ 30 cited

CANA: A python package for quantifying control and canalization in Boolean Networks

Rion Brattig Correia, Alexander J. Gates, Xuan Wang +1

Logical models offer a simple but powerful means to understand the complex dynamics of biochemical regulation, without the need to estimate kinetic parameters. However, even simple…

math.PR2016

Entropy reduction in Euclidean first-passage percolation

Michael Damron, Xuan Wang

The Euclidean first-passage percolation (FPP) model of Howard and Newman is a rotationally invariant model of FPP which is built on a graph whose vertices are the points of homogen…

math.PR2015★ 3 cited

Asymptotics for Critical First Passage Percolation

Michael Damron, Wai-Kit Lam, Xuan Wang

We consider first-passage percolation on with i.i.d. weights, whose distribution function satisfies . This is sometimes known as the "critical case…

math.PR2014

Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph

Shankar Bhamidi, Nicolas Broutin, Sanchayan Sen +1

A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter and a critical time when a…

math.PR2014★ 2 cited

Continuum limit of critical inhomogeneous random graphs

Shankar Bhamidi, Sanchayan Sen, Xuan Wang

Motivated by applications, the last few years have witnessed tremendous interest in understanding the structure as well as the behavior of dynamics for inhomogeneous random graph m…

math.PR2012★ 9 cited

The augmented multiplicative coalescent and critical dynamic random graph models

Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang

Random graph models with limited choice have been studied extensively with the goal of understanding the mechanism of the emergence of the giant component. One of the standard mode…

math.PR2012★ 10 cited

Bounded-size rules: The barely subcritical regime

Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang

Bounded-size rules are dynamic random graph processes which incorporate limited choice along with randomness in the evolution of the system. One starts with the empty graph and at…

math.PR2011★ 3 cited

Bohman-Frieze processes at criticality and emergence of the giant component

Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang

The evolution of the usual Erdős-Rényi random graph model on n vertices can be described as follows: At time 0 start with the empty graph, with n vertices and no edges. Now at each…