<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">When will I see you again: modelling the influence of social networks on social activities</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Nicole</forename><surname>Ronald</surname></persName>
							<email>n.a.ronald@tue.nl</email>
							<affiliation key="aff0">
								<orgName type="department">Design and Decision Support Systems Group</orgName>
								<orgName type="institution" key="instit1">Eindhoven</orgName>
								<orgName type="institution" key="instit2">University of Technology Eindhoven</orgName>
								<address>
									<country key="NL">The Netherlands</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Virginia</forename><surname>Dignum</surname></persName>
							<email>m.v.dignum@tudelft.nl</email>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Faculty of Technology</orgName>
								<orgName type="department" key="dep2">Policy and Management Delft</orgName>
								<orgName type="institution">University of Technology Delft</orgName>
								<address>
									<country key="NL">The Netherlands</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Catholijn</forename><surname>Jonker</surname></persName>
							<email>c.m.jonker@tudelft.nl</email>
							<affiliation key="aff2">
								<orgName type="department">Man-Machine</orgName>
								<orgName type="laboratory">Interaction Group</orgName>
								<orgName type="institution">Delft University of Technology Delft</orgName>
								<address>
									<country key="NL">The Netherlands</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">When will I see you again: modelling the influence of social networks on social activities</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">4CC6E44CDAC15B8585B5864E01FC2DFC</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T07:17+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Social activities account for a large amount of travel, yet due to their irregularity and the number of options regarding location, participants, and timing, they are difficult to model and predict. We assume that social activities are constrained by one's social network, which consists of people you are close to, both socially and spatially. Therefore, a model of social activity behaviour should be sensitive to the network. In this paper, an agent-based model to describe social activities between two people over time is described and four different input networks (random, based on spatial distance, based on social distance, based on both distances) are experimented with. The results show that the overall social network has an effect on the number of activities generated in the entire system and also between pairs of friends.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>I. INTRODUCTION</head><p>Every transport system may be described as a social system, composed of individuals who interact and influence the behaviour of each other. Multi-agent simulation is therefore becoming increasingly important in travel simulation, travel analysis, and travel forecasting, in particular due to its possibilities to model explicitly the individuals' decision making processes. In fact, all travel is a result of individual decisions, as people try to manage his/her life in a satisfying way. As such, travel can be seen as result of individual goals (e.g. go to work to earn money, visit friends for pleasure) <ref type="bibr" target="#b0">[1]</ref>.</p><p>Our focus in this paper is on social face-to-face activities. People frequently interact face-to-face with each other. This could fulfill several needs: to gather information, to share an experience, to help one another, or for relaxation. Face-toface interaction is sometimes also crucial for relationships to continue. Urry <ref type="bibr" target="#b1">[2]</ref> notes that "[e]specially in order to sustain particular relationships with a friend or family or colleague that are 'in the mind', that person has intermittently to be seen, sensed, through physical copresence".</p><p>In order to model these activities, the transport modelling field is experiencing a shift from understanding "where are people going" and "what activity are they doing" towards "who are they interacting with". The generation and scheduling of social activities depends not only on the structure of the spatial network, which is covered by "where" and "what", but requires that social networks, which mean "who" need to be incorporated as well.</p><p>In this project, we are interested in ascertaining the influence of social network typology on the number, frequency and type of social activities between network nodes. This is necessary because incorporating social networks into existing activitytravel models will add a lot of complexity and require more intensive data collections. Testing the sensitivity of potential models of activity behaviour to different networks is an important step in evaluating the usefulness of their incorporation.</p><p>The aim of this paper is to demonstrate the relevance of the social network structure, by investigating the performance of a simplified model with different input structures with respect to the number of activities generated for individuals, pairs of individuals, and for the entire population. We begin with a review of activity modelling and social network generation. A model with utility-based agents is described and the results are discussed. We conclude with recommendations for other applications and future work.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>II. BACKGROUND AND RELATED WORK</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>A. Activity generation</head><p>Human activities are generated due to "physiological, psychological and economical needs" <ref type="bibr" target="#b2">[3]</ref>. A distinction is commonly made between subsistence (e.g., work-related), maintenance (e.g., keeping the household running), and leisure activities.</p><p>Non-discretionary activities such as work and school can be partly explained by the traveller's sociodemographic characteristics and generalised travel costs <ref type="bibr" target="#b3">[4]</ref>, as well as long-term decisions such as a decision to move to a particular town. Participation in, and scheduling of, other activities is not as easily predicted. Social and leisure activities are the reported purpose for a large number of trips, ranging from 25 to 40% for various countries <ref type="bibr" target="#b4">[5]</ref>.</p><p>In current state-of-the-art activity-travel models, social activities, if at all scheduled, are assigned to random locations and times <ref type="bibr" target="#b5">[6]</ref> and do not take into account the constraints or preferences of friends. Being able to model these activities could lead to better prediction of activity schedules and forecasts of travel patterns and demand for urban facilities, in particular those relating to social and leisure activities.</p><p>A theory currently being explored for generating discretionary activities is based on needs. Activities both satisfy and generate needs and needs grow over time <ref type="bibr" target="#b6">[7]</ref>. Maslow's hierarchy of needs has been proposed as a starting point <ref type="bibr" target="#b7">[8]</ref>, however it is difficult to collect data for model validation. A separate set of needs was proposed by Arentze and Timmermans <ref type="bibr" target="#b6">[7]</ref> which could be identified through empirical research.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>B. Social networks</head><p>Social networks are a representation of individuals and the relationships between them. The relationship between two individuals can be defined in a number of ways, for example how similar they are, how they are related to each other, whether they interact or how often they interact, or how information flows between them <ref type="bibr" target="#b8">[9]</ref>.</p><p>Networks can be represented in two ways: complete or personal. A complete network contains all of the relationships for all the individuals in the network, for example, all the friendship links between students in a class. Personal networks contain the relationships for a particular individual (known as the ego), however the attributes of the people they name (known as alters) are provided by the ego rather than the alter themselves. It is not guaranteed that the personal networks of egos in the sample will intersect.</p><p>As Newman <ref type="bibr" target="#b9">[10]</ref> recognised, research has been slow in understanding the actual workings of networked systems and the focus has been on structural form and analysis. As a result, there are many methods for generating (e.g., the small world model <ref type="bibr" target="#b10">[11]</ref> and the scale-free network <ref type="bibr" target="#b11">[12]</ref>) and measurements for comparing static, complete (and not necessarily social) networks (e.g., <ref type="bibr" target="#b12">[13]</ref>). However, it has been recognised that social networks have certain properties, in particular with respect to the similarity between people, their spatial proximity, the overall clustering coefficient (i.e., how tightly-knit the network is) and the variation in size of personal networks (e.g., how many friends do people have; also known as the degree). Hamill and Gilbert <ref type="bibr" target="#b13">[14]</ref> presented a model known as social circles, where two people are connected depending on the distance between them. This distance could be social (e.g., based on whether two people are similar in terms of age, gender, occupation, religion, or shared values etc.) or spatial.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>C. The effects of social networks on activities</head><p>The bulk of the research on the effects of social networks on activities is at the data analysis stage. Individuals are surveyed about their social network and asked to complete an activity diary for several days, listing who they interacted with and the nature of the activity.</p><p>As part of the Connected Lives study, Carrasco <ref type="bibr" target="#b14">[15]</ref> collected data on individuals' personal networks and interactions, then used multi-level modelling to look for influences on frequencies of activities. The results showed that the number of components (i.e., subgroups), density (i.e., clustering), and degree of the personal network influences the frequency of social interactions, and are a better indication of frequency than the size of the network or isolates. Younger people tend to have a higher frequency of activities, as well as egos and alters with similar ages. The latter is an example of homophily, which is based on the idea that individuals interact with others who are similar to them <ref type="bibr" target="#b15">[16]</ref>. Homophilies can be separated into two groups: those based on status, both ascribed (e.g., age, gender, etc.) and acquired (e.g., occupation, religion, etc.), and those based on values, such as attitudes and beliefs.</p><p>Given the data collected for activity-travel modelling purposes, at least two network generation algorithms have been developed. Illenberger et al. <ref type="bibr" target="#b16">[17]</ref> presented a model based on spatial distance, while Arentze and Timmermans <ref type="bibr" target="#b17">[18]</ref> developed an algorithm based on spatial and social distance. The latter can also be extended to include the influence of common friends, following the theory that if person 1 is friends with person 2 and person 3, then persons 2 and 3 have a good chance of also being friends.</p><p>Hackney and Marchal <ref type="bibr" target="#b18">[19]</ref>, building on previous work, developed a microsimulation which incorporated a social network on top of a daily activity scheduler. The individuals in the system exchange information with each other, either about locations or about friends. Currently their system does not include collaborative scheduling.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>III. MODEL DESCRIPTION AND DESIGN</head><p>Joint social activities are defined by the different people involved, their relationships and interactions with each other, and their activities in and possible movement around the environment. The topology of interactions is not homogeneous and clusters may form. Therefore agent-based modelling appears to be appropriate for our model, due to the complex relationships and interactions between individuals and the individuals' situatedness in an urban environment <ref type="bibr" target="#b19">[20]</ref>.</p><p>The model consists of agents located in a spatial environment, where they have a home location. This environment is represented by a network of locations. Each agent has a list of other agents he/she is friends with and a list of locations that he/she knows. They also have sociodemographic attributes (e.g., age, gender, car ownership, work status etc.) and a schedule with a certain number of time periods. Each agent can undertake maximally one activity per time period.</p><p>Each pair of agents has a similarity measure, which follows from the notion of homophily. Pairs also keep track of when they last saw each other. Links are undirected, meaning that friendships are mutual.</p><p>The goals of the agents in the system are derived from the social needs of humans, which include interacting with, and gaining the respect and esteem of others. The agent goals are therefore:</p><p>• making and maintaining (long-term) relationships with other people;</p><p>• sharing experiences with other people, in the form of joint activity participation;</p><p>• sharing (giving and gaining) information with other people; and</p><p>• learning about their local environment.</p><p>In this paper we focus on the second goal of joint activity participation. Utility-based agents are used as this allows the agents to evaluate the outcomes of participating in different activities. This has advantages and disadvantages: utility functions are difficult to develop and tend to oversimplify the realworld processes <ref type="bibr" target="#b20">[21]</ref>, however as the aim is to create a model of a sample population for a city, i.e., thousands of agents, the agent model needs to be simple in order to be scalable.</p><p>A utility function (Equation <ref type="formula">1</ref>) has been developed to take into account the required issues -type (a) and purpose (p) of the activity, location (l), day (d), the other person involved (j) -, essentially, what, where when and who. This is based on the needs-based theory discussed in Section II-A.</p><formula xml:id="formula_0">U i (a, p, l, d, j) = V ap i + V l i + V j i + ǫ (1) V ap i = f t (α ap i , d − t ap ) (2) V l i = f t (1 − d il , d − t l ) (3) V j i = f t (s ij , d − t j )<label>(4)</label></formula><formula xml:id="formula_1">f t (x, t) = ( 2 1 + e −xt ) − 1<label>(5)</label></formula><formula xml:id="formula_2">s ij = Q g + Q a (6)</formula><p>Activities can have a purpose, chosen from sharing experiences, sharing information, informal chatting, and support. The different purposes can be used to determine who is suitable for a given activity. Activities can also have a type, such as shopping, eating out, or sporting activities, which determines the location of the activity. In future, this will be also used to determine the duration of the activity.</p><p>The components of the utility function U i consider when an individual last undertook an activity (Equation <ref type="formula">2</ref>), visited a location (Equation <ref type="formula">3</ref>), or saw someone (Equation <ref type="formula" target="#formula_0">4</ref>). These values (t l , t ap , t j ) are combined with the date of the proposed activity d to find the last time the particular event happened. The utility increases over time (Equation <ref type="formula" target="#formula_1">5</ref>), so that an activity/location/person that an individual hasn't seen/visited for a while is more attractive than one seen/visited the previous day.</p><p>The preferences for an activity with a particular purpose and type (α ap i ) is also an input to the model. In this instance of the model, we consider preferences to be unidimensional as a simplification. It could be that preferences are dependent on the composition of the group, for example, in terms of gender, cultural background, size of the group etc.</p><p>The distance to the location (d il ) is also taken into account, based on the individual perception of the environment and travel time. For each pair of individuals i and j, a similarity measure was calculated (Equation <ref type="formula">6</ref>), taking into account age (a) and gender (g). The values of d ij and s ij are scaled to [0, 1].</p><p>In order to schedule activities, the agents need to negotiate with each other. This can be done using a negotiation protocol. Given that our aim is to understand the relation between social network and activities, we are more interested in the group formation than on the specific time and type of activity undertaken. As such, we use the package deal method <ref type="bibr" target="#b21">[22]</ref> that abstracts from negotiation issues (for example, the activity may determine the time and location or vice versa, or in which order they should be discussed).</p><p>We further assume that interactions and activities are undertaken between two agents, who are connected to each other in the social network. This means that the social and location networks do not change (as new connections are not being made), therefore the centrality calculations do not change.</p><p>Agent i, the host, makes a decision to start an interaction using an altered utility function, where the initial location l is set to the other agent's (j; the participant) house:</p><formula xml:id="formula_3">U s (a, p, l, d, j) = V ap i + V j i + V jl i (<label>7</label></formula><formula xml:id="formula_4">)</formula><formula xml:id="formula_5">V jl i = f t (1 − d il , t j )<label>(8)</label></formula><p>If U s exceeds i's threshold, the host and participant exchange ideas for days and locations.</p><p>1) Host proposes an activity.</p><p>2) The respondent then creates a list of the possible day/time combinations (taking into account the host's time window) and sends them to the host.</p><p>3) The host collates the day/times and creates a list of the intersection of the suggestions. 4) The respondent determines what type of locations are appropriate from the patterns provided. They then look up which locations they know of that match those location types. 5) The host collates the locations and creates a list of the union of the suggestions. 6) The host then creates a list of possible activities, taking into account when agents are available and the locations they have suggested. The list is returned to the respondent. 7) The respondent evaluates this list using a utility function and returns the list with their preferences. 8) Using the Borda ranking method, the host determines the chosen option and notifies the respondent, who adds the activity to their schedule. The host also adds the activity to their schedule. Negotiations can be unsuccessful if neither individual is available on the same day, neither can suggest any suitable locations, or one individual finds that the utility of all proposed activities does not exceed their threshold.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>IV. NETWORK INPUTS</head><p>For all input networks, the agent population was constant, with the same personal properties (age, gender), thresholds and parameters, and home location. The average degree was kept roughly the same (∼10), which is in line with analysis of friendship/social interaction networks <ref type="bibr" target="#b17">[18]</ref>.</p><p>Four different networks were generated. The first was a random graph based on Erdos-Renyi random graph <ref type="bibr" target="#b22">[23]</ref>, randomly generated by the NetworkX package for Python <ref type="bibr" target="#b23">[24]</ref>. This network is shown in Figure <ref type="figure">1</ref>.  The other networks were based on the social circles algorithm <ref type="bibr" target="#b13">[14]</ref>. All individuals used the same distance size for simplicity, however this varied per network in order to meet the average degree requirement. The social distance was based on Equation <ref type="formula">6</ref>.</p><p>The second network used only spatial distance as the distance measurement (Figure <ref type="figure">2</ref>).</p><p>The third used only social distance as the distance measurement (Figure <ref type="figure">3</ref>).</p><p>The fourth used both spatial and social distance as the distance measurement (Figure <ref type="figure">4</ref>).</p><p>The different social networks have differing clustering coefficients and assortativity on degree (i.e., nodes are connected to other nodes with similar number of nodes <ref type="bibr" target="#b9">[10]</ref>) and on node attributes such as age, gender, and activity threshold. These properties are shown in Table <ref type="table">I</ref>.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>V. AN ILLUSTRATIVE SCENARIO</head><p>In this scenario, the only locations present are home locations. This means, that for an activity between two agents, only two locations are possible. Activities were also scheduled for the current time period, however the protocol does allow for looking ahead. For the one activity type and purpose, α home,social was set to 0.5. Each agent has an activity threshold randomly chosen from [0.5, 1, 1.5, 2.0].</p><p>The agents all use the same utility function and negotiation protocol. Each agent also has an age level in the range <ref type="bibr">[1 − 4]</ref>, which is consistent with the aggregation used in activity-travel surveys (e.g., <ref type="bibr" target="#b17">[18]</ref>). The gender similarity is Q g = 1 if two agents have the same gender, and Q g = 0 otherwise. For age, following <ref type="bibr" target="#b17">[18]</ref>, Q a = 4−n, where n is the difference between the two age classes. The overall similarity or social distance</p><formula xml:id="formula_6">s ij is scaled to [0, 1].</formula><p>The error term takes into account the location (N (0, 0.2)), each participant (N (0, 0.1)), and a personal short-(i.e., drawn every timestep, N (0, 0.5)) and long-term (i.e., drawn at the start of the simulation, N (0, 0.2)) error.</p><p>The model was run for 28 time periods as a warmup, and then for a further 28 time periods to collect data.</p><p>The aim of the experiment is to validate the following hypotheses:</p><p>H1. The network structure will affect the number of activities. H2. The network properties will affect the number of activities. H3. At the node level, the distribution of activities will be different for different input networks and the node attributes (degree, clustering) will affect the number of activities. H4. At the relationship level, the distribution of activities will be different for different input networks and the dyad attributes (similarity, distance) will affect the number of activities. H5. The interaction protocol will be sensitive to different input networks in terms of the number of successfully and unsuccessfully negotiated activities.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>VI. RESULTS AND DISCUSSION</head><p>All analysis was done in R, a statistical analysis package. ANOVA tests were used to measure the difference in means of output variables for different input networks, while Kolmogorov-Smirnov tests can indicate whether two distributions are similar. p indicates the significance of each test and r denotes the correlation coefficient. If p is less than 0.05, then this indicates that the result is statistically significant.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>A. Hypothesis 1: The overall network structure</head><p>The effect of the overall network structure on the number of activities was measured using an ANOVA test. The result suggested a significant difference between the input network types (p &lt; 0.001).</p><p>This means that hypothesis 1 can be accepted, as the network structure affects the number of activities.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>B. Hypothesis 2: The network properties</head><p>The correlation between each network property (clustering coefficient, assortativity on degree) and the number of activities was not significant. This indicates that these aggregate measurements are not a good indication of the outcomes of the processes in the system and therefore hypothesis 2 cannot be accepted. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Personal activities (random)</head><note type="other">Activities</note></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>C. Hypothesis 3: At the node level</head><p>By averaging the number of activities across the ten runs for each person, the distribution of the activities can be measured. Using a Kolmogorov-Smirnov test can indicate whether the distributions are similar or not. The distributions at the node level are not significantly dissimilar, as shown in <ref type="bibr">Figures 5,</ref><ref type="bibr" target="#b5">6,</ref><ref type="bibr" target="#b6">7,</ref><ref type="bibr" target="#b7">8.</ref> The correlation of the number of activities per person and their centrality or degree is significant (p &lt; 0.001, r = 0.216). This could be because those with more friends have more opportunity to engage in activities. The threshold for activities is also significant (p &lt; 0.001, r = −0.328), meaning that those with lower thresholds are participating in more activities as expected. The individual clustering coefficient is not significant, as activities are limited to only two agents. We would expect this to become significant if larger group sizes are modelled.</p><p>Although some individual properties are significant, as the overall distribution of activities is not dissimilar, hypothesis 3 cannot be accepted.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>D. Hypothesis 4: At the relationship level</head><p>As with the personal level, the activities across runs for each pair were averaged. The distributions at pair level were significant (all p &lt; 0.01), with the exception of the random network and the social/spatial distance network (p = 0.70). The distributions can be seen in <ref type="bibr">Figures 9,</ref><ref type="bibr" target="#b9">10,</ref><ref type="bibr" target="#b10">11,</ref><ref type="bibr" target="#b11">12.</ref> There was a very weak correlation between the similarity of pairs and activities (p &lt; 0.05, r = 0.041).</p><p>The correlation between distance between pairs and the number of activities was stronger (p &lt; 0.001, r = −0.347), which shows that pairs who live closer to each other are engaging in more activities together.</p><p>These results indicate that the relationship level attributes of the network are more significant than the overall or the node attributes and therefore hypothesis 4 can be accepted.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>E. Hypothesis 5: Performance of the protocol</head><p>We expect that the negotiation protocol is sensitive to the network. The protocol can fail at two points: if agents are not available at the same time, or there is no overlap in the preferred activities (e.g., both agents want to do completely different activities, or one does not like any of the options).</p><p>We have already shown that the successful activities differs for each network. The unsuccessful activities due to time (p &lt; 0.1) and due to activity disagreement (p &lt; 0.01) also differs for each network. The networks with some sort of spatial component performed better; with these networks as a base, agents are less likely to decline an activity based on distance.</p><p>From these results, hypothesis 5 can be accepted.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>F. Summary</head><p>The experiment shows that overall, the key factor is not the overall structure of the network, but the nature of the links between agents.</p><p>Whether spatial or social distance is given more weight in the utility function will also influence the outcomes. In this experiment, they were treated equally.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>VII. CONCLUSION</head><p>Multi-agent simulation is a useful method for modelling the decision-making processes undertaken by individuals, in this case, regarding whether they participate in a social activity with other people or not. Current research assumes that social networks influence social activities, therefore testing the sensitivity of potential decision-making models to different networks is an important step in evaluating the usefulness of incorporating social networks in activity-travel models. This step could also important for other domains where the social network is influential, e.g., social support networks or exchange networks <ref type="bibr" target="#b24">[25]</ref>.</p><p>We have described an agent-based simulation of social activities and discussed the results of experimentation with several input networks, differing in structure and properties. We show that the relationship properties within the network are more significant than individual or overall network properties for this type of model. However, as the model is developed further, some personal or network properties could become important. For example, people can only maintain a certain number of friends, so the degree becomes important.</p><p>The model was simplified to one activity type/purpose and no network dynamics, so that the effects of the input network could be seen. Future work involves extending the model to include further details about activities (including different locations, activities with more than two participants, and taking into account time pressures/value of time), experimenting with agents using different utility functions and/or negotiation protocols, and exploring the effects of social distance/homophily in closer detail, in particular in the context of cultural characteristics.</p><p>The results of our research will be used by city planners to evaluate the effects on social activities and travel of both changes in population and their characteristics (e.g., increasing elderly population, an increase/decrease in car ownership) and changes in infrastructure (e.g., public transport routes, locations of new shopping facilities).</p><p>As research into the effects of social networks on travel behaviour is in its early stages, there are little data available and as a result most models are in early stages of development. Research into how these models can be validated is in progress <ref type="bibr" target="#b25">[26]</ref>. However, this work can be seen as a step forward in the requirements for sensitivity testing of such models.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Pajek</head><label></label><figDesc></figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Fig. 1 .Fig. 2 .</head><label>12</label><figDesc>Fig. 1. The random network.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Pajek</head><label></label><figDesc></figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Fig. 3 .Fig. 4 .</head><label>34</label><figDesc>Fig. 3. The social circles network taking into account social distance.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Fig. 5 .Fig. 6 .Fig. 7 .</head><label>567</label><figDesc>Fig. 5. The distribution of activities for the random network.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Fig. 8 .</head><label>8</label><figDesc>Fig. 8. The distribution of activities for the social/spatial network.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Fig. 9 .Fig. 10 .Fig. 11 .</head><label>91011</label><figDesc>Fig. 9. The distribution of activities per pair for the random network.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_7"><head>Fig. 12 .</head><label>12</label><figDesc>Fig. 12. The distribution of activities per pair for the social/spatial network.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head></head><label></label><figDesc>Table II shows the average for each type.</figDesc><table><row><cell cols="3">Network Successful Unsuccessful (time)</cell><cell>Unsuccessful (activity)</cell></row><row><cell>Random</cell><cell>868.2</cell><cell>834.2</cell><cell>437.5</cell></row><row><cell>Spatial</cell><cell>967.5</cell><cell>876.5</cell><cell>178.7</cell></row><row><cell>Social</cell><cell>882.7</cell><cell>834.4</cell><cell>405.5</cell></row><row><cell>Soc/spa</cell><cell>951.3</cell><cell>868.8</cell><cell>200.7</cell></row><row><cell></cell><cell></cell><cell>TABLE II</cell><cell></cell></row><row><cell cols="4">THE NUMBER OF SUCCESSFUL AND UNSUCCESSFUL NEGOTIATIONS.</cell></row></table></figure>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>ACKNOWLEDGEMENTS</head><p>The first author would like to thank Theo Arentze and Harry Timmermans. The comments from the anonymous reviewers were also appreciated.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><surname>Balmer</surname></persName>
		</author>
		<title level="m">Travel demand modeling for multi-agent transport simulations: algorithms and systems</title>
				<imprint>
			<date type="published" when="2007">2007</date>
		</imprint>
		<respStmt>
			<orgName>ETH Zürich</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Ph.D. dissertation</note>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Connections</title>
		<author>
			<persName><forename type="first">J</forename><surname>Urry</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Environment and Planning D: Society and Space</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="page" from="27" to="37" />
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">A conceptual and methdological framework for the generation of activity-travel patterns</title>
		<author>
			<persName><forename type="first">C.-H</forename><surname>Wen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">S</forename><surname>Koppelman</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Transportation</title>
		<imprint>
			<biblScope unit="volume">27</biblScope>
			<biblScope unit="page" from="5" to="23" />
			<date type="published" when="2000">2000</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Model for coupling multi-agent social interactions and traffic simulation</title>
		<author>
			<persName><forename type="first">J</forename><surname>Hackney</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of Frontiers in Transportation 2007</title>
				<meeting>Frontiers in Transportation 2007</meeting>
		<imprint>
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Social networks, mobility biographies and travel: The survey challenges</title>
		<author>
			<persName><forename type="first">K</forename><surname>Axhausen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Institut für Verkehrsplanung und Transportsysteme, Tech. Rep</title>
		<imprint>
			<biblScope unit="volume">343</biblScope>
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">A learning-based transportation oriented simulation system</title>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">A</forename><surname>Arentze</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">J</forename><surname>Timmermans</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Transportation Research B</title>
		<imprint>
			<biblScope unit="volume">38</biblScope>
			<biblScope unit="page" from="613" to="633" />
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Social networks, social interactions and activity-travel behavior: A framework for micro-simulation</title>
		<author>
			<persName><forename type="first">T</forename><surname>Arentze</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Timmermans</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">TRB 2006 Annual Meeting</title>
				<imprint>
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">An integrated framework for modelling short-and longrun household decision-making</title>
		<author>
			<persName><forename type="first">E</forename><surname>Miller</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Progress in Activity-Based Analysis</title>
				<editor>
			<persName><forename type="first">H</forename><surname>Timmermans</surname></persName>
		</editor>
		<meeting><address><addrLine>Oxford, England</addrLine></address></meeting>
		<imprint>
			<publisher>Elsevier</publisher>
			<date type="published" when="2005">2005</date>
			<biblScope unit="page" from="175" to="202" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Network analysis in the social sciences</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">P</forename><surname>Borgatti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Mehra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">J</forename><surname>Brass</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Labianca</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Science</title>
		<imprint>
			<biblScope unit="volume">323</biblScope>
			<biblScope unit="page" from="892" to="895" />
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">The structure and function of networks</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">E J</forename><surname>Newman</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Computer Physics Communications</title>
		<imprint>
			<biblScope unit="volume">147</biblScope>
			<biblScope unit="page" from="40" to="45" />
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Collective dynamics of &apos;small-world&apos; networks</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">J</forename><surname>Watts</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Strogatz</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Nature</title>
		<imprint>
			<biblScope unit="volume">393</biblScope>
			<biblScope unit="page" from="440" to="442" />
			<date type="published" when="1998">1998</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Emergence of scaling in random networks</title>
		<author>
			<persName><forename type="first">A.-L</forename><surname>Barabasi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Albert</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Science</title>
		<imprint>
			<biblScope unit="volume">286</biblScope>
			<biblScope unit="page" from="509" to="512" />
			<date type="published" when="1999">1999</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<monogr>
		<title level="m" type="main">Introduction to social network methods</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">A</forename><surname>Hanneman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Riddle</surname></persName>
		</author>
		<ptr target="http://faculty.ucr.edu/∼hanneman/nettext/" />
		<imprint>
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Social circles: A simple structure for agent-based social network models</title>
		<author>
			<persName><forename type="first">L</forename><surname>Hamill</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Gilbert</surname></persName>
		</author>
		<ptr target="http://jasss.soc.surrey.ac.uk/12/2/3.html" />
	</analytic>
	<monogr>
		<title level="j">Journal of Artificial Societies and Social Simulation</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="issue">2</biblScope>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Unravelling the social, urban, and time-space context of activity-travel behaviour: Results from a social network data collection experience</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Carrasco</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 12th International Conference on Travel Behaviour Research</title>
				<meeting>the 12th International Conference on Travel Behaviour Research</meeting>
		<imprint>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Birds of a feather: Homophily in social networks</title>
		<author>
			<persName><forename type="first">M</forename><surname>Mcpherson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Smith-Lovin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">M</forename><surname>Cook</surname></persName>
		</author>
		<ptr target="http://www.jstor.org/stable/2678628" />
	</analytic>
	<monogr>
		<title level="j">Annual Review of Sociology</title>
		<imprint>
			<biblScope unit="volume">27</biblScope>
			<biblScope unit="page" from="415" to="441" />
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">A model for spatially embedded social networks</title>
		<author>
			<persName><forename type="first">J</forename><surname>Illenberger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Flötteröd</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kowald</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Nagel</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 12th International Conference on Travel Behaviour Research</title>
				<meeting>the 12th International Conference on Travel Behaviour Research</meeting>
		<imprint>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Modeling social networks in geographic space: approach and empirical application</title>
		<author>
			<persName><forename type="first">T</forename><surname>Arentze</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Van Den</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Berg</surname></persName>
		</author>
		<author>
			<persName><surname>Timmermans</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the workshop on Frontiers in Transportation: Social networks and travel</title>
				<meeting>the workshop on Frontiers in Transportation: Social networks and travel</meeting>
		<imprint>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">A model for coupling multi-agent social interactions and traffic simulation</title>
		<author>
			<persName><forename type="first">J</forename><surname>Hackney</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">TRB 2009 Annual Meeting</title>
				<imprint>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Tutorial on agent-based modeling and simulation part 2: How to model with agents</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">M</forename><surname>Macal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">J</forename><surname>North</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2006 Winter Simulation Conference</title>
				<editor>
			<persName><forename type="first">L</forename><forename type="middle">F</forename><surname>Perrone</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><forename type="middle">P</forename><surname>Wieland</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><surname>Liu</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">B</forename><forename type="middle">G</forename><surname>Lawson</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Nicol</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">R</forename><forename type="middle">M</forename><surname>Fujimoto</surname></persName>
		</editor>
		<meeting>the 2006 Winter Simulation Conference</meeting>
		<imprint>
			<date type="published" when="2006">2006</date>
			<biblScope unit="page" from="73" to="83" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<monogr>
		<title level="m" type="main">An introduction to multiagent systems</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">J</forename><surname>Wooldridge</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2009">2009</date>
			<publisher>John Wiley &amp; Sons</publisher>
			<pubPlace>Chichester, England</pubPlace>
		</imprint>
	</monogr>
	<note>2nd ed</note>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Multi-issue negotiation with deadlines</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">S</forename><surname>Fatima</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Wooldridge</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">R</forename><surname>Jennings</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Artificial Intelligence</title>
		<imprint>
			<biblScope unit="volume">27</biblScope>
			<biblScope unit="page" from="381" to="417" />
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">On the evolution of random graphs</title>
		<author>
			<persName><forename type="first">P</forename><surname>Erdős</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rényi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Magyar Tud. Akad. Mat. Kutató Int. Közl</title>
		<imprint>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page" from="17" to="61" />
			<date type="published" when="1960">1960</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<monogr>
		<title level="m" type="main">Networkx</title>
		<ptr target="http://networkx.lanl.gov/" />
		<imprint>
			<date type="published" when="2010">2010</date>
		</imprint>
		<respStmt>
			<orgName>NetworkX Developers</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Exchange and power in networks of interorganizational relations</title>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">S</forename><surname>Cook</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">The Sociological Quarterly</title>
		<imprint>
			<biblScope unit="volume">18</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="62" to="82" />
			<date type="published" when="1977">1977</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Validation of complex agent-based models of social activities and travel behaviour</title>
		<author>
			<persName><forename type="first">N</forename><surname>Ronald</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Arentze</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Timmermans</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 12th World Conference on Transport Research</title>
				<meeting>the 12th World Conference on Transport Research</meeting>
		<imprint>
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
