Filters








216 Hits in 2.1 sec

Hypergraph Random Walks, Laplacians, and Clustering [article]

Koby Hayashi, Sinan G. Aksoy, Cheong Hee Park, Haesun Park
2020 arXiv   pre-print
of a random walk on G, and Φ, Π denote diagonal matrices with the stationary distributions of P, Q, respectively, on the diagonal.  ...  If the Markov chain given by P is non-reversible, there does not exist any edgeweighted graph G such that Φ 1/2 (I − P) Φ −1/2 = Π 1/2 (I − Q) Π −1/2 , (8) where Q denotes the probability transition matrix  ... 
arXiv:2006.16377v2 fatcat:sfp33ydu25g6toaxscdyz7jc2i

Spectral Threshold for Extremal Cyclic Edge-Connectivity [article]

Sinan G. Aksoy, Mark Kempton, Stephen J. Young
2021 arXiv   pre-print
We show that for graphs of minimum degree at least 3 and girth g at least 4, the cyclic edge-connectivity is bounded above by (Δ-2)g where Δ is the maximum degree.  ...  The cyclic edge-connectivity of a graph G is the least k such that there exists a set of k edges whose removal disconnects G into components where every component contains a cycle.  ...  G, for 0 ≤ i ≤ k, (iii) G k = G.  ... 
arXiv:2003.02393v2 fatcat:7ckodugncbblxc2geeguigovs4

Directional Laplacian Centrality for Cyber Situational Awareness [article]

Sinan G. Aksoy, Emilie Purvine, Stephen J. Young
2021 arXiv   pre-print
G.  ...  Aksoy, Emilie Purvine, and Stephen J. Young , Vol. 1, No. 1, Article . Publication date: August 2020. The term "network flow" here is different than network flow data used in this paper.  ... 
arXiv:2008.04357v2 fatcat:nwuvdbxepvh4pbwb3qjcxtghny

Relative Hausdorff distance for network analysis

Sinan G. Aksoy, Kathleen E. Nowak, Emilie Purvine, Stephen J. Young
2019 Applied Network Science  
However, as discussed and analyzed in Aksoy et al. (2018) , this also decouples the "distance" from the underlying topology, yielding a function RH(F, G) that does not satisfy the triangle inequality  ...  algorithm and more on theoretical properties of RH distance, the reader is referred to Aksoy et al. (2018) .  ... 
doi:10.1007/s41109-019-0198-0 fatcat:z5lk7gul6vfg3e7teuyo36wiri

Hypernetwork Science via High-Order Hypergraph Walks [article]

Sinan G. Aksoy, Cliff Joslyn, Carlos Ortiz Marrero, Brenda Praggastis, Emilie Purvine
2020 arXiv   pre-print
(ii) The average s-efficiency of H is |Es| 2 −1 f,g∈Es f =g 1 ds(f, g) . (iii) The harmonic s-closeness centrality index of a hyperedge f is 1 |Es| − 1 g∈Es f =g 1 ds(f, g) .  ...  Consequently, if G is a graph, L(G * ) is identical to G. Line graphs play an important role in hypernetwork science.  ... 
arXiv:1906.11295v2 fatcat:qjncpn2oovfqpoaevdl3atxa24

Hypernetwork science via high-order hypergraph walks

