- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from

**publisher and metadata sources**).We study the linear large-n behaviour of the average number of distinct sites S(n) visited by a random walker after n steps on a large random graph. An expression for the graph topology-dependent… Continue Reading

3 September 2017

We present a physically inspired model and an efficient algorithm to infer hierarchical rankings of nodes in directed networks. It assigns real-valued ranks to nodes rather than simply ordinal ranks,… Continue Reading

5 January 2017

Complex systems are often characterized by distinct types of interactions between the same entities. These can be described as a multilayer network where each layer represents one type of… Continue Reading

We investigate a stochastic search process in one, two, and three dimensions in which N diffusing searchers that all start at x 0 seek a target at the origin. Each of the searchers is also reset to… Continue Reading

54th Annual Allerton Conference on Communication…

1 September 2016

We consider the problem of Gaussian mixture clustering in the high-dimensional limit where the data consists of m points in n dimensions, n,m → ∞ and α = m/n stays finite. Using exact but… Continue Reading

Introduction Eating disorders (EDs) are serious mental illnesses with multifactorial pathogenesis and biological, psychic, family, and sociocultural aspects. EDs are difficult-to-treat disorders that… Continue Reading

We describe and demonstrate an algorithm for the efficient simulation of generic stochastic dynamics of classical degrees of freedom defined on the vertices of a locally tree-like graph. Networks… Continue Reading

Rare event statistics for random walks on complex networks are investigated using the large deviations formalism. Within this formalism, rare events are realized as typical events in a suitably… Continue Reading

2 March 2015

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the… Continue Reading

A localized method to distribute paths on random graphs is de vised, aimed at finding the shortest paths between given source/destinatio n pairs while avoiding path overlaps at nodes. We propose a… Continue Reading