Other Talks

Some talks have interesting applications or tie-ins to mine. These require further investigation and thought.

  1. Networks in Literary History: The Salons Project, Melanie Conroy
    • Drawing a map of Europe’s salons over a 400-year period.
      • how is she using time?
    • Social connections between authors, artists, and others through salons, academies, and clubs
    • VIAF and ULAN resources
    • Change in networks over time and distance using Gephi and Palladio
  2. The New Woman Network: Visualizing the Discursive Development of a Feminist Ideal, Hannah Jacobs
    • Words in their requency or aberrance and syntactical relationship to the term “New Woman”
    • Characterizing the term’s change over time, across space, and between publications
    • Text analysis and strategies to visualize: maps, timelines, graphs
    • (Part of a master’s dissertation)
  3. Applying Network Visualization: Women and Socialism in the 1840s U.S., Kathryn Tomasek
    • (Bad grammar in the abstract, though)
    • Asking questions such as how participation in the movement for Fourierist Association overlapped with other reform movements of that time. How did one affect the other, was one dominant?
      • These are similar questions to our marriage vs ecclesiastical office discussion? Which affected the other?
      • How to look at these different movements across time and compare

% Meeting about DHF

Talk info

  1. State my interest
    • I’m interested in data structures to effectively and efficiiently store and maintain temporal data, networks, and structures
    • Base computer science efficiency would be flops or time/space complexity
    • There is more: What is effective?
      • Depends on what we want it to mean
      • Depends on what we’re doing
      • What is our driving application??
      • What we want as an appropriate application outcome
    • Time data and networks addressed in other applications. It’s been done before, but we’re doing something different, something more
      • Such as TAG, …
  2. Emphasize Evolving
    • Evolve: form, dissolve, change major attributes (morph)
      • Entities (as nodes) that have these three characteristics
      • Relationships (as edges) that have these characteristics
    • Substantive node characteristics change
    • Relationships, edges: form and dissove, and hcange major characteristics (the 3 things that happen)
  3. Temporal graphs are not a new idea
    • We’re expanding on current work
  4. For time slide, don’t use the word “meaning”
    • In algorithms, there is a tradeoff:
      • More storage for to store precomputed steps for faster computing
      • Less storage, don’t store precomputed steps, and do a lazy evaluation : slower computing
      • Space vs Time Complexity Tradeoff

To do

  1. Continue working on getting data in
    • Work with Joseph
  2. Outline for the presentation/paper
    • Get something to Worthy next week, even partial deliverables are okay
  3. Fix sliders
  4. Start thinking about dissertation proposal
  5. READ MORE PAPERS

Digital Humanities Forum

  • Good place for feedback on some of these ideas
    • Transaction time vs calendar time
      • Are there good distinctions?
      • What if the transactions did not happen in calendar time order?
        • Example: narrative story, telling about past events
        • Reading a book, there is page order, where things happen in order of the book, from page 1 to page $n$
        • But, there is also chronological order, the time in which events occured. A later page might have a flashback to an earier time point
      • What about a node being a conversation. It would grow as people are included in the conversation (cc-ed, mentioned in a tweet, retweeted, etc)
        • The documents could be analyzed later, and the analysis could add other people into that conversation (perhaps people metioned in emails or tweets, but not originally linked into the conversation.
        • The later analysis might add people into the conversation at an earlier time, so “analysis time” would be different than real time
      • Analyizing documents in an archival box
        • Analysis order will likely not be in chronological order of the documents. So they will go in at different times.
      • There is an analogue here to storing a sparce matrix
        • Event driven storage is like a sparce matrix, you only need to store points or the structure when an event occurs. So, the calendar time in between is empty.
        • Wall-clock, calendar, time would be the full matrix
        • How much do we store about each event? Do we store the entire state of the graph? Or use something like what the temporal graph structures use and store the updated portion?
        • Idea: 2-D sparce matrix, x-axis = time ordered by telling, y-axis = time ordered by calendar, to store something where we have 2 different orderings of events.
  • Outline for the talk
    • Evolving graphs
      • Evolving over time
      • We’ve seen temporal graphs in literature. Go over what temporal graphs are.
        • We’re doing something extra, different from these (looking at the evolution over time)
          • variation
          • distinction
          • these are crucial for the dissertation
      • Examples to show. Use this distinction between evolving graphs and temporal graphs to pick some good examples to show. What should we show them?
    • What we’re doing for our example, marriages
      • Complexity of the marriages, richness of the data

Other Discussion

  • We have these two different levels/evolving structures and we want to see how the interact
      1. Groups of people as nodes
        • People can be in multiple groups, so we have multi-arcs or hyperedges for people connecting groups
      1. Marriages as nodes
        • There’s a geneological connection here of people between families
        • One arc per person, less hyperedges
    • We’ve been hand wavy about knowing how one affects the other
    • We want temporal/evolving measures that we can draw a correlation as to which one affects the other (and why?).
    • One idea: pull measures out of each individual graph (say connectedness, degree, etc), which are time-dependent, then use those measures as dependent variables/values over time and compare the metrics to find some correlation.
  • Desirable for dissertation
    • Aggregate measures over one of these things
      • the notion of :what is an evolving network? (structure, definition, data structure, theoretical notion, …)
      • Necessary (sufficient?) conditions fo the graph that make the evolving measures make sense / possible
    • Now, with two of them
      • are there necessary conditions (or sufficient conditions), ie max degree, avg degree, etc, that make evolving comparison between the two evolving structure possible or make sense (in this context)?
      • Conditions on each (independently) that make comparison possible. Necessary or sufficient.
      • One has this property, the other has this other property, so therefore they won’t be comparable with these measures
        • “it is this, but not that by definition”
        • “when is the measure/structure applicable?”
        • If timespan organization is not consistent (event-driven vs calendar-driven, or in different orders), then some measures might not make sense
        • Event-time: we might need to have specific rates (when considered on calendar-time) for certain measures to make sense
          • one or the other can not be bursting while the other is not, or vice versa. The rates might need to match for some measures to make sense.
    • Queuing theory: queue lengths, consumer vs producer rates
      • might have some relevance here, or find some good results in queuing theory
      • Comparing two different queuing networks
        • Worthy hasn’t seen anything comparing these different networks, which might have different conditions, makeups, parameters
        • Could do something like get the throughput of each queuing network and compare their throughputs
          • This might work, however throughput might not be a fair comparison of the two based on structure, type of the network, rate of events, network conditions, etc.

To Do

  1. Fix problem with the import names script.
  2. Done: Change colors on the displays
    • Yellow for spiritual marriage
    • Green for civil/time marriage
  3. Done: Remove civil marriages
  4. Done: Display number of wives on the diagrams (hard to count)

Discussion

  • Interesting People
    • BYUID 20344 - Polly Miller
      • Should be sealed to Samuel Bent for time
      • Sealed for eternity to Hyrum Smith (same day as sealing to Bent. Bent was proxy)
      • Missing these sealings in the BYU Data
      • Also married (civil) to someone else
  • Mostly interested in only married for time and married for eternity (not civil)

Discussion Points

  • How/what to link up with SNAC research page
    • Do we want to link to ford, which might not always be running?
  • Spoke with Joseph
    • Added women to AQ
    • Getting names soon
    • Getting marriage (date) information soon

To Do

  1. Contact Sarah to book flights and shuttle