http://publicationslist.org/data/k.e-m/atom.xml Kenth Engø-Monsenhttp://publicationslist.org/k.e-m$basepathfavicon.icoRecent additions to Kenth Engø-Monsen's PublicationsList.org pagehttp://publicationslist.org/publications.png2010-10-27T19:19:06Z http://publicationslist.org/k.e-m/refid19 2010-10-27T19:18:14Z

To understand the diffusive spreading of a product in a telecom network, whether the product is a service, handset, or subscription, it can be very useful to study the structure of the underlying social network. By combining mobile traffic data and product adoption history from one of Telenor's markets, we can define and measure an adoption network-roughly, the social network of adopters. By study...<br/><br/>Sundsøy, P.R.; Bjelland, J.; Canright, G.; Engø-Monsen, K.; Ling, R.; (2010) <i>2010 International Conference on Advances in Social Networks Analysis and Mining (ASONAM)</i> <br/>

http://publicationslist.org/k.e-m/refid10 2010-05-31T05:20:04Z

We study the properties of the principal eigenvector for the adjacency matrix (and related matrices) for a general directed graph. In particular—motivated by the use of the eigenvector for estimating the “importance” of the nodes in the graph—we focus on the distribution of positive weight in this eigenvector, and give a coherent picture which builds upon and unites earlier results. We als...<br/><br/>Johannes Bjelland, Mark Burgess, Geoffrey Canright, Kenth Engø-Monsen (2010) <i>Data Mining and Knowledge Discovery</i> <i></i> <i>http://dx.doi.org/10.1007/s10618-009-0154-1</i> 20: 1 98-151<br/>

http://publicationslist.org/k.e-m/refid16 2010-05-31T06:08:11Z

The problem of epidemic spreading over networks has received considerable attention in recent years, due both to its intrinsic intellectual challenge and to its practical importance. A good recent summary of such work may be found in Newman (8), while (9) gives an outstanding example of a non-trivial prediction which is obtained from explicitly modeling the network in the epidemic spreading. In th...<br/><br/>Johannes Bjelland, Geoffrey Canright, Kenth Engø-Monsen, Valencia P Remple (2009) <i></i> <i>Dynamics On and Of Complex Networks - Applications to Biology, Computer Science, and the Social Sciences</i> <i>http://dx.doi.org/10.1007/978-0-8176-4751-3_6</i> : 97-116<br/>

http://publicationslist.org/k.e-m/refid11 2010-05-31T06:09:43Z

The World Wide Web consists of a vast amount of information in the form of web-pages. Almost all subjects are covered somewhere in the billions of pages reachable from your computer. To access this enormous library from our computers is a wonderful thing – but the tremendous size of the web is also a problem. With an ever-growing number of pages covering all sorts of subjects, it becomes very ha...<br/><br/>Johannes Bjelland, Geoffrey Canright, Kenth Engø-Monsen (2009) <i></i> <i>Encyclopedia of Complexity and Systems Science</i> <i>http://dx.doi.org/10.1007/978-0-387-30440-3_312</i> : 5265-5286<br/>

http://publicationslist.org/k.e-m/refid2 2010-05-28T19:34:12Z

Geoffrey S Canright, Kenth Engø-Monsen (2008) <i></i> <i>Handbook of Network and System Administration</i> <i>http://www.sciencedirect.com/science/article/B8KPW-4S0B15K-M/2/a074b6a2caab8aa1995574daa0260050</i> : 361-424<br/>

http://publicationslist.org/k.e-m/refid8 2010-05-31T13:44:00Z

The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, importance ranking to support search, and virtual coordinate systems to facilitate managing network proximity. Robust and efficient asynchronous distributed algorithms are known only for the case when the dominant eigenvalu...<br/><br/>Márk Jelasity, Geoffrey Canright, Kenth Engø-Monsen (2007) <i></i> <i>Euro-Par 2007 Parallel Processing</i> <i>http://dx.doi.org/10.1007/978-3-540-74466-5_55</i> : 514-525<br/>

http://publicationslist.org/k.e-m/refid6 2010-05-31T13:39:54Z

We present qualitative arguments concerning the probable infection pattern in a directed graph under the (weak or strong) influence of the outside world. This question is relevant for real computer viruses, which spread by following the (logical) directed links formed by address lists. Our arguments build on previous work in two (seemingly unrelated) areas: epidemic spreading on undirected graphs,...<br/><br/>Geoffrey Canright, Kenth Engø-Monsen (2007) <i></i> <i>Inter-Domain Management</i> <i>http://dx.doi.org/10.1007/978-3-540-72986-0_12</i> : 133-144<br/>

http://publicationslist.org/k.e-m/refid9 2010-05-31T13:42:37Z

In this chapter we introduce a model for analyzing the spread of epidemics in a disconnected mobile network. The work is based on an extension, to a dynamic setting, of the eigenvector centrality principle introduced by two of the authors for the case of static networks. The extension builds on a new definition of connectivity matrix for a highly partitioned mobile system, where the connectivity b...<br/><br/>Iacopo Carreras, Daniele Miorandi, Geoffrey Canright, Kenth Engø-Monsen (2007) <i></i> <i>Advances in Biologically Inspired Information Systems</i> <i>http://dx.doi.org/10.1007/978-3-540-72693-7_7</i> : 125-147<br/>

http://publicationslist.org/k.e-m/refid1 2010-05-31T05:24:55Z