Sinan G. Aksoy, Cliff Joslyn, Carlos Ortiz Marrero, Brenda Praggastis, Emilie Purvine
2020 EPJ Data Science  
(ii) The average s-efficiency of H is g) . |E s | 2 -1 f ,g∈E s f =g 1 d s (f , (iii) The harmonic s-closeness centrality index of a hyperedge f is 1 |E s | -1 g∈E s f =g 1 d s (f , g) .  ...  (ii) The average s-distance of H is |E s | 2 -1 f ,g∈E s d s (f , g). (iii) The s-closeness centrality of a hyperedge f is |E s | -1 g∈E s d s (f , g) .  ...  its dual G * is 2-uniform (and hence still a graph) if and only if G is 2-regular, in which case G is a cycle or disjoint union of cycles. f https://github.com/pnnl/HyperNetX g Consequently, the s-Laplacian  ... 
doi:10.1140/epjds/s13688-020-00231-0 fatcat:x7bvvkmbo5gulcoznzjtiialma

Ramanujan Graphs and the Spectral Gap of Supercomputing Topologies [article]

Sinan G. Aksoy, Paul Bruillard, Stephen J. Young, Mark Raugas
2020 arXiv   pre-print
, if we delete v j from G and G , we have λ 2 (G) ≤ λ 1 (G \ v j ) ≤ λ 1 (G), λ 2 (G ) ≤ λ 1 (G \ v j ) ≤ λ 1 (G ).  ...  As each edge in G is represented by |G||H| 2 G k edges in G k H, this gives an upper bound of |G||H| 2 G k BW(G).  ... 
arXiv:1909.11694v2 fatcat:f3tstjgqljewxkh3qsnuswqzte

A linear-time algorithm and analysis of graph Relative Hausdorff distance [article]

Sinan G. Aksoy, Kathleen E. Nowak, Stephen J. Young
2019 arXiv   pre-print
To consider the case where m = 4 and n = 3, 4, we first fix some F ∈ G 3 ∪ G 4 and GG 4 and suppose that RH(F, G) > ǫ 4 .  ...  We call RH(F, G) = max{ − − → RH(F, G) , − − → RH(G, F )} the smooth Relative Hausdorff distance between F and G.  ... 
arXiv:1903.01682v2 fatcat:fdsktmts7rbfvlv4vuys2qja7i

Measuring and modeling bipartite graphs with community structure

Sinan G. Aksoy, Tamara G. Kolda, Ali Pinar
2017 Journal of Complex Networks  
One-Way Graph Two-Way Graph G = (V, E) G = (U, V, E) Vertices : V Vtx. Partition 1 : U Vtx.  ...  Chung-Lu for Two-way Graphs Consider the bipartite graph G = (U, V, E).  ... 
doi:10.1093/comnet/cnx001 fatcat:4i52jygsz5hnriiwftmiosyxgy

Models and Methods for Sparse (Hyper)Network Science in Business, Industry, and Government

Sinan G Aksoy, Aric Hagberg, Cliff A Joslyn, Bill Kay, Emilie Purvine, Stephen J Young
2022 Notices of the American Mathematical Society  
Aksoy. • In blogging and social networks such as Twitter, users interact with external content by posting links, thereby forming a user-content hypergraph whose structure affects information spread.  ...  National Laboratory is operated by Triad National Security, LLC, for the National Nuclear Security Administration of US Department of Energy (Contract No. 89233218CNA000001).Figures 1 and 2 were created by Sinan  ... 
doi:10.1090/noti2424 fatcat:hnu5w6rojraudjkchhm4k5cdrq

A generative graph model for electrical infrastructure networks

Sinan G Aksoy, Emilie Purvine, Eduardo Cotilla-Sanchez, Mahantesh Halappanavar
2018 Journal of Complex Networks  
G[X2] G[X1] G[X3] (a) Notation Description G Entire power grid graph n Number of vertices in G G[X ] Subgraph induced by vertices of volt- age level X d X Degree sequence of voltage  ...  FIG. 1: A sample power grid graph G with three voltage levels. Vertices in G[X 1 ] are red, in G[X 2 ] are green, and in G[X 3 ] are orange.  ... 
doi:10.1093/comnet/cny016 fatcat:jabnfnwpejdepkrrrwpt2bdhxm

The maximum relaxation time of a random walk

Sinan G. Aksoy, Fan Chung, Michael Tait, Josh Tobin
2018 Advances in Applied Mathematics  
Assume G achieves α(n) and let G P and G N be the graphs induced by P and N respectively. Note that vol P = 2e(G P ) + e(N, P ), and vol N = 2e(G N ) + e(N, P ).  ...  eigenvector g = T 1/2 f .  ... 
doi:10.1016/j.aam.2018.07.002 fatcat:qmtpss2h5jcq3jv6yjbfqlin24

TÜRK DÜNYASINDA DEYİM BİLİMİ ÇALIŞMALARI

Kuanyshbek KENZHALİN
2017 Turk Dunyasi Dergisi  
dır (Aksoy 1971: 49) .  ...  Almatı, 1996) , genel olarak Türkiye Türkçesindeki deyimler hakkında kapsamlı olarak Aksoy (Aksoy, Ö. A. Atasözleri ve Deyimler Sözlüğü. Deyimler Sözlüğü.  ... 
doi:10.24155/tdk.2017.7 fatcat:uv6a3rio6rcn7oqkmifdranane

How Should We Treat Prepubertal Labial Adhesions? Retrospective Comparison of Topical Treatments: Estrogen Only, Betamethasone Only, and Combination Estrogen and Betamethasone

Egemen Eroğlu, Marcus Yip, Tayfun Oktar, Sinan Mahir Kayiran, Hilal Mocan
2011 Journal of Pediatric and Adolescent Gynecology  
Mocan H, Erduran E, Karagüzel G. High dose methylprednisolone therapy in nephrotic syndrome. Indian J Pediatr. 1999 Mar-Apr;66(2):171-4. A7. Mocan H, Aksoy A, Uydu HA, Mocan MC.  ...  Mocan H, Mocan MC, Sen Y, Kuzey G, Civiloglu C. Fatal polyarteritis nodosa with massive mesenteric necrosis in a child. Clin Rheumatol. 1999;18(1):88-90. A12. Erduran E, Mocan H, Aslan Y, Sari A.  ... 
doi:10.1016/j.jpag.2011.07.015 pmid:21945628 fatcat:4vtlqadbf5a6pldomp57s52muq

JLO volume 125 issue 2 Cover and Back matter

2011 Journal of Laryngology and Otology  
W-B Wu, Y-F Ding, RP-Y Chiang, S-M Wu 133 Auditory and vestibular manifestations of Vogt-Koyanagi-Harada disease: S Al Dousary 138 Serum matrix metalloproteinases and tympanosclerosis: H Aslan, M Sinan  ...  cancer-related unilateral vocal fold paralysis: J Shi, S Chen, D Chen, W Wang, S Xia, H Zheng 173 Value of autofluorescence bronchoscopy in patients with laryngeal cancer: E Çetinkaya, B Veyseller, YS Yildirim, F Aksoy  ... 
doi:10.1017/s0022215110002902 fatcat:ons3gk5ixjgpzaopmj46w64boy
« Previous Showing results 1 — 15 out of 216 results