Filters








8,923 Hits in 6.6 sec

Motif discovery algorithms in static and temporal networks: A survey

Ali Jazayeri, Christopher C Yang, Peter Holme
<span title="">2020</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jsceyotievepbjk7disgxezmdq" style="color: black;">Journal of Complex Networks</a> </i> &nbsp;
Motifs are the fundamental components of complex systems.  ...  As we witness the generation of a large amount of network data in social media platforms, bioinformatics applications and communication and transportation networks and the advance in distributed computing  ...  This algorithm converts the temporally connected components of the giant network into interaction sequences (a component to be temporally connected should have every pair of vertices to be t-connected)  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/comnet/cnaa031">doi:10.1093/comnet/cnaa031</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7hasephaffajdl5bn7gl33qn2a">fatcat:7hasephaffajdl5bn7gl33qn2a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210224063328/https://watermark.silverchair.com/cnaa031.pdf?token=AQECAHi208BE49Ooan9kkhW_Ercy7Dm3ZL_9Cf3qfKAc485ysgAAAqkwggKlBgkqhkiG9w0BBwagggKWMIICkgIBADCCAosGCSqGSIb3DQEHATAeBglghkgBZQMEAS4wEQQMpXuENGZji9j9eFauAgEQgIICXMa0KuEmPQeVLRKx7BqWNypYlm93KGnoNfC9ZA86EvnvbaDup_6VTA_hO_5XBa6c3BxyCQto32ed-DrQ7D_gutPKnyvshn3YAoSKx9_Hs5s8JSN0txKobSOBNsYYQdy1tAJKL7s-udJCNeTtXkhpiYDXpMk-ertAy-6vcSVRCCrf-8PZk4bmO8Mgkw9wl-EC8_LCsDsc8zmIS1yEjV9FwxzPSIvNcNBZlc_vLZ375GcihC83uq7SqegDLrPzLDVU6y_j4ToXxHj4oYWBR6l9SvSySQKsxioIQcEbwqHBh0StHlgtk_nRwV5wUB3S06_JjkPK6sIRGbqcOERqNsP5e1aAlISFBhprUm2t5cpOpzd_1s7y5U3ytO9rZKXGEXJtBm7p3ODAOcauDXab-fP_aP9foCa7UNNabPKqvhut_CJut9Jy7Tb6Nz3gb6TPggH2q3ngqvf19Ro7hBQFECZdS3KllI_UhSwx_QSNpylfQHDk2Ha8XEfAbV-WflUBglG2k9Ro77ETjCzNCFmc3BKaFMZ0X1z6vSwf4PniIwnq4wXLccGFzq9P42mwU0P2ksa63KJ2zE0uzbpEH0U2zVyN_yGAykwPvXXxfercqruN1AynWm1FqMYBoRMTOSIIiIT3xrIHJI2Io47Ns_oQKRfCPt5gYalxn2BFU-fJsBASJXpzlZBkaCy0IBDbs7cdqcsuH4oWXaijZVnc6h56gRv5cOxrMeqkcIqxmfbozPjf8IF0zomY--l5y6UILcNmvZDf7157rZMv5eoH_teT5ysYOfPUa5uTETd9HcuIRTg" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/19/d5/19d5181d18fa06c1a957dac2e4dcb135a2cf1718.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/comnet/cnaa031"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>

Motif Discovery Algorithms in Static and Temporal Networks: A Survey [article]