In this paper we offer a topology-driven ([`]natural') definition of subclusters of an undirected graph or network. In addition we find rules for assigning unique roles (from a small set of possible roles) to each node in the network. Our approach is based on the use of a [`]smooth' index for well-connectedness (eigenvector centrality) which is computed for each node. This index, viewed as a heig...<br/><br/>Geoffrey Canright, Kenth Engø-Monsen (2004) <i>Science of Computer Programming</i> <i></i> <i>http://www.sciencedirect.com/science/article/B6V17-4CVV945-2/2/4bcdef79ecab43064a89b4098e9de0a8</i> 53: 2 195-214<br/>

http://publicationslist.org/k.e-m/refid4 2010-05-31T05:22:31Z

We describe a model of computer security that applies results from the statistical properties of graphs to human-computer systems. The model attempts to determine a safe threshold of interconnectivity in a human-computer system by ad hoc network analyses. The results can be applied to physical networks, social networks and networks of clues in a forensic analysis. Access control, intrusions and so...<br/><br/>Mark Burgess, Geoffrey Canright, Kenth Engø-Monsen (2004) <i>International Journal of Information Security</i> <i></i> <i>http://dx.doi.org/10.1007/s10207-004-0044-x</i> 3: 2 70-85<br/>

http://publicationslist.org/k.e-m/refid15 2010-05-31T05:28:30Z

We introduce partitioned Runge–Kutta (PRK) methods as geometric integrators in the Runge–Kutta–Munthe-Kaas (RKMK) method hierarchy. This is done by first noticing that tangent and cotangent bundles are the natural domains for the differential equations to be solved. Next, we equip the (co)tangent bundle of a Lie group with a group structure and treat it as a Lie group. The structure of the d...<br/><br/>Kenth Engø (2003) <i>BIT Numerical Mathematics</i> <i></i> <i>http://dx.doi.org/10.1023/A:1023668015087</i> 43: 1 21-39<br/>

http://publicationslist.org/k.e-m/refid5 2010-05-31T05:37:57Z

In Multibody System Dynamics2, 71–88, wedescribed the Munthe-Kaas and Crouch–Grossman methods for integratingordinary differential equations numerically on Lie groups. We used theheavy top as a special test problem, and showed that the numericalsolution respects the configuration space TSO(3). We were, however, notable to generate numerical solutions that preserved the first integralsof the to...<br/><br/>Kenth Engø, Arne Marthinsen (2001) <i>Multibody System Dynamics</i> <i></i> <i>http://dx.doi.org/10.1023/A:1011459217639</i> 5: 4 387-397<br/>

http://publicationslist.org/k.e-m/refid3 2010-05-31T05:38:40Z

We describe an object-oriented MATLAB toolbox for solving differential equations on manifolds. The software reflects recent development within the area of geometric integration. Through the use of elements from differential geometry, in particular Lie groups and homogeneous spaces, coordinate free formulations of numerical integrators are developed. The strict mathematical definitions and results...<br/><br/>Kenth Engø, Arne Marthinsen, Hans Z Munthe-Kaas (2001) <i>Applied Numerical Mathematics</i> <i></i> <i>http://www.sciencedirect.com/science/article/B6TYD-44B292J-6/2/84e6385483671fa544d7579ef74fab23</i> 39: 3-4 323-347<br/>

http://publicationslist.org/k.e-m/refid13 2010-05-31T05:30:11Z

We find local closed-form expression for the Baker—Campbell—Hausdorff formula in the Lie algebra so(3), and interpret the formula geometrically in terms of rotation vectors in ℝ3.<br/><br/>Kenth Engø (2001) <i>BIT Numerical Mathematics</i> <i></i> <i>http://dx.doi.org/10.1023/A:1021979515229</i> 41: 3 629-632<br/>

http://publicationslist.org/k.e-m/refid7 2010-05-31T05:36:33Z

In the past few years, a number of Lie-group methods based on Runge—Kutta schemes have been proposed. One might extrapolate that using a selfadjoint Runge—Kutta scheme yields a Lie-group selfadjoint scheme, but this is generally not the case: Lie-group methods depend on the choice of a coordinate chart which might fail to comply to selfadjointness.<br/><br/>Antonella Zanna, Kenth Engø, Hans Munthe-Kaas (2001) <i>BIT Numerical Mathematics</i> <i></i> <i>http://dx.doi.org/10.1023/A:1021950708869</i> 41: 2 395-421<br/>

http://publicationslist.org/k.e-m/refid14 2010-05-31T05:39:48Z

We consider the construction of geometric integrators in the class of RKMK methods. Any differential equation in the form of an infinitesimal generator on a homogeneous space is shown to be locally equivalent to a differential equation on the Lie algebra corresponding to the Lie group acting on the homogeneous space. This way we obtain a distinction between the coordinate-free phrasing of the diff...<br/><br/>Kenth Engø (2000) <i>BIT Numerical Mathematics</i> <i></i> <i>http://dx.doi.org/10.1023/A:1022362117414</i> 40: 1 41-61<br/>

http://publicationslist.org/k.e-m/refid18 2010-05-31T20:47:21Z

Kenth Engø (2000) <br/>

http://publicationslist.org/k.e-m/refid12 2010-05-31T05:40:55Z

We apply Munthe-Kaas and Crouch–Grossman methods in the solution of some mechanical problems. These methods are quite new, and they exploit intrinsic properties of the manifolds defined by the mechanical problems, thus ensuring that the numerical solution obey underlying constraints. A brief introduction to the methods is presented, and numerical simulations show some of the properties they poss...<br/><br/>Kenth Engø, Arne Marthinsen (1998) <i>Multibody System Dynamics</i> <i></i> <i>http://dx.doi.org/10.1023/A:1009701220769</i> 2: 1 71-88<br/>

http://publicationslist.org/k.e-m/refid17 2010-05-31T20:43:27Z

Kenth Engø (1995) <br/>