FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1563575792> ?p ?o ?g. }

• W1563575792 abstract "Over the past few years, a consensus has emerged among scientists and engineers that net-centric technology can provide unprecedented levels of performance, robustness, and efficiency. Success stories such as the Internet, distributed sensor networks, and multi-agent networks of mobile robots are only a few examples that support this view. The important role played by complex networks has been widely observed in various physical, natural, and social systems. Given the complexity of many of these systems, it is important to understand the fundamental rules that govern them and introduce appropriate models that capture such principles, while abstracting away the redundant details.The main goal of this thesis is to contribute to the emerging field of science'' in two ways. The first part of the thesis focuses on the question of information aggregation over complex networks. The problem under study is the asymptotic behavior of agents in a network when they are willing to share information with their neighbors. We start by focusing on conditions under which all agents in the network will asymptotically agree on some quantity of interest, what is known as the consensus problem. We present conditions that guarantee asymptotic agreement when inter-agent communication links change randomly over time. We then propose a distributed (non-Bayesian) algorithm that enables agents to not only agree, but also learn the true underlying state of the world. We prove that our proposed learning rule results in successful information aggregation, in the sense that all agents asymptotically learn the truth as if they were completely informed of all signals and updated their beliefs rationally. Moreover, the simplicity of our local update rule guarantees that agents eventually achieve full learning, while at the same time, avoiding highly complex computations that are essential for full Bayesian learning over networks.The second part of this thesis focuses on presenting a new modeling paradigm that greatly expands the tool set for mathematical modeling of networks, beyond graphs. The approach taken is based on using simplicial complexes, which are objects of study in algebraic topology, as generalizations of graphs to higher dimensions. We show how simplicial complexes serve as more faithful models of the network and are able to capture many of its global topological properties. Furthermore, we develop distributed algorithms for computing various topological invariants of the network. These concepts and algorithms are further explored in the context of a specific application: coverage verification in coordinate-free sensor networks, where sensor nodes have no access to location, distance, or orientation information. We propose real-time, scalable, and decentralized schemes for detection of coverage holes, as well as computation of a minimal set of sensors required to monitor a given region of interest. The presented algorithms clarify the benefits of using simplicial complexes and simplicial homology, instead of applying tools…" @default.
• W1563575792 created "2016-06-24" @default.
• W1563575792 creator A5088246308 @default.
• W1563575792 date "2009-01-01" @default.
• W1563575792 modified "2023-09-23" @default.
• W1563575792 title "Complex Networks: New Models and Distributed Algorithms" @default.
• W1563575792 cites W129275981 @default.
• W1563575792 cites W1486210143 @default.
• W1563575792 cites W1488089606 @default.
• W1563575792 cites W1496383623 @default.
• W1563575792 cites W1500921805 @default.
• W1563575792 cites W1541256735 @default.
• W1563575792 cites W1547358136 @default.
• W1563575792 cites W1551504295 @default.
• W1563575792 cites W1565704283 @default.
• W1563575792 cites W1568288633 @default.
• W1563575792 cites W1592702895 @default.
• W1563575792 cites W1596411313 @default.
• W1563575792 cites W1639375587 @default.
• W1563575792 cites W177913229 @default.
• W1563575792 cites W1881522137 @default.
• W1563575792 cites W1964647857 @default.
• W1563575792 cites W1974340519 @default.
• W1563575792 cites W1983033166 @default.
• W1563575792 cites W1988043312 @default.
• W1563575792 cites W1990513740 @default.
• W1563575792 cites W1998692453 @default.
• W1563575792 cites W2005308357 @default.
• W1563575792 cites W2015263936 @default.
• W1563575792 cites W2015410655 @default.
• W1563575792 cites W2018800107 @default.
• W1563575792 cites W2024571424 @default.
• W1563575792 cites W2026883597 @default.
• W1563575792 cites W2034586501 @default.
• W1563575792 cites W2036780368 @default.
• W1563575792 cites W2039661659 @default.
• W1563575792 cites W2058360748 @default.
• W1563575792 cites W2058715110 @default.
• W1563575792 cites W2067831995 @default.
• W1563575792 cites W2093766264 @default.
• W1563575792 cites W2096605213 @default.
• W1563575792 cites W2098863504 @default.
• W1563575792 cites W2100430744 @default.
• W1563575792 cites W2101517602 @default.
• W1563575792 cites W2101641320 @default.
• W1563575792 cites W2102431007 @default.
• W1563575792 cites W2107396783 @default.
• W1563575792 cites W2108962686 @default.
• W1563575792 cites W2110152576 @default.
• W1563575792 cites W2110369778 @default.
• W1563575792 cites W2110541499 @default.
• W1563575792 cites W2113096089 @default.
• W1563575792 cites W2113623259 @default.
• W1563575792 cites W2114403255 @default.
• W1563575792 cites W2115428923 @default.
• W1563575792 cites W2115926002 @default.
• W1563575792 cites W2117905067 @default.
• W1563575792 cites W2119682789 @default.
• W1563575792 cites W2122093006 @default.
• W1563575792 cites W2122469751 @default.
• W1563575792 cites W2122489728 @default.
• W1563575792 cites W2122552472 @default.
• W1563575792 cites W2123488028 @default.
• W1563575792 cites W2134252677 @default.
• W1563575792 cites W2140950724 @default.
• W1563575792 cites W2144044408 @default.
• W1563575792 cites W2144267444 @default.
• W1563575792 cites W2144668683 @default.
• W1563575792 cites W2147539438 @default.
• W1563575792 cites W2149012756 @default.
• W1563575792 cites W2149966324 @default.
• W1563575792 cites W2153597269 @default.
• W1563575792 cites W2153986241 @default.
• W1563575792 cites W2155261584 @default.
• W1563575792 cites W2156280901 @default.
• W1563575792 cites W2158020336 @default.
• W1563575792 cites W2160413708 @default.
• W1563575792 cites W2160643434 @default.
• W1563575792 cites W2163916252 @default.
• W1563575792 cites W2164270936 @default.
• W1563575792 cites W2165469059 @default.
• W1563575792 cites W2165744313 @default.
• W1563575792 cites W2166496101 @default.
• W1563575792 cites W2167485994 @default.
• W1563575792 cites W2169071224 @default.
• W1563575792 cites W2172252395 @default.
• W1563575792 cites W2296319761 @default.
• W1563575792 cites W2333017703 @default.
• W1563575792 cites W2550138155 @default.
• W1563575792 cites W2621124976 @default.
• W1563575792 cites W2798766386 @default.
• W1563575792 cites W2911463656 @default.
• W1563575792 cites W2912291331 @default.
• W1563575792 cites W2914594774 @default.
• W1563575792 cites W2964718042 @default.
• W1563575792 cites W2986240932 @default.
• W1563575792 cites W3013843370 @default.
• W1563575792 cites W3040586665 @default.
• W1563575792 cites W3109381375 @default.
• W1563575792 cites W3121562466 @default.

• next