Search arXivSearch

arXiv · nlin/0703033

Roles of hubs in Boolean networks

Abstract

We examined the effects of inhomogeneity on the dynamics and structural properties using Boolean networks. Two different power-law rank outdegree distributions were embedded to determine the role of hubs. The degree of randomness and coherence of the binary sequence in the networks were measured by entropy and mutual information, depending on the number of outdegrees and types of Boolean functions for the hub. With a large number of outdegrees, the path length from the hub reduces as well as the effects of Boolean function on the hub are more prominent. These results indicate that the hubs play important roles in networks' dynamics and structural properties. By comparing the effect of the skewness of the two different power-law rank distributions, we found that networks with more uniform distribution exhibit shorter average path length and higher event probability of coherence but lower degree of coherence. Networks with more skewed rank distribution have complementary properties. These results indicate that highly connected hubs provide an effective route for propagating their signals to the entire network.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chikoo Oosawa. 2007-03-16. Roles of hubs in Boolean networks. https://arxiv.org/abs/nlin/0703033

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dimension-dependent continuum limits in tissue mechanics

Continuum descriptions of epithelial tissue mechanics can replace expensive individual-based simulations with tractable macroscopic models, yet the link between cell-scale forces and tissue-scale transport remains poorly understood. We show that dimensionality controls this link: long-time mechanical relaxation rates reveal generalized porous-media-type nonlinear transport phenomena, $D(ρ)\proptoρ^γ$. Exponents in nonlinear diffusivities are fixed by microscopic mechanics and dimensionality, providing a novel physical mechanism for emergent macroscopic transport phenomena.

nlin.CG

Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre

The hat and spectre monotiles, discovered in 2023, tile the plane only aperiodically; no cellular automaton dynamics on these tilings has previously been reported. Cellular automata are studied here on patches generated by finite-state transducers, so that every experiment regenerates deterministically from a small record. Within edge-adjacency semi-totalistic rules, exhaustive and evolutionary searches find only mortal travelers: gliders are absent. Guided by a reproduction of the known Penrose-tiling glider, the rule space is extended to vertex neighborhoods and to priority-table rules whose non-quiescent states are visible to neighbors. Evolutionary search then discovers gliders on both monotilings; tracked by a sliding window that regenerates the patch along the flight, they travel one million rings at constant speed and heading. All headings are quantized, to millidegrees, onto a six-spoke compass - the fast axes of the tiling's graph metric. An ablation shows both rule-space extensions are individually necessary. All results replay exactly in an accompanying interactive essay.

nlin.CG

Diagonal Bases and Diagonal Periods of Elementary Cellular Automata

Which cellular-automaton diagonal families form bases in every finite window? For canonical polynomial lifts of elementary rules, two truth-table bits determine triangularity, and units on the matrix diagonal determine invertibility. Exactly 24 rules give universal binary bases; all remain universal over every modulus. Among triangular binary coordinate maps, the Pascal transform is uniquely characterized by converting OR convolution into pointwise multiplication, while increment becomes strict prefix summation. Explicit inverses and coordinate comparisons distinguish sparsity from evaluation cost. A Rule 30 polynomial construction gives Fibonacci bounds on interpolation order and prime-modulus periods. Exact additive periods anchor a finite census modulo two and three. These results separate all-window basis classification from optimization of a representation and from period patterns observed in finite windows.

nlin.CG