scholarly journals Directed paths on hierarchical lattices with random sign weights

1998 ◽  
Vol 58 (4) ◽  
pp. 4246-4253 ◽  
Author(s):  
Eduardo G. Aponte ◽  
Ernesto Medina
2019 ◽  
Vol 146 (3) ◽  
pp. 1519-1527 ◽  
Author(s):  
ZhiWei Zhu ◽  
ZiChen Deng ◽  
ShuZhan Tong ◽  
BenJie Ding ◽  
JianKe Du

1988 ◽  
Vol 102 (1) ◽  
pp. 102-102 ◽  
Author(s):  
T. Figiel ◽  
W. B. Johnson ◽  
G. Schechtman
Keyword(s):  

2020 ◽  
Author(s):  
Vinícius De Souza Carvalho ◽  
Cândida Nunes Da Silva ◽  
Orlando Lee

 Given a digraph D, a coloring 𝒞 of D is a partition of V(D) into stable sets. The k-norm of 𝒞 is defined as ΣC∈𝒞 min{|C|, k}. A coloring of D with minimum k-norm has its k-norm noted by χk(D). A (path)-k-pack of a digraph D is a set of k vertex-disjoint (directed) paths of D. The weight of a k-pack is the number of vertices covered by the k-pack. We denote by λk(D) the weight of a maximum k-pack. Linial conjectured that χk(D) ≤ λk(D) for every digraph. Such conjecture remains open, but has been proved for some classes of digraphs. We prove the conjecture for path-spine digraphs, defined as follows. A digraph D is path-spine if there exists a partition {X, Y} of V(D) such that D[X] has a Hamilton path and every arc in D[Y] belongs to a single path Q. 


2013 ◽  
Vol 20 (2) ◽  
pp. 185-209 ◽  
Author(s):  
Yann Dijoux ◽  
Olivier Gaudoin

2020 ◽  
Vol 343 (10) ◽  
pp. 112015
Author(s):  
Ilkyoo Choi ◽  
Bernard Lidický ◽  
Florian Pfender
Keyword(s):  

2019 ◽  
Vol 6 (2) ◽  
pp. 180719 ◽  
Author(s):  
Helen R. Fielding ◽  
Trevelyan J. McKinley ◽  
Matthew J. Silk ◽  
Richard J. Delahay ◽  
Robbie A. McDonald

Network analyses can assist in predicting the course of epidemics. Time-directed paths or ‘contact chains' provide a measure of host-connectedness across specified timeframes, and so represent potential pathways for spread of infections with different epidemiological characteristics. We analysed networks and contact chains of cattle farms in Great Britain using Cattle Tracing System data from 2001 to 2015. We focused on the potential for between-farm transmission of bovine tuberculosis, a chronic infection with potential for hidden spread through the network. Networks were characterized by scale-free type properties, where individual farms were found to be influential ‘hubs' in the network. We found a markedly bimodal distribution of farms with either small or very large ingoing and outgoing contact chains (ICCs and OCCs). As a result of their cattle purchases within 12-month periods, 47% of British farms were connected by ICCs to more than 1000 other farms and 16% were connected to more than 10 000 other farms. As a result of their cattle sales within 12-month periods, 66% of farms had OCCs that reached more than 1000 other farms and 15% reached more than 10 000 other farms. Over 19 000 farms had both ICCs and OCCs reaching more than 10 000 farms for two or more years. While farms with more contacts in their ICCs or OCCs might play an important role in disease spread, farms with extensive ICCs and OCCs might be particularly important by being at higher risk of both acquiring and disseminating infections.


Sign in / Sign up

Export Citation Format

Share Document