Results 51 to 60 of about 1,215,022 (288)

Duality properties of indicatrices of knots

, 2012
The bridge index and superbridge index of a knot are important invariants in knot theory. We define the bridge map of a knot conformation, which is closely related to these two invariants, and interpret it in terms of the tangent indicatrix of the knot ...
A.S. McRae, Bena Tshishiku, C.B. Jeon, Charmaine Sia, Colin Adams, Dan Collins, G.T. Jin, H. Schubert, I. Fáry, J.W. Milnor, J.W. Milnor, Katherine Hawkins, N.H. Kuiper, R. Uribe-Vargas, Rob Silversmith, T.F. Banchoff, V.I. Arnold, W. Blaschke, W. Fenchel, Y.-Q. Wu   +19 more
core   +1 more source

Sequential visibility-graph motifs [PDF]

, 2016
Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science.
Iacovacci, J, Lacasa, L
core   +3 more sources

Criticality, Connectivity, and Neural Disorder: A Multifaceted Approach to Neural Computation

Frontiers in Computational Neuroscience, 2021
It has been hypothesized that the brain optimizes its capacity for computation by self-organizing to a critical point. The dynamical state of criticality is achieved by striking a balance such that activity can effectively spread through the network ...
Kristine Heiney, Kristine Heiney, Ola Huse Ramstad, Vegard Fiskum, Nicholas Christiansen, Axel Sandvig, Axel Sandvig, Axel Sandvig, Stefano Nichele, Stefano Nichele, Ioanna Sandvig   +10 more
doaj   +1 more source

Investigating the Inequality of Communication Structure in the Iranian Stock Market through Social Network Analysis Approach [PDF]

پژوهش‌های راهبردی مسائل اجتماعی ایران, 2020
Introduction Stock markets are considered as complex types of multi-agent networks due to the interaction of different companies and investors. Studies dealing with financial data modeling have shown that network models of financial data refer to many ...
Reza Taghizadeh, Ali Ruhani
doaj   +1 more source

Graph Theory and Environmental Algorithmic Solutions to Assign Vehicles: Application to Garbage Collection in Vietnam

Advances in Decision Sciences, 2019
The problem of finding the shortest path including garbage collection is one of the most important problems in environmental research and public health. Usually, the road map has been modeled by a connected undirected graph with the edge representing the
Buu-Chau Truong, Kim-Hung Pho, Van-Buol Nguyen, B. A. Tuan, W. Wong   +4 more
semanticscholar   +1 more source

Pedagogía interdisciplinaria del metro visualizando la teoría de la música matemática a través del gráfico Ski-hill [PDF]

, 2022
This paper aims to convey how and why teaching the fundamentals of the meter through interdisciplinary Ski-hill graph pedagogy of the meter brings benefits to school-age students.
Calilhanna, A.
core  

Crosstalk between gut microbiota and tumor: tumors could cause gut dysbiosis and metabolic imbalance

Molecular Oncology, EarlyView.
In this research, we analyzed the relationship between gut microbiota and tumor. We discovered that both subcutaneous and metastatic tumors would alter the composition and metabolic function of gut microbiota. Meanwhile, fecal microbiota transplantation also indicated the anti‐tumor role of the gut microbiota, revealing the crosstalk between tumor and ...
Siyuan Zhang, Haimei Wen, Ying Chen, Jingya Ning, Di Hu, Yujiao Dong, Chenyu Yao, Bo Yuan, Shuanying Yang   +8 more
wiley   +1 more source

Visibility graphs for fMRI data: Multiplex temporal graphs and their modulations across resting-state networks [PDF]

Network Neuroscience, 2017
Visibility algorithms are a family of methods that map time series into graphs, such that the tools of graph theory and network science can be used for the characterization of time series. This approach has proved a convenient tool, and visibility graphs
Speranza Sannino, Sebastiano Stramaglia, Lucas Lacasa, Daniele Marinazzo   +3 more
doaj   +1 more source

Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture [PDF]

J. Combin. Theory Ser. B 136 (2019), 44-71, 2015
A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that if $\mathcal{G}_n$ is any bridge-addable class of graphs on $n$ vertices, and $G_n$ is taken uniformly at random ...
arxiv   +1 more source

Multi-bridge graphs are anti-magic

Electronic Journal of Graph Theory and Applications, 2022
An anti-magic graph is a graph whose | E | edges can be labeled with the first | E | natural numbers such that each edge receives a distinct number and each vertex receives a distinct vertex sum which is obtained by taking the sum of the labels of all the
Yu Bin Tai, G. Chia, Poh-Hwa Ong
semanticscholar   +1 more source