Ali Jazayeri, Christopher C. Yang
<span title="2020-05-19">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Motifs are the fundamental components of complex systems.  ...  As we witness the generation of a large amount of network data in social media platforms, bioinformatics applications, and communication and transportation networks and the advance in distributed computing  ...  This algorithm converts the temporally connected components of the giant network into interaction sequences (a component to be temporally connected should have every pair of vertices to be ∆t-connected  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.09721v1">arXiv:2005.09721v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m7ytgi2kajcsdoj2cgz2nba6uy">fatcat:m7ytgi2kajcsdoj2cgz2nba6uy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200522001646/https://arxiv.org/pdf/2005.09721v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/84/fe84c3fbe34f806902610cf80be147b250e56282.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.09721v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

LGL: Creating a Map of Protein Function with an Algorithm for Visualizing Very Large Biological Networks

Alex T. Adai, Shailesh V. Date, Shannon Wieland, Edward M. Marcotte
<span title="">2004</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nk6zopmzsjfizb6z5kztdu477y" style="color: black;">Journal of Molecular Biology</a> </i> &nbsp;
Visualization of networks is important for their study, but visualization tools are often inadequate for working with very large biological networks.  ...  Here, we present an algorithm, called large graph layout (LGL), which can be used to dynamically visualize large networks on the order of hundreds of thousands of vertices and millions of edges.  ...  An important method of function discovery is the study of genes and their products as components of networks, rather than studying genes in isolation or in linear pathways.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jmb.2004.04.047">doi:10.1016/j.jmb.2004.04.047</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/15184029">pmid:15184029</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/35yi6jemwvc6jp2smipn6jxesy">fatcat:35yi6jemwvc6jp2smipn6jxesy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808160119/http://www.cbil.upenn.edu/~svdate/downloads/Adai-Date-McDonald-Marcotte-JMB-June-04.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/63/9a/639ad7c2f987b29a96c035c187a5d037de4fa3db.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jmb.2004.04.047"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Preface to the Special Issue on Graph Data Management in Online Social Networks

Kai Zheng, Guanfeng Liu, Mehmet A. Orgun, Junping Du
<span title="2020-01-16">2020</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tdniohqnfvcqrpinoqffpwlpgq" style="color: black;">World wide web (Bussum)</a> </i> &nbsp;
The guest editors selected 11 contributions that covers varying topics within this theme, ranging from graph-based representations to learning models, from graph-based query processing to analysis.  ...  We are delighted to present this special issue of World Wide Web on Graph Data Management in Online Social Networks.  ...  In "Towards k-Vertex Connected Component Discovery from Large Networks", the authors study a k-vertex connected component (k-VCC) model, which is much more cohesive, and thus supports overlapping between  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11280-019-00771-0">doi:10.1007/s11280-019-00771-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ee7b2an4xzc77clj2w36oyl4zq">fatcat:ee7b2an4xzc77clj2w36oyl4zq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200510142816/https://link.springer.com/content/pdf/10.1007%2Fs11280-019-00771-0.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a4/5e/a45ecc2e85acd9e44ac99552757def3e7e953ae4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11280-019-00771-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Statistical theory of Internet exploration

Luca Dall'Asta, Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vázquez, Alessandro Vespignani
<span title="2005-03-24">2005</span> <i title="American Physical Society (APS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nuk2stxzvvhf7ljciu325kj77m" style="color: black;">Physical Review E</a> </i> &nbsp;
We tackle this problem by modeling the network sampling process on synthetic graphs and by using a mean-field approximation to obtain expressions for the probability of edge and vertex detection in the  ...  a graphlike representation of the network.  ...  Since an ER graph can consist of more than one connected component, we consider only the largest of these components.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physreve.71.036135">doi:10.1103/physreve.71.036135</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/15903521">pmid:15903521</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s27ueuehxvbb3ezkdpguddviry">fatcat:s27ueuehxvbb3ezkdpguddviry</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809002833/http://www.cpt.univ-mrs.fr/~barrat/pre71.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/09/1d/091d993f1c07879dc6ab63bca5cb0e547611d8fe.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physreve.71.036135"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> aps.org </button> </a>

Topological phase transitions of random networks

Imre Derényi, Illés Farkas, Gergely Palla, Tamás Vicsek
<span title="">2004</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dlb6tmf5cve7dphk62d6tkyuvy" style="color: black;">Physica A: Statistical Mechanics and its Applications</a> </i> &nbsp;
This enables us to establish an equivalence between the equilibrium rewiring problem we consider and the dynamics of a lattice gas on the edge-dual graph of a fully connected network.  ...  feature(s) of the global connectivity as a function of a parameter playing the role of the temperature.  ...  For k ¡ 1 the graphs falls apart into small pieces, while for k ¿ 1 a giant connected component emerges. Near the critical point the size of the giant component scales as ( k − 1)M .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.physa.2003.10.083">doi:10.1016/j.physa.2003.10.083</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/myacvpv32nhmvcokbqc2owhmja">fatcat:myacvpv32nhmvcokbqc2owhmja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050529105552/http://angel.elte.hu:80/~fij/homepage/articles/phasetransPhysA.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0b/69/0b6937e8a1627ef5b3f474d5b534adbdf7c40abf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.physa.2003.10.083"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Towards the Discovery of Diseases Related by Genes Using Vertex Similarity Measures

Hung-Hsuan Chen, Liang Gou, Xiaolong Luke Zhang, C. Lee Giles
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zs2qsp26orboxav4dupthc3ml4" style="color: black;">2013 IEEE International Conference on Healthcare Informatics</a> </i> &nbsp;
We apply the vertex similarity among the vertices in the human disease network to infer the diseases implicated in common genes.  ...  By similar manner, we utilize vertex similarity measures on the disease gene network to infer the genes related to a common multiple-gene disease.  ...  R * pm (v i , v j ) := K k=1 R(u k , u k+1 ) if K ≤ r 0 otherwise, (5) where r is the discovery range parameter controlling the maximum degree of separation to calculate, and p m is a path from v i (=  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ichi.2013.78">doi:10.1109/ichi.2013.78</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ichi/ChenGZG13.html">dblp:conf/ichi/ChenGZG13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3gq7pxv4ufdyrh62ejvhcbep6a">fatcat:3gq7pxv4ufdyrh62ejvhcbep6a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160405003534/http://dr-hhchen.appspot.com/academic_works/chen13_towards.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bc/1a/bc1ad8ac9272d12bc412dd4712621013cd9360ee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ichi.2013.78"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Network Backbone Discovery Using Edge Clustering [article]

Ning Ruan, Ruoming Jin, Guan Wang, Kun Huang
<span title="2012-02-16">2012</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we investigate the problem of network backbone discovery.  ...  We develop an efficient mining algorithm based on Kullback-Leibler divergence optimization procedure and maximal weight connected subgraph discovery procedure.  ...  Since the entire network consists of several disconnected components, we extract the largest connected component with 379 vertices and 1828 edges for the experiment.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1202.1842v2">arXiv:1202.1842v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jm3hcipqrnc3vc3w6jk275nupm">fatcat:jm3hcipqrnc3vc3w6jk275nupm</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1202.1842/1202.1842.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/10/73/1073149a6cd8d630260f2696f833282f7636f71f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1202.1842v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A statistical approach to the traceroute-like exploration of networks: theory and simulations [article]

Luca Dall'Asta, Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vazquez, Alessandro Vespignani
<span title="2004-06-22">2004</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Mapping the Internet generally consists in sampling the network from a limited set of sources by using "traceroute"-like probes.  ...  This finding might hint the steps toward more efficient mapping strategies.  ...  Since G N,p can consist of more than one connected component, we consider only the largest of these components.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cond-mat/0406404v2">arXiv:cond-mat/0406404v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sb73zrwrwbc4voradlj2pgora4">fatcat:sb73zrwrwbc4voradlj2pgora4</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cond-mat0406404/cond-mat0406404.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2b/03/2b03e7059f3cfcf9bbae4700b5fe4083de33a7e5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cond-mat/0406404v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

SkyGraph: an algorithm for important subgraph discovery in relational graphs

Apostolos N. Papadopoulos, Apostolos Lyritsis, Yannis Manolopoulos
<span title="2008-07-17">2008</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ja54f4dcmzfz7cvlo7o757jdba" style="color: black;">Data mining and knowledge discovery</a> </i> &nbsp;
Some example applications are: (i) analysis of microarray data in bioinformatics, (ii) pattern discovery in a large graph representing a social network, (iii) analysis of transportation networks, (iv)  ...  In this paper, we propose a methodology to support such preferences by applying subgraph discovery in relational graphs towards retrieving important connected subgraphs.  ...  Acknowledgements The authors are grateful to Kostas Tsichlas and Anastasios Gounaris for their helpful comments, Xifeng Yan for providing the microarray data and the anonymous reviewers for their aid towards  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10618-008-0109-y">doi:10.1007/s10618-008-0109-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ijowotahqrdlrlawtw3idy744u">fatcat:ijowotahqrdlrlawtw3idy744u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809030458/http://delab.csd.auth.gr/~apostol/pubs/dmkd2008_plm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c8/7b/c87b0d8b3c04302eb84d8012041362c60ff7ae16.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10618-008-0109-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Exploring networks with traceroute-like probes: Theory and simulations

Luca Dall'Asta, Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vázquez, Alessandro Vespignani
<span title="">2006</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes.  ...  The results might hint the steps toward more efficient mapping strategies.  ...  Since G N,p can consist of more than one connected component, we consider only the largest of these components.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2005.12.009">doi:10.1016/j.tcs.2005.12.009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qdcoyw76mrhrplgauayopjuima">fatcat:qdcoyw76mrhrplgauayopjuima</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811144705/http://cnet.fi.uba.ar/ignacio.alvarez-hamelin/pdf/D_AH_B_V_V_TCS2006.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/92/bd/92bd01034bdd58220ccfb3975a84849eec00d444.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2005.12.009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Discovering highly reliable subgraphs in uncertain graphs

Ruoming Jin, Lin Liu, Charu C. Aggarwal
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fqqihtxlu5bvfaqxjyvqcob35a" style="color: black;">Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD &#39;11</a> </i> &nbsp;
This problem arises in a wide range of network applications, such as protein-complex discovery, network routing, and social network analysis.  ...  This problem attempts to identify all induced subgraphs for which the probability of connectivity being maintained under uncertainty is higher than a given threshold.  ...  Given a set of vertices, this problem tries to remove K edges from the original graph so that the remaining subgraph can maximize the probability of these vertices belonging to one connected component.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2020408.2020569">doi:10.1145/2020408.2020569</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/kdd/JinLA11.html">dblp:conf/kdd/JinLA11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zgnrpk4qgvfc3ffpfkfpjzjkem">fatcat:zgnrpk4qgvfc3ffpfkfpjzjkem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808055204/http://www.cs.kent.edu/~jin/Papers/kdd11_uncertaingraph.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3b/46/3b4617e0371715cffad1420a47dd9951e7f88b80.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2020408.2020569"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Security and Discoverability of Spread Dynamics in Cyber-Physical Networks

Sandip Roy, Mengran Xue, Sajal K. Das
<span title="">2012</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ll6bfs5o6bahfinh3u5z2cnyoy" style="color: black;">IEEE Transactions on Parallel and Distributed Systems</a> </i> &nbsp;
for network security and vulnerability.  ...  These security and discoverability definitions capture whether or not, and to what extent, a stakeholder can infer the temporal dynamics of the spread from localized and noisy measurements.  ...  interconnected, i.e., each edge weight from the ith vertex in subgraph 1 to the jth vertex in subgraph 2 is equal to each edge weight from the ith vertex in subgraph 2 to the jth vertex in subgraph 1;  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpds.2012.59">doi:10.1109/tpds.2012.59</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7o6bluexnzbojkdyrtzw5jlj2e">fatcat:7o6bluexnzbojkdyrtzw5jlj2e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830210100/http://www.tjucs.win/faculty/xugq/teaching/computer%20security/references/06148225.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/60/8d/608d30a7e13d837252cf511112c400dc240a7389.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpds.2012.59"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Connected Component in Secure Sensor NetworkInduced by a Random Key Pre-Distribution Scheme

Bhupendra Gupta, Subir Singh Lamba
<span title="">2011</span> <i title="EJournal Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2uckwik5xjerdg36acn26gjq6e" style="color: black;">International Journal of Machine Learning and Computing</a> </i> &nbsp;
We prove that for a network having N nodes, is a single connected component almost surely, if size of the key-ring is m = √ 2 log N and the size of key pool is K = N log N.  ...  Here we establish the threshold value of the parameters (Key pool size and key-ring of an individual node) for which the entire network is almost surely a single connected component.  ...  Then for sufficiently large N, and c > √ 2 network have a single component. P [Network is not connected] < ∞. Now by the Borel-Cantelli's Lemma , we have P [Network is not connected i.o.] = 0.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7763/ijmlc.2011.v1.37">doi:10.7763/ijmlc.2011.v1.37</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oojzk6i6dbafjnrwdpvrwfaoy4">fatcat:oojzk6i6dbafjnrwdpvrwfaoy4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928023000/http://www.ijmlc.org/papers/37-C01126-003.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f9/48/f9482b06d24300c65d27e7695b6ed8407aad5f02.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7763/ijmlc.2011.v1.37"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Global stabilization of complex networks with digraph topologies via a local pinning algorithm

Wenlian Lu, Xiang Li, Zhihai Rong
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/e5pgtxytlra45muqmfmoj6kvte" style="color: black;">Automatica</a> </i> &nbsp;
A pinned vertex set can stabilize a directed network to some unstable trajectories, for instance, to a chaotic trajectory of the uncoupled systems, if and only if the pinned vertex set can access all other  ...  This paper concerns the global stability of controlling a complex network with digraph topology to a homogeneous trajectory of the uncoupled system by the local pinning control algorithm.  ...  Introduction Since 1998, the new discoveries of small-world (Watts & Strogatz, 1998) and scale-free connectivity patterns (Barabási & Albert, 1999) in many natural and artificial complex networking  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.automatica.2009.10.006">doi:10.1016/j.automatica.2009.10.006</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6rk4kkaqcrejrgfgbdi2n5czpu">fatcat:6rk4kkaqcrejrgfgbdi2n5czpu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706014848/http://ccsb.fudan.edu.cn/eWebEditor/uploadfile/20110318150617621.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d7/82/d782795c601e48048507d6b5fe96dd81ace8f9b4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.automatica.2009.10.006"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 8,923 results