activity
20052026
most citedHuman Mobility: Models and Applications

1.1k citations · 2.9k across the 54 of their papers we have counts for

collaborators
Showing cond-mat.stat-mechShow all

7 papers · 1 filter

cond-mat.stat-mech2025

Configurational Information Measures, Phase Transitions, and an Upper Bound on Complexity

Damian R Sowinski, Sean Kelty, Gourab Ghoshal

Configurational entropy (CE) and configurational complexity (CC) are recently popularized information theoretic measures used to study the stability of solitons. This paper examine…

cond-mat.stat-mech2023★ 14 cited

Semantic Information in a model of Resource Gathering Agents

Damian R Sowinski, Jonathan Carroll-Nellenback, Robert N Markwick +5

We explore the application of a new theory of Semantic Information to the well-motivated problem of a resource foraging agent. Semantic information is defined as the subset of corr…

cond-mat.stat-mech2014★ 4 cited

Effects of intrinsic noise on a cubic autocatalytic reaction diffusion system

Fred Cooper, Gourab Ghoshal, Juan Pérez-Mercader

Starting from our recent chemical master equation derivation of the model of an autocatalytic reaction-diffusion chemical system with reactions $U+2V {\stackrel {λ_0}{\rightarrow}}…

cond-mat.stat-mech2013★ 8 cited

Composite Bound States and Broken U(1) symmetry in the Chemical Master Equation derivation of the Gray-Scott Model

Fred Cooper, Gourab Ghoshal, Juan Pérez-Mercader

We give a first principles derivation of the stochastic partial differential equations that describe the chemical reactions of the Gray-Scott model (GS): $U+2V {\stackrel λ{\righta…

cond-mat.stat-mech2013★ 8 cited

Internal composite bound states in deterministic reaction diffusion models

Fred Cooper, Gourab Ghoshal, Alec Pawling +1

By identifying potential composite states that occur in the Sel'kov-Gray-Scott (GS) model, we show that it can be considered as an effective theory at large spatio-temporal scales,…

cond-mat.stat-mech2007★ 78 cited

Bicomponents and the robustness of networks to failure

M. E. J. Newman, Gourab Ghoshal

A common definition of a robust connection between two nodes in a network such as a communication network is that there should be at least two independent paths connecting them, so…