CSE416A HOMEWORK 2 M. Neumann Due: FRI 25 FEB 2022 (11:59PM) This homework consists of 3 problems. SUBMISSION INSTRUCTIONS • written work – needs to be submitted electronically in pdf format via GRADESCOPE – start every problem on a new page – weprefertypedsubmissions,e.g.,usingLATEX(ifwecannotreadyourhandwriting we cannot give you credit) • code (Jupyter notebook) – needs to be submitted in form of a submission to the corresponding GRADE- SCOPE programming assignment (instructions can be found on the course web- page) – make sure to change the file name(s) including your name(s) and follow the for- matting instructions provided in the notebook (otherwise we cannot grade your submission) • group work (up to 2 students) – make a goup submission via GRADESCOPE (one submission per team) for both written work and code submission PIAZZA We use Piazza for all course and homework related announcements. Ask all questions on Piazza using the appropriate tags. GRADING RESULTS AND REGRADES Grades will be uploaded to Canvas and detailed grading comments will be provided via GRADESCOPE . You will be notified via GRADESCOPE when the grades are published. All regrade requests need to made via GRADESCOPE within one week of this announcement. 1 PROBLEM 1: Local Bridges (15%) 1.1 [Pen-and-paper] What is the minimum possible value of the span of a local bridge. Explain your answer. 1.2 [Proof] We discussed tie strength and strong triadic closure as a means to analyze the connectedness of networks. Prove the following claim: If strong triadic closure is satisfied then local bridges between nodes with at least one other existing strong tie are weak ties. (HINT: use proof by contradiction) PROBLEM 2: Who is the most central actor? (45%)