Row-ordering schemes for sparse givens transformations. I. bipartite graph model

1984 ◽  
Vol 61 ◽  
pp. 55-81 ◽  
Author(s):  
Alan George ◽  
Joseph Liu ◽  
Esmond Ng
2021 ◽  
pp. 100093
Author(s):  
John D. Hogan ◽  
Jiandong Wu ◽  
Joshua A. Klein ◽  
Cheng Lin ◽  
Luis Carvalho ◽  
...  
Keyword(s):  

2009 ◽  
Vol 2009 ◽  
pp. 1-12 ◽  
Author(s):  
Sutapa Chaudhuri ◽  
Anirban Middey

Single Spectrum Bipartite Graph (SSBG) model is developed to forecast thunderstorms over Kolkata(22∘32′N,88∘20′E)during the premonsoon season (April-May). The statistical distribution of normal probability is observed for temperature, relative humidity, convective available potential energy (CAPE), and convective inhibition energy (CIN) to quantify the threshold values of the parameters for the prevalence of thunderstorms. Method of conditional probability is implemented to ascertain the possibilities of the occurrence of thunderstorms within the ranges of the threshold values. The single spectrum bipartite graph connectivity model developed in this study consists of two sets of vertices; one set includes two time vertices (00UTC, 12UTC) and the other includes four meteorological parameters: temperature, relative humidity, CAPE, and CIN. Three distinct ranges of maximal eigen values are obtained for the three categories of thunderstorms. Maximal eigenvalues for severe, ordinary, and no thunderstorm events are observed to be(2.6±0.12),(1.88±0.09), and(1.26±.03), respectively. The ranges of the threshold values obtained using ten year data (1997–2006) are considered as the reference range and the result is validated with the IMD (India Meteorological Department) observation, Doppler Weather Radar (DWR) Products, and satellite images of 2007. The result reveals that the model provides 12- to 6-hour forecast (nowcasting) of thunderstorms with 96% to 98% accuracy.


1986 ◽  
Vol 75 ◽  
pp. 203-223 ◽  
Author(s):  
Alan George ◽  
Joseph Liu ◽  
Esmond Ng
Keyword(s):  

2009 ◽  
Vol 42 (20) ◽  
pp. 246-251 ◽  
Author(s):  
Houli DUAN ◽  
Zhiheng LI ◽  
Yi ZHANG ◽  
Zuo ZHANG ◽  
Danya YAO ◽  
...  

Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 452
Author(s):  
Yilun Shang

Social networks describe social interactions between people, which are often modeled by intersection graphs. In this paper, we propose an intersection graph model that is induced by adding a sparse random bipartite graph to a given bipartite graph. Under some mild conditions, we show that the vertex–isoperimetric number and the edge–isoperimetric number of the randomly perturbed intersection graph on n vertices are Ω ( 1 / ln n ) asymptomatically almost surely. Numerical simulations for small graphs extracted from two real-world social networks, namely, the board interlocking network and the scientific collaboration network, were performed. It was revealed that the effect of increasing isoperimetric numbers (i.e., expansion properties) on randomly perturbed intersection graphs is presumably independent of the order of the network.


2013 ◽  
Vol 7 (6) ◽  
pp. 875-893 ◽  
Author(s):  
Rong Zhang ◽  
Koji Zettsu ◽  
Yutaka Kidawara ◽  
Yasushi Kiyoki ◽  
Aoying Zhou

Author(s):  
Kazuki Tawaramoto ◽  
Junpei Kawamoto ◽  
Yasuhito Asano ◽  
Masatoshi Yoshikawa
Keyword(s):  

2010 ◽  
Vol 59 (9) ◽  
pp. 6689
Author(s):  
Feng Ai-Xia ◽  
Gong Zhi-Qiang ◽  
Zhi Rong ◽  
Zhou Lei

Sign in / Sign up

Export Citation Format

Share Document